The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
From MaRDI portal
Publication:5317657
DOI10.1137/S0895479804440335zbMath1096.65031MaRDI QIDQ5317657
Publication date: 19 September 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
total positivitySchur functionbidiagonal decompositionhigh relative accuracyLDU decompositiongeneralized Vandermonde matrix
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (61)
Fast and accurate algorithms for Jacobi-Stirling matrices ⋮ Characterizations and accurate computations for tridiagonal Toeplitz matrices ⋮ Accurate solutions of product linear systems associated with rank-structured matrices ⋮ Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method ⋮ Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases ⋮ A Matrix Approach to the Newton Formula and Divided Differences ⋮ Total Positivity: A New Inequality and Related Classes of Matrices ⋮ Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\) ⋮ Tests for the recognition of total positivity ⋮ Sign regular matrices and Neville elimination ⋮ Filon-Clenshaw-Curtis formulas for highly oscillatory integrals in the presence of stationary points ⋮ Accurate bidiagonal decomposition and computations with generalized Pascal matrices ⋮ Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices ⋮ A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems ⋮ Accurate polynomial interpolation by using the Bernstein basis ⋮ Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ Bernstein-Bezoutian matrices and curve implicitization ⋮ Accurate eigenvalues of certain sign regular matrices ⋮ Total positivity and accurate computations with Gram matrices of Bernstein bases ⋮ Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices ⋮ Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices ⋮ Polynomial total positivity and high relative accuracy through Schur polynomials ⋮ Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices ⋮ A note on matrices with maximal growth factor for Neville elimination ⋮ The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature ⋮ High relative accuracy through Newton bases ⋮ Growth factors of pivoting strategies associated with Neville elimination ⋮ Increasing data locality and introducing level-3 BLAS in the neville elimination ⋮ Extremal and optimal properties of B-bases collocation matrices ⋮ High-precision computation: mathematical physics and dynamics ⋮ Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices ⋮ Neville elimination: An efficient algorithm with application to chemistry ⋮ The discrete moment problem with fractional moments ⋮ Accurate computations with Lupaş matrices ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications ⋮ Accurate computations with Said-Ball-Vandermonde matrices ⋮ Neville elimination: a study of the efficiency using checkerboard partitioning ⋮ Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications ⋮ Accurate solutions of weighted least squares problems associated with rank-structured matrices ⋮ A collection of examples where Neville elimination outperforms Gaussian elimination ⋮ Phaseless reconstruction from space-time samples ⋮ Iterative refinement for Neville elimination ⋮ Threshold Secret Sharing Through Multivariate Birkhoff Interpolation ⋮ 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 ⋮ Similarity to totally positive matrices and accurate computations ⋮ Accurate computations with Wronskian matrices ⋮ Positivities of Vandermonde tensors ⋮ Blocking Neville elimination algorithm for exploiting cache memories ⋮ Progressive iterative approximation for extended cubic uniform B-splines with shape parameters ⋮ Accurate algorithms for Bessel matrices ⋮ A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy ⋮ Accurate and efficient evaluation of Schur and Jack functions ⋮ Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy ⋮ On parametrization of totally nonpositive matrices and applications ⋮ Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms ⋮ Accurate Computations with Collocation Matrices of q-Bernstein Polynomials ⋮ Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs ⋮ High-precision arithmetic in mathematical physics
Uses Software
This page was built for publication: The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
