The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
\textit{Å. Björck} and \textit{V. Pereyra} [Math. Comput. 24, 893--903 (1970; Zbl 0221.65054)] introduced an algorithm for Vandermonde matrices which solves the linear system with componentwise small relative errors, independent of the condition number, due to the use of the Newton interpolation. The authors of the present paper prove that Björck-Pereyra-type methods also exist for totally positive linear systems as long as the initial minors can be computed accurately. The accuracy and efficiency of the new method is due to the fact that substractive cancellation can be avoided using a new fast and accurate evaluation of the Schur function [cf. \textit{J. Demmel} and \textit{P. Koev}, Math. Comput. 75, No. 253, 223--239 (2006; Zbl 1076.05083)]. Algorithms for the bidiagonal decomposition, the LDU decomposition and the computation of the inverse of totally positive generalized Vandermonde matrices are presented.
- An efficient and fast algorithm for solving generalized Vandermonde systems
- Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
- Accurate computations with totally positive Bernstein-Vandermonde matrices
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- Blocking Neville elimination algorithm for exploiting cache memories
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Accurate solutions of product linear systems associated with rank-structured matrices
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Accurate computations with Lupaş matrices
- Neville elimination: An efficient algorithm with application to chemistry
- A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations
- Accurate solutions of structured generalized Kronecker product linear systems
- Accurate computations with collocation and Wronskian matrices of Jacobi polynomials
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
- Accurate computations with Wronskian matrices
- Progressive iterative approximation for extended cubic uniform B-splines with shape parameters
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
- Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases
- Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\)
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Extremal and optimal properties of B-bases collocation matrices
- Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- Phaseless reconstruction from space-time samples
- Accurate algorithms for Bessel matrices
- High-precision arithmetic in mathematical physics
- Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method
- Tests for the recognition of total positivity
- Filon-Clenshaw-Curtis formulas for highly oscillatory integrals in the presence of stationary points
- Accurate polynomial interpolation by using the Bernstein basis
- The discrete moment problem with fractional moments
- Accurate bidiagonal decomposition and computations with generalized Pascal matrices
- Total positivity and accurate computations with Gram matrices of Bernstein bases
- Fast and accurate algorithms for Jacobi-Stirling matrices
- Threshold secret sharing through multivariate Birkhoff interpolation
- Positivities of Vandermonde tensors
- Factorization of Vandermonde matrices and the Newton formula
- On parametrization of totally nonpositive matrices and applications
- Accurate solution of structured linear systems via rank-revealing decompositions
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- scientific article; zbMATH DE number 4129873 (Why is no real title available?)
- Iterative refinement for Neville elimination
- Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices
- A note on matrices with maximal growth factor for Neville elimination
- Increasing data locality and introducing level-3 BLAS in the neville elimination
- scientific article; zbMATH DE number 2076018 (Why is no real title available?)
- High-precision computation: mathematical physics and dynamics
- A Matrix Approach to the Newton Formula and Divided Differences
- Total Positivity: A New Inequality and Related Classes of Matrices
- Accurate computations and applications of some classes of matrices
- Accurate computation of generalized eigenvalues of regular SR-BP pairs
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Matrices with bidiagonal decomposition, accurate computations and corner cutting algorithms
- Accurate computations with collocation matrices of q-Bernstein polynomials
- Accurate and efficient evaluation of Schur and Jack functions
- Accurate computations with totally positive Bernstein-Vandermonde matrices
- Characterizations and accurate computations for tridiagonal Toeplitz matrices
- Similarity to totally positive matrices and accurate computations
- Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices
- Polynomial total positivity and high relative accuracy through Schur polynomials
- The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature
- High relative accuracy through Newton bases
- A fast and accurate algorithm for solving linear systems associated with a class of negative matrix
- Growth factors of pivoting strategies associated with Neville elimination
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- Accurate computations of singular values and linear systems for polynomial-Vandermonde-type matrices
- Accurate computations with some Catalan-Stieltjes matrices
- Total positivity and accurate computations related to q-Abel polynomials
- High relative accuracy for rational q-Bernstein–Vandermonde matrices
- Efficient algorithm to compute finite difference weights for arbitrarily spaced data
- On the accurate basis conversion of univariate polynomials
- High-relative-accuracy computations with Kac-Murdock-Szegö matrices and their generalizations
- Full operator preconditioning and the accuracy of solving linear systems
- Positivity, accuracy, optimality and applications
- On the accurate computation of the Newton form of the Lagrange interpolant
- Neville elimination: a study of the efficiency using checkerboard partitioning
- An accurate method for the Lu decomposition of amazing matrices
- Recent advances on accuracy, stability and optimality of B-bases
- Accurate computations with Riordan arrays associated with Schröder matrices
- Accurate inverses and determinants of doubly strictly diagonally dominant Z-matrices
- Accurate spectral computations and error analysis for r-geometric Min and Max matrices
- Total positivity of analytic bases through symmetric functions
- Accurate computations for the inverse of \(\{P_1, P_2\}\)-Nekrasov \(Z\)-matrices
- A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices
- Sign regular matrices and Neville elimination
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Bernstein-Bezoutian matrices and curve implicitization
- Accurate eigenvalues of certain sign regular matrices
- Accurate computations with Said-Ball-Vandermonde matrices
- A collection of examples where Neville elimination outperforms Gaussian elimination
This page was built for publication: The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317657)