Δημοσιεύσεις

Project Acronym: ScaleSciCompIII
Title: Scientific Computing and Large Scale Simulation
Affiliation: democritus university of thrace
Pi: George Gravvanis
Research Field: mathematics and computer sciences

Distributed algebraic tearing and interconnecting techniques
by Tselepidis, N. A., Filelis-Papadopoulos, C. K. and Gravvanis, G. A.
Abstract:
A class of novel parallel preconditioning schemes in conjunction with a Krylov subspace iterative method for solving general sparse linear systems is presented. The proposed preconditioning schemes are domain decomposition methods that enforce the continuity of the solution on the subdomain interfaces using Lagrange multipliers, without requiring geometric information, namely algebraic tearing and interconnecting methods. Hence, they are applicable to a wide variety of problems as they are based only on the adjacency graph corresponding to the coefficient matrix. A modification of the proposed schemes, which improves performance while reducing the required operations is also presented. The algebraic tearing and interconnecting methods are designed for distributed systems with multicore nodes. Numerical results concerning the convergence behavior and the parallel performance of the proposed schemes are given along with discussions.
Reference:
Distributed algebraic tearing and interconnecting techniques (Tselepidis, N. A., Filelis-Papadopoulos, C. K. and Gravvanis, G. A.), In Numerical Algorithms, volume 82, 2019.
Bibtex Entry:
@article{Tselepidis2019,
 author = {Tselepidis, N. A. and Filelis-Papadopoulos, C. K. and Gravvanis, G. A.},
 title = {Distributed algebraic tearing and interconnecting techniques},
 journal = {Numerical Algorithms},
 year = {2019},
 bibyear = {2019},
 month = {Nov},
 day = {01},
 volume = {82},
 number = {3},
 pages = {809--842},
 abstract = {A class of novel parallel preconditioning schemes in conjunction with a Krylov subspace iterative method for solving general sparse linear systems is presented. The proposed preconditioning schemes are domain decomposition methods that enforce the continuity of the solution on the subdomain interfaces using Lagrange multipliers, without requiring geometric information, namely algebraic tearing and interconnecting methods. Hence, they are applicable to a wide variety of problems as they are based only on the adjacency graph corresponding to the coefficient matrix. A modification of the proposed schemes, which improves performance while reducing the required operations is also presented. The algebraic tearing and interconnecting methods are designed for distributed systems with multicore nodes. Numerical results concerning the convergence behavior and the parallel performance of the proposed schemes are given along with discussions.},
 issn = {1572-9265},
 doi = {10.1007/s11075-018-0628-6},
 url = {https://doi.org/10.1007/s11075-018-0628-6},
}