Analysis of stepsize selection schemes for Runge-Kutta codes
Hall, G. and Higham, D.J. (1988) Analysis of stepsize selection schemes for Runge-Kutta codes. IMA Journal of Numerical Analysis, 8 (3). pp. 305-310. ISSN 0272-4979
Full text not available in this repository.Request a copy from the Strathclyde authorOfficial URL: https://doi.org/10.1093/imanum/8.3.305
Abstract
Conditions on Runge-Kutta algorithms can be obtained which ensure smooth stepsize selection when stability of the algorithm is restricting the stepsize. Some recently derived results are shown to hold for a more general test problem.
ORCID iDs
Hall, G. and Higham, D.J.
ORCID: https://orcid.org/0000-0002-6635-3461;
Item type: Article ID code: 215 Dates: DateEventJuly 1988PublishedKeywords: Rungr-Kutta methods, numerical mathematics, computer science, stepsize selection, Electronic computers. Computer science, Mathematics, Computational Mathematics, Applied Mathematics, Mathematics(all) Subjects: Science > Mathematics > Electronic computers. Computer science
Science > MathematicsDepartment: Faculty of Science > Mathematics and Statistics Depositing user: Ms Sarah Scott Date deposited: 08 Mar 2006 Last modified: 20 Jan 2021 16:41 URI: https://strathprints.strath.ac.uk/id/eprint/215
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)