A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem

DOI10.1007/BF01932945zbMATH Open0282.65030MaRDI QIDQ4768554FDOQ4768554

Ilkka Karasalo

Publication date: 1974

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Title not available (Why is that?)
• Solving linear least squares problems by Gram-Schmidt orthogonalization

Cited In (10)

• On computing bounds for the least singular value of a triangular matrix
• Solving the minimal least squares problem subject to bounds on the variables
• Fast and stable polynomial equation solving and its application to computer vision
• Computational methods of linear algebra
• On the comparison of H-matrices with M-matrices
• Linear systems with a large number of sparse constraints with applications to incompressible materials
• Bounds for condition numbers of triangular and trapezoid matrices
• Rang revealing QR factorizations
• Analysis of singular matrix pencils
• A method for calculating the reciprocal coefficients of function matrices

This page was built for publication: A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem

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