Abstract
A new class of normalized approximate inverse matrix techniques, based on the concept of sparse normalized approximate factorization procedures are introduced for solving sparse linear systems derived from the finite difference discretization of partial differential equations. Normalized explicit preconditioned conjugate gradient type methods in conjunction with normalized approximate inverse matrix techniques are presented for the efficient solution of sparse linear systems. Theoretical results on the rate of convergence of the normalized explicit preconditioned conjugate gradient scheme and estimates of the required computational work are presented. Application of the new proposed methods on two dimensional initial/boundary value problems is discussed and numerical results are given. The parallel and systolic implementation of the dominant computational part is also investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. Axelsson. Iterative Solution Methods. Cambridge University Press, 1994.
A. Chalmers and J. Tidmus. Practical Parallel Processing, An Introduction to Problem Solving in Parallel. International Thomson Computer Press, 1996.
J. D. F. Cosgrove, J. C. Dias, and A. Griewank. Approximate inverse preconditioning for sparse linear systems. Inter. J. Comp. Math., 44:91–110, 1992.
J. J. Dongarra, I. S. Duff, D. C. Sorensen, and H. A. van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, 1991.
O. B. Efremides and M. P. Bekakos. Designing processor-time optimal systolic configurations. In M. P. Bekakos, ed., Highly Parallel Computations: Algorithms and Applications. Series: Advances in High Perfor-mance Computing, Vol. 5, pp. 339–364. WIT Press, 2001.
H. C. Elman. Relaxed and stabilized incomplete factorization for non-self-adjoint linear systems. BI T, 29:890–915, 1989.
D. J. Evans and E. A. Lipitakis. A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations. Comp. Meth. Appl. Mech. & Engin., 23:1–19, 1980.
K. M. Giannoutakis and G. A. Gravvanis. A normalized explicit preconditioned conjugate gradient method for solving sparse non-linear systems. In H. R. Arabnia, ed., Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications,Vol. I, pp. 107–113. CSREA Press, 2002.
G. H. Golub and C. F. van Loan. Matrix Computations. The John Hopkins University Press, 1996.
G. A. Gravvanis. Explicit isomorphic iterative methods for solving arrow-type linear systems. Inter. J. Comp. Math., 74(2):195–206, 2000.
G. A. Gravvanis. An approximate inverse matrix technique for arrowhead matrices. Inter. J. Comp. Math., 70:35–45, 1998.
G. A. Gravvanis. Parallel matrix techniques. In K. D. Papailiou, D. Tsahalis, J. Periaux, C. Hirsch, and M. Pandolfi, eds., Computational Fluid Dynamics 98,Vol. I, pp. 472–477. Wiley, 2002.
G. A. Gravvanis. The rate of convergence of explicit approximate inverse preconditioning. Inter. J. Comp. Math., 60:77–89, 1996.
G. A. Gravvanis. A three dimensional symmetric linear equation solver. Commun. Numer. Meth. in Engin., 10:717–730, 1994.
G. A. Gravvanis and K. M. Giannoutakis. On the rate of convergence and complexity of finite element normalized explicit approximate inverse preconditioning. In K. J. Bathe, ed., Proceedings of the Second MIT Conference on Computational Fluid and Solid Mechanics, Elsevier, 2003, to appear.
G. A. Gravvanis and E. A. Lipitakis. On the numerical modelling and solution of initial/boundary value problems. In R. W. Lewis and P. Durbetaki, eds., Numerical Methods in Thermal Problems, Vol. IX, No. 2, pp. 782–793, Pineridge Press, 1995.
A. Greenbaum. Iterative Methods for Solving Linear Systems. SIAM, 1997.
M. J. Grote and T. Huckle. Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput., 18:838–853, 1997.
T. Huckle. Efficient computations of sparse approximate inverses. Numer. Linear Algebra Appl., 5:57–71, 1998.
I. Kaporin. New convergence results and preconditioning strategies for the conjugate gradient method. Numer. Linear Algebra. Appl., 1:179–210, 1994.
L. Y. Kolotilina and A. Y. Yeremin. Factorized sparse approximate inverse preconditioning. SIAM J. Matrix Anal. Appl., 14:45–58, 1993.
B. P. Lester. The Art of Parallel Programming. Prentice-Hall Int. Inc., 1993.
E. A. Lipitakis and G. A. Gravvanis. A class of explicit preconditioned conjugate gradient methods for solving large finite element systems. Inter. J. Comp. Math., 44:189–206, 1992.
E. A. Lipitakis and G. A. Gravvanis. The convergence rate and complexity of preconditioned iterative methods based on approximate finite element matrix factorization. Bulletin of the Greek Mathematical Society, 33:11–23, 1992.
Y. Notay. On the convergence rate of the conjugate gradients in presence of rounding errors. Numer. Math., 65:301–317, 1993.
Y. Saad. Iterative Methods for Sparse Linear Systems. PWS, 1996.
Y. Saad and H. A. van der Vorst. Iterative solution of linear systems in the 20th century. J. Comput. Appl. Math., 123:1–33, 2000.
A. van der Sluis and H. A. van der Vorst. The rate of convergence of conjugate gradients. Numer. Math., 48:543–560, 1986.
H. A. van der Vorst and C. Vuik. GMRESR: A family of nested GMRES methods. Numer. Linear Algebra Appl., 1(4):369–386, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gravvanis, G.A., Giannoutakis, K.M., Bekakos, M.P. et al. Parallel and Systolic Solution of Normalized Explicit Approximate Inverse Preconditioning. The Journal of Supercomputing 30, 77–96 (2004). https://doi.org/10.1023/B:SUPE.0000040610.88224.7e
Issue Date:
DOI: https://doi.org/10.1023/B:SUPE.0000040610.88224.7e