Nearly optimal computations with structured matrices

DOI10.1145/2631948.2631954zbMath1346.68297arXiv1404.4768MaRDI QIDQ5890872

Elias P. Tsigaridas, Pan, Victor Y.

Publication date: 29 September 2016

Published in: Proceedings of the 2014 Symposium on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4768

zbMATH Keywords

interpolationpolynomialsrational functionsstructured matrixBoolean complexityfast polynomial divisionprecision of computingapproximate computationsTrummer's problemmultipoint evaluationCauchy linear system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Iterative numerical methods for linear systems (65F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ Univariate real root isolation in an extension field and applications

This page was built for publication: Nearly optimal computations with structured matrices