Next  |  Prev  |  Up  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

Least Squares Optimization

$\displaystyle \hat{x} \mathrel{\stackrel{\Delta}{=}}\arg \min_x \left\Vert\,Ax-b\,\right\Vert _2 = \arg \min_x \left\Vert\,Ax-b\,\right\Vert _2^2
$

Hence we can minimize

$\displaystyle \left\Vert\,Ax-b\,\right\Vert _2^2 = (Ax-b)^T(Ax-b)
$

Expanding this, we have:

$\displaystyle (Ax-b)^T(Ax-b) = (b^T-x^TA^T)(Ax-b)
$

This is quadratic in $ x$ , hence it has a global minimum which we can find by taking the derivative, setting it to zero, and solving for $ x$ . Doing this yields:

$\displaystyle A^TAx-A^Tb=0 $

These are the famous normal equations whose solution is given by:

$\displaystyle \zbox{\hat{x} = \left[(A^TA)^{-1}A^T\right]b}
$

The matrix

$\displaystyle A^\dagger \isdef (A^TA)^{-1}A^T
$

is known as the pseudo-inverse of the matrix $ A$ .


Next  |  Prev  |  Up  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

[Comment on this page via email]

``The Window Method for FIR Digital Filter Design}'', by Julius O. Smith III, (From Lecture Overheads, Music 421).
Copyright © 2020-06-27 by Julius O. Smith III
Center for Computer Research in Music and Acoustics (CCRMA),   Stanford University
CCRMA  [Automatic-links disclaimer]