Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions

DOI10.1007/978-3-319-06686-8_22zbMath1392.65121OpenAlexW367054681MaRDI QIDQ4981167

Pan, Victor Y.

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_22

zbMATH Keywords

interpolationfast multipole methodpolynomial evaluationVandermonde matricesCauchy matricesHSS matricesrational evaluation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure theory of linear operators (47A65) Linear transformations, semilinear transformations (15A04) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65Fxx) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

An efficient, memory-saving approach for the Loewner framework, Transformations of matrix structures work again, A Low-Rank Technique for Computing the Quasi-Stationary Distribution of Subcritical Galton--Watson Processes, Nearly optimal computations with structured matrices

Uses Software

• na20