Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Numerical aspects of the generalized CG-method applied to least squares problems
Evans D., Li C. Computing41 (1-2):171-178,1989.Type:Article
Date Reviewed: Jan 1 1990

The authors present a useful comparison between the generalized conjugate gradient method and an adjusted form of this method and the successive over-relaxation (SOR) and the conjugate gradient (CG) methods when applied to least squares problems. The authors’ study suggests that the generalized CG method is always better than the SOR method and, further, that the adjusted form of the generalized CG method is generally superior in performance to the unadjusted form.

Reviewer:  J. McCabe Review #: CR113505
Bookmark and Share
 
Least Squares Approximation (G.1.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Least Squares Approximation": Date
Optimal absolute error starting values for Newton-Raphson calculation of square root
Montuschi P., Mezzalama M. Computing 46(1): 67-86, 1991. Type: Article
Oct 1 1991
Partial linearization of one class of the nonlinear total least squares problem by using the inverse model function
Jukić D., Scitovski R., Späth H. Computing 62(2): 163-178, 1999. Type: Article
Aug 1 1999
 Orthogonal least squares algorithm for the approximation of a map and its derivatives with a RBF network
Drioli C., Rocchesso D. Signal Processing 83(2): 283-296, 2003. Type: Article
Jun 11 2003
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy