This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multigrid Methods: Managing Massive Meshes
September/October 2006 (vol. 8 no. 5)
pp. 96-103
Dianne P. O'Leary, University of Maryland
In our last homework assignment, we investigated iterative methods for solving large, sparse, linear systems of equations. We saw that the Gauss-Seidel (GS) method was intolerably slow, but various forms of preconditioned conjugate gradient (CG) algorithms gave us reasonable results. The test problems we used were discretizations of elliptic partial differential equations, but for these problems, we can use a faster class of methods called multigrid algorithms.
Index Terms:
multigrid, finite element, finite difference
Citation:
Dianne P. O'Leary, "Multigrid Methods: Managing Massive Meshes," Computing in Science and Engineering, vol. 8, no. 5, pp. 96-103, Sept.-Oct. 2006, doi:10.1109/MCSE.2006.94
Usage of this product signifies your acceptance of the Terms of Use.