The Additive Peaceman–Rachford Method


如何引用文章

全文:

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

详细

A new version of the parallel Alternating Direction Implicit (ADI) method by Peaceman and Rachford for solving systems of linear algebraic equations with positive-definite coefficient matrices represented as sums of two commuting terms is suggested. The algorithms considered are suited for solving two-dimensional grid boundary-value problems with separable variables, as well as the Sylvester and Lyapunov matrix equations. The approach to rising parallel efficiency proposed in the paper is based on representing rational functions as sums of partial fractions. An additive version of the factorized ADI method for solving Sylvester’s equation is described. Estimates of the speedup resulting from increasing the number of computer units are presented. These estimates demonstrate a potential advantage of using the additive algorithms when implemented on a supercomputer with large number of processors or cores.

作者简介

N. Gorbenko

Institute of Computational Mathematics and Mathematical Geophysics, SB RAS; Novosibirsk State University

Email: ilin@sscc.ru
俄罗斯联邦, Novosibirsk; Novosibirsk

V. Il’in

Institute of Computational Mathematics and Mathematical Geophysics, SB RAS; Novosibirsk State University

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

补充文件

附件文件
动作
1. JATS XML

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