Fast Simulations of Models of Cardiac Electrophysiology
dc.contributor.committeeMember | Tom, Steele | |
dc.contributor.committeeMember | Mark, Keil | |
dc.contributor.committeeMember | Lingling, Jin | |
dc.creator | Tereda, Yoseph | |
dc.date.accessioned | 2022-04-13T14:48:59Z | |
dc.date.available | 2022-04-13T14:48:59Z | |
dc.date.created | 2021-11 | |
dc.date.issued | 2022-04-13 | |
dc.date.submitted | November 2021 | |
dc.date.updated | 2022-04-13T14:48:59Z | |
dc.description.abstract | Cardiac electrophysiology studies the electrical activity of the heart. Researchers from different fields are working together to model and simulate the electrical activity in the heart. Such simulations may lead to help cardiologists to treat a patient's heart condition with better techniques and diagnoses. Mathematical models of cardiac electrophysiology are described by a system of partial differential equations~(PDEs) and a non-linear system of ordinary differential equations~(ODEs). One way to reach real-time simulation of the electrical activity of the heart is through more efficient time integration of these ODEs. Larger time steps lead to more efficient computations provided the solutions remain accurate enough. Producing the largest stable time step for solving these ODEs is a daunting task. Usually, trial and error is used to get the largest stable time step, but it is time consuming. In this thesis, we propose a new efficient method to find the largest stable time step to solve these ODEs efficiently. In this thesis, we present thirty-seven cardiac cell models. We compare, the forward Euler method, the explicit midpoint method, the four-stage, fourth-order Runge--Kutta method, the two-stage, first-order Runge--Kutta--Chebyshev method, the three-stage, first-order Runge--Kutta--Chebyshev method, the three-stage, third-order strong-stability-preserving Runge--Kutta method, and the four-stage, third-order strong-stability-preserving Runge--Kutta method based on their largest stepsize, mixed root mean square errors, and CPU time to solve the cardiac cell models. From the theoretical largest stepsize results, the forward Euler method outperforms all the other methods considered on all thirty-seven cardiac cell models. Next to the forward Euler method, the two-stage, first-order Runge--Kutta--Chebyshev method outperforms all the other methods considered on thirty-seven cardiac cell models. From the experimental largest stepsize results, the forward Euler method outperforms all the other methods considered on all thirty-seven cardiac cell models. Next to the forward Euler method, the two-stage, first-order Runge--Kutta--Chebyshev and the explicit midpoint methods outperform all the other methods considered on thirty-six cardiac cell models and one cardiac cell model, respectively. Also, we solve the monodomain problem coupled with FitzHugh--Nagumo model using the forward Euler, the two-stage, first-order Runge--Kutta--Chebyshev method, and the three-stage, first-order Runge--Kutta--Chebyshev method in one, two, and three dimensions. We compare these methods based on their theoretical largest stepsize, experimental largest stepsize, CPU time, and mixed root mean square errors. From these results, the three-stage, first-order Runge--Kutta--Chebyshev method outperforms all the other methods over a one-dimensional problem, a two-dimensional problem, and a three-dimensional problem. | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | https://hdl.handle.net/10388/13889 | |
dc.subject | Electrophysiology | |
dc.subject | Cardiac cell models | |
dc.subject | Monodomain model | |
dc.subject | Time integration methods | |
dc.subject | Fast simulation | |
dc.title | Fast Simulations of Models of Cardiac Electrophysiology | |
dc.type | Thesis | |
dc.type.material | text | |
thesis.degree.department | Computer Science | |
thesis.degree.discipline | Computer Science | |
thesis.degree.grantor | University of Saskatchewan | |
thesis.degree.level | Masters | |
thesis.degree.name | Master of Science (M.Sc.) |