Abstract
Methods of constructing preconditioning of explicit iterative methods of solving systems of linear, algebraic equations with sparse matrices are considered in the work. The techniques considered can, first of all, be realized within the framework of the simplest data structures; secondly, the graph structures of the corresponding algorithms are well adapted to realization on parallel computers; thirdly, in conjunction with modifications of Chebyshev methods they make it possible to construct rather effective computational algorithms. Experimental data are presented which demonstrate the effect of the proposed techniques of preconditioning of the distribution of the eigenvalues of matrices of systems arising in discretization of two-dimensional elliptic boundary-value problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
A. Yu. Eremin, I. E. Kaporin, and N. Ya. Mar'yashkin, “Solution of linear systems of large size on vector and pipeline supercomputers,” in: Vopr. Kibern.: Koveierizatsiya Vychislenii, Moscow (1964).
M. Marcus and H. Mink, A Survey of Matrix Theory and Matrix Inequalities [Russian translation], Moscow (1972).
I. Babuska and M. Dorr, “Error estimates for the combined h-and p-version of the finite element method,” Numer. Math.,37, No. 2, 257–277 (1981).
I. Babuska, R. B. Kellogg, and J. Pitkäranta, “Direct and inverse error estimates for finite elements with mesh refinements,” Numer. Math.,33, No. 4, 447–471 (1979).
M. W. Benson and P. O. Frederickson, “Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems,” Utilitas Math.,22, 127–140 (1982).
A. Greenbaum, “Comparison of splittings used with the CG algorithms,” Numer. Math.,33, No. 2, 181–193 (1979).
J. W. Huang and O. Wing, “Optimal parallel triangulation of a sparse matrix,” IEEE Trans. Circuits Syst.,CAS-26, No. 9, 726–732 (1979).
D. C. Kershaw, “The incomplete Cholesky —conjugate gradient method for the iterative solution of systems of linear equations,” J. Comput. Phys.,26, No. 1, 43–65 (1978).
J. S. Kowalik and S. P. Kumar, “An efficient parallel block CG method for linear equation,” in: Proc. 1982 Int. Conf. Parallel Process. (1982), pp. 85–97.
T. A. Manteuffel, “The Tchebychev iterations for nonsymmetric linear systems,” Num. Math.,28, 307–327 (1977).
Y. Saad, “Practical use of polynomial preconditionings for the conjugate gradient method,” Rep. YALEU/DCS/RR-282 (1983).
Y. Saad and A. Sameh, “A parallel block Stiefel method for solving positive definite systems,” in: Proc. Elliptic Problem Solvers Conf. (1980), pp. 405–412.
A. Sameh, “An overview of parallel algorithms in numerical linear algebra,” Bull. Dir. Etud. Rech. Ser. C, No. 1, 129–134 (1983).
W. Schönauer, “The efficient solution of large linear systems resulting from the FLM for 3-D PDE's on vector computers,” Bull. Dir. Etud. Rechn. Ser. C, No. 1, 135–142 (1983).
M. Vogelius, “An analysis of the p-version of the finite element method for nearly incompressible materials,” Numer. Math.,41, No. 1, 39–53 (1983).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 139, pp. 51–60, 1984.
Rights and permissions
About this article
Cite this article
Eremin, A.Y., Kaporin, I.E. Spectral optimization of explicit iterative methods. I. J Math Sci 36, 207–214 (1987). https://doi.org/10.1007/BF01091801
Issue Date:
DOI: https://doi.org/10.1007/BF01091801