On 12Mar2004, Pascal A. Dupuis <
[hidden email]> wrote:
 from octave doc, it is said that the left division operator can be
 used to solve overdetermined problems: find x which minimises
 norm(AxB) => x=A\B

 It is also stated that it does not compute the inverse of
 A. Translation: it does not use the normal equation (A'*A)*x=A'*B. Right ?

 Just curious: which proceduce is used ? Householder transformation of
 A? Singular values decomposition ? Other ? In fact, this matters
 mainly in the case of a badly conditionned A (nearly linear dependance
 between columns).
You could look in the sources to find out.
Eventually, you would find the function Matrix::lssolve in
liboctave/dMatrix.cc (for the realvalued case), and you would see
that it calls the Lapack function DGELSS which uses an SVD method.
BTW, this is more of a general question about Octave, not so much
about maintaining Octave or its future, so a better list probably
would have been helpoctave.
Thanks,
jwe