[Numpy-discussion] Total least squares problem
Konrad Hinsen
hinsen at cnrs-orleans.fr
Wed Nov 14 05:30:07 EST 2001
Nils Wagner <nwagner at mecha.uni-stuttgart.de> writes:
> There is a difference between classical least squares (Numpy)
> and TLS (total least squares).
Algorithmically speaking it is even a very different problem. I'd say
the only reasonable (i.e. efficient) solution for NumPy is to
implement the TLS algorithm in a C subroutine calling LAPACK routines
for SVD etc.
Konrad.
--
-------------------------------------------------------------------------------
Konrad Hinsen | E-Mail: hinsen at cnrs-orleans.fr
Centre de Biophysique Moleculaire (CNRS) | Tel.: +33-2.38.25.56.24
Rue Charles Sadron | Fax: +33-2.38.63.15.17
45071 Orleans Cedex 2 | Deutsch/Esperanto/English/
France | Nederlands/Francais
-------------------------------------------------------------------------------
More information about the NumPy-Discussion
mailing list