On computing givens rotations reliably and efficiently
From MaRDI portal
Publication:5461237
Recommendations
Cited in
(19)- 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
- Good rotations
- Set-oriented numerical computation of rotation sets
- scientific article; zbMATH DE number 4054913 (Why is no real title available?)
- \(\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
- Evaluation of fast rotation methods
- Algorithm 978: Safe scaling in the level 1 BLAS
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)