loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Why Multigrid Methods Are So Efficient
November/December 2006 (vol. 8 no. 6)
pp. 12-22
ASCII Text
x 
 
Irad Yavneh, "Why Multigrid Methods Are So Efficient," Computing in Science and Engineering, vol. 8, no. 6, pp. 12-22, November/December, 2006.
 
 
BibTex
x
 
@article{ 10.1109/MCSE.2006.125,
author = {Irad Yavneh},
title = {Why Multigrid Methods Are So Efficient},
journal ={Computing in Science and Engineering},
volume = {8},
number = {6},
issn = {1521-9615},
year = {2006},
pages = {12-22},
doi = {http://doi.ieeecomputersociety.org/10.1109/MCSE.2006.125},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computing in Science and Engineering
TI - Why Multigrid Methods Are So Efficient
IS - 6
SN - 1521-9615
SP12
EP22
EPD - 12-22
A1 - Irad Yavneh,
PY - 2006
KW - multigrid methods
KW - numerical solution of partial differntial equations
VL - 8
JA - Computing in Science and Engineering
ER -
 
Irad Yavneh, Technion-Israel Institute of Technology
Originally introduced as a way to numerically solve elliptic boundary-value problems, multigrid methods, and their various multiscale descendants, have since been developed and applied to various problems in many disciplines. This introductory article provides the basic concepts and methods of analysis and outlines some of the difficulties of developing efficient multigrid algorithms.
Index Terms:
multigrid methods, numerical solution of partial differntial equations
Citation:
Irad Yavneh, "Why Multigrid Methods Are So Efficient," Computing in Science and Engineering, vol. 8, no. 6, pp. 12-22, Nov./Dec. 2006, doi:10.1109/MCSE.2006.125
Usage of this product signifies your acceptance of the Terms of Use.