By Topic

Multigrid Methods: Managing Massive Meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
O'Leary, D.P. ; Inst. for Adv. Comput. Studies & the Appl. Math., Univ. of Maryland, MD

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. Surprisingly, the GS method (or some variant) is one of the two main ingredients in these algorithms!

Published in:

Computing in Science & Engineering  (Volume:8 ,  Issue: 5 )