Christopher C. Paige
- 1 BJORCK, A. Use of conjugate gradients for solving linear least squares problems. In Duff, I.S. (Ed.), Conjugate-Gradwnt Methods and Stmilar Techntques, Rep. AERE R-9636, Computer Science and Systems Division, AERE Harwell, England, 1979, 48-71.Google Scholar
- 2 BJORCK, A, AND DUFF, I.S. A direct method for the solution of sparse linear least squares problems. Linear Algebra Appl. 34 (1980), 43-67.Google Scholar
- 3 BJORCK, A, AND ELFVING, T. Accelerated projection methods for computing Pseudoinverse solutions of systems of linear equations. Res Rep. LITH-MAT-R-1978-5, Dep. Mathematics, Linkoping Univ., Linkoping, Sweden, 1978.Google Scholar
- 4 CHEW, Y.T. Iterative methods for linear least-squares problems. Res. Rep. CS-75-04, Dep. of Computer Science, Univ. Waterloo, Waterloo, Ont., Canada, 1975.Google Scholar
- 5 ELFVING, T. On the conjugate gradient method for solving linear least-squares problems. Res. Rep. L1TH-MAT-R-1978-3, Dep. Mathematics, Linkoping Univ., Link6ping, Sweden, 1978.Google Scholar
- 6 FADDEEV, D.K., AND FADDEEVA, V.N. Computational Methods of Linear Algebra, Freeman, London, 1963.Google Scholar
- 7 GEORGE, A, AND HEATH, M T. Solution of sparse linear least squares problems using Givens rotations. Linear Algebra Appl. 34 (1980), 69-83.Google Scholar
- 8 GOLUB, G.H. Numerical methods for solving linear least-squares problems. Numer. Math. 7 (1965), 206-216.Google Scholar
- 9 GOLUB, G.H., AND KAHAN, W. Calculating the singular values and pseudoinverse of a matrix. SIAM J. Numer. Anal. 2 (1965), 205-224.Google Scholar
- 10 HESTENES, M.R., AND STIEFEL, E. Methods of conjugate gradients for solving linear systems J. Res. N.B.S. 49 (1952), 409-436.Google Scholar
- 11 HOUSEHOLDER, A.S. Terminating and non-terminating iterations for solving linear systems. SIAM J. Appl. Math. 3 (1955), 67-72.Google Scholar
- 12 KENNEDY, W.J., AND GENTLE, J.E. Stat~stwal Computing. Marcel Dekker, Inc., New York and Basel, 1980.Google Scholar
- 13 LANCZOS, C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J Res. N.B.S. 45 (1950), 255-282.Google Scholar
- 14 LEwis, J.G. Algorithms for sparse matrix eigenvalue problems. Res. Rep. STAN-CS-77-595, Stanford Univ., Stanford, CA, 1977.Google Scholar
- 15 NASHED, M.Z. Aspects of generalized inverses in analysis and regularization. In Nashed, M.A. (Ed.), Generahzed Inverses and Applwat~ons, Academic Press, New York, 1976, 193-244.Google Scholar
- 16 NELDER, J.A. GLIMManual. Numerical Algorithms Group, 13 Banbury Road, Oxford, England, 1975Google Scholar
- 17 PAIGE, C.C. Bidiagonahzatlon of matrices and solution of linear equations. SIAM J. Numer. Anal. 11 (1974), 197-209.Google Scholar
- 18 PAIGE, C.C. Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix. J. Inst. Maths. Appl 18 (1976), 341-349.Google Scholar
- 19 PAIGE, C.C., AND SAUNDERS, M.A. Solution of sparse indefinite systems of equations and leastsquares problems Res. Rep. STAN-CS-73-399, Stanford Univ., Stanford, CA, 1973.Google Scholar
- 20 PAIGE, C.C., AND SAUNDERS, M.A. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12 (1975), 617-629.Google Scholar
- 21 PAIGE, C.C., AND SAUNDERS, M.A. A bidiagonalization algorithm for sparse linear equations and least-squares problems. Rep. SOL 78-19, Dep. Operations Research, Stanford Univ., Stanford, CA, 1978.Google Scholar
- 22 PAIGE, C.C., AND SAUNDERS, M.A. LSQR' Sparse hnear equations and least-squares problems. ACM Trans. Math. Softw., to appear. Google Scholar
- 23 STEWART, G.W. Research, development and LINPACK. In Rice, J.R. (Ed.), Mathematwal Software III, Academic Press, New York, 1977, pp. 1-14.Google Scholar
- 24 VAN HEIJST, J., JACOBS, J., AND SCHERDERS, J. Kleinste-kwadraten problemen. Dep. Mathematics Rep., Eindhoven University of Technology, Eindhoven, The Netherlands, August 1976Google Scholar
- 25 WILKINSON, J.H. The Algebraw Etgenvalue Problem. Oxford University Press (Clarendon), New York, 1965. Google Scholar
Index Terms
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Recommendations
Sparse Linear Least Squares Problems in Optimization
Numerical and computational aspects of direct methods for large and sparse least squares problems are considered. After a brief survey of the most often used methods, we summarize the important conclusions made from a numerical comparison in matlab. ...
A note on sparse least-squares regression
We compute a sparse solution to the classical least-squares problem min"x@?Ax-b@?"2, where A is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from A,...
Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by finite difference approximations. Tensor methods have been shown to have very good ...
Comments