Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A quasi-optimal non-overlapping domain decomposition algorithm for the Helmholtz equation
Boubendir Y., Antoine X., Geuzaine C. Journal of Computational Physics231 (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
A posteriori estimates for a non-overlapping domain decomposition method
Otto F., Lube G. Computing 62(1): 27-43, 1999. Type: Article
Jul 1 1999
Relaxation and decomposition methods for mixed integer nonlinear programming (International Series of Numerical Mathematics)
Nowak I., BIRKHAUSER, Boston, MA, 2005.  213, Type: Book (9783764372385)
Jun 28 2006
Multi-element generalized polynomial chaos for arbitrary probability measures
Wan X., Karniadakis G. SIAM Journal on Scientific Computing 28(3): 901-928, 2006. Type: Article
Sep 6 2007
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy