On Row and Column Orderings for Sparse Least Squares Problems

DOI10.1137/0720022MaRDI QIDQ3659024zbMATH OpenOpenAlexFDO

Authors

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

computing costsnested dissection methodnumerical experimentsrow-column orderingsparse linear least squares problems

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50)

Cited in

(14)

• Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems
• 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 range-space implementation for large quadratic programs with small active sets
• 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
• A survey of direct methods for sparse linear systems
• Sparse linear least-squares problems
• Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
• Block computation and representation of a sparse nullspace basis of a rectangular matrix
• Sparse QR factorization on a massively parallel computer

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

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