Remarks on complexity of polynomial and special matrix computations
From MaRDI portal
Publication:1824347
zbMath0682.65011MaRDI QIDQ1824347
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
rational interpolationToeplitz matricesmatrix inversionHankel matricespolynomial evaluationLöwner matricesasymptotic order of complexity
Analysis of algorithms and problem complexity (68Q25) Approximation by rational functions (41A20) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (2)
An inversion formula and fast algorithms for Cauchy-Vandermonde matrices ⋮ A fast Hankel solver based on an inversion formula for Loewner matrices
Cites Work
This page was built for publication: Remarks on complexity of polynomial and special matrix computations