dc.contributor.advisor |
Muir, Paul |
|
dc.creator |
Singla, Shivam |
|
dc.date.accessioned |
2021-09-29T13:40:12Z |
|
dc.date.available |
2021-09-29T13:40:12Z |
|
dc.date.issued |
2021 |
|
dc.identifier.uri |
http://library2.smu.ca/xmlui/handle/01/29939 |
|
dc.description |
1 online resource (128, 2 unnumbered pages) : charts |
|
dc.description |
Includes abstract and appendix. |
|
dc.description |
Includes bibliographical references (page 92). |
|
dc.description.abstract |
The investigation of many real-world applications involves mathematical models that consist
of systems of ordinary differential equations (ODEs). This thesis mainly focuses on the ODEs
with the initial values known as initial value ordinary differential equations. These equations
are typically solved using numerical methods to obtain approximate solutions. A popular class
of numerical methods to solve an initial value ODE are the Explicit Runge-Kutta (ERK) methods.
This thesis considers Python software for the investigation of ERK methods. ERK methods can
be used to obtain approximate solutions at a discrete set of points across the domain of
interest, with ℎ being the distance between the points. An ERK method is said to be of order
𝑝 if the error of the numerical solution is proportional to ℎ𝑝
. In this thesis, we consider Python
software for the determination of optimal ERK methods of orders 1 to 4. The Python software
also has the capability to solve a set of test problems using various ERK methods in order to
allow for a comparison of the accuracy of the numerical solutions obtained from the ERK
methods. The Python software can also be used to extend the discrete approximate solutions from the ERK methods to obtain continuous approximate solutions over the entire domain using Hermite interpolation. To assess the accuracy of the continuous solution approximation,
the software can also be used to compute the defect of the continuous approximate solution,
where defect is the amount by which the continuous approximate solution fails to satisfy the
ODE. |
en_CA |
dc.description.provenance |
Submitted by Greg Hilliard (greg.hilliard@smu.ca) on 2021-09-29T13:40:12Z
No. of bitstreams: 1
Singla_Shivam_Honours_2021.pdf: 1510681 bytes, checksum: 3df31decb1516bfde4b52b115b24a9ff (MD5) |
en |
dc.description.provenance |
Made available in DSpace on 2021-09-29T13:40:12Z (GMT). No. of bitstreams: 1
Singla_Shivam_Honours_2021.pdf: 1510681 bytes, checksum: 3df31decb1516bfde4b52b115b24a9ff (MD5)
Previous issue date: 2021-09-09 |
en |
dc.language.iso |
en |
en_CA |
dc.publisher |
Halifax, N.S. : Saint Mary's University |
|
dc.title |
Python tools for the investigation of optimal explicit runge-kutta methods |
en_CA |
dc.type |
Text |
en_CA |
thesis.degree.name |
Bachelor of Science (Honours Computing Science) |
|
thesis.degree.level |
Undergraduate |
|
thesis.degree.discipline |
Mathematics and Computing Science |
|
thesis.degree.grantor |
Saint Mary's University (Halifax, N.S.) |
|