Fast approximate computations with Cauchy matrices and polynomials
DOI10.1090/mcom/3204zbMath1392.65122arXiv1506.02285OpenAlexW2963910749MaRDI QIDQ5270834
Publication date: 3 July 2017
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02285
interpolationfast multipole methodpolynomial evaluationmatrix compressionVandermonde matricesCauchy matricesHSS matricesrational evaluationtransformation of matrix structures
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Transformations of matrix structures work again
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- A fast algorithm for the inversion of general Toeplitz matrices
- Rapid solution of integral equations of classical potential theory
- A fast method for interpolation using preconditioning
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Introduction to hierarchical matrices with applications.
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Incomplete cross approximation in the mosaic-skeleton method
- A new approach to fast polynomial interpolation and multipoint evaluation
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- An algebraic approach to approximate evaluation of a polynomial on a set of real points
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Computations with quasiseparable polynomials and matrices
- How Bad Are Vandermonde Matrices?
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- Computational Advertising: Techniques for Targeting Relevant Ads
- Randomized algorithms for the low-rank approximation of matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- On Computations with Dense Structured Matrices
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Construction of Data-Sparse $\mathcal{H}^2$-Matrices by Hierarchical Compression
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- A Fast Algorithm for Trummer’s Problem
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A Fast Solver for HSS Representations via Sparse Matrices
