Driver Routines for Linear Least Squares Problems

• CALL LA_GELS ( A, B, TRANS=trans, INFO=info )
  Solves over-determined or under-determined linear systems or its transpose, using a QR or LQ factorization of A.
• CALL LA_GELSY ( A, B, RANK=rank, JPVT=jpvt, RCOND=rcond, INFO=info )
  Computes the minimum-norm solution to a linear least squares problem, using a complete orthogonal factorization of A.
• CALL LA_GELSX ( A, B, RANK=rank, JPVT=jpvt, RCOND=rcond, INFO=info )
  Computes the minimum-norm solution to a linear least squares problem, using a complete orthogonal factorization of A.
• CALL LA_GELSS ( A, B, RANK=rank, S=s, RCOND=rcond, INFO=info )
  Computes the minimum norm solution to a real linear least squares problem, using the singular value decomposition (SVD) of A.
• CALL LA_GELSD ( A, B, RANK=rank, S=s, RCOND=rcond, INFO=info )
  Computes the minimum norm solution to a real linear least squares problem, using the singular value decomposition (SVD) of A, combined with a divide and conquer technique.

  
  

  Back to LAPACK95 Homepage