@techreport{891601, abstract = {The truncated singular value decomposition (SVD) is considered as a method for regularization of ill-posed linear least squares problems. In particular, the truncated SVD solution is compared with the usual regularized solution. Necessary conditions are defined in which the two methods will yield similar results. This investigation suggests the truncated SVD as a favorable alternative to standard-form regularization in case of ill-conditioned matrices with a well-determined rank.}, address = {Stanford, CA, USA}, author = {Hansen, Per C}, interhash = {fb80b54fa51bf03e59980dc1e6a170e4}, intrahash = {ad995682545c5a74bcb4d273bc900800}, publisher = {Stanford University}, source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FNA-M-86-36}, title = {The truncated SVD as a method for regularization}, url = {http://portal.acm.org/citation.cfm?id=891601}, year = 1986 } @article{78499, abstract = { Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations
ACM Portal HeBIS: Universitaetsbibliothek Kassel
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations
Source SIAM Journal on Scientific and Statistical Computing archive
Volume 11 ,  Issue 3  (May 1990) table of contents
Pages: 519 - 530  
Year of Publication: 1990
ISSN:0196-5204
Authors
Tony F. Chan
Per Christian Hansen
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1137/0911029

CITED BY
 
P. Michalik , B. D. Brüderlin, Constraint-based design of B-spline surfaces from curves, Proceedings of the ninth ACM symposium on Solid modeling and applications, June 09-11, 2004, Genoa, Italy

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS

Additional Classification:
  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis


General Terms:
Algorithms, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
Tony F. Chan: colleagues
Per Christian Hansen: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
}, address = {Philadelphia, PA, USA}, author = {Chan, Tony F. and Hansen, Per Christian}, doi = {http://dx.doi.org/10.1137/0911029}, interhash = {2b726f44b73d5f4344ec672b6ba15948}, intrahash = {2890d06aaac6e75f62984de8b61fb938}, issn = {0196-5204}, journal = {SIAM J. Sci. Stat. Comput.}, number = 3, pages = {519--530}, publisher = {Society for Industrial and Applied Mathematics}, title = {Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations}, url = {http://portal.acm.org/citation.cfm?id=78499}, volume = 11, year = 1990 }