Explicit/Implicit, Conservative Domain Decomposition Procedures for Parabolic Problems Based on Block-Centered Finite Differences | Zendy

Clint Dawson | Zendy; Todd F. Dupont | Zendy

Open Access

Explicit/Implicit, Conservative Domain Decomposition Procedures for Parabolic Problems Based on Block-Centered Finite Differences

Author(s) -

Clint Dawson,

Todd F. Dupont

Publication year - 1994

Publication title -

siam journal on numerical analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 2.78

H-Index - 134

eISSN - 1095-7170

pISSN - 0036-1429

DOI - 10.1137/0731055

Subject(s) - domain decomposition methods , mathematics , discretization , stability (learning theory) , block (permutation group theory) , a priori and a posteriori , domain (mathematical analysis) , von neumann stability analysis , boundary value problem , numerical stability , finite element method , neumann boundary condition , boundary (topology) , numerical analysis , mathematical analysis , computer science , geometry , philosophy , physics , epistemology , machine learning , thermodynamics

Domain decomposition procedures for solving parabolic equations are considered. The underlying discretization consists of block-centered finite differences. In these procedures, fluxes at subdomain interfaces are calculated from the solution at the previous time level. These fluxes serve as Neumann boundary data for implicit, block-centered discretizations in the subdomains. A priori error estimates are presented, and numerical results examining the stability, accuracy, and parallelism of the scheme are presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research