A pipelined Givens method for computing the QR factorization of a sparse matrix

DOI10.1016/0024-3795(86)90168-0zbMath0587.65018OpenAlexW1991565749MaRDI QIDQ1072333

Danny C. Sorensen, Michael T. Heath

Publication date: 1986

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90168-0

zbMATH Keywords

numerical examplesQR factorizationSPARSPAKpipelined Givens method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Linear algebra on high performance computers, A survey of direct methods for sparse linear systems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Buffering for vector performance on a pipelined MIMD machine
• Implementation of some concurrent algorithms for matrix factorization
• Solution of sparse linear least squares problems using Givens rotations
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• The natural factor formulation of the stiffness for the matrix displacement method
• Error analysis of QR decompositions by Givens transformations
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Solving Linear Algebraic Equations on an MIMD Computer
• On Stable Parallel Linear System Solvers
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems