| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4644836 | Applied Numerical Mathematics | 2016 | 12 Pages |
Abstract
In this paper we analyze the convergence of the domain decomposition method applied to transport problems on networks. In particular, we derive estimates for the number of required iterations for linear problems. These estimates can be used to determine when the implementation of domain decomposition methods would be beneficial for this type of problems.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Computational Mathematics
Authors
J.B. Collins, P.A. Gremaud,