Next: Singular values and vectors
Up: Singular Value Decomposition
Previous: Singular Value Decomposition
The discussion here follows closely the formulation in
[1, Chapter 3, pp. 113-115, pp. 144-152]. Suppose we
expect
to be a linear function of
, so that we expect
to write the measurements
of
in the form,
 |
(1) |
where
is ``measurement noise.'' Given
measurements at times
, we write
equations
 |
(2) |
where
![$\displaystyle \mathbf{E} = \left[ \begin{array}{cc} 1 & t_1 1 & t_2 \vdot...
...eft[ \begin{array}{c} n(t_1) n(t_2) \vdots n(t_M) \end{array} \right] .$](img10.png) |
(3) |
The ``best'' solution is obtained by minimizing, wrt
(here,
and
), the quantity
 |
(4) |
Differentiating wrt
leads to the normal equations,
 |
(5) |
The solution is not
- the inverse
or
is not even defined for
. It could be
 |
(6) |
if
can be found under certain assumptions. An
alternate approach, to be described next, is to use the singular
value decomposition of the matrix
. This latter approach can
be beneficial when
, when
does not
exist, or when the eigenvectors of
matrix
are not
orthonormal. It is also helpful not only because singular values,
unlike eigenvalues, exist for every matrix but also because the
singular vectors tell us something about the ``dynamics'' under
. (The last sentence couldn't have been more vague, but I will
leave it at that...) See [1] or email (yes, that is a
verb too) Juan for an extended discussion.
Next: Singular values and vectors
Up: Singular Value Decomposition
Previous: Singular Value Decomposition
Amit Apte
2005-03-14