Accurate SVDs of weakly diagonally dominant M-matrices
From MaRDI portal
Publication:1882555
DOI10.1007/s00211-004-0527-8zbMath1054.65037OpenAlexW2053270331MaRDI QIDQ1882555
Publication date: 1 October 2004
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-004-0527-8
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
Accurate determinants of some classes of matrices ⋮ Total Positivity: A New Inequality and Related Classes of Matrices ⋮ Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices ⋮ Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ Accurate eigenvalues of certain sign regular matrices ⋮ Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators ⋮ Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices ⋮ Accurate inverses of Nekrasov \(Z\)-matrices ⋮ Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices ⋮ Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy ⋮ Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices ⋮ Accurate solutions of diagonally dominant tridiagonal linear systems ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Computing singular values of diagonally dominant matrices to high relative accuracy ⋮ Singular value decomposition Geršgorin sets ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general 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 ⋮ On parametrization of totally nonpositive matrices and applications ⋮ Relative Perturbation Analysis for Eigenvalues and Singular Values of Totally Nonpositive Matrices ⋮ Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms ⋮ Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
Uses Software
Cites Work
- Entrywise perturbation theory for diagonally dominant M-matrices with applications
- Relative-error bounds for the LU decomposition via the GTH algorithm
- Computing the singular value decomposition with high relative accuracy
- Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix
- Accurate Singular Value Decompositions of Structured Matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
