A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
From MaRDI portal
Publication:4768554
DOI10.1007/BF01932945zbMath0282.65030MaRDI QIDQ4768554
Publication date: 1974
Published in: BIT (Search for Journal in Brave)
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
On the comparison of H-matrices with M-matrices, Fast and stable polynomial equation solving and its application to computer vision, Computational methods of linear algebra, On computing bounds for the least singular value of a triangular matrix, Bounds for condition numbers of triangular and trapezoid matrices, A method for calculating the reciprocal coefficients of function matrices, Rang revealing QR factorizations, Linear systems with a large number of sparse constraints with applications to incompressible materials, Analysis of singular matrix pencils, Solving the minimal least squares problem subject to bounds on the variables
Cites Work
