An Optimal Algorithm for the δ-ziti Method to Solve Some Mathematical Problems
Authors
Abstract:
The numerical approximation methods of the differential problems solution are numerous and various. Their classifications are based on several criteria: Consistency, precision, stability, convergence, dispersion, diffusion, speed and many others. For this reason a great interest must be given to the construction and the study of the associated algorithm: indeed the algorithm must be simple, robust, less expensive and fast. In this paper, after having recalled the δ-ziti method, we reformulat it to obtain an algorithm that does not require as many calculations as many nodes knowing that they are counted by thousands. We have, therefore, managed to optimize the number of iterations by passing for example from 103 at 10 iterations.
similar resources
An Efficient Method to Solve the Mathematical Model of HIV Infection for CD8+ T-Cells
In this paper, the mathematical model of HIV infection for CD8+ T-cells is illustrated. The homotopy analysis method and the Laplace transformations are combined for solving this model. Also, the convergence theorem is proved to demonstrate the abilities of presented method for solving non-linear mathematical models. The numerical results for $N=5, 10$ are presented. Several $hbar$-c...
full textAn Efficient Meta Heuristic Algorithm to Solve Economic Load Dispatch Problems
The Economic Load Dispatch (ELD) problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA), for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to lim...
full textالگوریتم های القایی سیمپلکس برای حل رده ای از مسائل برنامه ریزی محدب
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
The comparison of optimal homotopy asymptotic method and homotopy perturbation method to solve Fisher equation
In recent years, numerous approaches have been applied for finding the solutions of functional equations. One of them is the optimal homotopy asymptotic method. In current paper, this method has been applied for obtaining the approximate solution of Fisher equation. The reliability of the method will be shown by solving some examples of various kinds and comparing the obtained outcomes with the ...
full textAn optimal analytical method for nonlinear boundary value problems based on method of variation of parameter
In this paper, the authors present a modified convergent analytic algorithm for the solution of nonlinear boundary value problems by means of a variable parameter method and briefly, the method is called optimal variable parameter method. This method, based on the embedding of a parameter and an auxiliary operator, provides a computational advantage for the convergence of the approximate soluti...
full textthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMy Resources
Journal title
volume 18 issue 1
pages 109- 129
publication date 2023-04
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023