The sub-implicit method: New multiprocessor algorithms for old implicit codes
The paper presents a new approach to the parallel solution of an implicit system of difference equations. The region of solution is split into subregions and the difference equations solved on each subregion. The solution on the boundaries between the subregions is then found by averaging. The method is illustrated for the one-dimensional heat equation. The method is suitable for implementation on parallel computers. The question of stability is not investigated but it is noted that the fully implicit method is not unconditionally stable.
- The D'yakonov fully explicit variant of the iterative decomposition method
- Alternating block Crank-Nicolson method for the 3-D heat equation
- An efficient parallel iteration algorithm for nonlinear diffusion equations with time extrapolation techniques and the Jacobi explicit scheme
- Parallel difference schemes with interface extrapolation terms for quasi-linear parabolic systems
This page was built for publication: The sub-implicit method: New multiprocessor algorithms for old implicit codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111347)