Efficient Approximate Solution of Sparse Linear Systems

Computers and Mathematics with Applications

Volumn 36, Issue 9, 1998, Pages 37-58

  Reif, J H ^a  

^a Duke University   (United States)

Author keywords

Approximate solution; Condition number; Iterations; Linear systems; Preconditioners; Sparse matrices

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

APPROXIMATE SOLUTION; CONDITION NUMBER; PRECONDITIONERS; SPARSE LINEAR SYSTEMS;

LINEAR SYSTEMS;

EID: 0032205750     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00191-6     Document Type: Article

References (46)

1. P. Vaidya, Invited Talk Workshop on Graph Theory and Sparse Matrix Computation, Special Year Algebra (October 14-18, 1991), Institute for Mathematics and Its Applications, University of Minnesota, MN.
2. K.D. Gremban, G.L. Miller and M. Zagha, Performance evaluation of a new parallel preconditioner, Technical Report CMU-CS-94-205, Carnegie Mellon University, (1994).
3. th International Parallel Processing Symposium, pp. 65-69, (1995).
4. K.D. Gremban, Combinatorial preconditioners for large sparse, diagonally dominant linear systems CMU Technical Report CMU-CS-96-123, Ph.D. Thesis, Carnegie Mellon University, (October 1996).
5. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (3), 251-280, (1990).
6. G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, (1989).
7. J.M. Ortega, Numerical Analysis, A Second Course, Academic Press, New York, (1972).
8. B. Bollobas, Extremal Graph Theory, Academic Press, (1978).
9. nd Annual ACM Symp. Theory of Computing, pp. 293-299, (1990).
10. R.J. Lipton, D.J. Rose and R.E. Tarjan, Generalized nested dissection, SIAM J. Num. Anal. 16, 346-358, (1979).
11. J.R. Gilbert and R.E. Tarjan, The analysis of a nested dissection algorithm, Numer. Math. 50 (4), 377-404, (1987).
12. S.F. Ashby, Polynomial preconditioning for conjugate gradient methods, Technical Report UIUCDCS-R-87-1355, Univ. Illinois, (1987).
13. O. Axelsson, Bounds of eigenvalues of preconditioned matrices, SIAM J. Matrix Anal. Appl. 13 (3), 847-862, (1992).
14. O. Axelsson and G. Lindskog, On the rate of convergence of the preconditioned conjugate gradient method, Numer. Math. 48, 499-523, (1986).
15. O. Axelsson and P.S. Vassilevski, Algebraic multilevel preconditioning methods, Numer. Math. 56, 157-177, (1989).
16. J.H. Bramble, J.E. Pasciak and J. Xu, Parallel multilevel preconditioners, Math. Comp. 55, 1-22, (1990).
17. S.C. Eisenstat, Efficient implementation of a class of preconditioned conjugate gradient methods, SIAM J. Sci. Stat. Comput. 2, 1-4, (1981).
18. I.S. Duff and G.A. Meurant, The effect of ordering on preconditioned conjugate gradients, BIT 29, 635-657, (1989).
19. H.A. van der Vorst, High performance preconditioning, SIAM J. Sci. Stat. Comput. 10 (6), 1174-1185, (1999).
20. M.A. Heroux, P. Vu and C. Yang, A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP, Appl. Num. Math. 8, 93-115, (1991).
21. X.-Z. Guo, Multilevel preconditioners: Analysis, performance enhancements, and parallel algorithms. In Technical Report CS-TR-2903, University of Maryland, (1992).
22. A. Brandt, Multi-level adaptive solutions to boundary-value problems, Math. Comput. 31, 333-390, (1977).
23. K. Stuben, Algebraic multigrid (AMG): Experiences and comparisons, Appl. Math. Comp. 13, 419-451, (1983).
24. D. Braess and W. Hackbusch, A new convergence proof for the multigrid method including the V-cycle, SIAM J. Numer. Anal. 20, 975-986, (1983).
25. R.B. Ewing, Editor, Frontiers in Applied Mathematics: Multigrid Methods, SLANS, (1987).
26. W.L. Briggs, A multigrid tutorial, SIAM, (1987).
27. W.H. Press and S.A. Teukolsky, Multigrid methods for boundary value problems, Computers in Physics, 514-519, (1991).
28. R.S. Varga, Matrix Iterative Analysis, Prentice Hall, (1962).
29. D.M. Young, Iterative Solution of Large Linear Systems, Academic Press, (1971).
30. O. Axelsson, Iterative Solution Methods, Cambridge University Press, (1984).
31. L.A. Hageman and D.M. Young, Applied Iterative Methods, Academic Press, (1981).
32. W. Hackbusch, Iterative Solution of Large Sparse Systems of Equations, Springer-Verlag, (1994).
33. W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, (1988).
34. G. Golub and J.M. Ortega, Scientific Computing: An Introduction with Parallel Computing, Academic Press, (1993).
35. M.T. Heath, E. Ng and B.W. Peyton, Parallel algorithms for sparse linear systems, In Parallel Algorithms for Matrix Computations, SIAM, (1990).
36. M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards 49, 409-436, (1952).
37. J.K. Reid, On the method of conjugate gradients for the solution of large sparse systems of equations, In Large Sparse Sets of Linear Equations, pp. 231-254, Academic Press, (1971).
38. G. Golub and D. O'Leary, Some history of the conjugate gradient and Lanczos algorithms: 1948-1976, SIAM Rev. 31, 50-102, (1989).
39. P.G. Doyle and J.L. Snell, Random walks and electric networks, Carus Mathematical Mono-Graphs 22, (1984).
40. st Annual ACM Symposium on the Theory of Computing, pp. 574-586, (1989).
41. th ACM Symposium on Theory of Computing, Montreal, Canada, pp. 9-15, (1994).
42. R.J. Lipton and R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Applied Math., 177-189, (1979).
43. M. Arioli, I. Duff and D. Ruiz, Stopping criteria for iterative solvers, SIAM J. Matrix Anal. Appl. 13 (1), 138-144, (1992).
44. th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 452-461, (1994).
45. V. Pan and J.H. Reif, On the bit complexity of discrete solutions of PDEs: Compact multigrid, SIAM Journal of Scientific and Statistical Computing, 612-625, (1991).
46. J.H. Reif, Communication to K.D. Gremban, (1996).