arXiv subjects

Lorenzo Pareschi

Publications and source records attributed to Lorenzo Pareschi.

122 records · Page 7Linked to original sources

arXiv2012

Binary interaction algorithms for the simulation of flocking and swarming dynamics

Microscopic models of flocking and swarming takes in account large numbers of interacting individ- uals. Numerical resolution of large flocks implies huge computational costs. Typically for $N$ interacting individuals we have a cost of $O(N^2)$. We tackle the problem numerically by considering approximated binary interaction dynamics described by kinetic equations and simulating such equations by suitable stochastic methods. This approach permits to compute approximate solutions as functions of a small scaling parameter $\varepsilon$ at a reduced complexity of O(N) operations. Several numerical results show the efficiency of the algorithms proposed.

physics.comp-ph↗

arXiv2012

High order asymptotic-preserving schemes for the Boltzmann equation

In this note we discuss the construction of high order asymptotic preserving numerical schemes for the Boltzmann equation. The methods are based on the use of Implicit-Explicit (IMEX) Runge-Kutta methods combined with a penalization technique recently introduced in [F. Filbet, S. Jin: A class of asymptotic preserving schemes for kinetic equations and related problems with stiff sources,J. Comp. Phys. 229, (2010), pp. 7625-7648.].

math.NA↗

arXiv2012

Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX Runge-Kutta methods in the context of optimal control problems. The analysis of the schemes is based on the continuous optimality system. Using suitable transformations of the adjoint equation, order conditions up to order three are proven as well as the relation between adjoint schemes obtained through different transformations is investigated. Conditions for the IMEX Runge-Kutta methods to be symplectic are also derived. A numerical example illustrating the theoretical properties is presented.

math.NA↗

arXiv2011

Mean field mutation dynamics and the continuous Luria-Delbrück distribution

The Luria-Delbrück mutation model has a long history and has been mathematically formulated in several different ways. Here we tackle the problem in the case of a continuous distribution using some mathematical tools from nonlinear statistical physics. Starting from the classical formulations we derive the corresponding differential models and show that under a suitable mean field scaling they correspond to generalized Fokker-Planck equations for the mutants distribution whose solutions are given by the corresponding Luria-Delbrück distribution. Numerical results confirming the theoretical analysis are also presented.

math-ph↗

arXiv2010

Exponential Runge-Kutta methods for stiff kinetic equations

We introduce a class of exponential Runge-Kutta integration methods for kinetic equations. The methods are based on a decomposition of the collision operator into an equilibrium and a non equilibrium part and are exact for relaxation operators of BGK type. For Boltzmann type kinetic equations they work uniformly for a wide range of relaxation times and avoid the solution of nonlinear systems of equations even in stiff regimes. We give sufficient conditions in order that such methods are unconditionally asymptotically stable and asymptotic preserving. Such stability properties are essential to guarantee the correct asymptotic behavior for small relaxation times. The methods also offer favorable properties such as nonnegativity of the solution and entropy inequality. For this reason, as we will show, the methods are suitable both for deterministic as well as probabilistic numerical techniques.

math.NA↗

arXiv2010

Direct simulation Monte Carlo schemes for Coulomb interactions in plasmas

We consider the development of Monte Carlo schemes for molecules with Coulomb interactions. We generalize the classic algorithms of Bird and Nanbu-Babovsky for rarefied gas dynamics to the Coulomb case thanks to the approximation introduced by Bobylev and Nanbu (Theory of collision algorithms for gases and plasmas based on the Boltzmann equation and the Landau-Fokker-Planck equation, Physical Review E, Vol. 61, 2000). Thus, instead of considering the original Boltzmann collision operator, the schemes are constructed through the use of an approximated Boltzmann operator. With the above choice larger time steps are possible in simulations; moreover the expensive acceptance-rejection procedure for collisions is avoided and every particle collides. Error analysis and comparisons with the original Bobylev-Nanbu (BN) scheme are performed. The numerical results show agreement with the theoretical convergence rate of the approximated Boltzmann operator and the better performance of Bird-type schemes with respect to the original scheme.

physics.comp-ph↗

arXiv2010

Spectral methods for the non cut-off Boltzmann equation and numerical grazing collision limit

In this paper we study the numerical passage from the spatially homogeneous Boltzmann equation without cut-off to the Fokker-Planck-Landau equation in the so-called grazing collision limit. To this aim we derive a Fourier spectral method for the non cut-off Boltzmann equation in the spirit of L. Pareschi, B.Perthame, TTSP 25, (1996) and L.Pareschi, G.Russo, SINUM 37, (2000). We show that the kernel modes that define the spectral method have the correct grazing collision limit providing a consistent spectral method for the limiting Fokker-Planck-Landau equation. In particular, for small values of the scattering angle, we derive an approximate formula for the kernel modes of the non cut-off Boltzmann equation which, similarly to the Fokker-Planck-Landau case, can be computed with a fast algorithm. The uniform spectral accuracy of the method with respect to the grazing collision parameter is also proved.

math.NA↗

arXiv2010

Price dynamics in financial markets: a kinetic approach

The use of kinetic modelling based on partial differential equations for the dynamics of stock price formation in financial markets is briefly reviewed. The importance of behavioral aspects in market booms and crashes and the role of agents' heterogeneity in emerging power laws for price distributions is emphasized and discussed.

q-fin.TR↗

arXiv2009

Fluid Solver Independent Hybrid Methods for Multiscale Kinetic equations

In some recent works [G. Dimarco, L. Pareschi, Hybrid multiscale methods I. Hyperbolic Relaxation Problems, Comm. Math. Sci., 1, (2006), pp. 155-177], [G. Dimarco, L. Pareschi, Hybrid multiscale methods II. Kinetic equations, SIAM Multiscale Modeling and Simulation Vol 6., No 4,pp. 1169-1197, (2008)] we developed a general framework for the construction of hybrid algorithms which are able to face efficiently the multiscale nature of some hyperbolic and kinetic problems. Here, at variance with respect to the previous methods, we construct a method form-fitting to any type of finite volume or finite difference scheme for the reduced equilibrium system. Thanks to the coupling of Monte Carlo techniques for the solution of the kinetic equations with macroscopic methods for the limiting fluid equations, we show how it is possible to solve multiscale fluid dynamic phenomena faster with respect to traditional deterministic/stochastic methods for the full kinetic equations. In addition, due to the hybrid nature of the schemes, the numerical solution is affected by less fluctuations when compared to standard Monte Carlo schemes. Applications to the Boltzmann-BGK equation are presented to show the performance of the new methods in comparison with classical approaches used in the simulation of kinetic equations.

math.NA↗

arXiv2009

The Moment Guided Monte Carlo Method

In this work we propose a new approach for the numerical simulation of kinetic equations through Monte Carlo schemes. We introduce a new technique which permits to reduce the variance of particle methods through a matching with a set of suitable macroscopic moment equations. In order to guarantee that the moment equations provide the correct solutions, they are coupled to the kinetic equation through a non equilibrium term. The basic idea, on which the method relies, consists in guiding the particle positions and velocities through moment equations so that the concurrent solution of the moment and kinetic models furnishes the same macroscopic quantities.

math-ph↗

arXiv2006

Solving the Boltzmann equation in N log N

In [C. Mouhot and L. Pareschi, "Fast algorithms for computing the Boltzmann collision operator," Math. Comp., to appear; C. Mouhot and L. Pareschi, C. R. Math. Acad. Sci. Paris, 339 (2004), pp. 71-76], fast deterministic algorithms based on spectral methods were derived for the Boltzmann collision operator for a class of interactions including the hard spheres model in dimension three. These algorithms are implemented for the solution of the Boltzmann equation in two and three dimension, first for homogeneous solutions, then for general non homogeneous solutions. The results are compared to explicit solutions, when available, and to Monte-Carlo methods. In particular, the computational cost and accuracy are compared to those of Monte-Carlo methods as well as to those of previous spectral methods. Finally, for inhomogeneous solutions, we take advantage of the great computational efficiency of the method to show an oscillation phenomenon of the entropy functional in the trend to equilibrium, which was suggested in the work [L. Desvillettes and C. Villani, Invent. Math., 159 (2005), pp. 245-316].

math.AP↗

arXiv2006

Fast algorithms for computing the Boltzmann collision operator

The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres model in dimension three, we are able to derive spectral methods that can be evaluated through fast algorithms. These algorithms are based on a suitable representation and approximation of the collision operator. Explicit expressions for the errors in the schemes are given and spectral accuracy is proved. Parallelization properties and adaptivity of the algorithms are also discussed.

math.AP↗

arXiv2004

Dissipative hydrodynamic models for the diffusion of impurities in a gas

Recently linear dissipative models of the Boltzmann equation have been introduced. In this work, we consider the problem of constructiing suitable hydrodynamic approximations for such models where the mean velocity and the temperature of inelastic particles appear as independent variables.

math.AP↗

arXiv2004

On a kinetic model for a simple market economy

In this paper, we consider a simple kinetic model of economy involving both exchanges between agents and speculative trading. We show that the kinetic model admits non trivial quasi-stationary states with power law tails of Pareto type. In order to do this we consider a suitable asymptotic limit of the model yielding a Fokker-Planck equation for the distribution of wealth among individuals. For this equation the stationary state can be easily derived and shows a Pareto power law tail. Numerical results confirm the previous analysis.

math.AP↗