Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
J. Ortega, Introduction to Parallel and Vector Solution of Linear Systems (Springer, New York, 1991).
O. Yu. Milyukova, “Parallel approximate factorization method for solving discreate elliptic equations,” Parallel Comput., No. 27, 1365–1379 (2001).
O. Yu. Milyukova, “Parallel iterative methods using factorized preconditioning matrices for solving elliptic equations on triangular grids,” Comput. Math. Math. Phys. 46, 1044–1060 (2006).
J. A. Meijerink and H. A. van der Vorst, “An iterative solution method for linear systems, of which the coefficient matrix is a symmetric M-matrix,” Math. Comput. 31 (137), 148–162 (1977).
I. Gustafsson, “A class of first order factorization methods,” BIT 18, 142–156 (1978).
O. Axelsson, “A generalazed SSOR method,” BIT 13, 443–467 (1972).
I. S. Duff and G. A. Meurant, “The effect of ordering on preconditioned conjugate gradients,” BIT 29, 625–657 (1989).
I. E. Kaporin, “High quality preconditionings of a general symmetric positive definite matrix based on its U T U + U T R + R T U-decomposition,” Num. Linear Algebra Appl. 5, 483–509 (1998).
I. E. Kaporin and I. N. Kon’shin, “Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks,” Comput. Math. Math. Phys. 41, 481–493 (2001).
I. E. Kaporin and O. Yu. Milyukova, “Massively parallel algorithm of the preconditioned conjugate gradient method for the numerical solution of systems of linear algebraic equations I,” in Collection of the Articles of Computational Center of RAS, Ed. by V. G. Zhadan (VTs RAN, Moscow, 2011), pp. 32–49 [in Russian].
S. A. Kharchenko, “The influence of parallelization of computations with surface interprocessor boundaries on the scalability of a parallel iterative algorithm for solving systems of linear equations using the example of the equations of computational hydrodynamics,” in Proceedings of the International Scientific Conference on Parallel Computational Technologies, PaCT'2008, St. Petersburg, 2008 (IUUrGU, Chelyabinsk, 2008), pp. 494–499.
V. L. Yakushev, V. N. Simbirkin, A. V. Filimonov, P. A. Novikov, I. N. Konshin, G. B. Sushko, and S. A. Kharchenko, “Solution of ill-conditioned symmetric SLAE for structural mechanics problems by parallel iterative methods,” Vestn. Nizhegor. Univ. Lobashevskogo, No. 4, 238–246 (2012).
O. Yu. Milyukova, “Parallel versions of the order incomplete triangular factorization preconditio¬ned conjugate gradient method using special matrix reordering,” KIAM Preprint No. 52 (Keldysh Inst. Appl. Math., Moscow, 2014). http://keldysh.ru/papers/2014/prep2014_52.pdf.
O. Yu. Milyukova, “Combining incomplete factorization strategies 'by value' and 'by position' for the order incomplete triangular factorization in parallel algorithms for the preconditioned conjugate gradient method,” KIAM Preprint No. 10 (Keldysh Inst. Appl. Math., Moscow, 2015). http://keldysh.ru/papers/ 2015/prep2015_10.pdf.
T. A. Davis and Y. F. Hu, “University of Florida sparse matrix collection,” ACM Trans. Math. Software 38 (2011). http://www.cise.ufl.edu/research/sparse/matrices.
M. Tismenetsky, “A new preconditioning technique for solving large sparse linear systems,” Linear Algebra Appl. 154–156, 331–353 (1991).
M. Suarjana and K. H. Law, “A robust incomplete factorization based on value and space constraints,” Int. J. Num. Methods Eng. 38, 1703–1719 (1995).
T. A. Manteuffel, “An incomplete factorization technique for positive definite linear systems,” Math. Comput. 34, 473–497 (1980).
I. Yamazaki, Z. Bai, W. Chen and R. Scalettar, “A high-quality preconditioning technique for multi-length-scale symmetric positive definite linear systems,” Num. Math. Theor. Meth. Appl. 2, 469–484 (2009).
A. Jennings and G. M. Malik, “Partial elimination,” J. Inst. Math. Appl. 20, 307–316 (1977).
I. E. Kaporin, “Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method,” Comput. Math. Math. Phys. 52, 169–193 (2012).
M. V. Yakobovskii, “Incremental graph decomposition algorithm,” Vestn. Nizhegor. Univ. Lobashevskogo, Ser.: Mat. Model. Optim. Upravl., No. 1 (28), 243–250 (2005).
E. N. Golovchenko, “Parallel partitioning tool for large mesh decomposition,” Mat. Model. 23 (10), 3–18 (2011).
ACKNOWLEDGMENTS
This work was supported by the Division of Mathematical Sciences of the Russian Academy of Sciences under program no. 3.
I thank I.E. Kaporin for his attention to this work and M.V. Yakobovskii and E.N. Golovchenko for the construction of the factorizations of the сfd2 and offshore matrices by the incremental method.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by I. Tselishcheva
Rights and permissions
About this article
Cite this article
Milyukova, O.Y. On a Parallel Version of a Second-Order Incomplete Triangular Factorization Method. Math Models Comput Simul 11, 309–320 (2019). https://doi.org/10.1134/S207004821902011X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S207004821902011X