Improving Rates of Convergence of Iterative Schemes for Implicit Runge-Kutta Methods

Please use this identifier to cite or link to this item: http://repo.lib.jfn.ac.lk/ujrr/handle/123456789/541

Full metadata record

DC Field	Value	Language
dc.contributor.author	Vigneswaran, R.
dc.date.accessioned	2014-07-17T03:47:13Z
dc.date.accessioned	2022-06-28T06:46:03Z	-
dc.date.available	2014-07-17T03:47:13Z
dc.date.available	2022-06-28T06:46:03Z	-
dc.date.issued	1993-06-13
dc.identifier.uri	http://repo.lib.jfn.ac.lk/ujrr/handle/123456789/541	-
dc.description.abstract	Various iterative schemes have been proposed to solve the non-linear equations arising in the implementation of implicit Runge-Kutta methods. In one scheme, when applied to an s-stage Runge-Kutta method, each step of the iteration still requires s function evaluations but consists of r(>s) sub-steps. Improved convergence rate was obtained for the case r = s + 1 only. This scheme is investigated here for the case r = ks, k = 2, 3, …, and superlinear convergence is obtained in the limit k ∞. Some results are obtained for Gauss methods and numerical results are given. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)	en_US
dc.language.iso	en	en_US
dc.publisher	Springer-Verlag	en_US
dc.title	Improving Rates of Convergence of Iterative Schemes for Implicit Runge-Kutta Methods	en_US
dc.type	Article	en_US
Appears in Collections:	Mathematics and Statistics

Files in This Item:

File	Description	Size	Format
Vigneswaran, Improving Rates of Convergence of Iterative Schemes for Implicit Runge.pdf		326.98 kB	Adobe PDF	View/Open