Iterative operator-splitting methods for linear problems Online publication date: Wed, 14-May-2008
by I. Farago, J. Geiser
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 4, 2007
Abstract: The operator-splitting methods are based on splitting of the complex problem into a sequence of simpler tasks. A useful method is the iterative splitting method which ensures a consistent approximation in each step. In our paper, we suggest a new method which is based on the combination of the splitting time interval and the traditional iterative operator splitting. We analyse the local splitting error of the method. Numerical examples are given in order to demonstrate the method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com