Pivot selection and row ordering in Givens reduction on sparse matrices

DOI10.1007/BF02241717zbMath0298.65029OpenAlexW2077687064MaRDI QIDQ1214736

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

Related Items (9)

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

Cites Work

• Unnamed Item
• Numerical methods for solving linear least squares problems
• The Elimination form of the Inverse and its Application to Linear Programming
• On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
• A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• Least Squares Computations by Givens Transformations Without Square Roots
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations

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