arXiv subjects

Simone Scacchi

Publications and source records attributed to Simone Scacchi.

At least 19 recordsLinked to original sources

arXiv2026

A Neural Latent Dynamics Approach for Solving Inverse Problems in Cardiac Electrophysiology

Solving inverse problems in cardiac electrophysiology consists in the recovery of physiological parameters from surface electrocardiogram (ECG) measurements, a task which is often computationally unfeasible due to the severe ill-posedness and the prohibitive computational complexity of PDE-constrained optimization. In this work, we introduce a data-driven framework leveraging Latent Dynamics Networks (LDNets) to construct efficient surrogate models of the forward operator. By mapping low-dimensional parameters, representing ectopic activation sites or ischemic region descriptors, to the ECG signals via latent dynamics governed by neural ordinary differential equations, our approach circumvents the computational burden of evaluating high-fidelity cardiac models during iterative parameter estimation. The surrogate is trained offline on high-fidelity data, enabling rapid and robust inversion. We validate the proposed framework through rigorous numerical experiments with synthetic data across both 2d and 3d geometries. Results show that the LDNet-based surrogate achieves precise reconstruction of cardiac parameters while drastically reducing computational overhead, thereby enabling near real-time clinical applications.

math.NA↗

arXiv2025

Optimization of gridding algorithms for FFT by vector optimization

The Fast Fourier Transform (FFT) is widely used in applications such as MRI, CT, and interferometry; however, because of its dependence on uniformly sampled data, it requires the use of gridding techniques for practical implementation. The performance of these algorithms strongly depends on the choice of the gridding kernel, with the first prolate spheroidal wave function (PSWF) regarded as optimal. This work redefines kernel optimality through the lens of vector optimization (VO), introducing a rigorous framework that characterizes optimal kernels as Pareto-efficient solutions of an error shape operator. We establish the continuity of such operator, study the existence of solutions, and propose a novel methodology to construct kernels tailored to a desired target error function. The approach is implemented numerically via interior-point optimization. Comparative experiments demonstrate that the proposed kernels outperform both the PSWF and the state-of-the-art methods (MIRT-NUFFT) in specific regions of interest, achieving orders-of-magnitude improvements in mean absolute errors. These results confirm the potential of VO-based kernel design to provide customized accuracy profiles aligned with application-specific requirements. Future research will extend this framework to multidimensional cases and relative error minimization, with potential integration of machine learning for adaptive target error selection.

math.NA↗

arXiv2025

Pollution control for a spatially structured economic growth system

In this paper investigations by the same authors on environmental issues concerning the control of the pollution produced by human activities have been extended to include costs related to environmental interventions. The proposed model consists of a spatially structured dynamic economic growth model which takes into account the level of pollution induced by production, a possible taxation based on the amount of produced pollution, and possible environmental interventions. It has been analyzed an optimal harvesting control problem with an objective function composed of four terms, namely the intertemporal utility of the decision maker, the space-time average of the level of pollution in the habitat, the disutility due to the imposition of taxation and the cost of environmental interventions. A specific novelty in the model proposed here is the localization of the possible interventions to a subregion of the whole habitat. Computational experiments have been carried out to exemplify the outcomes of the proposed model.

math.NA↗

arXiv2025

Learning cardiac activation and repolarization times with operator learning

Solving partial or ordinary differential equation models in cardiac electrophysiology is a computationally demanding task, particularly when high-resolution meshes are required to capture the complex dynamics of the heart. Moreover, in clinical applications, it is essential to employ computational tools that provide only relevant information, ensuring clarity and ease of interpretation. In this work, we exploit two recently proposed operator learning approaches, namely Fourier Neural Operators (FNO) and Kernel Operator Learning (KOL), to learn the operator mapping the applied stimulus in the physical domain into the activation and repolarization time distributions. These data-driven methods are evaluated on synthetic 2D and 3D domains, as well as on a physiologically realistic left ventricle geometry. Notably, while the learned map between the applied current and activation time has its modelling counterpart in the Eikonal model, no equivalent partial differential equation (PDE) model is known for the map between the applied current and repolarization time. Our results demonstrate that both FNO and KOL approaches are robust to hyperparameter choices and computationally efficient compared to traditional PDE-based Monodomain models. These findings highlight the potential use of these surrogate operators to accelerate cardiac simulations and facilitate their clinical integration.

math.NA↗

arXiv2025

A BDDC Preconditioner for the Cardiac EMI Model in three Dimensions

We analyze a Balancing Domain Decomposition by Constraints (BDDC) preconditioner for the solution of three dimensional composite Discontinuous Galerkin discretizations of reaction-diffusion systems of ordinary and partial differential equations arising in cardiac cell-by-cell models like the Extracellular space, Membrane and Intracellular space (EMI) Model. These microscopic models are essential for the understanding of events in aging and structurally diseased hearts which macroscopic models relying on homogenized descriptions of the cardiac tissue, like Monodomain and Bidomain models, fail to adequately represent. The modeling of each individual cardiac cell results in discontinuous global solutions across cell boundaries, requiring the careful construction of dual and primal spaces for the BDDC preconditioner. We provide a scalable condition number bound for the precondition operator and validate the theoretical results with extensive numerical experiments.

math.NA↗

arXiv2024

GDSW preconditioners for composite Discontinuous Galerkin discretizations of multicompartment reaction-diffusion problems

The aim of the present work is to design, analyze theoretically, and test numerically, a generalized Dryja-Smith-Widlund (GDSW) preconditioner for composite Discontinuous Galerkin discretizations of multicompartment parabolic reaction-diffusion equations, where the solution can exhibit natural discontinuities across the domain. We prove that the resulting preconditioned operator for the solution of the discrete system arising at each time step converges with a scalable and quasi-optimal upper bound for the condition number. The GDSW preconditioner is then applied to the EMI (Extracellular - Membrane - Intracellular) reaction-diffusion system, recently proposed to model microscopically the spatiotemporal evolution of cardiac bioelectrical potentials. Numerical tests validate the scalability and quasi-optimality of the EMI-GDSW preconditioner, and investigate its robustness with respect to the time step size as well as jumps in the diffusion coefficients.

math.NA↗

arXiv2023

A comparison of Algebraic Multigrid Bidomain solvers on hybrid CPU-GPU architectures

The numerical simulation of cardiac electrophysiology is a highly challenging problem in scientific computing. The Bidomain system is the most complete mathematical model of cardiac bioelectrical activity. It consists of an elliptic and a parabolic partial differential equation (PDE), of reaction-diffusion type, describing the spread of electrical excitation in the cardiac tissue. The two PDEs are coupled with a stiff system of ordinary differential equations (ODEs), representing ionic currents through the cardiac membrane. Developing efficient and scalable preconditioners for the linear systems arising from the discretization of such computationally challenging model is crucial in order to reduce the computational costs required by the numerical simulations of cardiac electrophysiology. In this work, focusing on the Bidomain system as a model problem, we have benchmarked two popular implementations of the Algebraic Multigrid (AMG) preconditioner embedded in the PETSc library and we have studied the performance on the calibration of specific parameters. We have conducted our analysis on modern HPC architectures, performing scalability tests on multi-core and multi-GPUs setttings. The results have shown that, for our problem, although scalability is verified on CPUs, GPUs are the optimal choice, since they yield the best performance in terms of solution time.

math.NA↗

arXiv2023

BDDC preconditioners for virtual element approximations of the three-dimensional Stokes equations

The Virtual Element Method (VEM) is a novel family of numerical methods for approximating partial differential equations on very general polygonal or polyhedral computational grids. This work aims to propose a Balancing Domain Decomposition by Constraints (BDDC) preconditioner that allows using the conjugate gradient method to compute the solution of the saddle-point linear systems arising from the VEM discretization of the three-dimensional Stokes equations. We prove the scalability and quasi-optimality of the algorithm and confirm the theoretical findings with parallel computations. Numerical results with adaptively generated coarse spaces confirm the method's robustness in the presence of large jumps in the viscosity and with high-order VEM discretizations.

math.NA↗

arXiv2023

A parallel solver for FSI problems with fictitious domain approach

We present and analyze a parallel solver for the solution of fluid structure interaction problems described by a fictitious domain approach. In particular, the fluid is modeled by the non-stationary incompressible Navier-Stokes equations, while the solid evolution is represented by the elasticity equations. The parallel implementation is based on the PETSc library and the solver has been tested in terms of robustness with respect to mesh refinement and weak scalability by running simulations on a Linux cluster.

math.NA↗

arXiv2022

A parallel solver for fluid structure interaction problems with Lagrange multiplier

The aim of this work is to present a parallel solver for a formulation of fluid-structure interaction (FSI) problems which makes use of a distributed Lagrange multiplier in the spirit of the fictitious domain method. The fluid subproblem, consisting of the non-stationary Stokes equations, is discretized in space by $\mathcal{Q}_2$-$\mathcal{P}_1$ finite elements, whereas the structure subproblem, consisting of the linear or finite incompressible elasticity equations, is discretized in space by $\mathcal{Q}_1$ finite elements. A first order semi-implicit finite difference scheme is employed for time discretization. The resulting linear system at each time step is solved by a parallel GMRES solver, accelerated by block diagonal or triangular preconditioners. The parallel implementation is based on the PETSc library. Several numerical tests have been performed on Linux clusters to investigate the effectiveness of the proposed FSI solver.

math.NA↗

arXiv2022

Convergence analysis of BDDC preconditioners for composite DG discretizations of the cardiac cell-by-cell model

A Balancing Domain Decomposition by Constraints (BDDC) preconditioner is constructed and analyzed for the solution of composite Discontinuous Galerkin discretizations of reaction-diffusion systems of ordinary and partial differential equations arising in cardiac cell-by-cell models. Unlike classical Bidomain and Monodomain cardiac models, which rely on homogenized descriptions of cardiac tissue at the macroscopic level, the cell-by-cell models enable the representation of individual cardiac cells, cell aggregates, damaged tissues, and nonuniform distributions of ion channels on the cell membrane. The resulting discrete cell-by-cell models exhibit discontinuous global solutions across the cell boundaries. Therefore, the proposed BDDC preconditioner employs appropriate dual and primal spaces with additional constraints to transfer information between cells (subdomains) without affecting the overall discontinuity of the global solution. A scalable convergence rate bound is proved for the resulting BDDC cell-by-cell preconditioned operator, while numerical tests validate this bound and investigate its dependence on the discretization parameters.

math.NA↗

arXiv2022

Robust parallel nonlinear solvers for implicit time discretizations of the Bidomain equations

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.

math.NA↗

arXiv2022

A comparative study of scalable multilevel preconditioners for cardiac mechanics

In this work, we provide a performance comparison between the Balancing Domain Decomposition by Constraints (BDDC) and the Algebraic Multigrid (AMG) preconditioners for cardiac mechanics on both structured and unstructured finite element meshes. The mechanical behavior of myocardium can be described by the equations of three-dimensional finite elasticity, which are discretized by finite elements in space and yield the solution of a large scale nonlinear algebraic system. This problem is solved by a Newton-Krylov method, where the solution of the Jacobian linear system is accelerated by BDDC/AMG preconditioners. We thoroughly explore the main parameters of the BDDC preconditioner in order to make the comparison fair. We focus on: the performance of different direct solvers for the local and coarse problems of the BDDC algorithm; the impact of the different choices of BDDC primal degrees of freedom; and the influence of the finite element degree. Scalability tests are performed on Linux clusters up to 1024 processors, and we conclude with a performance study on a realistic electromechanical simulation.

math.NA↗

arXiv2022

Parallel block preconditioners for virtual element discretizations of the time-dependent Maxwell equations

The focus of this study is the construction and numerical validation of parallel block preconditioners for low order virtual element discretizations of the three-dimensional Maxwell equations. The virtual element method (VEM) is a recent technology for the numerical approximation of partial differential equations (PDEs), that generalizes finite elements to polytopal computational grids. So far, VEM has been extended to several problems described by PDEs, and recently also to the time-dependent Maxwell equations. When the time discretization of PDEs is performed implicitly, at each time-step a large-scale and ill-conditioned linear system must be solved, that, in case of Maxwell equations, is particularly challenging, because of the presence of both H(div) and H(curl) discretization spaces. We propose here a parallel preconditioner, that exploits the Schur complement block factorization of the linear system matrix and consists of a Jacobi preconditioner for the H(div) block and an auxiliary space preconditioner for the H(curl) block. Several parallel numerical tests have been perfomed to study the robustness of the solver with respect to mesh refinement, shape of polyhedral elements, time step size and the VEM stabilization parameter.

math.NA↗

arXiv2022

BDDC preconditioners for divergence free virtual element discretizations of the Stokes equations

The Virtual Element Method (VEM) is a new family of numerical methods for the approximation of partial differential equations, where the geometry of the polytopal mesh elements can be very general. The aim of this article is to extend the balancing domain decomposition by constraints (BDDC) preconditioner to the solution of the saddle-point linear system arising from a VEM discretization of the two-dimensional Stokes equations. Under suitable hypotesis on the choice of the primal unknowns, the preconditioned linear system results symmetric and positive definite, thus the preconditioned conjugate gradient method can be used for its solution. We provide a theoretical convergence analysis estimating the condition number of the preconditioned linear system. Several numerical experiments validate the theoretical estimates, showing the scalability and quasi-optimality of the method proposed. Moreover, the solver exhibits a robust behavior with respect to the shape of the polygonal mesh elements. We also show that a faster convergence could be achieved with an easy to implement coarse space, slightly larger than the minimal one covered by the theory.

math.NA↗

arXiv2022

Parallel inexact Newton-Krylov and quasi-Newton solvers for nonlinear elasticity

In this work, we address the implementation and performance of inexact Newton-Krylov and quasi-Newton algorithms, more specifically the BFGS method, for the solution of the nonlinear elasticity equations, and compare them to a standard Newton-Krylov method. This is done through a systematic analysis of the performance of the solvers with respect to the problem size, the magnitude of the data and the number of processors in both almost incompressible and incompressible mechanics. We consider three test cases: Cook's membrane (static, almost incompressible), a twist test (static, incompressible) and a cardiac model (complex material, time dependent, almost incompressible). Our results suggest that quasi-Newton methods should be preferred for compressible mechanics, whereas inexact Newton-Krylov methods should be preferred for incompressible problems. We show that these claims are also backed up by the convergence analysis of the methods. In any case, all methods present adequate performance, and provide a significant speed-up over the standard Newton-Krylov method, with a CPU time reduction exceeding 50% in the best cases.

math.NA↗

arXiv2021

$C^1$-VEM for some variants of the Cahn-Hilliard equation: a numerical exploration

We consider the $C^1$-Virtual Element Method (VEM) for the conforming numerical approximation of some variants of the Cahn-Hilliard equation on polygonal meshes. In particular, we focus on the discretization of the advective Cahn-Hilliard problem and the Cahn-Hilliard inpainting problem. We present the numerical approximation and several numerical results to assess the efficacy of the proposed methodology.

math.NA↗

arXiv2021

On arbitrarily regular conforming virtual element methods for elliptic partial differential equations

The Virtual Element Method (VEM) is a very effective framework to design numerical approximations with high global regularity to the solutions of elliptic partial differential equations. In this paper, we review the construction of such approximations for an elliptic problem of order $p_1$ using conforming, finite dimensional subspaces of $ H^{p_2}(\Omega)$, where $p_1$ and $p_2$ are two integer numbers such that $p_2 \geq p_1 \geq 1$ and $\Omega\in R^2$ is the computational domain. An abstract convergence result is presented in a suitably defined energy norm. The space formulation and major aspects such as the choice and unisolvence of the degrees of freedom are discussed, also providing specific examples corresponding to various practical cases of high global regularity. Finally, the construction of the "enhanced" formulation of the virtual element spaces is also discussed in details with a proof that the dimension of the "regular" and "enhanced" spaces is the same and that the virtual element functions in both spaces can be described by the same choice of the degrees of freedom.

math.NA↗