Pivot selection and row ordering in Givens reduction on sparse matrices

DOI10.1007/BF02241717MaRDI QIDQ1214736zbMATH OpenOpenAlexFDO

Authors Iain S. Duff

Publication date 1974

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02241717

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cites work

• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Least Squares Computations by Givens Transformations Without Square Roots
• Numerical methods for solving linear least squares problems
• On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
• The elimination form of the inverse and its application to linear programming
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations

Cited in

(9)

• Numerical methods for the transition to wavy Taylor vortices
• 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
• Sparse linear problems and the least squares method
• Comparison of two pivotal strategies in sparse plane rotations
• On the Householder Fox algorithm for decomposing a projection
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• Class of optimization algorithms for the solution of large nonlinear programming problems. I
• A survey of direct methods for sparse linear systems

This page was built for publication: Pivot selection and row ordering in Givens reduction on sparse matrices

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