Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

Bérenger/Maxwell with Discontinous Absorptions : Existence, Perfection, and No Loss

Laurence HalpernJeffrey Rauch

Séminaire Laurent Schwartz — EDP et applications

We analyse Bérenger’s split algorithm applied to the system version of the two dimensional wave equation with absorptions equal to Heaviside functions of x j , j = 1 , 2 . The methods form the core of the analysis [11] for three dimensional Maxwell equations with absorptions not necessarily piecewise constant. The split problem is well posed, has no loss of derivatives (for divergence free data in the case of Maxwell), and is perfectly matched.

New trends in coupled simulations featuring domain decomposition and metacomputing

Philippe d'AnfrayLaurence HalpernJuliette Ryan — 2002

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a CORBA environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel subproblems...

New trends in coupled simulations featuring domain decomposition and metacomputing

Philippe d'AnfrayLaurence HalpernJuliette Ryan — 2010

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel subproblems...

Analysis of patch substructuring methods

Martin GanderLaurence HalpernFrédéric MagoulèsFrancois Roux — 2007

International Journal of Applied Mathematics and Computer Science

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 case of one...

Page 1

Download Results (CSV)