Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 17 Feb 2021 in math.NA and cs.NA

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
Citations (11)

Summary

We haven't generated a summary for this paper yet.