Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSpace-time multilevel quadrature methods and their application for cardiac electrophysiology
355
0
0.0
(
0
)
Added by
Seif Ben Bader
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We present a novel approach which aims at high-performance uncertainty quantification for cardiac electrophysiology simulations. Employing the monodomain equation to model the transmembrane potential inside the cardiac cells, we evaluate the effect of spatially correlated perturbations of the heart fibers on the statistics of the resulting quantities of interest. Our methodology relies on a close integration of multilevel quadrature methods, parallel iterative solvers and space-time finite element discretizations, allowing for a fully parallelized framework in space, time and stochastics. Extensive numerical studies are presented to evaluate convergence rates and to compare the performance of classical Monte Carlo methods such as standard Monte Carlo (MC) and quasi-Monte Carlo (QMC), as well as multilevel strategies, i.e. multilevel Monte Carlo (MLMC) and multilevel quasi-Monte Carlo (MLQMC) on hierarchies of nested meshes. Finally, we employ a recently suggested variant of the multilevel approach for non-nested meshes to deal with a realistic heart geometry.
rate research
Read More
We present a novel approach aimed at high-performance uncertainty quantification for time-dependent problems governed by partial differential equations. In particular, we consider input uncertainties described by a Karhunen-Loeeve expansion and compute statistics of high-dimensional quantities-of-interest, such as the cardiac activation potential. Our methodology relies on a close integration of multilevel Monte Carlo methods, parallel iterative solvers, and a space-time discretization. This combination allows for space-time adaptivity, time-changing domains, and to take advantage of past samples to initialize the space-time solution. The resulting sequence of problems is distributed using a multilevel parallelization strategy, allocating batches of samples having different sizes to a different number of processors. We assess the performance of the proposed framework by showing in detail its application to the solution of nonlinear equations arising from cardiac electrophysiology. Specifically, we study the effect of spatially-correlated perturbations of the heart fibers conductivities on the mean and variance of the resulting activation map. As shown by the experiments, the theoretical rates of convergence of multilevel Monte Carlo are achieved. Moreover, the total computational work for a prescribed accuracy is reduced by an order of magnitude with respect to standard Monte Carlo methods.
In this work, we analyse the links between ghost penalty stabilisation and aggregation-based discrete extension operators for the numerical approximation of elliptic partial differential equations on unfitted meshes. We explore the behavior of ghost penalty methods in the limit as the penalty parameter goes to infinity, which returns a strong version of these methods. We observe that these methods suffer locking in that limit. On the contrary, aggregated finite element spaces are locking-free because they can be expressed as an extension operator from well-posed to ill-posed degrees of freedom. Next, we propose novel ghost penalty methods that penalise the distance between the solution and its aggregation-based discrete extension. These methods are locking-free and converge to aggregated finite element methods in the infinite penalty parameter limit. We include an exhaustive set of numerical experiments in which we compare weak (ghost penalty) and strong (aggregated finite elements) schemes in terms of error quantities, condition numbers and sensitivity with respect to penalty coefficients on different geometries, intersection locations and mesh topologies.
In this work, we propose and develop efficient and accurate numerical methods for solving the Kirchhoff-Love plate model in domains with complex geometries. The algorithms proposed here employ curvilinear finite-difference methods for spatial discretization of the governing PDEs on general composite overlapping grids. The coupling of different components of the composite overlapping grid is through numerical interpolations. However, interpolations introduce perturbation to the finite-difference discretization, which causes numerical instability for time-stepping schemes used to advance the resulted semi-discrete system. To address the instability, we propose to add a fourth-order hyper-dissipation to the spatially discretized system to stabilize its time integration; this additional dissipation term captures the essential upwinding effect of the original upwind scheme. The investigation of strategies for incorporating the upwind dissipation term into several time-stepping schemes (both explicit and implicit) leads to the development of four novel algorithms. For each algorithm, formulas for determining a stable time step and a sufficient dissipation coefficient on curvilinear grids are derived by performing a local Fourier analysis. Quadratic eigenvalue problems for a simplified model plate in 1D domain are considered to reveal the weak instability due to the presence of interpolating equations in the spatial discretization. This model problem is further investigated for the stabilization effects of the proposed algorithms. Carefully designed numerical experiments are carried out to validate the accuracy and stability of the proposed algorithms, followed by two benchmark problems to demonstrate the capability and efficiency of our approach for solving realistic applications. Results that concern the performance of the proposed algorithms are also presented.
It is well known that domain-decomposition-based multiscale mixed methods rely on interface spaces, defined on the skeleton of the decomposition, to connect the solution among the non-overlapping subdomains. Usual spaces, such as polynomial-based ones, cannot properly represent high-contrast channelized features such as fractures (high permeability) and barriers (low permeability) for flows in heterogeneous porous media. We propose here new interface spaces, which are based on physics, to deal with permeability fields in the simultaneous presence of fractures and barriers, accommodated respectively, by the pressure and flux spaces. Existing multiscale methods based on mixed formulations can take advantage of the proposed interface spaces, however, in order to present and test our results, we use the newly developed Multiscale Robin Coupled Method (MRCM) [Guiraldello, et al., J. Comput. Phys., 355 (2018) pp. 1-21], which generalizes most well-known multiscale mixed methods, and allows for the independent choice of the pressure and flux interface spaces. An adaptive version of the MRCM [Rocha, et al., J. Comput. Phys., 409 (2020), 109316] is considered that automatically selects the physics-based pressure space for fractured structures and the physics-based flux space for regions with barriers, resulting in a procedure with unprecedented accuracy. The features of the proposed approach are investigated through several numerical simulations of single-phase and two-phase flows, in different heterogeneous porous media. The adaptive MRCM combined with the interface spaces based on physics provides promising results for challenging problems with the simultaneous presence of fractures and barriers.
The Lorentz equations describe the motion of electrically charged particles in electric and magnetic fields and are used widely in plasma physics. The most popular numerical algorithm for solving them is the Boris method, a variant of the Stormer-Verlet algorithm. Boris method is phase space volume conserving and simulated particles typically remain near the correct trajectory. However, it is only second order accurate. Therefore, in scenarios where it is not enough to know that a particle stays on the right trajectory but one needs to know where on the trajectory the particle is at a given time, Boris method requires very small time steps to deliver accurate phase information, making it computationally expensive. We derive an improved version of the high-order Boris spectral deferred correction algorithm (Boris-SDC) by adopting a convergence acceleration strategy for second order problems based on the Generalised Minimum Residual (GMRES) method. Our new algorithm is easy to implement as it still relies on the standard Boris method. Like Boris-SDC it can deliver arbitrary order of accuracy through simple changes of runtime parameter but possesses better long-term energy stability. We demonstrate for two examples, a magnetic mirror trap and the Solevev equilibrium, that the new method can deliver better accuracy at lower computational cost compared to the standard Boris method. While our examples are motivated by tracking ions in the magnetic field of a nuclear fusion reactor, the introduced algorithm can potentially deliver similar improvements in efficiency for other applications.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
