Fast givens rotations for orthogonal similarity transformations

DOI10.1007/BF01459074zbMath0479.65023OpenAlexW2053473712MaRDI QIDQ1162108

Wolfgang Rath

Publication date: 1982

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

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

zbMATH Keywords

numerical resultsJacobi methodfast givens rotationsHouseholder reflexionsQR- algorithmreduction to Hessenberg form

Mathematics Subject Classification ID

Related Items (7)

A Jacobi eigenreduction algorithm for definite matrix pairs ⋮ A real algorithm for the Hermitian eigenvalue decomposition ⋮ Self-scaling fast rotations for stiff and equality-constrained linear least squares problems ⋮ Quadratic convergence estimate of scaled iterates by \(J\)-symmetric Jacobi method ⋮ A note on a one-sided Jacobi algorithm ⋮ On a modification of the QZ algorithm with fast Givens rotations ⋮ A NOTE ON THE COMPUTATION OF THE BAYESIAN DECOMPOSITION OF A TIME SERIES

Cites Work

• Unnamed Item
• Unnamed Item
• The economical storage of plane rotations
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Least Squares Computations by Givens Transformations Without Square Roots
• An Algorithm for Generalized Matrix Eigenvalue Problems

This page was built for publication: Fast givens rotations for orthogonal similarity transformations