Explicit-implicit domain decomposition methods for solving parabolic equations (Q1921803): Difference between revisions

A new algorithm (without iteration) for domain decomposition on nonoverlapping subdomains is presented for multidimensional parabolic boundary value problems. Although methods with overlapping subdomains have better convergence properties than algorithms without overlapping, the last ones are more simple from the point of realisation. It is known that domain decomposition methods without overlapping subdomains have only conditional convergence (with correlations of the space and time grid steps). So that the present paper is devoted to the construction of new conditionally convergent methods. For this purpose the author use Lanczos polynomials instead of Chebyshev polynomials.