Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2025
License: CC BY
Data sources: ZENODO
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

COMPAIRSION OF TAMED EULAR AND Ɛ-EULAR-MARUYAMA FOR STOCHASTIC DIFFERENTIAL EQUATIONS WITH LÉVY NOISE

Authors: Tawfiqullah Ayoubi; Mohammad Mahdi Mohammadi;

COMPAIRSION OF TAMED EULAR AND Ɛ-EULAR-MARUYAMA FOR STOCHASTIC DIFFERENTIAL EQUATIONS WITH LÉVY NOISE

Abstract

In this research we explore two numerical approaches for simulating the stochastic differential equations (SDEs) with Lévy noise. This study focus on a stochastic logistic equation (SLE) by two independent Lévy processes. The research assesses the Tamed Euler and ε–Euler–Maruyama methods, both method ware designe for SDEs with nonlinear coefficient. To measure their performance, two generally used error metrics—Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) are employed. Result shows that, the Tamed Euler scheme tends to produce more accurate approximations. Owing to, in cases involving strong noise and larger time step size, the ε–Euler–Maruyama method has better performace than Tamed approach. The investigation further examines how different parameters affect the precision and stability of each method. The results prove that both schemes are effective and suitable for numerically solving SDEs with Lévy noise.

Keywords

Stochastic differential equations, Lévy noise, Logistic growth model, Numerical solution.

  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average