Results 201 to 210 of about 505,660 (243)
Some of the next articles are maybe not open access.
1994
Various iterative methods can be classified as domain decomposition methods. Although a prototype of this iteration due to H. A. Schwarz (Viertelsjahresschrift der Naturforschenden Gesellschaft in Zurich, Vol. 15, 1870) is already 120 years old, this class of algorithms has attracted the interest of numerical analysts only recently.
openaire +1 more source
Various iterative methods can be classified as domain decomposition methods. Although a prototype of this iteration due to H. A. Schwarz (Viertelsjahresschrift der Naturforschenden Gesellschaft in Zurich, Vol. 15, 1870) is already 120 years old, this class of algorithms has attracted the interest of numerical analysts only recently.
openaire +1 more source
Overlapping Domain Decomposition Methods
2003Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation
openaire +1 more source
Multi-level domain decomposition methods
Applied Numerical Mathematics, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Advances in domain decomposition methods
2002Domain decomposition methods (DDM) have received much attention in recent years, which was originally motivated mainly because they are the most effective ways for devising parallel algorithms that can benefit from multiprocessor computation, and supercomputers, in the numerical modeling of continuous systems.
Ismael Herrera, Graciela S. Herrera
openaire +1 more source
Multigrid Methods of Macrogrid Domain Decomposition
Computational Mathematics and Mathematical PhysicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Algebraic multigrid domain decomposition methods
Russian Journal of Numerical Analysis and Mathematical Modelling, 1989Summary: The paper treats a new approach to constructing multilevel preconditioners for symmetric, positive definite and semi-definite matrices which arises in approximating elliptic problems by finite difference and finite element methods. The approach is based on multilevel domain decomposition methods with partitionings into small substructures and ...
openaire +2 more sources
Nonlinear Overlapping Domain Decomposition Methods
2009We discuss some overlapping domain decomposition algorithms for solving sparse nonlinear systemof equations arising fromthe discretization of partial differential equations. All algorithms are derived using the three basic algorithms: Newton for local or global nonlinear systems, Krylov for the linear Jacobian system inside Newton, and Schwarz for ...
openaire +1 more source
An hybrid domain decomposition method
2007In the field of non overlapping domain decomposition methods, two classical choices are the primal and the dual Schur complement approaches. The first leads to the Balanced Domain Decomposition [1,2] and the second to the Finite Element Tearing and Interconnecting method [3].
Gosselet, Pierre, Rey, Christian
openaire +2 more sources
Numerical Methods, Domain Decomposition
2011Quarteroni, Alfio, Formaggia, Luca
openaire +1 more source