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

DOI10.1016/0024-3795(84)90022-3zbMATH Open0557.65018OpenAlexW2064124155WikidataQ127087501 ScholiaQ127087501MaRDI QIDQ761765FDOQ761765

Authors: 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

Recommendations

• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
• Ordering Givens Rotations for Sparse $QR$ Factorization
• A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition
• On General Row Merging Schemes for Sparse Givens Transformations

zbMATH Keywords

reductionbipartite graphsQR decompositionRow-ordering schemessparse Givens transformations

Mathematics Subject Classification ID

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

Cites Work

• Yale sparse matrix package I: The symmetric codes
• Title not available (Why is that?)
• Numerical methods for solving linear least squares problems
• Least Squares Computations by Givens Transformations Without Square Roots
• On Row and Column Orderings for Sparse Least Squares Problems
• The natural factor formulation of the stiffness for the matrix displacement method
• 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
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Title not available (Why is that?)

Cited In (10)

• A survey of direct methods for sparse linear systems
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• On General Row Merging Schemes for Sparse Givens Transformations
• Accuracy of preconditioned CG-type methods for least squares problems.
• Title not available (Why is that?)
• 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
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• Row Ordering for a Sparse QR Decomposition
• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model

Uses Software

• symrcm
• YSMP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761765)