Displaying similar documents to “On selection of interface weights in domain decomposition methods”

New trends in coupled simulations featuring domain decomposition and metacomputing

Philippe d'Anfray, Laurence Halpern, Juliette Ryan (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

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

An asynchronous three-field domain decomposition method for first-order evolution problems

Krupička, Lukáš, Beneš, Michal

Similarity:

We present an asynchronous multi-domain time integration algorithm with a dual domain decomposition method for the initial boundary-value problems for a parabolic equation. For efficient parallel computing, we apply the three-field domain decomposition method with local Lagrange multipliers to ensure the continuity of the primary unknowns at the interface between subdomains. The implicit method for time discretization and the multi-domain spatial decomposition enable us to use different...

A variant of the reciprocal super Catalan matrix

Emrah Kılıç, Ilker Akkus, Gonca Kızılaslan (2015)

Special Matrices

Similarity:

Recently Prodinger [8] considered the reciprocal super Catalan matrix and gave explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and obtained some related matrices. For all results, q-analogues were also presented. In this paper, we define and study a variant of the reciprocal super Catalan matrix with two additional parameters. Explicit formulæ for its LU-decomposition, LUdecomposition of its inverse and the Cholesky decomposition are obtained. For all...