Displaying similar documents to “Domain decomposition methods and scientific computing applications”

Analysis of patch substructuring methods

Martin Gander, Laurence Halpern, Frédéric Magoulès, Francois Roux (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

Patch substructuring methods are non-overlapping domain decomposition methods like classical substructuring methods, but they use information from geometric patches reaching into neighboring subdomains condensated, on the interfaces to enhance the performance of the method, while keeping it non-overlapping. These methods are very convenient to use in practice, but their convergence properties have not been studied yet. We analyze geometric patch substructuring methods for the special...

A numerical study on Neumann-Neumann methods for approximations on geometrically refined boundary layer meshes II. Three-dimensional problems

Andrea Toselli, Xavier Vasseur (2006)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper, we present extensive numerical tests showing the performance and robustness of a Balancing Neumann-Neumann method for the solution of algebraic linear systems arising from finite element approximations of scalar elliptic problems on geometrically refined boundary layer meshes in three dimensions. The numerical results are in good agreement with the theoretical bound for the condition number of the preconditioned operator derived in [Toselli and Vasseur, ...

A vehicle-track-soil dynamic interaction problem in sequential and parallel formulation

Janusz Kogut, Henryk Ciurej (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Some problems regarding numerical modeling of predicted vibrations excited by railway traffic are discussed. Model formulation in the field of structural mechanics comprises a vehicle, a track (often in a tunnel) and soil. Time consuming computations are needed to update large matrices at every discrete step. At first, a sequential Matlab code is generated. Later on, the formulation is modified to use grid computing, thereby a significant reduction in computational time is expected. ...

Admissible disturbance sets for discrete perturbed systems

Jamal Bouyaghroumni, Abdelhaq El Jai, Mostafa Rachik (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

We consider a discrete disturbed system given by the difference bilinear equation where are disturbances which excite the system in a linear and a bilinear form. We assume that the system is augmented with the output function. Let be a tolerance index on the output. The disturbance is said to be -admissible if, where is the output signal associated with the case of an uninfected system. The set of all -admissible disturbances is the admissible set. The characterization of is investigated...

Approximation of a solidification problem

Rajae Aboulaïch, Ilham Haggouch, Ali Souissi (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

A two-dimensional Stefan problem is usually introduced as a model of solidification, melting or sublimation phenomena. The two-phase Stefan problem has been studied as a direct problem, where the free boundary separating the two regions is eliminated using a variational inequality (Baiocchi, 1977; Baiocchi et al., 1973; Rodrigues, 1980; Saguez, 1980; Srunk and Friedman, 1994), the enthalpy function (Ciavaldini, 1972; Lions, 1969; Nochetto et al., 1991; Saguez, 1980), or a control problem...