This paper presents a new technique in designing the finite difference domain decomposition algorithm for the heat-equation. The basic procedure is to define the finite difference schemes at the interface grid points with smaller time step Δt̄ = Δt̄/m (m is a positive integer) by the classical explicit scheme. The stability region of the algorithm is expanded m times comparing with the classical explicit scheme, and the prior error estimates for the numerical solutions are obtained for some algorithms when m = 2 or m = 3. Numerical experiments on stability and accuracy are also presented. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Shen, W., & Yang, S. (2004). New techniques in designing finite difference domain decomposition algorithm for the heat equation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3046 LNCS(PART 4), 1–10. https://doi.org/10.1007/978-3-540-24768-5_1
Mendeley helps you to discover research relevant for your work.