Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Best of 2012 Recommended by Editor Recommended by Reviewer Recommended by Reader
Search
A quasi-optimal non-overlapping domain decomposition algorithm for the Helmholtz equation
Boubendir Y., Antoine X., Geuzaine C.  Journal of Computational Physics 231 (2): 262-280, 2012. Type: Article
Date Reviewed: Feb 8 2012

The numerical solution of partial differential equations is one of the prime tasks in scientific computing. The two most important challenges in this area are the increasing size of the models and the ever-stricter accuracy requirements. To handle these difficult problems in an acceptable amount of time, it is necessary to use powerful computational techniques that utilize the available hardware in an efficient way. Under today’s conditions, this usually includes parallel algorithms.

The Helmholtz equation--a special case of such problems--has important applications in, for example, the modeling of wave propagation and scattering phenomena. For this equation set on the exterior of a bounded domain, Boubendir et al. propose and analyze a new efficient method. The algorithm is based on first truncating the originally unbounded domain where the solution is sought via the introduction of artificial absorbing boundary conditions, and then introducing a nonoverlapping decomposition of the remaining finite domain into a number of subdomains. Up to this point, the method follows the commonly pursued approaches.

One of the key points of the algorithm is the selection of transmission operators that link the individual subdomains. This transmission is based on square roots of suitably chosen regularized surface divergence operators. As these operators are of a nonlocal nature, and hence unsuitable for being handled computationally in an efficient way, they are approximated using Padé approximation techniques, thus removing the nonlocality. For the solution of the resulting linear problems, numerical experiments then indicate that the generalized minimal residual method (GMRES) performs in a highly satisfactory way. The authors’ detailed analysis demonstrates the very good convergence properties of the complete algorithm. Detailed numerical examples support these theoretical results.

The paper is likely to be of interest to researchers dealing with the simulation of problems modeled by the Helmholtz equation. It could also provide useful information for the development of efficient algorithms for related problems.

Reviewer:  Kai Diethelm Review #: CR139833 (1206-0608)
Bookmark and Share
  Editor Recommended
Featured Reviewer
 
 
Domain Decomposition Methods (G.1.8 ... )
 
 
Finite Element Methods (G.1.8 ... )
 
 
Physics (J.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Domain Decomposition Methods": Date
Mesh partitioning techniques and domain decomposition methods
Magoules F.,  Saxe-Coburg Publications, Stirling, UK, 2008. 342 pp. Type: Book (9781874672296)
Jun 24 2009
BDDC and FETI-DP under minimalist assumptions
Mandel J., Sousedík B.  Computing 81(4): 269-280, 2007. Type: Article
Apr 2 2008
2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications
Buttari A., D’Ambra P., di Serafino D., Filippone S.  Applicable Algebra in Engineering, Communication and Computing 18(3): 223-239, 2007. Type: Article
Jan 14 2008
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc.
Terms of Use
| Privacy Policy