LAPACK/ScaLAPACK Development

I am trying to solve an under-determined system of equation (more variables than equations)

Routines SGELS/DGELS assumes that the matrix is full-rank, what happens if the A matrix is rank defficient?
Will it thow any erros or will it still proceed solving the linear system?

Thanks
CNY

If you suspect that your matrix may be rank deficient then you should use one of the routines

S/DGELSD
S/DGELSS
S/DGELSY

The first two use the singular value decomposition (SVD) and the third uses the complete orthogonal decomposition.
The SVD is the most reliable for rank detection, but the complete orthogonal decomposition is likely to be faster.

S/DGELS is only intended for full rank problems.

See the LAPACK Users' Guide, Section 2.3.2 Linear Least Squares (LLS) Problems, for further information:

http://www.netlib.org/lapack/lug/node27.html

Sven Hammarling.