Problems of Parallel Solution of Large Systems of Linear Algebraic Equations


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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 heterogeneous MCS with hierarchical memory structure.

作者简介

V. Il’in

Institute of Computational Mathematics and Mathematical Geophysics, SO RAN and Novosibirsk State University

编辑信件的主要联系方式.
Email: ilin@sscc.ru
俄罗斯联邦, Novosibirsk

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media New York, 2016