On computing givens rotations reliably and efficiently
DOI10.1145/567806.567809zbMATH Open1072.65048OpenAlexW2061771449WikidataQ113309772 ScholiaQ113309772MaRDI QIDQ5461237FDOQ5461237
William Kahan, D. Bindel, O. A. Marques, James Demmel
Publication date: 22 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/567806.567809
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cited In (15)
- A unification of unitary similarity transforms to compressed representations
- Complex square root with operand prescaling
- Fast and accurate normalization of vectors and quaternions
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
- The Synthesis of Spatial Filtering Algorithm with a Constant Level of Useful Signal
- Implicit double shift \(QR\)-algorithm for companion matrices
- Rational Krylov for eigenvalue computation and model order reduction
- On a modification of the QZ algorithm with fast Givens rotations
- Set-oriented numerical computation of rotation sets
- \(\mathbb G\)-reflectors: Analogues of Householder transformations in scalar product spaces
- Affine tensor product model transformation
- Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- GMRES algorithms over 35 years
Uses Software
This page was built for publication: On computing givens rotations reliably and efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461237)
