On General Row Merging Schemes for Sparse Givens Transformations

DOI10.1137/0907081zbMath0605.65031OpenAlexW2011896664WikidataQ122920399 ScholiaQ122920399MaRDI QIDQ3742616

Joseph W. H. Liu

Publication date: 1986

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0907081

zbMATH Keywords

orthogonal decompositionmulti-frontal methodQR-decompositionGivens rotationComparative computational studiesrow merging schemerow/submatrix mergingvariable row pivoting

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Orthogonalization in numerical linear algebra (65F25)

Related Items (8)

Householder reflections versus Givens rotations in sparse orthogonal decomposition ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Solving large and sparse linear least-squares problems by conjugate gradient algorithms ⋮ Solution of sparse positive definite systems on a hypercube ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ Parallel QR Factorization of Block-Tridiagonal Matrices ⋮ A survey of direct methods for sparse linear systems ⋮ Parallel sparse Gaussian elimination with partial pivoting

Uses Software

• SPARSPAK

This page was built for publication: On General Row Merging Schemes for Sparse Givens Transformations