A General Updating Algorithm for Constrained Linear Least Squares Problems
From MaRDI portal
Publication:3675410
DOI10.1137/0905029zbMath0562.65018OpenAlexW2045102407MaRDI QIDQ3675410
Publication date: 1984
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0905029
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (9)
Recursive least squares with linear inequality constraints ⋮ Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations ⋮ A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ Self-scaling fast rotations for stiff and equality-constrained linear least squares problems ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ Matrix stretching for sparse least squares problems ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems ⋮ Solving large linear least squares problems with linear equality constraints
This page was built for publication: A General Updating Algorithm for Constrained Linear Least Squares Problems
