An implicit QR algorithm for symmetric semiseparable matrices
β Scribed by Raf Vandebril; Marc Van Barel; Nicola Mastronardi
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 261 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.425
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The implicit QR algorithm is a serial iterative algorithm for determining all the eigenvalues of an \(n \times n\) symmetric tridiagonal matrix \(A\). About \(3 n\) iterations, each requiring the serial application of about \(n\) similarity planar transformations, are required to reduce \(A\) to dia
We present an algorithm for the approximation of the dominant singular values and corresponding right and left singular vectors of a complex symmetric matrix. The method is based on two short-term recurrences first proposed by Saunders, Simon and Yip for a non-Hermitian linear system solver. With s