Please use this identifier to cite or link to this item:
http://repository.kln.ac.lk/handle/123456789/15715
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shanjeevan, T. | - |
dc.contributor.author | Vigneswaran, R. | - |
dc.date.accessioned | 2017-01-04T09:07:20Z | - |
dc.date.available | 2017-01-04T09:07:20Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Shanjeevan, T. and Vigneswaran, R. 2016. Schemes with improving rate of convergence for three-stage Gauss method. In Proceedings of the International Research Symposium on Pure and Applied Sciences (IRSPAS 2016), Faculty of Science, University of Kelaniya, Sri Lanka. p 61. | en_US |
dc.identifier.isbn | 978-955-704-008-0 | - |
dc.identifier.uri | http://repository.kln.ac.lk/handle/123456789/15715 | - |
dc.description.abstract | The various iteration schemes have been proposed to solve the nonlinear equations arising in the implementation of s-stage implicit Runge-Kutta methods applied to solve a system of n ordinary differential equations with initial conditions () = () ; ≤ ≤ , ∶ [ , ] ⟶ ℝ, () = and ∶ ℝ ⟶ ℝ. A more general scheme, which was already proposed, is given by { ⊗ ( − ℎ ⊗ )} = ( ⊗ )() + ( ⊗ ), = + ( ⊗ ), = 1,2,3, …, where and are real non-singular parametric matrices, is a strictly lower triangular matrix, is the Jacobian evaluated at some recent point , ℎ is a fixed step size, and are identity matrices with order s and n respectively, ⊗ is the direct product of S with and is a real constant and () is the approximate diffect correction given by () = − + ℎ( ⊗ )() , where A is a coefficient matrix of the method, and () = () ⊕ () ⊕ () ⊕ … … ⊕ () is column vector. The rate of convergence of this scheme is examined when it is applied to the scalar differential equations = and the rate of convergence depends on the spectral radius [()] of the iteration matrix (), a function of = ℎ, where ℎ is a fixed step size. This scheme had already been investigated by assuming that () has only one non-zero eigen-value. In this problem, this scheme is further investigated by forcing [()] to be zero at = 0 and to be zero at = ∞ in addition to the constraint that () has only one non-zero eigenvalue. Results are obtained for three-stage Gauss method. A number of numerical experiments are carried out to confirm the results obtained for three stage Gauss method. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Faculty of Science, University of Kelaniya, Sri Lanka | en_US |
dc.subject | Stiff system | en_US |
dc.subject | Optimal value | en_US |
dc.subject | Spectral radius | en_US |
dc.subject | Gauss method | en_US |
dc.title | Schemes with improving rate of convergence for three-stage Gauss method | en_US |
dc.type | Article | en_US |
Appears in Collections: | IRSPAS 2016 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.