The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
From MaRDI portal
Publication:1368833
DOI10.1006/jcom.1997.0442zbMath0883.65018OpenAlexW1995696964MaRDI QIDQ1368833
Vadim Olshevsky, Israel Gohberg
Publication date: 23 March 1998
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1997.0442
inverseVandermonde matricesdisplacement rankBjörck-Pereyra algorithmsgeneralized Parker-Traub algorithm
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A well-conditioned direct pint algorithm for first- and second-order evolutionary equations, A new study on some Vandermonde matrices and systems, Symmetric functions and the Vandermonde matrix, Computations with quasiseparable polynomials and matrices, Signal flow graph approach to inversion of \((H,m)\)-quasiseparable-Vandermonde matrices and new filter structures, Displacement-structure approach to polynomial Vandermonde and related matrices, Lagrange's formula for tangential interpolation with application to structured matrices, Decoding algorithms for Goppa codes with errors and erasures, A fast method to diagonalize a Hankel matrix, Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines, Transformed statistical distance measures and the Fisher information matrix, The accurate inversion of Vandermonde matrices, On the inversion of the Vandermonde matrix, Confluent polynomial Vandermonde-like matrices: Displacement structures, inversion formulas and fast algorithm, Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Algebraic methods for Toeplitz-like matrices and operators
- Newton interpolation at Leja points
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Lower bounds for the condition number of Vandermonde matrices
- Displacement ranks of matrices and linear equations
- State-space approach to factorization of lossless transfer functions and structured matrices
- Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
- How bad are Hankel matrices?
- Fast inversion of Chebyshev-Vandermonde matrices
- Complexity of multiplication with vectors for structured matrices
- Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Displacement structure approach to Chebyshev-Vandermonde and related matrices
- Mixed, Componentwise, and Structured Condition Numbers
- Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
- Stability of Methods for Matrix Inversion
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Solution of Vandermonde systems of equations
- Associated Polynomials and Uniform Methods for the Solution of Linear Problems
- Inverses of Vandermonde Matrices
