Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems

DOI10.1137/0908033zbMath0617.65034OpenAlexW2062370504MaRDI QIDQ4727285

George Ostrouchov

Publication date: 1987

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

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

zbMATH Keywords

bipartite graphsequential processinglarge sparse least squares problemsGivens factorizationcolumn-orderingprocessing orderrow- orderingsymbolic Givens reduction algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Orthogonalization in numerical linear algebra (65F25)

Related Items (1)

Solving sparse linear least-squares problems on some supercomputers by using large dense blocks

This page was built for publication: Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems