Linear Least Squares (LLS) Problems: LAPACK
Driver Routines
This
topic
describes LAPACK driver routines used for solving linear least
squares problems.
Table
"Driver Routines for Solving LLS
Problems"
lists all such routines.
Routine Name
| Operation performed
|
|---|---|
Uses QR or LQ factorization to solve a
overdetermined or underdetermined linear system with full rank matrix.
| |
Computes the minimum-norm solution to a linear
least squares problem using a complete orthogonal factorization of A.
| |
Computes the minimum-norm solution to a linear
least squares problem using the singular value decomposition of A.
| |
Computes the minimum-norm solution to a linear
least squares problem using the singular value decomposition of A and a divide
and conquer method.
|