Name
Abstract | ||
|---|---|---|
In this paper, we prove convergence of a domain decomposition method for one-dimensional scalar conservation laws by dealing carefully with nonconservative terms at the interface of subdomains. The method consists of an explicit scheme in some subdomains and an implicit scheme in other subdomains with a numerical flux being the same as the one used in the explicit scheme. Although such a multidomain algorithm is not strictly conservative, the conservation error $CE(0,N\Delta t)$ is equal to ${\mathcal O}(\Delta t)$ regardless of the smoothness of the solution. Finally, two test examples are given to validate convergence and the computational efficiency of the present method. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1137/040607423 | SIAM J. Numerical Analysis |
Keywords | Field | DocType |
domain decomposition method,present method,conservation error,computational efficiency,nonconservative term,one-dimensional scalar conservation law,mathcal o,explicit scheme,multidomain algorithm,implicit scheme,scalar conservation law,convergence | Convergence (routing),Mathematical analysis,Scalar (physics),Decomposition method (constraint satisfaction),Numerical analysis,Partial differential equation,Domain decomposition methods,Mathematics,Conservation law,Multigrid method | Journal |
Volume | Issue | ISSN |
45 | 4 | 0036-1429 |
Citations | PageRank | References |
1 | 0.51 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huazhong Tang | 1 | 189 | 26.79 |
| Gerald Warnecke | 2 | 35 | 6.92 |