A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
From MaRDI portal
Publication:494684
DOI10.1007/s11075-014-9931-zzbMath1329.65079arXiv1401.2350MaRDI QIDQ494684
Yusaku Yamamoto, Takumi Yamashita, Kinji Kimura
Publication date: 1 September 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2350
algorithm; singular values; lower bounds; numerical experiment; matrix trace; bidiagonal matrix; subtraction-free formula
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
15A42: Inequalities involving eigenvalues and eigenvectors
15A18: Eigenvalues, singular values, and eigenvectors
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on a lower bound for the smallest singular value
- Error analysis of the mdLVs algorithm for computing bidiagonal singular values
- A Gershgorin-type lower bound for the smallest singular value
- Accurate computation of singular values in terms of shifted integrable schemes
- A lower bound for the smallest singular value
- Accurate singular values and differential qd algorithms
- Further lower bounds for the smallest singular value
- Further bounds for the smallest singular value and the spectral condition number
- Estimations of the trace of powers of positive self-adjoint operators by extrapolation of the moments
- A floating-point technique for extending the available precision
- Some large-scale matrix computation problems
- An application of the Kato-Temple inequality on matrix eigenvalues to the dqds algorithm for singular values
- The Orthogonal qd-Algorithm
- Conserved quantities of the discrete finite Toda equation and lower bounds of the minimal singular value of upper bidiagonal matrices
- Lower bounds for the smallest singular value
