Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • 5 - Linear Least Squares Problem

  • from Part I - Numerical Linear Algebra
  • Abner J. Salgado, University of Tennessee, Knoxville, Steven M. Wise, University of Tennessee, Knoxville
  • Book:
    Classical Numerical Analysis
    Published online:
    29 September 2022
    Print publication:
    20 October 2022, pp 88-120

  • Summary

    We study the solution of overdetermined systems of equations. Introduce weak, and in particular least squares solutions. For full rank systems, we show existence and uniqueness via the normal equations. We introduce projection matrices and the QR factorization. We discuss the computation of the QR factorization with the help of Householder reflectors. For rank defficient systems we prove the existence and uniqueness of a minimal norm least squares solution. We introduce the Moore-Penrose pseudoinverse, show how it relates to the SVD, and how it can be used to solve rank defficient systems.