Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
From MaRDI portal
Publication:5317647
DOI10.1137/S0895479803438225zbMath1095.65031MaRDI QIDQ5317647
Publication date: 19 September 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
algorithmseigenvalueperturbation theorysingular value decompositionnumerical experimentserror analysiscondition numberSVDVandermonde matrixtotally positive matrixtotally nonnegative matrixhigh relative accuracysign regular matrixCauchy matrixbidiagonal matrixoscillatory matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items (70)
On the characterization of totally nonpositive matrices ⋮ Fast and accurate algorithms for Jacobi-Stirling matrices ⋮ Characterizations and accurate computations for tridiagonal Toeplitz matrices ⋮ Accurate computations with Wronskian matrices of Bessel and Laguerre polynomials ⋮ Accurate solutions of product linear systems associated with rank-structured matrices ⋮ Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases ⋮ Total Positivity: A New Inequality and Related Classes of Matrices ⋮ A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy ⋮ Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis ⋮ Tests for the recognition of total positivity ⋮ 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 eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity ⋮ Accurate eigenvalues of certain sign regular matrices ⋮ A test and bidiagonal factorization for certain sign regular matrices ⋮ Bidiagonal factorizations with some parameters equal to zero ⋮ Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices ⋮ Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices ⋮ On the accuracy of de Casteljau-type algorithms and Bernstein representations ⋮ Accurate and fast computations with positive extended Schoenmakers-Coffey matrices ⋮ Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank ⋮ Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices ⋮ The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature ⋮ High relative accuracy through Newton bases ⋮ Gaussian Markov random fields and totally positive matrices ⋮ Depth of almost strictly sign regular matrices ⋮ Accurate bidiagonal factorization of quantum Hilbert matrices ⋮ On a shifted \(LR\) transformation derived from the discrete hungry Toda equation ⋮ Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy ⋮ Componentwise error analysis for the block LU factorization of totally nonnegative matrices ⋮ Integrable discrete hungry systems and their related matrix eigenvalues ⋮ On the characterization of almost strictly sign regular matrices ⋮ Bidiagonal decompositions of oscillating systems of vectors ⋮ Componentwise backward error analysis of Neville elimination ⋮ Rank structure properties of rectangular matrices admitting bidiagonal-type factorizations ⋮ Accurate eigenvalues and exact zero Jordan blocks of totally nonnegative matrices ⋮ Conditioning and accurate computations with Pascal matrices ⋮ Irreducible totally nonnegative matrices with a prescribed Jordan structure ⋮ Error analysis, perturbation theory and applications of the bidiagonal decomposition of rectangular totally positive h-Bernstein-Vandermonde matrices ⋮ Accurate singular values of a class of parameterized negative matrices ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications ⋮ Modeling mixed push and pull promotion flows in manpower planning ⋮ Neville elimination for rank-structured matrices ⋮ Unnamed Item ⋮ Error analysis for matrix eigenvalue algorithm based on the discrete hungry Toda equation ⋮ Accurate computations with Said-Ball-Vandermonde 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 ⋮ Computing singular values of diagonally dominant matrices to high relative accuracy ⋮ 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 ⋮ Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ 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 ⋮ Implicit standard Jacobi gives 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 ⋮ On computing Schur functions and series thereof ⋮ Relative Perturbation Analysis for Eigenvalues and Singular Values of Totally Nonpositive Matrices ⋮ 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 ⋮ Algorithm 960
Uses Software
This page was built for publication: Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
