ACM Home Page
Please provide us with feedback. Feedback
Algorithm 853: An efficient algorithm for solving rank-deficient least squares problems
Full text PdfPdf (203 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 32 ,  Issue 1  (March 2006) table of contents
Pages: 157 - 165  
Year of Publication: 2006
ISSN:0098-3500
Authors
Leslie Foster  San Jose State University, San Jose, CA
Rajesh Kommu  San Jose State University, San Jose, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 64,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132973.1132981
What is a DOI?

APPENDICES and SUPPLEMENTS
Zip853.zip (526 KB)
Software for "An efficient algorithm for solving rank-deficient least squares problems"


ABSTRACT

Existing routines, such as xGELSY or xGELSD in LAPACK, for solving rank-deficient least squares problems require O(mn2) operations to solve min ‖bAx‖ where A is an m by n matrix. We present a modification of the LAPACK routine xGELSY that requires O(mnk) operations where k is the effective numerical rank of the matrix A. For low rank matrices the modification is an order of magnitude faster than the LAPACK code.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
Businger, P. and Golub, G. H. 1965. Linear least squares solutions by Householder transformations. Numer. Math. 7, 269--276.
 
5
 
6
Enting, I. G. 2002. Inverse Problems in Atmospheric Constituent Transport. Cambridge University Press, Cambridge.
 
7
 
8
Golub, G. and VanLoan, C. F. 1996. Matrix Computations. John Hopkins, Baltimore, Md.
 
9
 
10
 
11
Stewart, G. W. 1998. Matrix Algorithms vol. 1: Basic Decompositions. SIAM, Philadelphia.

Collaborative Colleagues:
Leslie Foster: colleagues
Rajesh Kommu: colleagues