arXiv subjects

Rafael Bailo

Publications and source records attributed to Rafael Bailo.

14 recordsLinked to original sources

arXiv2025

A Particle method for stationary transport equations

We present and study a Particle method for the stationary solutions of a class of transport equations. This method is inspired by non-stationary Particle methods, the time variable being replaced by one spatial variable. Particles trajectories are computed using the ``time-dependent'' equations, and then the approximation is based on a quadrature method using the particle locations as quadrature points. We prove the convergence of the scheme under suitable regularity assumptions on the data and the solution, together with a ``characteristic completeness'' assumption (the characteristic curves fullfill the whole computational domain). We also provide an error estimate. The scheme is tested numerically on a two dimensional linear equation and we present a numerical study of convergence. Finally, we use this method to carry out numerical simulations of a landscape evolution model, where an erodible topography evolves under the effects of water erosion and sedimentation. The scheme is then useful to deal with wet/dry areas.

math.NA↗

arXiv2024

CBX: Python and Julia packages for consensus-based interacting particle methods

We introduce CBXPy and ConsensusBasedX.jl, Python and Julia implementations of consensus-based interacting particle systems (CBX), which generalise consensus-based optimization methods (CBO) for global, derivative-free optimisation. The raison d'être of our libraries is twofold: on the one hand, to offer high-performance implementations of CBX methods that the community can use directly, while on the other, providing a general interface that can accommodate and be extended to further variations of the CBX family. Python and Julia were selected as the leading high-level languages in terms of usage and performance, as well as their popularity among the scientific computing community. Both libraries have been developed with a common ethos, ensuring a similar API and core functionality, while leveraging the strengths of each language and writing idiomatic code.

math.OC↗

arXiv2024

Aggregation-Diffusion Equations for Collective Behaviour in the Sciences

This is a survey article based on the content of the plenary lecture given by José A. Carrillo at the ICIAM23 conference in Tokyo. It is devoted to produce a snapshot of the state of the art in the analysis, numerical analysis, simulation, and applications of the vast area of aggregation-diffusion equations. We also discuss the implications in mathematical biology explaining cell sorting in tissue growth as an example of this modelling framework. This modelling strategy is quite successful in other timely applications such as global optimisation, parameter estimation and machine learning.

math.AP↗

arXiv2024

The Collisional Particle-In-Cell Method for the Vlasov-Maxwell-Landau Equations

We introduce an extension of the particle-in-cell (PIC) method that captures the Landau collisional effects in the Vlasov-Maxwell-Landau equations. The method arises from a regularisation of the variational formulation of the Landau equation, leading to a discretisation of the collision operator that conserves mass, charge, momentum, and energy, while increasing the (regularised) entropy. The collisional effects appear as a fully deterministic effective force, thus the method does not require any transport-collision splitting. The scheme can be used in arbitrary dimension, and for a general interaction, including the Coulomb case. We validate the scheme on scenarios such as the Landau damping, the two-stream instability, and the Weibel instability, demonstrating its effectiveness in the numerical simulation of plasma.

physics.plasm-ph↗

arXiv2023

Uncertainty Quantification for the Homogeneous Landau-Fokker-Planck Equation via Deterministic Particle Galerkin methods

We design a deterministic particle method for the solution of the spatially homogeneous Landau equation with uncertainty. The deterministic particle approximation is based on the reformulation of the Landau equation as a formal gradient flow on the set of probability measures, whereas the propagation of uncertain quantities is computed by means of a sg representation of each particle. This approach guarantees spectral accuracy in uncertainty space while preserving the fundamental structural properties of the model: the positivity of the solution, the conservation of invariant quantities, and the entropy production. We provide a regularity results for the particle method in the random space. We perform the numerical validation of the particle method in a wealth of test cases.

math.NA↗

arXiv2023

Pedestrian models with congestion effects

We study the validity of the dissipative Aw-Rascle system as a macroscopic model for pedestrian dynamics. The model uses a congestion term (a singular diffusion term) to enforce capacity constraints in the crowd density while inducing a steering behaviour. Furthermore, we introduce a semi-implicit, structure-preserving, and asymptotic-preserving numerical scheme which can handle the numerical solution of the model efficiently. We perform the first numerical simulations of the dissipative Aw-Rascle system in one and two dimensions. We demonstrate the efficiency of the scheme in solving an array of numerical experiments, and we validate the model, ultimately showing that it correctly captures the fundamental diagram of pedestrian flow.

physics.soc-ph↗

arXiv2023

A Finite-Volume Scheme for Fractional Diffusion on Bounded Domains

We propose a new fractional Laplacian for bounded domains, expressed as a conservation law and thus particularly suited to finite-volume schemes. Our approach permits the direct prescription of no-flux boundary conditions. We first show the well-posedness theory for the fractional heat equation. We also develop a numerical scheme, which correctly captures the action of the fractional Laplacian and its anomalous diffusion effect. We benchmark numerical solutions for the L\'evy-Fokker-Planck equation against known analytical solutions. We conclude by numerically exploring properties of these equations with respect to their stationary states and long-time asymptotics.

math.NA↗

arXiv2023

Unconditional bound-preserving and energy-dissipating finite-volume schemes for the Cahn-Hilliard equation

We propose finite-volume schemes for the Cahn-Hilliard equation which unconditionally and discretely preserve the boundedness of the phase field and the dissipation of the free energy. Our numerical framework is applicable to a variety of free-energy potentials, including Ginzburg-Landau and Flory-Huggins, to general wetting boundary conditions, and to degenerate mobilities. Its central thrust is the upwind methodology, which we combine with a semi-implicit formulation for the free-energy terms based on the classical convex-splitting approach. The extension of the schemes to an arbitrary number of dimensions is straightforward thanks to their dimensionally split nature, which allows to efficiently solve higher-dimensional problems with a simple parallelisation. The numerical schemes are validated and tested through a variety of examples, in different dimensions, and with various contact angles between droplets and substrates.

math.NA↗

arXiv2023

Bound-Preserving Finite-Volume Schemes for Systems of Continuity Equations with Saturation

We propose finite-volume schemes for general continuity equations which preserve positivity and global bounds that arise from saturation effects in the mobility function. In the case of gradient flows, the schemes dissipate the free energy at the fully discrete level. Moreover, these schemes are generalised to coupled systems of non-linear continuity equations, such as multispecies models in mathematical physics or biology, preserving the bounds and the dissipation of the energy whenever applicable. These results are illustrated through extensive numerical simulations which explore known behaviours in biology and showcase new phenomena not yet described by the literature.

math.NA↗

arXiv2022

Convergence of a Fully Discrete and Energy-Dissipating Finite-Volume Scheme for Aggregation-Diffusion Equations

We study an implicit finite-volume scheme for non-linear, non-local aggregation-diffusion equations which exhibit a gradient-flow structure, recently introduced by Bailo, Carrillo, and Hu (2020). Crucially, this scheme keeps the dissipation property of an associated fully discrete energy, and does so unconditionally with respect to the time step. Our main contribution in this work is to show the convergence of the method under suitable assumptions on the diffusion functions and potentials involved.

math.NA↗

arXiv2022

Projective and Telescopic Projective Integration for Non-Linear Kinetic Mixtures

We propose fully explicit projective integration and telescopic projective integration schemes for the multispecies Boltzmann and Bhatnagar-Gross-Krook (BGK) equations. The methods employ a sequence of small forward-Euler steps, intercalated with large extrapolation steps. The telescopic approach repeats said extrapolations as the basis for an even larger step. This hierarchy renders the computational complexity of the method essentially independent of the stiffness of the problem, which permits the efficient solution of equations in the hyperbolic scaling with very small Knudsen numbers. We validate the schemes on a range of scenarios, demonstrating its prowess in dealing with extreme mass ratios, fluid instabilities, and other complex phenomena.

math.NA↗

arXiv2020

Fully Discrete Positivity-Preserving and Energy-Dissipating Schemes for Aggregation-Diffusion Equations with a Gradient Flow Structure

We propose fully discrete, implicit-in-time finite-volume schemes for a general family of non-linear and non-local Fokker-Planck equations with a gradient-flow structure, usually known as aggregation-diffusion equations, in any dimension. The schemes enjoy the positivity-preservation and energy-dissipation properties, essential for their practical use. The first-order scheme verifies these properties unconditionally for general non-linear diffusions and interaction potentials, while the second-order scheme does so provided a CFL condition holds. Sweeping dimensional splitting permits the efficient construction of these schemes in higher dimensions while preserving their structural properties. Numerical experiments validate the schemes and show their ability to handle complicated phenomena typical in aggregation-diffusion equations, such as free boundaries, metastability, merging and phase transitions.

math.NA↗

arXiv2019

Pedestrian Models based on Rational Behaviour

Following the paradigm set by attraction-repulsion-alignment schemes, a myriad of individual based models have been proposed to calculate the evolution of abstract agents. While the emergent features of many agent systems have been described astonishingly well with force-based models, this is not the case for pedestrians. Many of the classical schemes have failed to capture the fine detail of crowd dynamics, and it is unlikely that a purely mechanical model will succeed. As a response to the mechanistic literature, we will consider a model for pedestrian dynamics that attempts to reproduce the rational behaviour of individual agents through the means of anticipation. Each pedestrian undergoes a two-step time evolution based on a perception stage and a decision stage. We will discuss the validity of this game theoretical based model in regimes with varying degrees of congestion, ultimately presenting a correction to the mechanistic model in order to achieve realistic high-density dynamics.

physics.soc-ph↗

arXiv2018

Optimal consensus control of the Cucker-Smale model

We study the numerical realisation of optimal consensus control laws for agent-based models. For a nonlinear multi-agent system of Cucker-Smale type, consensus control is cast as a dynamic optimisation problem for which we derive first-order necessary optimality conditions. In the case of a smooth penalization fo the control energy, the optimality system is numerically approximated via a gradient-descent method. For sparsity promoting, non-smooth $\ell_1$-norm control penalizations, the optimal controllers are realised by means of heuristic methods. For an increasing number of agents, we discuss the approximation of the consensus control problem by following a mean-field modelling approach.

math.OC↗