Open Access
2011 Computing Exponential for Iterative Splitting Methods: Algorithms and Applications
Jürgen Geiser
J. Appl. Math. 2011(SI1): 1-27 (2011). DOI: 10.1155/2011/193781


Iterative splitting methods have a huge amount to compute matrix exponential. Here, the acceleration and recovering of higher-order schemes can be achieved. From a theoretical point of view, iterative splitting methods are at least alternating Picards fix-point iteration schemes. For practical applications, it is important to compute very fast matrix exponentials. In this paper, we concentrate on developing fast algorithms to solve the iterative splitting scheme. First, we reformulate the iterative splitting scheme into an integral notation of matrix exponential. In this notation, we consider fast approximation schemes to the integral formulations, also known as φ -functions. Second, the error analysis is explained and applied to the integral formulations. The novelty is to compute cheaply the decoupled exp-matrices and apply only cheap matrix-vector multiplications for the higher-order terms. In general, we discuss an elegant way of embedding recently survey on methods for computing matrix exponential with respect to iterative splitting schemes. We present numerical benchmark examples, that compared standard splitting schemes with the higher-order iterative schemes. A real-life application in contaminant transport as a two phase model is discussed and the fast computations of the operator splitting method is explained.


Download Citation

Jürgen Geiser. "Computing Exponential for Iterative Splitting Methods: Algorithms and Applications." J. Appl. Math. 2011 (SI1) 1 - 27, 2011.


Published: 2011
First available in Project Euclid: 29 August 2011

zbMATH: 1217.65065
MathSciNet: MR2784394
Digital Object Identifier: 10.1155/2011/193781

Rights: Copyright © 2011 Hindawi

Vol.2011 • No. SI1 • 2011
Back to Top