How Bad Are Vandermonde Matrices?
From MaRDI portal
Publication:2813332
DOI10.1137/15M1030170zbMath1382.15008arXiv1504.02118OpenAlexW2962832549MaRDI QIDQ2813332
Publication date: 23 June 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02118
condition numberVandermonde matricesCauchy matricesCauchy inversion formulaeVandermonde matrix inversion
Numerical computation of matrix norms, conditioning, scaling (65F35) Structure theory of linear operators (47A65) Conditioning of matrices (15A12)
Related Items
Numerically safe Gaussian elimination with no pivoting, RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices, Accurate solutions of product linear systems associated with rank-structured matrices, A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy, Tropical Vandermonde matrices, An \(L^2\)-stability estimate for periodic nonuniform sampling in higher dimensions, Accurate quadrature of nearly singular line integrals in two and three dimensions by singularity swapping, Rational Minimax Approximation via Adaptive Barycentric Representations, On the RLWE/PLWE equivalence for cyclotomic number fields, On the Singular Values of Matrices with Displacement Structure, Performance and accuracy of the basic closure algorithm of quadrature-based moment methods, Solving ill-posed problems faster using fractional-order Hopfield neural network, ITVOLT: an iterative solver for the time-dependent Schrödinger equation, Phase retrieval and system identification in dynamical sampling via Prony's method, Multiseasonal discrete-time risk model revisited, Fast matrix multiplication and its algebraic neighbourhood, On the structure of time-delay embedding in linear models of non-linear dynamical systems, Derivation and Analysis of Fast Bilinear Algorithms for Convolution, The spectral properties of Vandermonde matrices with clustered nodes, An exponential lower bound for the condition number of real Vandermonde matrices, On the stability and accuracy of the empirical interpolation method and gravitational wave surrogates, Structured low rank decomposition of multivariate Hankel matrices, Data-Driven Polynomial Ridge Approximation Using Variable Projection, Learning algebraic varieties from samples, Bounds on the Singular Values of Matrices with Displacement Structure, A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy, Unnamed Item, Vandermonde with Arnoldi, Data Driven Koopman Spectral Analysis in Vandermonde--Cauchy Form via the DFT: Numerical Method and Theoretical Insights, Solution of Stokes flow in complex nonsmooth 2D geometries via a linear-scaling high-order adaptive integral equation scheme, The value of shape constraints in discrete moment problems: a review and extension, Phase-based order separation for Volterra series identification, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation, How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix?, Fast approximate computations with Cauchy matrices and polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transformations of matrix structures work again
- A fast solver for linear systems with displacement structure
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- A fast algorithm for the inversion of general Toeplitz matrices
- Lower bounds for the condition number of Vandermonde matrices
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- How bad are Hankel matrices?
- Explicit inverse of a generalized Vandermonde matrix.
- Interpolation and approximation by polynomials
- Randomized preprocessing versus pivoting
- Generalized inverses of certain Toeplitz matrices
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- Inverses of Vandermonde Matrices
- On Computations with Dense Structured Matrices
- Average-Case Stability of Gaussian Elimination
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Probabilistic Analysis of Gaussian Elimination Without Pivoting
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Inversion of Displacement Operators
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- Asymptotic Behavior of Random Vandermonde Matrices With Entries on the Unit Circle
- Optimal Levels of Perturbation Signals for Nonlinear System Identification
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Log-Time Sampling of Signals: Zeta Transform
- A fast algorithm for particle simulations
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
