On Row and Column Orderings for Sparse Least Squares Problems

DOI10.1137/0720022zbMath0513.65019OpenAlexW1979536183MaRDI QIDQ3659024

No author found.

Publication date: 1983

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

numerical experimentsnested dissection methodsparse linear least squares problemscomputing costsrow-column ordering

Mathematics Subject Classification ID

Related Items (13)

Row-ordering schemes for sparse Givens transformations. II. Implicit graph model ⋮ Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem ⋮ Sparse linear problems and the least squares method ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ Matrix enlarging methods and their application ⋮ A fast algorithm for sparse matrix computations related to inversion ⋮ Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions ⋮ Block computation and representation of a sparse nullspace basis of a rectangular matrix ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse QR factorization on a massively parallel computer ⋮ A range-space implementation for large quadratic programs with small active sets ⋮ Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model ⋮ Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems

This page was built for publication: On Row and Column Orderings for Sparse Least Squares Problems