ACM Home Page
Please provide us with feedback. Feedback
Solutions to Weighted Least Squares Problems by Modified Gram-Schmidt with Iterative Refinement
Full text PdfPdf (490 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 5 ,  Issue 4  (December 1979) table of contents
Pages: 457 - 465  
Year of Publication: 1979
ISSN:0098-3500
Author
Roy H. Wampler  National Bureau of Standards, Admm. A337, U.S. Department of Commerce, Washington, DC
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 99,   Citation Count: 2
Additional Information:

references   cited by   index terms  

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/355853.355862
What is a DOI?

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
}3JORCK, A. Solving linear least squares problems by Gram-Schmidt orthogonalization. BIT 7 (1967), 1-21
 
2
BJORCK, A. Iterative refinement of linear least squares solutions I. BIT 7 (1967), 257-278.
 
3
BJoaCK, A. iteratlve refinement of linear least squares solutions If. BIT 8 (1968), 8-30.
 
4
BJORCK, A. A uniform numerical method for linear estmmtion from general Gauss-Markoff models. COMPSTAT 1974, Proc. in Computational Statistms, G. Bruckmann, F. Ferscbl, and L. Schmetterer, Eds., Physica Verlag, Vienna, 1974, pp. 131-140.
 
5
BJORCK, /k. Comment on the iterative refinement of least-squares solutions. J. Amer. Stattst. Assoc. 73 (1978), 161-166.
 
6
BJORCK, /k., AND GOLUB, G. ALGOL programming contnbutlon No 22: Iterative refinement of lmear least square solutions by Householder transformation. BIT 7 (1967), 322-337
 
7
DAHLQUIST, G., AND BJORCK, A. Numerwal Methods (Transl by N. Anderson). Prentice-Hall, Englewood Cliffs, N J., 1974.
 
8
FORSYTHE, G E., AND MOLER, C. B. Computer Solutton of Linear Algebraw Systems, Prentme- Hall, Englewood Cliffs, N. J., 1967.
 
9
HALL, A. D., AND RYDER, B G. The PFORT verifier. Proc. Comptr. Sci. and Statist., Eighth Ann Syrup. on the Interface, J. W. Frane, Ed., U of California, Los Angeles, Calif., 1975, p. 327
 
10
LAWSON, C. L., AND HANSON, R. J. Solving Least Squares Problems. Prentice-Hall, Englewood Cliffs, N. J., 1974.
 
11
LYON, G., AND STILLMAN, R B. A FORTRAN analyzer. Tech Note 849, Nat. Bur. of Stand., U.S Government Printing Office, Washington, D.C., 1974.
 
12
PETERS, G., AND WILKINSON, J. H. The least squares problem and pseudoinverses Computer J. 13 (1970), 309-316.
 
13
RAO, C. R. Linear Stattstical Inference and Its Apphcattons, 2nd ed. Wiley, New York, 1973.
 
14
RYDER, B. G. The PFORT verLfier. Software--Practwe and Experwnce 4 (1974), 359-377
 
15
SANDE, G. Program exection profiles Proc. Comptr. Scl. and Statist., Eighth Ann. Symp. on the Interface, J. W. Frane, Ed., U. of Califorma, Los Angeles, Calif., 1975, pp. 325-326.
 
16
WAMPLER, R. H. An evaluation of hnear least squares computer programs. J. Res Nat. Bur. Standards 7313 (1969), 59-90.
 
17
WAMPLER, R. H. A report on the accuracy of some widely used least squares computer programs. J. Amer Statist. Assoc. 65 (1970), 549-565.
 
18
WAMPLER, R. H. Some recent developments m linear least-squares computations. Proc. Comptr. Sci. and Statist., SLxth Ann. Syrup. on the Interface, M. E. Tarter, Ed., U. of California, Berkeley, Calif, 1972, pp 94-110.
19
 
20
WAMPLER, R. H Problems used in testing the efficiency and accuracy of the modified Gram. Schmidt least squares algorithm. Tech. Note, Nat. Bur. of Stand., U.S Government Printing office. (To appear.)