Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem

DOI10.1016/0024-3795(86)90191-6zbMath0596.65012MaRDI QIDQ1078977

B. George

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)90191-6

zbMATH Keywords

QR decomposition; computational costs; Givens rotation; large sparse overdetermined linear system; row ordering; width-1 nested dissection column ordering

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F20: Numerical solutions to overdetermined systems, pseudoinverses

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Solving sparse linear least-squares problems on some supercomputers by using large dense blocks

Uses Software

• symrcm