Journal of Scientific Computing

, Volume 13, Issue 3, pp 275–302

Preconditioning the Matrix Exponential Operator with Applications

Authors

  • Paul Castillo
    • Department of Computer Science and EngineeringUniversity of Minnesota
  • Yousef Saad
    • Department of Computer Science and EngineeringUniversity of Minnesota
Article

DOI: 10.1023/A:1023219016301

Cite this article as:
Castillo, P. & Saad, Y. Journal of Scientific Computing (1998) 13: 275. doi:10.1023/A:1023219016301

Abstract

The idea of preconditioning is usually associated with solution techniques for solving linear systems or eigenvalue problems. It refers to a general method by which the original system is transformed into one which admits the same solution but which is easier to solve. Following this principle we consider in this paper techniques for preconditioning the matrix exponential operator, eAy0, using different approximations of the matrix A. These techniques are based on using generalized Runge Kutta type methods. Preconditioners based on the sparsity structure of the matrix, such as diagonal, block diagonal, and least-squares tensor sum approximations are presented. Numerical experiments are reported to compare the quality of the schemes introduced.

Exponential operatorpreconditionergeneralized Runge Kutta methods

Copyright information

© Plenum Publishing Corporation 1998