Papers
Topics
Authors
Recent
2000 character limit reached

Newton-Krylov-BDDC deluxe solvers for non-symmetric fully implicit time discretizations of the Bidomain model

Published 17 Feb 2021 in math.NA and cs.NA | (2102.08736v1)

Abstract: A novel theoretical convergence rate estimate for a Balancing Domain Decomposition by Constraints algorithm is proven for the solution of the cardiac Bidomain model, describing the propagation of the electric impulse in the cardiac tissue. The non-linear system arises from a fully implicit time discretization and a monolithic solution approach. The preconditioned non-symmetric operator is constructed from the linearized system arising within the Newton-Krylov approach for the solution of the non-linear problem; we theoretically analyze and prove a convergence rate bound for the Generalised Minimal Residual iterations' residual. The theory is confirmed by extensive parallel numerical tests, widening the class of robust and efficient solvers for implicit time discretizations of the Bidomain model.

Citations (11)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.