On the augmented system approach to sparse least-squares problems
- 230 Downloads
We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.
Subject ClassificationsAMS(MOS): 65F20 CR: G1.3
Unable to display preview. Download preview PDF.
- Arioli, M., Demmel, J.W., Duff, I.S.: Solving sparse linear systems with sparse backward error. Report CSS 214, CSS Division, Harwell Laboratory, England. SIAM J. Matrix Anal. Appl. 1988 (to appear)Google Scholar
- Bartels, R.H., Golub, G.H., Saunders, M.A.: Numerical techniques in mathematical programming. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.): Nonlinear programming, pp. 123–176. New York: Academic Press 1970Google Scholar
- Björck, Å.: Iterative refinement of linear least squares solutions. BIT7, 257–278 (1967)Google Scholar
- Duff, I.S., Grimes, R.G., Lewis, J.G.: Sparse matrix test problems. Report CSS 191, CSS Division, Harwell Laboratory, England. ACM Trans. Math. Software 1987 (to appear)Google Scholar
- Gay, D.M.: Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter 1985Google Scholar
- Golub, G.H., Van Loan, C.F.: Matrix computations. 1st Ed. North Oxford Academic, Oxford, and John Hopkins Press, Baltimore 1983Google Scholar
- Hachtel, G.D.: Extended applications of the sparse tableau approach—finite elements and least squares. In: Spillers, W.R. (ed.): Basic question of design theory. Amsterdam: North Holland 1974Google Scholar
- Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica4, 373–395 (1984)Google Scholar
- Skeel, R.D.: Iterative refinement implies numerical stability for Gaussian elimination. Math. Comput.35, 817–832 (1980)Google Scholar