arXiv subjects

François Dufour

Publications and source records attributed to François Dufour.

21 records · Page 2Linked to original sources

arXiv2011

Numerical methods for the exit time of a piecewise-deterministic Markov process

We present a numerical method to compute the survival function and the moments of the exit time for a piecewise-deterministic Markov process (PDMP). Our approach is based on the quantization of an underlying discrete-time Markov chain related to the PDMP. The approximation we propose is easily computable and is even flexible with respect to the exit time we consider. We prove the convergence of the algorithm and obtain bounds for the rate of convergence in the case of the moments. An academic example and a model from the reliability field illustrate the paper.

math.PR↗

arXiv2011

Optimal stopping for the predictive maintenance of a structure subject to corrosion

We present a numerical method to compute the optimal maintenance time for a complex dynamic system applied to an example of maintenance of a metallic structure subject to corrosion. An arbitrarily early intervention may be uselessly costly, but a late one may lead to a partial/complete failure of the system, which has to be avoided. One must therefore find a balance between these too simple maintenance policies. To achieve this aim, we model the system by a stochastic hybrid process. The maintenance problem thus corresponds to an optimal stopping problem. We propose a numerical method to solve the optimal stopping problem and optimize the maintenance time for this kind of processes.

math.PR↗

arXiv2010

Numerical method for optimal stopping of piecewise deterministic Markov processes

We propose a numerical method to approximate the value function for the optimal stopping problem of a piecewise deterministic Markov process (PDMP). Our approach is based on quantization of the post jump location---inter-arrival time Markov chain naturally embedded in the PDMP, and path-adapted time discretization grids. It allows us to derive bounds for the convergence rate of the algorithm and to provide a computable $ε$-optimal stopping time. The paper is illustrated by a numerical example.

math.PR↗