Generalized mono-implicit Runge-Kutta methods for stiff ordinary differential equations

Show simple item record

dc.contributor.advisor Muir, Paul
dc.creator Dow, Fatima 2017-07-13T14:39:31Z 2017-07-13T14:39:31Z 2017
dc.identifier.other QA372 D69 2017
dc.description ix, 100 leaves ; 29 cm
dc.description Includes abstract and appendices.
dc.description Includes bibliographical references (leaves 58-61).
dc.description.abstract Ordinary differential equations (ODEs) arise in many applications. Typically these ODEs are sufficiently complicated that they must be solved using numerical methods. One of the well-known classes of numerical methods for ODEs is the class of Mono- Implicit Runge-Kutta (MIRK) methods. An important property of a MIRK method is its order; a method is of order p if its global error is O(hp). An issue with MIRK methods, when applied to certain ODEs, known as stiff ODEs, is that when they should be of order p, they perform as if their order is q, where q < p. This is called order reduction. This means that the MIRK methods will be inefficient when the ODE is stiff because the amount of computation that is performed is not consistent with the accuracy obtained. In this thesis, we derive generalizations of MIRK methods that can avoid order reduction when the ODE is stiff. en_CA
dc.language.iso en en_CA
dc.publisher Halifax, N.S. : Saint Mary's University
dc.subject.lcc QA372
dc.subject.lcsh Differential equations -- Numerical solutions
dc.subject.lcsh Runge-Kutta formulas
dc.title Generalized mono-implicit Runge-Kutta methods for stiff ordinary differential equations en_CA
dc.type Text en_CA Master of Science in Applied Science Masters Department of Mathematics and Computing Science Saint Mary's University (Halifax, N.S.)

Files in this item


This item appears in the following Collection(s)

Show simple item record



My Account