Pages that link to "Item:Q5461237"
From MaRDI portal
The following pages link to On computing givens rotations reliably and efficiently (Q5461237):
Displaying 15 items.
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle (Q396051) (← links)
- A unification of unitary similarity transforms to compressed representations (Q652255) (← links)
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices (Q728451) (← links)
- Rational Krylov for eigenvalue computation and model order reduction (Q857552) (← links)
- Implicit double shift \(QR\)-algorithm for companion matrices (Q993375) (← links)
- Set-oriented numerical computation of rotation sets (Q1654467) (← links)
- Affine tensor product model transformation (Q1791066) (← links)
- On a modification of the QZ algorithm with fast Givens rotations (Q1819540) (← links)
- \(\mathbb G\)-reflectors: Analogues of Householder transformations in scalar product spaces (Q1827506) (← links)
- Fast and accurate normalization of vectors and quaternions (Q1993451) (← links)
- Complex square root with operand prescaling (Q2477433) (← links)
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices (Q2566271) (← links)
- Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification (Q2665359) (← links)
- GMRES algorithms over 35 years (Q2698151) (← links)
- The Synthesis of Spatial Filtering Algorithm with a Constant Level of Useful Signal (Q5852989) (← links)
