Please use this identifier to cite or link to this item: http://repo.lib.jfn.ac.lk/ujrr/handle/123456789/3525
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVigneswaran, R.
dc.contributor.authorKhokulan, M.
dc.date.accessioned2021-07-14T05:28:14Z
dc.date.accessioned2022-07-07T07:14:35Z-
dc.date.available2021-07-14T05:28:14Z
dc.date.available2022-07-07T07:14:35Z-
dc.date.issued2012
dc.identifier.issn2279-1922
dc.identifier.urihttp://repo.lib.jfn.ac.lk/ujrr/handle/123456789/3525-
dc.description.abstractVarious iteration schemes have been proposed to solve the non linear equations arising in the implementation of implicit Runge-Kutta methods. In more general scheme, when applied to an s-stage Runge-Kutta method, each step of the iteration requires s function evaluations and s sets of linear equations to be solved. Convergence rates were obtained when applied to the scalar differential equation 𝑥 ′ = 𝑞𝑥. The convergence rate of this scheme is further investigated by forcing the spectral radius 𝜌 𝑀 𝑧 of the iteration matrix 𝑀 𝑧 to be zero at 𝑧 = 0, to be zero at 𝑧 = ∞ and to be zero at 𝑧 = 0 and 𝑧 = ∞, where 𝑧 = ℎ𝑞 and ℎ is the fixed step-size. The respective optimal parameters of the improved schemes are obtained for two stage Gauss method. Numerical experiments are carried out to evaluate and compare the efficiency of the new schemes and the original scheme.en_US
dc.language.isoenen_US
dc.publisherUniversity of Jaffnaen_US
dc.subjectImplementationen_US
dc.subjectImplicit Runge-Kutta methodsen_US
dc.subjectRate of convergenceen_US
dc.subjectStiff systemsen_US
dc.titlemplementation Schemes for Two-stage Gauss Methoden_US
dc.typeArticleen_US
Appears in Collections:JUICE 2012

Files in This Item:
File Description SizeFormat 
Implementation Schemes for Two-stage Gauss Method.pdf524.69 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.