Name
Abstract | ||
|---|---|---|
Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied for steady state or slow unsteady computation. Implicit schemes are used in order to march with large time steps. Parallelization is realized by approximating interface values using explicit computation. Various techniques are examined, including a multistep second order explicit scheme and a one-step high-order scheme. We show that the resulting schemes are of second order global accuracy in space, and stable in the sense of Osher or in $L_{\infty }$. They are optimized with respect to the parallel efficiency. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1137/S0036142900381710 | SIAM Journal on Numerical Analysis |
Keywords | Field | DocType |
parabolic equations,parallel efficiency,domain decomposition algorithm,stability,order global accuracy,one-step high-order scheme,finite difference,explicit computation,parallel numerical solution,order explicit scheme,efficient parallel algorithms,approximating interface,approximation accuracy,parabolic problems,slow unsteady computation,implicit scheme,second order,parabolic equation,steady state,domain decomposition,parallel algorithm | Parabolic partial differential equation,Mathematical optimization,Maximum principle,Mathematical analysis,Parallel algorithm,Finite difference method,Partial differential equation,Domain decomposition methods,Mathematics,Computation,Parabola | Journal |
Volume | Issue | ISSN |
39 | 5 | 0036-1429 |
Citations | PageRank | References |
18 | 2.57 | 0 |
Authors | ||
3 | ||