Searcharxiv⌕ Search

arXiv subjects

Olivier Pironneau

Publications and source records attributed to Olivier Pironneau.

At least 19 recordsLinked to original sources

Monte Carlo pricing under fast mean-reverting stochastic volatility: the multi-scale limit ${ε\to 0}$

We compute $\E[(S_T-K)^+]$ by Monte Carlo for a scalar stochastic-volatility model with a fast mean-reverting factor of time scale $\eps$, for $\eps$ ranging from $1$ down to $10^{-3}$. A conditional (mixing) estimator gives finite variance, whereas the direct estimator has infinite variance for this model. The volatility factor is simulated with its exact Ornstein--Uhlenbeck transition. As $\eps\to0$ the price converges, at rate $O(\eps)$, to the Black--Scholes price with the averaged volatility $\barσ$, and the implied-volatility smile flattens to $\barσ$. Finally, we test a martingale control variate built on the Black--Scholes delta with volatility $\barσ$. If the martingale is driven by the true volatility $σ(Y_t)$, the variance is reduced by a factor that grows like $1/\eps$, about $160$ at $\eps=10^{-3}$. If it is driven by the constant $\barσ$, the variance is essentially not reduced. Last, we calibrate the model with $ρ\neq0$ to S\&P~500 implied volatilities by full simulation of $S$. At the same number of paths the control variate reduces the variance by a factor $1.7$--$16$ (median $5.6$) and gives more accurate calibrated parameters; at equal CPU time it pays off only if the delta is rebalanced on a coarser grid than the time step. For a basket of four indices (state dimension $8$) the gain is larger (median $8$) and the relative cost smaller, so that the control variate is about $4$--$5$ times more efficient than plain Monte Carlo at equal CPU time.

math.NA↗

Collimated Sunlight and Air Temperature

Atmospheric temperature on Earth results from complex phenomena that climate models must account for. One important module is radiation, which has three sources: infrared radiation emitted by the Earth and the air, and visible light from the Sun. The latter arrives from an almost point-like source in the sky, producing a Dirac singularity in the boundary conditions known as collimated light. Following Siewert and Maiorino (1980), we propose a very fast numerical implementation to handle the singularity.

math.NA↗

Numerical Simulation of Polarized Light and Temperature in a Stratified Atmosphere with a Slowly Varying Refractive Index

This article is an attempt to elucidate the effect of a slowly varying refractive index on the temperature in a stratified atmosphere, with a particular focus on greenhouse gases such as CO2. It validates an iterative method for the vector radiative transfer equations (VVRTE) called Iterations on the Source. As the system proposed by Chandrasekhar and Pomraning is not well posed for all rays directions when the refractive index varies, so instead we solve an integral representation of VRTE without the problematic rays. A mathematical proof is given showing monotonicity, convergence of the iterations and existence and uniqueness. Furthermore the convergence is geometric if the absorption is not too large. Some numerical tests are performed showing the effect of a layer of cloud with a refractive index greater than air, polarisation and scattering.

math.AP↗

Numerical Simulation of Polarized Light and Temperature with a Refractive Interface

In this article we propose a numerical algorithm to compute the intensity and polarization of a polychromatic electromagnetic radiation crossing a medium with graded refractive index and modeled by the Vector Radiative Refractive Transfer Equations (VRRTE). Special attention is given to the case where the refractive index has a discontinuity for which the Fresnel conditions are necessary. We assume that the only spatial variable of interest is the altitude (stratified medium). An algorithm based on iterations of the sources is shown to be monotone and convergent. Numerical examples are given with highly varying absorption coefficient kappa and Rayleigh scattering as in the Earth atmosphere. To study the effect of CO2 in the atmosphere kappa is changed in the frequency ranges where CO2 is absorbing.

math.AP↗

The Dual Characteristic-Galerkin Method

The Dual Characteristic-Galerkin method (DCGM) is conservative, precise and experimentally positive. We present the method and prove convergence and $L^2$-stability in the case of Neumann boundary conditions. In a 2D numerical finite element setting (FEM), the method is compared to Primal Characteristic-Galerkin (PCGM), Streamline upwinding (SUPG), the Dual Discontinuous Galerkin method (DDG) and centered FEM without upwinding. DCGM is difficult to implement numerically but, in the numerical context of this note, it is far superior to all others.

math.NA↗

Optimal Quota for a Multi-species Fishing Models

A Stochastic Control Problem can be solved by Dynamic Programming or Distributed Optimal Control with the Kolmogorov equation for the probability density of the Markov process of the problem. It can be solved also with Supervised Learning. We shall compare these two classes of methods for the control of fisheries. Fishing quotas are unpleasant but efficient to control the productivity of a fishing site. A popular model has a vector-valued stochastic differential equation for the biomass of the different species. Optimization of quota will be obtained by a gradient method applied to the least square difference with an ideal state weighted by the probability density of the biomasses. Alternatively a deep neural network which preserves the Markov property of the problem can be trained with a stochastic gradient algorithm. The model is extended to distributed fishing sites and biomass is stabilized by adjusting the quota to its time derivative.

math.NA↗

Reflective Conditions for Radiative Transfer in Integral Form with H-Matrices

In a recent article the authors showed that the radiative Transfer equations with multiple frequencies and scattering can be formulated as a nonlinear integral system. In the present article, the formulation is extended to handle reflective boundary conditions. The fixed point method to solve the system is shown to be monotone. The discretization is done with a $P^1$ Finite Element Method. The convolution integrals are precomputed at every vertices of the mesh and stored in compressed hierarchical matrices, using Partially Pivoted Adaptive Cross-Approximation. Then the fixed point iterations involve only matrix vector products. The method is $O(N\sqrt[3]{N}\ln N)$, with respect to the number of vertices, when everything is smooth. A numerical implementation is proposed and tested on two examples. As there are some analogies with ray tracing the programming is complex.

math.NA↗

Simulation of the 3D Radiative Transfer with Anisotropic Scattering for Convective Trails

The integro-differential formulation of the RTE and its solution by iterations on the source has been extended here to handle anisotropic scattering. The iterative part of the method is O(N ln N ), thanks to an efficient use of H-matrices. The precision is good enough to evaluate the effect of sensitive parameters for the study of contrails. Most of the time the stratified 1D approximation should suffice, but in complex cases with high relief the 3D formulation is needed.

math.NA↗

Radiative Transfer For Variable 3D Atmospheres

To study the temperature in a gas subjected to electromagnetic radiations, one may use the Radiative Transfer equations coupled with the Navier-Stokes equations. The problem has 7 dimensions; however with minimal simplifications it is equivalent to a small number of integro-differential equations in 3 dimensions. We present the method and a numerical implementation using an H-matrix compression scheme. The result is a very fast: 50K physical points, all directions of radiation and 680 frequencies require less than 5 minutes on an Apple M1 Laptop. The method is capable of handling variable absorptioN and scattering functionS of spatial positions and frequencies. The implementation is done using htool, a matrix compression library interfaced with the PDE solver freefem++. Applications to the temperature in the French Chamonix valley is presented at different hours of the day with and without snow / clouds and with a variable absorption taken from the Gemini measurements. The result is precise enough to assert temperature differences due to increased absorption in the vibrational frequency subrange of greenhouse gasses.

math.NA↗

Radiative Transfer in a Fluid

We study the Radiative Transfer equations coupled with the time dependent temperature equation of a fluid: existence, uniqueness, a maximum principle are established. A short numerical section illustrates the pros and cons of the method.

math.AP↗

Performance of a Markovian neural network versus dynamic programming on a fishing control problem

Fishing quotas are unpleasant but efficient to control the productivity of a fishing site. A popular model has a stochastic differential equation for the biomass on which a stochastic dynamic programming or a Hamilton-Jacobi-Bellman algorithm can be used to find the stochastic control -- the fishing quota. We compare the solutions obtained by dynamic programming against those obtained with a neural network which preserves the Markov property of the solution. The method is extended to a similar multi species model to check its robustness in high dimension.

math.OC↗

An energy stable one-field monolithic arbitrary Lagrangian-Eulerian formulation for fluid-structure interaction

In this article we present a one-field monolithic finite element method in the Arbitrary Lagrangian-Eulerian (ALE) formulation for Fluid-Structure Interaction (FSI) problems. The method only solves for one velocity field in the whole FSI domain, and it solves in a monolithic manner so that the fluid solid interface conditions are satisfied automatically. We prove that the proposed scheme is unconditionally stable, through energy analysis, by utilising a conservative formulation and an exact quadrature rule. We implement the algorithm using both ${\bf F}$-scheme and ${\bf d}$-scheme, and demonstrate that the former has the same formulation in two and three dimensions. Finally several numerical examples are presented to validate this methodology, including combination with remesh techniques to handle the case of very large solid displacement.

cs.CE↗

Calibration of a Fluid-Structure Problem with Keras

In this short paper we report on an inverse problem issued from a physical system, namely a fluid structure problem where the parameters are the rigidity constant, the solid-fluid density ratio and the fluid viscosity. We have chosen a simple geometry so that the numerical solution of the system is easy. We compare the solution of this inverse problem by a Neural Network with a more classical solution obtained with a genetic algorithm. The Neural Network does much better.

math.NA↗

Scale Prevention By Ceramic Balls

In industrial facilities and household equipments scale formation leads to reduced efficiency and damages. Therefore various devices for anti-scale have been designed for a long time. Recently one of them, an aggregation of ceramic spheres, was proposed to prevent scale formation and its efficiency shown experimentally. The purpose of this paper is to clarify the function of this device by proposing several mathematical models and by pursuing their mathematical and numerical analysis. The first model measures the effect on nucleation of calcite of the electric potential near the surface of a ceramic sphere in natural water. The second model is based on a crystal lattice model and argues that the surface tension energy of the calcite particles is reduced by the polarization energy brought by the ceramic balls. The third model is macroscopic and numerical and studies the effect of two ceramic balls arrangements in a flow of water containing calcite particles.

physics.comp-ph↗

Mini-symposium on automatic differentiation and its applications in the financial industry

Automatic differentiation is involved for long in applied mathematics as an alternative to finite difference to improve the accuracy of numerical computation of derivatives. Each time a numerical minimization is involved, automatic differentiation can be used. In between formal derivation and standard numerical schemes, this approach is based on software solutions applying mechanically the chain rule to obtain an exact value for the desired derivative. It has a cost in memory and cpu consumption. For participants of financial markets (banks, insurances, financial intermediaries, etc), computing derivatives is needed to obtain the sensitivity of its exposure to well-defined potential market moves. It is a way to understand variations of their balance sheets in specific cases. Since the 2008 crisis, regulation demand to compute this kind of exposure to many different case, to be sure market participants are aware and ready to face a wide spectrum of configurations. This paper shows how automatic differentiation provides a partial answer to this recent explosion of computation to perform. One part of the answer is a straightforward application of Adjoint Algorithmic Differentiation (AAD), but it is not enough. Since financial sensitivities involves specific functions and mix differentiation with Monte-Carlo simulations, dedicated tools and associated theoretical results are needed. We give here short introductions to typical cases arising when one use AAD on financial markets.

q-fin.CP↗

An Energy stable Monolithic Eulerian Fluid-Structure Numerical Scheme *

The conservation laws of continuum mechanic written in an Eulerian frame make no difference between fluids and solids except in the expression of the stress tensors, usually with Newton's hypothesis for the fluids and Helmholtz potentials of energy for hyperelastic solids. By taking the velocities as unknown , monolithic methods for fluid structure interactions (FSI) are built. In this article such a formulation is analyzed when the fluid is compressible and the fluid is incompressible. The idea is not new but the progress of mesh generators and numerical schemes like the Characteristics-Galerkin method render this approach feasible and reasonably robust. In this article the method and its discretization are presented, stability is discussed by through an energy estimate. A numerical section discusses implementation issues and presents a few simple tests.

cs.CE↗

Vibrato and automatic differentiation for high order derivatives and sensitivities of financial options

This paper deals with the computation of second or higher order greeks of financial securities. It combines two methods, Vibrato and automatic differentiation and compares with other methods. We show that this combined technique is faster than standard finite difference, more stable than automatic differentiation of second order derivatives and more general than Malliavin Calculus. We present a generic framework to compute any greeks and present several applications on different types of financial contracts: European and American options, multidimensional Basket Call and stochastic volatility models such as Heston's model. We give also an algorithm to compute derivatives for the Longstaff-Schwartz Monte Carlo method for American options. We also extend automatic differentiation for second order derivatives of options with non-twice differentiable payoff. 1. Introduction. Due to BASEL III regulations, banks are requested to evaluate the sensitivities of their portfolios every day (risk assessment). Some of these portfolios are huge and sensitivities are time consuming to compute accurately. Faced with the problem of building a software for this task and distrusting automatic differentiation for non-differentiable functions, we turned to an idea developed by Mike Giles called Vibrato. Vibrato at core is a differentiation of a combination of likelihood ratio method and pathwise evaluation. In Giles [12], [13], it is shown that the computing time, stability and precision are enhanced compared with numerical differentiation of the full Monte Carlo path. In many cases, double sensitivities, i.e. second derivatives with respect to parameters, are needed (e.g. gamma hedging). Finite difference approximation of sensitivities is a very simple method but its precision is hard to control because it relies on the appropriate choice of the increment. Automatic differentiation of computer programs bypass the difficulty and its computing cost is similar to finite difference, if not cheaper. But in finance the payoff is never twice differentiable and so generalized derivatives have to be used requiring approximations of Dirac functions of which the precision is also doubtful. The purpose of this paper is to investigate the feasibility of Vibrato for second and higher derivatives. We will first compare Vibrato applied twice with the analytic differentiation of Vibrato and show that it is equivalent, as the second is easier we propose the best compromise for second derivatives: Automatic Differentiation of Vibrato. In [8], Capriotti has recently investigated the coupling of different mathematical methods -- namely pathwise and likelihood ratio methods -- with an Automatic differ

q-fin.CP↗