scientific article; zbMATH DE number 32256
From MaRDI portal
Publication:3988237
For \(A\in\mathbb{R}^{m\times n}\) (\(m\geq n=\text{rank}(A)\)) and \(b\in\mathbb{R}^ m\), consider the least squares problem \[ \| Ax-b\|_ 2\to\min. \] The author shows that the modified Gram-Schmidt orthogonalization method for solving this problem is algebraically and numerically equivalent to Gaussian elimination applied to the normal equations \(A^ T Ax=A^ T b\).
Recommendations
- Gaussian elimination for the solution of linear systems of equations
- Gram-Schmidt Orthogonalization by Gauss Elimination
- On the modified Gram-Schmidt algorithm for weighted and constrained linear least squares problems
- Gaussian elimination is optimal for solving linear equations in dimension two
- Comparison on the modified Gauss-Seidel method for solving linear systems
- A technique for obtaining approximate solutions in Gaussian equivalent linearization
- Solving least squares problems with equality constraints based on augmented regularized normal equations
- On the relationship between the method of least squares and Gram-Schmidt orthogonalization
- Norm-constrained least-squares solutions to the matrix equation \(A X B = C\)
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988237)