Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Partial Differential Equations (G.1.8) > Domain Decomposition Methods (G.1.8...)  
 
Options:
 
  1-7 of 7 Reviews about "Domain Decomposition Methods (G.1.8...)": Date Reviewed
   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

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 requirement...

Feb 8 2012
  Mesh partitioning techniques and domain decomposition methods
Magoules F., Saxe-Coburg Publications, Stirling, UK, 2008. 342 pp.  Type: Book (9781874672296)

Today’s problems in scientific computing have become so large that they frequently cannot be handled in an acceptable amount of time on a single-processor system. Thus, there is a substantial demand for efficient parallel alg...

Jun 24 2009
  BDDC and FETI-DP under minimalist assumptions
Mandel J., Sousedík B. Computing 81(4): 269-280, 2007.  Type: Article

Balancing domain decomposition (BDD) and finite element tearing and interconnecting (FETI) are two families of approaches for the numerical solution of very large linear systems of equations, typically arising in connection with finite...

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

Mathematical modeling of real-life phenomena and engineering problems often involves solving very large and frequently ill-conditioned sparse linear systems of equations—preconditioning techniques are often employed to ad...

Jan 14 2008
  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

In computing, it is a challenge to obtain reliable information with uncertainties in inputs. To model uncertainty in physical applications, polynomial chaos is studied. The authors of this paper propose a multielement generalized polyn...

Sep 6 2007
  Relaxation and decomposition methods for mixed integer nonlinear programming (International Series of Numerical Mathematics)
Nowak I., BIRKHAUSER, Boston, MA, 2005. 213 pp.  Type: Book (9783764372385)

Mixed integer nonlinear program (MINLP) problems arise in many fields, including engineering design, the process industry, communications, and finance. In this book, the author discusses various methods to solve nonconvex structured MI...

Jun 28 2006
  A posteriori estimates for a non-overlapping domain decomposition method
Otto F., Lube G. Computing 62(1): 27-43, 1999.  Type: Article

The authors present a non-overlapping domain decomposition methodfor reaction diffusion problems. An a posteriori error estimate isderived, bounding the error on subdomains by using differences of tracesof the subdomain solutions. The ...

Jul 1 1999
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy