On a Parallel Version of a Second-Order Incomplete Triangular Factorization Method


如何引用文章

全文:

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

详细

We consider a parallel version of the stabilized second-order incomplete triangular factorization–conjugate gradient method in which the reordering of the coefficient matrix that corresponds to the ordering based on splitting into subdomains with separators is used. The incomplete triangular factorization is constructed using the truncation of the fill-in chosen “by value” at the internal nodes of the subdomains and “by value” and ‘by positions” on the separators. The reliability of the method under consideration is theoretically proved. The reliability and convergence rate of the parallel method are numerically analyzed. The developed algorithms are implemented using a Message Passing Interface (MPI); the computational results are presented for benchmark problems with matrices from the collection of the University of Florida.

作者简介

O. Milyukova

Keldysh Institute of Applied Mathematics, Russian Academy of Sciences

编辑信件的主要联系方式.
Email: olgamilyukova@mail.ru
俄罗斯联邦, Moscow, 125047

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2019