Module CGELSS.C in CLAPACK
Computes the minimum norm least squares solution to an over- or under-determined
system of linear equations A X=B, using the singular value decomposition of A.
(Simple driver.). [C version of LAPACK routine, converted from Fortran by f2c.].
Classes : D9a1 . Least squares (L-2) solution of singular, overdetermined or
underdetermined systems of linear equations without
constraints
Type : C subroutine in CLAPACK package.
Access : Public domain. Portable.
Precision: Single.
Note : For best results, CLAPACK developers prefer that you download and
install the entire CLAPACK library on your system. To do this, see the
netlib CLAPACK distribution for details.
Usage : int cgelss_(integer *m, integer *n, integer *nrhs, complex * a,
integer *lda, co mplex *b, integer *ldb, real *s, real *rcond,
integer *rank, complex *work, in teger *lwork, real *rwork, integer
* info)
Details : Fullsource Readme Source Utilities
Sites : (1) NETLIB
NETLIB: Public access repository, The University of Tennessee at
Knoxville and Bell Laboratories
Precision: Single. (Double: ZGELSS.C)
Note : For best results, CLAPACK developers prefer that you download and
install the entire CLAPACK library on your system. To do this, see the
netlib CLAPACK distribution for details.
You may access components from NETLIB outside GAMS as follows.
Access : The entire package can be retrieved by anonymous ftp from
ftp.netlib.org.
Source : echo 'send only cgelss.c from clapack/complex' | mail
netlib@ornl.gov
Fullsource : echo 'send cgelss.c from clapack/complex' | mail
netlib@ornl.gov
Utilities : Retrieve clapack/f2clibs.tgz by anonymous ftp from
ftp.netlib.org
Readme : Retrieve clapack/readme by anonymous ftp from
ftp.netlib.org
GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology
This page was generated on Sun Oct 12, 2008 at 05:41:00 UTC