scholarly journals Fitting coefficients of differential systems with Monte Carlo methods

2015 ◽  
Vol Volume 20 - 2015 - Special... ◽  
Author(s):  
Christian Chan Shio ◽  
Francine Diener

International audience We consider the problem of estimating the coefficients in a system of differential equations when a trajectory of the system is known at a set of times. To do this, we use a simple Monte Carlo sampling method, known as the rejection sampling algorithm. Unlike deterministic methods, it does not provide a point estimate of the coefficients directly, but rather a collection of values that "fits" the known data well. An examination of the properties of the method allows us not only to better understand how to choose the different parameters when implementing the method, but also to introduce a more efficient method by using a new two-step approach which we call sequential rejection sampling. Several examples are presented to illustrate the performance of both the original and the new methods. On considère le problème d'estimer les coefficients d'un système d'équations différentielles quand une trajectoire du système est connue en un petit nombre d'instants. On utilise pour cela une méthode de Monte Carlo très simple, la méthode de rejet qui ne fournit pas directement une estimation ponctuelle des coefficients comme le font les méthodes déterministes mais plutôt un ensemble de valeurs de ces coefficients qui sont cohérentes avec les données. L'examen des propriétés de cette méthode permet de comprendre non seulement comment bien choisir les différents paramètres de la méthode lorsqu'on l'utilise mais aussi d'introduire une méthode plus efficace, en deux étapes, que nous appelons la méthode de rejet séquentielle. Plusieurs exemples illustrent les performances respectives de la méthode d'origine et de la nouvelle méthode.

2018 ◽  
Vol 98 ◽  
pp. 11-26 ◽  
Author(s):  
Alejandro Peña ◽  
Isis Bonet ◽  
Christian Lochmuller ◽  
Francisco Chiclana ◽  
Mario Góngora

2020 ◽  
Vol 16 (10) ◽  
pp. 6645-6655
Author(s):  
Hao Liu ◽  
Jianpeng Deng ◽  
Zhou Luo ◽  
Yawei Lin ◽  
Kenneth M. Merz ◽  
...  

Circuit World ◽  
2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Swapnali Makdey ◽  
Rajendra Patrikar ◽  
Mohammad Farukh Hashmi

Purpose A “spin-diode” is the spintronics equivalent of an electrical diode: applying an external magnetic field greater than the limit of spin-diode BT flips the spin-diode between an isolating state and a conducting state [1]. While conventional electrical diodes are two-terminal devices with electrical current between the two terminals modulated by an electrical field, these two-terminal magneto resistive devices can generally be referred to as “spin-diodes” in which a magnetic field modulates the electrical current between the two terminals. Design/methodology/approach Current modulation and rectification are an important subject of electronics as well as spintronics spin diode is two-terminal magnetoresistive devices in which change in resistance in response to an applied magnetic field; this magnetoresistance occurs due to a variety of phenomena and with varying magnitudes and directions. Findings In this paper, an efficient rectifying spin diode is introduced. The resulting spin diode is formed from graphene gallium and indium quantum dots and antimony-doped molybdenum disulfide. Converting an alternating bias voltage to direct current is the main achievement of this model device with an additional profit of rectified spin-current. The non-equilibrium density functional theory with a Monte Carlo sampling method is used to evaluate the flow of electrons and rectification ratio of the system. Originality/value The results indicate that spin diode displaying both spin-current and charge-current rectification should be possible and may find practical application in nanoscale devices that combine logic and memory functions.


Author(s):  
Takayuki Shiina ◽  

We consider the stochastic programming problem with recourse in which the expectation of the recourse function requires a large number of function evaluations, and its application to the capacity expansion problem. We propose an algorithm which combines an L-shaped method and a Monte Carlo method. The importance sampling technique is applied to obtain variance reduction. In the previous approach, the recourse function is approximated as an additive form in which the function is separable in the components of the stochastic vector. In our approach, the approximate additive form of the recourse function is perturbed to define the new density function. Numerical results for the capacity expansion problem are presented.


1989 ◽  
Vol 3 (3) ◽  
pp. 435-451
Author(s):  
Bajis Dodin

Given a stochastic activity network in which the length of some or all of the arcs are random variables with known probability distributions. This paper concentrates on identifying the shortest path and the M shortest paths in the network and on using the M paths to identify surrogate stochastic networks which are amenable for deriving analytical solutions. First, it identifies the M shortest paths using a certain form of stochastic dominance. Second, it identifies the M shortest paths by applying the deterministic methods to the network resulting from replacing the random length of every arc by its mean value. The two sets of the M paths are compared with those obtained by Monte Carlo sampling. Finally, the paper investigates how the distributional properties of the shortest path in the surrogate network compare with those of the shortest path in the original stochastic network.


Sign in / Sign up

Export Citation Format

Share Document