Advertisement

BIT Numerical Mathematics

, Volume 18, Issue 2, pp 142–156 | Cite as

A class of first order factorization methods

  • Ivar Gustafsson
Article

Abstract

A class of first order factorization methods for the solution of large, symmetric, sparse systems of equations is introduced. Asymptotic results for the computational complexity are developed, results from numerical experiments are presented and comparisons with other iterative and direct methods are carried out.

Keywords

Numerical Experiment Computational Complexity Computational Mathematic Factorization Method Asymptotic Result 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    I. Gustafsson,A class of first order factorization methods, Computer Sciences 77.04R, Chalmers University of Technology, Göteborg, Sweden, (1977).Google Scholar
  2. 2.
    O. Axelsson,A class of iterative methods for finite element equations, Comp.meth. in appl. mechanics and engineering 9 (1976), 123–137.CrossRefGoogle Scholar
  3. 3.
    O. Axelsson,On preconditioning and convergence acceleration in sparse matrix problems, CERN 74-10, Genève, Switzerland (1974).Google Scholar
  4. 4.
    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. of Comp. 31 (1977), 148–162.Google Scholar
  5. 5.
    P. Saylor,Second order strongly implicit symmetric factorization methods for the solution of elliptic difference equations, SIAM J. Numer. Anal. 11 (1974), 894–908.CrossRefGoogle Scholar
  6. 6.
    H. L. Stone,Iterative solution of implicit approximations of multidimensional partial differential equations, SIAM J. Numer. Anal. 5 (1968), 530–558.CrossRefGoogle Scholar
  7. 7.
    T. Dupont, R. Kendall and H. H. Rachford Jr.,An approximate factorization procedure for solving selfadjoint elliptic difference equations, SIAM J. Numer. Anal. 5 (1968), 559–573.CrossRefGoogle Scholar
  8. 8.
    O. Axelsson,A generalized SSOR method, BIT 12 (1972), 443–467.CrossRefGoogle Scholar
  9. 9.
    I. Gustafsson,On first order factorization methods for the solution of problems with mixed boundary conditions and problems with discontinuous material coefficients, Computer Sciences 77.13R, Chalmers University of Technology, Göteborg, Sweden (1977).Google Scholar
  10. 10.
    A. George,Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10 (1973), 345–363.CrossRefGoogle Scholar
  11. 11.
    A. George,Numerical experiments using dissection methods to solve n by n grid problems, Research Report CS-75-07, University of Waterloo, Canada (1975).Google Scholar
  12. 12.
    H. M. Markowitz,The elimination form of the inverse and its applications to linear programming, Management Sci. (1957), 255–269.Google Scholar
  13. 13.
    O. Axelsson and I. Gustafsson,A modified upwind scheme for convective transport equations and the use of a conjugate gradient method for the solution of non-symmetric systems of equations, Computer Sciences 77.12R, Chalmers University of Technology, Göteborg, Sweden (1977).Google Scholar
  14. 14.
    O. Axelsson, and I. Gustafsson,Iterative methods for the solution of the Naviers equations of elasticity, Computer Sciences 77.09R, Chalmers University of Technology, Göteborg, Sweden (1977).Google Scholar

Copyright information

© BIT Foundations 1978

Authors and Affiliations

  • Ivar Gustafsson
    • 1
  1. 1.Department of Computer Sciences FackChalmers University of Technology And The University of GöteborgGöteborgSweden

Personalised recommendations