We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.
Journal of Physics: Conference Series PAPER • THE FOLLOWING ARTICLE ISOPEN ACCESS Estimate the Rate of Contamination in Baghdad Soils By Using Numerical Method Luma Naji Mohammed Tawfiq1, Nadia H Al-Noor2 and Taghreed H Al-Noor1 Published under licence by IOP Publishing Ltd Journal of Physics: Conference Series, Volume 1294, Issue 3 Citation Luma Naji Mohammed Tawfiq et al 2019 J. Phys.: Conf. Ser. 1294 032020 DOI 10.1088/1742-6596/1294/3/032020 DownloadArticle PDF References Download PDF 135 Total downloads 88 total citations on Dimensions. Turn on MathJax Share this article Share this content via email Share on Facebook (opens new window) Share on Twitter (opens new window) Share on Mendeley (opens new window) Hide article and author
... Show MoreMarket share is a major indication of business success. Understanding the impact of numerous economic factors on market share is critical to a company’s success. In this study, we examine the market shares of two manufacturers in a duopoly economy and present an optimal pricing approach for increasing a company’s market share. We create two numerical models based on ordinary differential equations to investigate market success. The first model takes into account quantity demand and investment in R&D, whereas the second model investigates a more realistic relationship between quantity demand and pricing.
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
The research dealt with a comparative study between some semi-parametric estimation methods to the Partial linear Single Index Model using simulation. There are two approaches to model estimation two-stage procedure and MADE to estimate this model. Simulations were used to study the finite sample performance of estimating methods based on different Single Index models, error variances, and different sample sizes , and the mean average squared errors were used as a comparison criterion between the methods were used. The results showed a preference for the two-stage procedure depending on all the cases that were used