The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart

Carlo Guastamacchia; Roberto Piersanti; Francesco Giardini; Raffaele Coppini; Cecilia Ferrantini; Luca Dede'; Leonardo Sacconi; Francesco Regazzoni

arXiv · 2604.00881

The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart

Carlo Guastamacchia·Roberto Piersanti·Francesco Giardini·Raffaele Coppini·Cecilia Ferrantini·Luca Dede'·Leonardo Sacconi·Francesco Regazzoni

View original source ↗Read source document ↗Export metadata ↓

Abstract

A major challenge in computational models of cardiac electromechanics is the reconstruction of myocardial fiber architecture, as direct in vivo measurements of fiber orientation are not feasible. Consequently, rule-based methods are commonly adopted as surrogates. This study investigates the respective roles of macroscopic fiber architecture and microscopic fiber disarray in cardiac electromechanical simulations. A high-fidelity biventricular electromechanical model of a murine heart was developed using a high-resolution myocardial fiber field obtained via mesoscopic optical imaging, which serves as a reference ground truth. A spatial smoothing strategy is introduced to decouple macroscopic fiber organization from local disarray, and the resulting responses are also compared with those obtained using a rule-based fiber field. The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions. In contrast, active mechanics is highly sensitive to fiber architecture. Moderate regularization of the experimentally measured fiber field enhances the ventricular pumping efficiency of the computational model by reducing microscopic disarray while preserving the macroscopic helical organization, whereas excessive smoothing or rule-based fiber reconstructions lead to unphysiologically strong or inefficient contraction. Within this framework, two commonly adopted surrogate strategies to account for fiber disarray are investigated: a reduction of the effective cross-bridge stiffness in the active tension model, and the introduction of controlled misalignment between active tension and the local fiber direction. Overall, the results reveal important limitations of commonly adopted surrogate approaches for modeling fiber disarray.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Carlo Guastamacchia, Roberto Piersanti, Francesco Giardini, Raffaele Coppini, Cecilia Ferrantini, Luca Dede', Leonardo Sacconi, Francesco Regazzoni. 2026-04-01. The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart. https://arxiv.org/abs/2604.00881

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗