Parallel version of the alternating triangular method
From MaRDI portal
A version of the alternating triangular method for solving difference elliptic equations on a parallel computing system with a distributed memory is proposed. The case of a rectangular computational domain and a spatially uniform grid is considered. Estimates of the convergence rate of the iterative process are obtained. The efficiency of the method proposed is estimated theoretically and by numerical calculations of a model problem.
Recommendations
- A parallel version of the generalized alternating triangular method for elliptic equations
- scientific article; zbMATH DE number 2205642
- Parallel versions of some iterative methods with factorized preconditioners
- scientific article; zbMATH DE number 3878286
- A transverse triangular iterative method for solving mesh elliptic equations in a rectangle
Cited in
(7)- A parallel version of the generalized alternating triangular method for elliptic equations
- A new class of parallel alternating-type iterative methods
- Parallel method of zonal decomposition
- scientific article; zbMATH DE number 2107071 (Why is no real title available?)
- scientific article; zbMATH DE number 2205642 (Why is no real title available?)
- The Parallel Modification to the Levenberg-Marquardt Algorithm
- A parallel iterative method with a factorized preconditioning matrix for elliptic equations
This page was built for publication: Parallel version of the alternating triangular method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569340)