arXiv subjects

Luca Bonaventura

Publications and source records attributed to Luca Bonaventura.

At least 37 records · Page 2Linked to original sources

arXiv2021

A seamless, extended DG approach for advection-diffusion problems on unbounded domains

We propose and analyze a seamless extended Discontinuous Galerkin (DG) discretization of advection-diffusion equations on semi-infinite domains. The semi-infinite half line is split into a finite subdomain where the model uses a standard polynomial basis, and a semi-unbounded subdomain where scaled Laguerre functions are employed as basis and test functions. Numerical fluxes enable the coupling at the interface between the two subdomains in the same way as standard single domain DG interelement fluxes. A novel linear analysis on the extended DG model yields unconditional stability with respect to the Péclet number. Errors due to the use of different sets of basis functions on different portions of the domain are negligible, as highlighted in numerical experiments with the linear advection-diffusion and viscous Burgers' equations. With an added damping term on the semi-infinite subdomain, the extended framework is able to efficiently simulate absorbing boundary conditions without additional conditions at the interface. A few modes in the semi-infinite subdomain are found to suffice to deal with outgoing single wave and wave train signals more accurately than standard approaches at a given computational cost, thus providing an appealing model for fluid flow simulations in unbounded regions.

math.NA↗

arXiv2020

Resiliency in Numerical Algorithm Design for Extreme Scale Simulations

This work is based on the seminar titled ``Resiliency in Numerical Algorithm Design for Extreme Scale Simulations'' held March 1-6, 2020 at Schloss Dagstuhl, that was attended by all the authors. Naive versions of conventional resilience techniques will not scale to the exascale regime: with a main memory footprint of tens of Petabytes, synchronously writing checkpoint data all the way to background storage at frequent intervals will create intolerable overheads in runtime and energy consumption. Forecasts show that the mean time between failures could be lower than the time to recover from such a checkpoint, so that large calculations at scale might not make any progress if robust alternatives are not investigated. More advanced resilience techniques must be devised. The key may lie in exploiting both advanced system features as well as specific application knowledge. Research will face two essential questions: (1) what are the reliability requirements for a particular computation and (2) how do we best design the algorithms and software to meet these requirements? One avenue would be to refine and improve on system- or application-level checkpointing and rollback strategies in the case an error is detected. Developers might use fault notification interfaces and flexible runtime systems to respond to node failures in an application-dependent fashion. Novel numerical algorithms or more stochastic computational approaches may be required to meet accuracy requirements in the face of undetectable soft errors. The goal of this Dagstuhl Seminar was to bring together a diverse group of scientists with expertise in exascale computing to discuss novel ways to make applications resilient against detected and undetected faults. In particular, participants explored the role that algorithms and applications play in the holistic approach needed to tackle this challenge.

cs.DC↗

arXiv2020

Flexible and efficient discretizations of multilayer models with variable density

We show that the semi-implicit time discretization approaches previously introduced for multilayer shallow water models for the barotropic case can be also applied to the variable density case with Boussinesq approximation. Furthermore, also for the variable density equations, a variable number of layers can be used, so as to achieve greater flexibility and efficiency of the resulting multilayer approach. An analysis of the linearized system, which allows to derive linear stability parameters in simple configurations, and the resulting spatially semi-discretized equations are presented. A number of numerical experiments demonstrate the effectiveness of the proposed approach.

math.NA↗

arXiv2020

A novel dowscaling procedure for compositional data in the Aitchison geometry with application to soil texture data

In this work, we present a novel downscaling procedure for compositional quantities based on the Aitchison geometry. The method is able to naturally consider compositional constraints, i.e. unit-sum and positivity. We show that the method can be used in a block sequential Gaussian simulation framework in order to assess the variability of downscaled quantities. Finally, to validate the method, we test it first in an idealized scenario and then apply it for the downscaling of digital soil maps on a more realistic case study. The digital soil maps for the realistic case study are obtained from SoilGrids, a system for automated soil mapping based on state-of-the-art spatial predictions methods.

stat.ME↗

arXiv2020

A hyperbolic reformulation of the Serre-Green-Naghdi model for general bottom topographies

We present a novel hyperbolic reformulation of the Serre-Green-Naghdi (SGN) model for the description of dispersive water waves. Contrarily to the classical Boussinesq-type models, it contains only first order derivatives, thus allowing to overcome the numerical difficulties and the severe time step restrictions arising from higher order terms. The proposed model reduces to the original SGN model when an artificial sound speed tends to infinity. Moreover, it is endowed with an energy conservation law from which the energy conservation law associated with the original SGN model is retrieved when the artificial sound speed goes to infinity. The governing partial differential equations are then solved at the aid of high order ADER discontinuous Galerkin finite element schemes. The new model has been successfully validated against numerical and experimental results, for both flat and non-flat bottom. For bottom topographies with large variations, the new model proposed in this paper provides more accurate results with respect to the hyperbolic reformulation of the SGN model with the mild bottom approximation recently proposed in "C. Escalante, M. Dumbser and M.J. Castro. An efficient hyperbolic relaxation system for dispersive non-hydrostatic water waves and its solution with high order discontinuous Galerkin schemes, Journal of Computational Physics 2018".

math.NA↗

arXiv2020

Second order fully semi-Lagrangian discretizations of advection-diffusion-reaction systems

We propose a second order, fully semi-Lagrangian method for the numerical solution of systems of advection-diffusion-reaction equations, which employs a semi-Lagrangian approach to approximate in time both the advective and the diffusive terms. Standard interpolation procedures are used for the space discretization on structured and unstructured meshes. The proposed method allows for large time steps, while avoiding the solution of large linear systems, which would be required by an implicit time discretization technique. Numerical experiments demonstrate the effectiveness of the proposed approach and its superior efficiency with respect to more conventional explicit and implicit time discretizations

math.NA↗

arXiv2019

IsoGeometric Approximations for Electromagnetic Problems in Axisymmetric Domains

We propose a numerical method for the solution of electromagnetic problems on axisymmetric domains, based on a combination of a spectral Fourier approximation in the azimuthal direction with an IsoGeometric Analysis (IGA) approach in the radial and axial directions. This combination allows to blend the flexibility and accuracy of IGA approaches with the advantages of a Fourier representation on axisymmetric domains. It also allows to reduce significantly the computational cost by decoupling of the computations required for each Fourier mode. We prove that the discrete approximation spaces employed functional space constitute a closed and exact de Rham sequence. Numerical simulations of relevant benchmarks confirm the high order convergence and other computational advantages of the proposed method.

math.NA↗

arXiv2019

Dynamical p-adaptivity for LES of compressible flows in a high order DG framework

We investigate the possibility of reducing the computational burden of LES models by employing locally and dynamically adaptive polynomial degrees in the framework of a high order DG method. A degree adaptation technique especially featured to be effective for LES applications, that was previously developed by the authors and tested in the statically adaptive case, is applied here in a dynamically adaptive fashion. Two significant benchmarks are considered, comparing the results of adaptive and non adaptive simulations. The proposed dynamically adaptive approach allows for a significant reduction of the computational cost of representative LES computation, while allowing to maintain the level of accuracy guaranteed by LES carried out with constant, maximum polynomial degree values.

physics.flu-dyn↗

arXiv2018

Direct and Large Eddy Simulation of three-dimensional non-Boussinesq gravity currents with a high order DG method

We present results of three-dimensional Direct Numerical Simulations (DNS) and Large Eddy Simulations (LES) of turbulent gravity currents with a Discontinuous Galerkin (DG) Finite Elements method. In particular, we consider the three-dimensional lock-exchange test case as a typical benchmark for gravity currents. Since, to the best of our knowledge, non-Boussinesq three-dimensional reference DNS are not available in the literature for this test case, we first perform a DNS experiment. The three-dimensional DNS allows to correctly capture the loss of coherence of the three-dimensional turbulent structures, providing an accurate description of the turbulent phenomena taking place in gravity currents. The DNS is then employed to assess the performance of different LES models. In particular, we have considered the Smagorinsky model, the isotropic dynamic model and an anisotropic dynamic model. The LES results highlight the excessively dissipative nature of the Smagorinsky model with respect to the dynamic models and the fact that the anisotropic dynamic model performs slightly better with respect to its isotropic counterpart.

physics.flu-dyn↗

arXiv2018

A priori tests of a novel LES approach to compressible variable density turbulence

We assess the viability of a recently proposed novel approach to LES for compressible variable density flows by means of a priori tests. The a priori tests have been carried out filtering a two-dimensional DNS database of the classic lock-exchange benchmark. The tests confirm that additional terms should be accounted for in subgrid scale modeling of variable density flows, with respect to the terms usually considered in the traditional approach. Several alternatives for the modeling of these terms are assessed and discussed.

physics.flu-dyn↗

arXiv2018

High order time integrators for the simulation of charged particle motion in magnetic quadrupoles

Magnetic quadrupoles are essential components of particle accelerators like the Large Hadron Collider. In order to study numerically the stability of the particle beam crossing a quadrupole, a large number of particle revolutions in the accelerator must be simulated, thus leading to the necessity to preserve numerically invariants of motion over a long time interval and to a substantial computational cost, mostly related to the repeated evaluation of the magnetic vector potential. In this paper, in order to reduce this cost, we first consider a specific gauge transformation that allows to reduce significantly the number of vector potential evaluations. We then analyze the sensitivity of the numerical solution to the interpolation procedure required to compute magnetic vector potential data from gridded precomputed values at the locations required by high order time integration methods. Finally, we compare several high order integration techniques, in order to assess their accuracy and efficiency for these long term simulations. Explicit high order Lie methods are considered, along with implicit high order symplectic integrators and conventional explicit Runge Kutta methods. Among symplectic methods, high order Lie integrators yield optimal results in terms of cost/accuracy ratios, but non symplectic Runge Kutta methods perform remarkably well even in very long term simulations. Furthermore, the accuracy of the field reconstruction and interpolation techniques are shown to be limiting factors for the accuracy of the particle tracking procedures.

cs.CE↗

arXiv2018

A conservative implicit multirate method for hyperbolic problems

This work focuses on the development of a self adjusting multirate strategy based on an implicit time discretization for the numerical solution of hyperbolic equations, that could benefit from different time steps in different areas of the spatial domain. We propose a novel mass conservative multirate approach, that can be generalized to various implicit time discretization methods. It is based on flux partitioning, so that flux exchanges between a cell and its neighbors are balanced. A number of numerical experiments on both non-linear scalar problems and systems of hyperbolic equations have been carried out to test the efficiency and accuracy of the proposed approach.

math.NA↗

arXiv2018

A self adjusting multirate algorithm based on the TR-BDF2 method

We propose a self adjusting multirate method based on the TR-BDF2 solver. The potential advantages of using TR-BDF2 as the key component of a multirate framework are highlighted. A linear stability analysis of the resulting approach is presented and the stability features of the resulting algorithm are analysed. The analysis framework is completely general and allows to study along the same lines the stability of self adjusting multirate methods based on a generic one step solver. A number of numerical experiments demonstrate the efficiency and accuracy of the resulting approach also the time discretization of hyperbolic partial differential equations.

math.NA↗

arXiv2017

Multilayer shallow water models with locally variable number of layers and semi-implicit time discretization

We propose an extension of the discretization approaches for multilayer shallow water models, aimed at making them more flexible and efficient for realistic applications to coastal flows. A novel discretization approach is proposed, in which the number of vertical layers and their distribution are allowed to change in different regions of the computational domain. Furthermore, semi-implicit schemes are employed for the time discretization, leading to a significant efficiency improvement for subcritical regimes. We show that, in the typical regimes in which the application of multilayer shallow water models is justified, the resulting discretization does not introduce any major spurious feature and allows again to reduce substantially the computational cost in areas with complex bathymetry. As an example of the potential of the proposed technique, an application to a sediment transport problem is presented, showing a remarkable improvement with respect to standard discretization approaches.

math.NA↗

arXiv2017

A fully semi-Lagrangian discretization for the 2D Navier--Stokes equations in the vorticity--streamfunction formulation

A numerical method for the two-dimensional, incompressible Navier--Stokes equations in vorticity--streamfunction form is proposed, which employs semi-Lagrangian discretizations for both the advection and diffusion terms, thus achieving unconditional stability without the need to solve linear systems beyond that required by the Poisson solver for the reconstruction of the streamfunction. A description of the discretization of Dirichlet boundary conditions for the semi-Lagrangian approach to diffusion terms is also presented. Numerical experiments on classical benchmarks for incompressible flow in simple geometries validate the proposed method.

math.NA↗

arXiv2016

A locally p-adaptive approach for Large Eddy Simulation of compressible flows in a DG framework

We investigate the possibility of reducing the computational burden of LES models by employing local polynomial degree adaptivity in the framework of a high order DG method. A novel degree adaptation technique especially featured to be effective for LES applications is proposed and its effectiveness is compared to that of other criteria already employed in the literature. The resulting locally adaptive approach allows to achieve significant reductions in computational cost of representative LES computations.

physics.flu-dyn↗

arXiv2015

Monotonicity, positivity and strong stability of the TR-BDF2 method and of its SSP extensions

We analyze the one-step method TR-BDF2 from the point of view of monotonicity, strong stability and positivity. All these properties are strongly related and reviewed in the common framework of absolute monotonicity. The radius of absolute monotonicity is computed and it is shown that the parameter value which makes the method L-stable is also the value which maximizes the radius of monotonicity. Two hybrid variants of TR-BDF2 are proposed, that reduce the formal order of accuracy and maximize the absolute monotonicity radius, while keeping the native L-stability useful in stiff problems. Numerical experiments compare these different hybridization strategies with other methods commonly used in the presence of stiff and mildly stiff source terms. The results show that both strategies provide a good compromise between accuracy and robustness at high CFL numbers, without suffering from the limitations of alternative approaches already available in literature.

math.NA↗

arXiv2015

Local Exponential Methods: a domain decomposition approach to exponential time integration of PDEs

A local approach to the time integration of PDEs by exponential methods is proposed, motivated by theoretical estimates by A.Iserles on the decay of off-diagonal terms in the exponentials of sparse matrices. An overlapping domain decomposition technique is outlined, that allows to replace the computation of a global exponential matrix by a number of independent and easily parallelizable local problems. Advantages and potential problems of the proposed technique are discussed. Numerical experiments on simple, yet relevant model problems show that the resulting method allows to increase computational efficiency with respect to standard implementations of exponential methods.

math.NA↗