Summary
The definition of acceleration parameters for the convergence of a sparseLU factorization semi-direct method is shown to be based on lower and upper bounds of the extreme eigevalues of the iteration matrix. Optimum values of these parameters are established when the eigenvalues of the iteration matrix are either real or complex. Estimates for the computational work required to reduce theL 2 norm of the error by a specified factor ɛ are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dupont, T., Kendall, R.P., Rachford, H.H.: An approximate factorization procedure for solving self-adjoint elliptic difference equations. SIAM J. Numer. Anal.5, 559–573 (1968)
Lipitakis, E.A.: Computational and algorithmic techniques for the solution of elliptic and parabolic P.D.E.'s in two and three space dimensions. Doctoral Thesis, Loughborough University of Technology, Loughborough, U.K. (1978)
Lipitakis, E.A., Evans, D.J.: A sparseLU factorization procedure for the solution of parabolic differential equations. Proc. Intern. Conf. on Num. Meth. in Thermal Problems, Swansea, U.K. Pineridge Press, pp. 954–966 (1979)
Stiefel, E.L.: Kernel polynomials in linear algebra and their numerical applications. Nat. Bur. Standards Appl. Math. Ser.49, 1–22 (1958)
Varga, R.S.: Matrix iterative analysis. Englewood Cliffs, N.J., Prentice Hall, 1962
Wrigley, H.E.: Accelerating the Jacobi method for solving simulataneous equations by Chebyshev extrapolation when the eigenvalues of the iteration matrix are complex. Comput J.6, 169–176 (1963)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lipitakis, E.A., Evans, D.J. The rate of convergence of an approximate matrix factorization semi-direct method. Numer. Math. 36, 237–251 (1980). https://doi.org/10.1007/BF01396653
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01396653