Problems of parallel solution of large systems of linear algebraic equations
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVIII, Tome 439 (2015), pp. 112-127
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
The paper considers some modern problems arising in developing parallel algorithms for solving large systems of linear algebraic equations with sparse matrices occurring in mathematical modeling of real-life processes and phenomena on a multiprocessor computer system (MCS). Two main requirements to methods and technologies under consideration are fast convergence of iterations and scalable parallelism, which are intrinsically contradictory and need a special investigation. The paper analyzes main trends is developing preconditioned iterative methods in Krylov's subspaces based on algebraic domain decomposition and principles of their program implementation on a geterogeneous MCS with hierarchical memory structure.