Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations.
The efficient solution of the bidomain equations is a fundamental tool in the field of cardiac electrophysiology. When choosing a finite element discretization of the coupled system, one has to deal with the solution of a large, highly sparse system of linear equations. The conjugate gradient algori...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2010
|
| _version_ | 1797101902143422464 |
|---|---|
| author | Bernabeu, M Pathmanathan, P Pitt-Francis, J Kay, D |
| author_facet | Bernabeu, M Pathmanathan, P Pitt-Francis, J Kay, D |
| author_sort | Bernabeu, M |
| collection | OXFORD |
| description | The efficient solution of the bidomain equations is a fundamental tool in the field of cardiac electrophysiology. When choosing a finite element discretization of the coupled system, one has to deal with the solution of a large, highly sparse system of linear equations. The conjugate gradient algorithm, along with suitable preconditioning, is the natural choice in this scenario. In this study, we identify the optimal preconditioners with respect to both stimulus protocol and mesh geometry. The results are supported by a comprehensive study of the mesh-dependence properties of several preconditioning techniques found in the literature. Our results show that when only intracellular stimulus is considered, incomplete LU factorization remains a valid choice for current cardiac geometries. However, when extracellular shocks are delivered to tissue, preconditioners that take into account the structure of the system minimize execution time and ensure mesh-independent convergence. |
| first_indexed | 2024-03-07T05:58:26Z |
| format | Journal article |
| id | oxford-uuid:eb55ca60-bbec-4167-a736-3661db80fb25 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T05:58:26Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | oxford-uuid:eb55ca60-bbec-4167-a736-3661db80fb252022-03-27T11:08:51ZStimulus protocol determines the most computationally efficient preconditioner for the bidomain equations.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:eb55ca60-bbec-4167-a736-3661db80fb25EnglishSymplectic Elements at Oxford2010Bernabeu, MPathmanathan, PPitt-Francis, JKay, DThe efficient solution of the bidomain equations is a fundamental tool in the field of cardiac electrophysiology. When choosing a finite element discretization of the coupled system, one has to deal with the solution of a large, highly sparse system of linear equations. The conjugate gradient algorithm, along with suitable preconditioning, is the natural choice in this scenario. In this study, we identify the optimal preconditioners with respect to both stimulus protocol and mesh geometry. The results are supported by a comprehensive study of the mesh-dependence properties of several preconditioning techniques found in the literature. Our results show that when only intracellular stimulus is considered, incomplete LU factorization remains a valid choice for current cardiac geometries. However, when extracellular shocks are delivered to tissue, preconditioners that take into account the structure of the system minimize execution time and ensure mesh-independent convergence. |
| spellingShingle | Bernabeu, M Pathmanathan, P Pitt-Francis, J Kay, D Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations. |
| title | Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations. |
| title_full | Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations. |
| title_fullStr | Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations. |
| title_full_unstemmed | Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations. |
| title_short | Stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations. |
| title_sort | stimulus protocol determines the most computationally efficient preconditioner for the bidomain equations |
| work_keys_str_mv | AT bernabeum stimulusprotocoldeterminesthemostcomputationallyefficientpreconditionerforthebidomainequations AT pathmanathanp stimulusprotocoldeterminesthemostcomputationallyefficientpreconditionerforthebidomainequations AT pittfrancisj stimulusprotocoldeterminesthemostcomputationallyefficientpreconditionerforthebidomainequations AT kayd stimulusprotocoldeterminesthemostcomputationallyefficientpreconditionerforthebidomainequations |