Computing singular values of diagonally dominant matrices to high relative accuracy
From MaRDI portal
Publication:3055066
DOI10.1090/S0025-5718-08-02112-1zbMath1198.65077MaRDI QIDQ3055066
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to inverse eigenvalue problems (65F18)
Related Items
Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ 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 computation of eigenvalues of generalized sign regular quasi-Said-Ball-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 singular values of a class of parameterized negative matrices ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices ⋮ 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 ⋮ Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy ⋮ Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accurate eigenvalues of certain sign regular matrices
- Accurate singular values and differential qd algorithms
- Entrywise perturbation theory and error analysis for Markov chains
- Entrywise perturbation theory for diagonally dominant M-matrices with applications
- Accurate SVDs of weakly diagonally dominant M-matrices
- Relative-error bounds for the LU decomposition via the GTH algorithm
- Computing the singular value decomposition with high relative accuracy
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- LDU decompositions with \(L\) and \(U\) well conditioned
- Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
- Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix
- Accurate Singular Values of Bidiagonal Matrices
- Regenerative Analysis and Steady State Distributions for Markov Chains
- The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics
- Jacobi’s Method is More Accurate than QR
- Accurate and Efficient Floating Point Summation
- Accurate Eigensystem Computations by Jacobi Methods
- Accurate Singular Value Decompositions of Structured Matrices
- Relative Perturbation Bounds for Eigenvalues of Symmetric Positive Definite Diagonally Dominant Matrices
- Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- Accurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices