Fast Plane Rotations with Dynamic Scaling

DOI10.1137/S0895479890193017zbMath0799.65047MaRDI QIDQ4287900

Andrew A. Anda, Haesun Park

Publication date: 19 April 1994

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical resultsQR decompositionorthogonal similaritydynamic scalingvector processorsfast plane rotations

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)

Related Items (9)

Another look at subset selection using linear least squares ⋮ Self-scaling fast rotations for stiff and equality-constrained linear least squares problems ⋮ Accurate downdating of a modified Gram-Schmidt QR decomposition ⋮ Accelerating the SVD block-Jacobi method ⋮ Quadratic convergence estimate of scaled iterates by \(J\)-symmetric Jacobi method ⋮ A self-scaling G-transformation for weighted least squares problems ⋮ Implicit standard Jacobi gives high relative accuracy ⋮ An active set quadratic programming algorithm for real-time model predictive control ⋮ Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD

This page was built for publication: Fast Plane Rotations with Dynamic Scaling