Search arXivSearch

arXiv · 2011.15051

A cardiac electromechanics model coupled with a lumped parameters model for closed-loop blood circulation. Part II: numerical approximation

Abstract

In the framework of accurate and efficient segregated schemes for 3D cardiac electromechanics and 0D cardiovascular models, we propose here a novel numerical approach to address the coupled 3D-0D problem introduced in Part I of this two-part series of papers. We combine implicit-explicit schemes to solve the different cardiac models in a multiphysics setting. We properly separate and manage the different time and space scales related to cardiac electromechanics and blood circulation. We employ a flexible and scalable intergrid transfer operator that enables to interpolate Finite Element functions among different meshes and, possibly, among different Finite Element spaces. We propose a numerical method to couple the 3D electromechanical model and the 0D circulation model in a numerically stable manner within a fully segregated fashion. No adaptations are required through the different phases of the heartbeat. We also propose a robust algorithm to reconstruct the stress-free reference configuration. Due to the computational cost associated with the numerical solution of this inverse problem, the reference configuration recovery algorithm comes along with a novel projection technique to precisely recover the unloaded geometry from a coarser representation of the computational domain. We show the convergence property of our numerical schemes by performing an accuracy study through grid refinement. To prove the biophysical accuracy of our computational model, we also address different scenarios of clinical interest in our numerical simulations by varying preload, afterload and contractility. Indeed, we simulate physiologically relevant behaviors and we reproduce meaningful results in the context of cardiac function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesco Regazzoni, Matteo Salvador, Pasquale Claudio Africa, Marco Fedele, Luca Dede', Alfio Quarteroni. 2020-11-30. A cardiac electromechanics model coupled with a lumped parameters model for closed-loop blood circulation. Part II: numerical approximation. https://arxiv.org/abs/2011.15051

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA