Matrix stretching for sparse least squares problems

DOI<51::AID-NLA187>3.0.CO;2-O 10.1002/(SICI)1099-1506(200003)7:2<51::AID-NLA187>3.0.CO;2-OzbMath0982.65046OpenAlexW2057811070MaRDI QIDQ2760330

Åke Björck, Mikael Adlers

Publication date: 19 December 2001

Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(200003)7:2<51::aid-nla187>3.0.co;2-o

zbMATH Keywords

numerical examplescondition numbernumerical stabilitysplitting algorithmlinear least squaressparse problemsdense rowsmatrix stretching

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (6)

Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ Iterative methods for least-square problems based on proper splittings. ⋮ An iterative algorithm for a least squares solution of a matrix equation ⋮ Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems

Cites Work

• Splitting dense columns in sparse linear systems
• Matrix enlarging methods and their application
• A General Updating Algorithm for Constrained Linear Least Squares Problems
• Predicting fill for sparse orthogonal factorization
• Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
• Sparse QR factorization in MATLAB

This page was built for publication: Matrix stretching for sparse least squares problems