The economical storage of plane rotations

  title={The economical storage of plane rotations},
  author={G. W. Stewart},
  journal={Numerische Mathematik},
  • G. Stewart
  • Published 1 June 1976
  • Business
  • Numerische Mathematik
SummaryPlane rotations, which have long been used in matrix computations to annihilate selected elements of a matrix, have the drawback that their definition requires two numbers. In this note it is shown how this information may be stably compacted into a single number. 
Fast Givens rotations for orthogonal similarity transformations
Fast Givens rotations with half as many multiplications for orthogonal similarity transformations and a matrix notation is introduced to describe them more easily to offer distinct advantages for sparse matrices.
A Survey of Numerical Aspects of Plane Rotations
In recent years the use of plane rotations in orthogonal factorizations has been increasing in popularity. This is in part due to modifications which enable computations with plane rotations to be
The Shifted Hessenberg System Solve Computation
We present methods for improving data reuse in solving sequences of linear systems that are Hessenberg matrices shifted by a sequence of scalars times the identity or a triangular matrix. The methods
The numerically stable reconstruction of Jacobi matrices from spectral data
Rutishauser's elegant and stable algorithm of 1963 is recalled, based on plane rotations, and implemented efficiently, and the algorithm is applied to reconstruct a persymmetric Jacobi matrix from its spectrum in an efficient and stable manner.
Parallel Block Hessenberg Reduction usingAlgorithms-By-Tiles for Multicore ArchitecturesRevisited
The objective of this paper is to extend and redesign the block matrix reduction applied for the family of two-sided factorizations, introduced by Dongarra et al. [9], to the context of multicore
A Special Case of Symmetric Matrices and Their Applications
This article presents a special case of symmetric matrices, matrices of transpositions (Tr matrices) that are created from the elements of given n-dimensional vector X∈Rn, n=2m, m∈N. Has been
The Singular Value Decomposition in Product Form
An efficient method for storing the Jacobi rotations is given and the storage required for the decomposition of a general matrix can be reduced to what is usual by giving up part of the gain in efficiency and applying an “ultimate shift” strategy.
Systolic Networks for Orthogonal Decompositions
An orthogonally connected systolic array, consisting of a few types of simple processors, is constructed to perform the $QR$ decomposition of a matrix. Application is made to solution of linear
One Modification which Increases Performance of N-Dimensional Rotation Matrix Generation Algorithm
This article presents one modification of algorithm, named N-dimensional Rotation Matrix Generation Algorithm (NRMG), which includes rotations of given vectors X and Y to the direction of coordinate axis x1 using twodimensional rotations in coordinate planes.


The algebraic eigenvalue problem
Theoretical background Perturbation theory Error analysis Solution of linear algebraic equations Hermitian matrices Reduction of a general matrix to condensed form Eigenvalues of matrices of