Finite-difference schemes for parabolic problems on graphs (Q619303): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s10986-010-9077-1 / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10986-010-9077-1 / rank | |||
Normal rank |
Revision as of 05:16, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite-difference schemes for parabolic problems on graphs |
scientific article |
Statements
Finite-difference schemes for parabolic problems on graphs (English)
0 references
24 January 2011
0 references
The authors propose three different types of finite-difference schemes for a reaction-diffusion parabolic problem on branched structures: the fully implicit scheme based on the backward Euler algorithm, the predictor-, and the predictor-corrector-type finite-difference schemes. The stability and convergence of these schemes in the maximum norm are proved based on the maximum principle. Numerical examples are presented.
0 references
reaction-diffusion parabolic problem
0 references
branched structures
0 references
finite-difference method
0 references
predictor-corrector algorithm
0 references
stability
0 references
convergence
0 references
backward Euler algorithm
0 references
numerical examples
0 references
0 references
0 references