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

DOI10.1016/0024-3795(86)90191-6zbMath0596.65012OpenAlexW2044759799MaRDI 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 decompositioncomputational costsGivens rotationlarge sparse overdetermined linear systemrow orderingwidth-1 nested dissection column ordering

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (5)

Row-ordering schemes for sparse Givens transformations. II. Implicit graph model ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ A survey of direct methods for sparse linear systems ⋮ Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
• Solution of sparse linear least squares problems using Givens rotations
• The natural factor formulation of the stiffness for the matrix displacement method
• Pivot selection and row ordering in Givens reduction on sparse matrices
• On Row and Column Orderings for Sparse Least Squares Problems

This page was built for publication: Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem