The economical storage of plane rotations

DOI10.1007/BF01462266zbMath0319.65033OpenAlexW1968162948WikidataQ56115601 ScholiaQ56115601MaRDI QIDQ1222937

G. W. Stewart

Publication date: 1976

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132367

Mathematics Subject Classification ID

Related Items (10)

The QR algorithm for unitary Hessenberg matrices ⋮ Self-scaling fast rotations for stiff and equality-constrained linear least squares problems ⋮ A dual projective simplex method for linear programming ⋮ Solution of sparse linear least squares problems using Givens rotations ⋮ Fast givens rotations for orthogonal similarity transformations ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ A projective simplex algorithm using LU decomposition ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ Linear systems with a large number of sparse constraints with applications to incompressible materials ⋮ The numerically stable reconstruction of Jacobi matrices from spectral data

Cites Work

• Least Squares Computations by Givens Transformations Without Square Roots
• Unnamed Item

This page was built for publication: The economical storage of plane rotations