2012
DOI: 10.3846/13926292.2012.645891
|View full text |Cite
|
Sign up to set email alerts
|

Predictor-Corrector Domain Decomposition Algorithm for Parabolic Problems on Graphs

Abstract: In this paper, we present a predictor-corrector type algorithm for solution of linear parabolic problems on graph structure. The graph decomposition is done by dividing some edges and therefore we get a set of problems on sub-graphs, which can be solved efficiently in parallel. The convergence analysis is done by using the energy estimates. It is proved that the proposed finite-difference scheme is unconditionally stable but the predictor step error gives only conditional approximation. In the second p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Thus 2D and 3D generalizations of the given mathematical model should be investigated. Construction of robust and efficient parallel algorithms can be done by using domain decomposition and splitting in space methods [29].…”
Section: Discussionmentioning
confidence: 99%
“…Thus 2D and 3D generalizations of the given mathematical model should be investigated. Construction of robust and efficient parallel algorithms can be done by using domain decomposition and splitting in space methods [29].…”
Section: Discussionmentioning
confidence: 99%
“…Thus 2D and 3D generalizations of the given mathematical model should be investigated. Construction of robust and efficient parallel algorithms can be done by using domain decomposition and splitting in space methods (Tumanova 2012).…”
Section: Summary Of the Third Chaptermentioning
confidence: 99%
“…As well as the use of an appropriate IBC, application of an accurate and efficient numerical scheme to solve the PDEs is also an important issue. Conventional numerical schemes mainly solve a PDE separately in reaches and around junctions (Szymkiewicz, 2010;Zhang et al, 2010;Sanders et al, 2011;Tumanova and ýLHJLV, 2012;Yang et al, 2012), which may result in the loss of computational efficiency. The authors developed a finite volume (FV) and finite element (FE) schemes for the parabolic PDEs in connected graphs (Yoshioka and Unami, 2012b;Yoshioka et al, 2013a-b).…”
Section: Introductionmentioning
confidence: 99%