Results 241 to 250 of about 577,422 (277)

Domain decomposition method (DDM)

2023
This chapter concerns the use of domain decomposition (DD) methods for the surface integral equation (SIE)-based solution of time-harmonic electromagnetic wave problems. DD methods have attracted significant attention for solving partial differential equations.
Martin, Victor F., Hong-Wei, Gao, Solis, Diego M., Taboada, Jose M., Peng, Zhen   +4 more
openaire   +2 more sources

PROJECTION DOMAIN DECOMPOSITION METHOD

Mathematical Models and Methods in Applied Sciences, 1994
A domain decomposition method using the projection approach is considered. The original elliptic problem is transformed to a set of analogous problems in subdomains and an abstract equation on the interface between subdomains, the latter being solved using Galerkin projection method with some special basis functions defined on the interface.
Agoshkov, V. I., Ovchinnikov, E.
openaire   +2 more sources

ADI method – Domain decomposition

Applied Numerical Mathematics, 2006
A domain decomposition algorithm which is based on an implicit prediction and fully implicit scheme for the interior values, for solving parabolic partial differential equations, is presented. It is shown that this algorithm without the correction procedure is unconditionally stable.
Jun, Younbae, Mai, Tsun-Zee
openaire   +1 more source

Domain Decomposition Techniques

2006
We introduce some parallel domain decomposition preconditioners for iterative solution of sparse linear systems like those arising from the approximation of partial differential equations by finite elements or finite volumes. We first give an overview of algebraic domain decomposition techniques. We then introduce a preconditioner based on a multilevel
FORMAGGIA, LUCA, M. Sala, SALERI, FAUSTO EMILIO   +2 more
openaire   +2 more sources

Domain decomposition algorithms

Acta Numerica, 1994
Domain decomposition refers to divide and conquer techniques for solving partial differential equations by iteratively solving subproblems defined on smaller subdomains. The principal advantages include enhancement of parallelism and localized treatment of complex and irregular geometries, singularities and anomalous regions.
Chan, Tony F., Mathew, Tarek P.
openaire   +1 more source

Extremal Decomposition of Spatial Domains

Journal of Mathematical Sciences, 2001
The authors extend classical results by Lavrent'ev and others on the product of the conformal radii of planar nonoverlapping domains to the space \({\mathbb R}^{n}\). Instead of the conformal radius a harmonic radius is considered. The reduced module with respect to a system of points is introduced by a generalized capacity.
Dubinin, V. N., Prilepkina, E. G.
openaire   +1 more source

Balancing domain decomposition

Communications in Numerical Methods in Engineering, 1993
AbstractThe Neumann–Neumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for iterative solution of finite‐element discretizations of difficult problems with strongly discontinuous coefficients (De Roeck and Le Tallec, 1991).
openaire   +1 more source

Tailored domain decomposition

Advances in Engineering Software, 1992
Abstract We developed a biased domain decomposition clustering algorithm designed for use in parallel processing for the numerical solution of partial differential equations. The biased clustering algorithm is designed to work on a distributed memory parallel computer.
openaire   +1 more source

Some Nonoverlapping Domain Decomposition Methods

SIAM Review, 1998
The rough contents of the present paper are as follows: 1. Introduction. 2. Algebraic aspects of preconditioning techniques. 3. A model problem and outline. 4. Preliminaries of Sobolev spaces and finite element spaces. 5. Substructuring methods. 6. Neumann-Neumann methods. 7. Some other interface preconditioners. 8.
Xu, Jinchao, Zou, Jun
openaire   +1 more source

Fictitious domain and domain decomposition methods

Russian Journal of Numerical Analysis and Mathematical Modelling, 1986
Summary: The fictitious domains and domain decomposition methods are treated as iterative methods in subspaces, developed for solving the systems of linear algebraic equations. The first part of the paper is devoted to the algebraic theory of these two methods, and the second part to their application to solving large systems of grid equations ...
Marchuk, G. I., Kuznetsov, Yu. A., Matsokin, A. M.   +2 more
openaire   +2 more sources