Fast Plane Rotations with Dynamic Scaling
From MaRDI portal
Publication:4287900
DOI10.1137/S0895479890193017zbMATH Open0799.65047MaRDI QIDQ4287900FDOQ4287900
Publication date: 19 April 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3846745
- Evaluation of fast rotation methods
- Approximating planar rotations
- A new method for quickly constructing rotation surfaces
- scientific article; zbMATH DE number 3980371
- scientific article; zbMATH DE number 3213166
- A floating point vectoring algorithm based on fast rotations
- An algorithm to decompose \(n\)-dimensional rotations into planar rotations
- scientific article
numerical resultsQR decompositionorthogonal similaritydynamic scalingvector processorsfast plane rotations
Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Cited In (14)
- Title not available (Why is that?)
- Implicit standard Jacobi gives high relative accuracy
- A self-scaling G-transformation for weighted least squares problems
- Accelerating the SVD block-Jacobi method
- Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD
- Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
- Quadratic convergence estimate of scaled iterates by \(J\)-symmetric Jacobi method
- Another look at subset selection using linear least squares
- Title not available (Why is that?)
- An active set quadratic programming algorithm for real-time model predictive control
- Accurate downdating of a modified Gram-Schmidt QR decomposition
- A floating point vectoring algorithm based on fast rotations
- Evaluation of fast rotation methods
- Title not available (Why is that?)
This page was built for publication: Fast Plane Rotations with Dynamic Scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287900)
