Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model

DOI10.1016/0024-3795(84)90022-3zbMath0557.65018OpenAlexW2064124155WikidataQ127087501 ScholiaQ127087501MaRDI QIDQ761765

D. Kharzeev

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0024-3795(84)90022-3

zbMATH Keywords

reductionbipartite graphsQR decompositionRow-ordering schemessparse Givens transformations

Mathematics Subject Classification ID

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

Related Items (7)

Row-ordering schemes for sparse Givens transformations. II. Implicit graph model ⋮ Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem ⋮ A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ 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 ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ A survey of direct methods for sparse linear systems

Uses Software

• symrcm
• YSMP

Cites Work

• Unnamed Item
• Unnamed Item
• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Solution of sparse linear least squares problems using Givens rotations
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Comparison of two pivotal strategies in sparse plane rotations
• The natural factor formulation of the stiffness for the matrix displacement method
• Numerical methods for solving linear least squares problems
• On Row and Column Orderings for Sparse Least Squares Problems
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Yale sparse matrix package I: The symmetric codes
• Least Squares Computations by Givens Transformations Without Square Roots

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