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

DOI10.1016/0024-3795(84)90022-3MaRDI QIDQ761765zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3523042 (Why is no real title available?)
• Comparison of two pivotal strategies in sparse plane rotations
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Least Squares Computations by Givens Transformations Without Square Roots
• Numerical methods for solving linear least squares problems
• On Row and Column Orderings for Sparse Least Squares Problems
• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Solution of sparse linear least squares problems using Givens rotations
• The natural factor formulation of the stiffness for the matrix displacement method
• Yale sparse matrix package I: The symmetric codes

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.
• scientific article; zbMATH DE number 5533281 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• YSMP
• symrcm

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)