Parallel diagonally implicit multistage integration methods for stiff ordinary differential equations

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.advisor Butcher, JC en
dc.contributor.author Singh, Anjana en
dc.date.accessioned 2017-04-19T03:38:14Z en
dc.date.issued 1999 en
dc.identifier.uri http://hdl.handle.net/2292/32585 en
dc.description.abstract From this large family of general linear methods, we look at a special class of methods known as the diagonally implicit multi-stage integration methods (DIMSIMs). One of the four matrices characterizing a DIMSIM, the matrix A, corresponds to the coefficient matrix in a Runge-Kutta method. Hence, the structure of A plays a central role in the implementation costs of the method. We will refer to various choices for the form of A as “types”. In particular, for type 4 methods, A = λI and these are suitable for the parallel solution of stiff problems. A-stable type 4 methods in which the order of the method equals the number of stages, has been derived by J. C. Butcher (1996). In this thesis we consider a variable stepsize, variable order implementation of these methods as parallel solvers for stiff initial value problems. Although these methods have shown potential for the solution of stiff initial value problems they are not very efficient when compared to existing sequential solvers RADAU5 and VODE. This is probably because of the large error constants of these methods. In order to have an efficient set of parallel methods, we derive a new set of A-stable type 4 methods which have one more stage than the order of the method. For these methods we can make the error constants very small and error estimates for stepsize control are available within each step. Hence, these methods are much simpler to implement and in a parallel implementation these methods will cost no more than the methods in which the number of stages is equal to the order. These methods have been successfully implemented in a variable stepsize, variable order code and have been used to solve some well-known stiff problems. On a test problem of dimension 400 these methods have shown speedup factors of up to 2.5. Although the present implementation is slightly slower than the sequential codes such as RADAU5 and VODE, they have shown potential as parallel solvers of stiff initial value problems. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof PhD Thesis - University of Auckland en
dc.relation.isreferencedby UoA9986988414002091 en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title Parallel diagonally implicit multistage integration methods for stiff ordinary differential equations en
dc.type Thesis en
thesis.degree.discipline Mathematics en
thesis.degree.grantor The University of Auckland en
thesis.degree.level Doctoral en
thesis.degree.name PhD en
dc.rights.holder Copyright: The author en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.elements-id 622932 en
pubs.record-created-at-source-date 2017-04-19 en


Full text options

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Advanced Search

Browse