Rosenbrock-type `Peer' two-step methods

Show simple item record

dc.contributor.author Podhaisky, H. en
dc.contributor.author Weiner, R. en
dc.contributor.author Schmitt, B.A. en
dc.date.accessioned 2009-08-28T03:22:45Z en
dc.date.available 2009-08-28T03:22:45Z en
dc.date.issued 2003-12 en
dc.identifier.citation Department of Mathematics - Research Reports-504 (2003) en
dc.identifier.issn 1173-0889 en
dc.identifier.uri http://hdl.handle.net/2292/5121 en
dc.description.abstract It is well-known that one-step Rosenbrock methods may suffer from order reduction for very stiff problems. By considering two-step methods we construct $s$-stage methods where all stage values have stage order $s-1$. The proposed class of methods is stable in the sense of zero-stability for arbitrary stepsize sequences. Furthermore there exist L($alpha$)-stable methods with large $alpha$ for $s=4ldots8$. Using the concept of emph{effective order} we derive methods having order $s$ for constant stepsizes. Numerical experiments show an efficiency superior to RODAS for more stringent tolerances. en
dc.publisher Department of Mathematics, The University of Auckland, New Zealand en
dc.relation.ispartofseries Research Reports - Department of Mathematics en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.source.uri http://www.math.auckland.ac.nz/Research/Reports/view.php?id=504 en
dc.title Rosenbrock-type `Peer' two-step methods en
dc.type Technical Report en
dc.subject.marsden Fields of Research::230000 Mathematical Sciences::230100 Mathematics en
dc.rights.holder The author(s) en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics