Robust parallel nonlinear solvers for implicit time discretizations of the Bidomain equations
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913362937380864 |
|---|---|
| author | Barnafi, Nicolás A. Huynh, Ngoc Mai Monica Pavarino, Luca F. Scacchi, Simone |
| author_facet | Barnafi, Nicolás A. Huynh, Ngoc Mai Monica Pavarino, Luca F. Scacchi, Simone |
| contents | In this work, we study the convergence and performance of nonlinear solvers for the Bidomain equations after decoupling the ordinary and partial differential equations of the cardiac system. Firstly, we provide a rigorous proof of the global convergence of Quasi-Newton methods, such as BFGS, and nonlinear Conjugate-Gradient methods, such as Fletcher--Reeves, for the Bidomain system, by analyzing an auxiliary variational problem under physically reasonable hypotheses. Secondly, we compare several nonlinear Bidomain solvers in terms of execution time, robustness with respect to the data and parallel scalability. Our findings indicate that Quasi-Newton methods are the best choice for nonlinear Bidomain systems, since they exhibit faster convergence rates compared to standard Newton-Krylov methods, while maintaining robustness and scalability. Furthermore, first-order methods also demonstrate competitiveness and serve as a viable alternative, particularly for matrix-free implementations that are well-suited for GPU computing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_05193 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Robust parallel nonlinear solvers for implicit time discretizations of the Bidomain equations Barnafi, Nicolás A. Huynh, Ngoc Mai Monica Pavarino, Luca F. Scacchi, Simone Numerical Analysis Optimization and Control 65N55, 65M55, 65F10, 92C30 In this work, we study the convergence and performance of nonlinear solvers for the Bidomain equations after decoupling the ordinary and partial differential equations of the cardiac system. Firstly, we provide a rigorous proof of the global convergence of Quasi-Newton methods, such as BFGS, and nonlinear Conjugate-Gradient methods, such as Fletcher--Reeves, for the Bidomain system, by analyzing an auxiliary variational problem under physically reasonable hypotheses. Secondly, we compare several nonlinear Bidomain solvers in terms of execution time, robustness with respect to the data and parallel scalability. Our findings indicate that Quasi-Newton methods are the best choice for nonlinear Bidomain systems, since they exhibit faster convergence rates compared to standard Newton-Krylov methods, while maintaining robustness and scalability. Furthermore, first-order methods also demonstrate competitiveness and serve as a viable alternative, particularly for matrix-free implementations that are well-suited for GPU computing. |
| title | Robust parallel nonlinear solvers for implicit time discretizations of the Bidomain equations |
| topic | Numerical Analysis Optimization and Control 65N55, 65M55, 65F10, 92C30 |
| url | https://arxiv.org/abs/2209.05193 |