Konrad Hinsen schrieb:
Nils Wagner <nwagner@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. --
There are two Fortran implementations of the TLS algorithm already available via http://www.netlib.org/vanhuffel/ . Moreover there is a tool called f2py that generates Python C/API modules for wrapping Fortran 77/90/95 codes to Python. Unfortunately I am not very familar with this tool. Therefore I need some advice for this. Thanks in advance Nils
------------------------------------------------------------------------------- Konrad Hinsen | E-Mail: hinsen@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 -------------------------------------------------------------------------------