Row-ordering schemes for sparse Givens transformations. II. Implicit graph model

DOI10.1016/0024-3795(86)90190-4zbMath0596.65011OpenAlexW4251673455WikidataQ126321647 ScholiaQ126321647MaRDI QIDQ1078976

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)90190-4

zbMATH Keywords

QR decompositioneliminationGivens rotationsgraph modelrow orderingSymmetric graphswidth-1 and width-2 nested-dissection column orderings

Mathematics Subject Classification ID

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

Related Items (4)

Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem ⋮ 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

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. III. Analyses for a model problem
• Solution of sparse linear least squares problems using Givens rotations
• On Row and Column Orderings for Sparse Least Squares Problems
• Algorithmic Aspects of Vertex Elimination on Graphs
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Row-ordering schemes for sparse Givens transformations. II. Implicit graph model