iterative method

(redirected from Iterative algorithm)

iterative method

[′īd·ə‚rād·iv ′meth·əd]
(mathematics)
Any process of successive approximation used in such problems as numerical solution of algebraic equations, differential equations, or the interpolation of the values of a function. Also known as iteration.
References in periodicals archive ?
Bu: An iterative algorithm for a general system of variational inequalities and fixed point problems in q-uniformly smooth Banach spaces, Optim Lett.
6] put forward an exact solution by adopting branch and bound algorithm that takes advantage of the event-driven time incremental method to solve the resource-constrained project scheduling problem; Shou [7] proposed using iterative algorithm to optimize the project scheduling problem; Cheng and Wu [8] worked out a hybrid intelligent algorithm by combining branch and bound algorithm and heuristic algorithm as a solution to such problems; Liu et al.
An algorithm for local search was employed for the optimum location of piles beneath a separate beam of the grillage (Belevicius, Valentinavicius 2001, 2000) and under the whole grillage using an iterative algorithm on the basis of the above mentioned work (Belevicius et al.
Now, the iterative algorithm for solving Problem 1.
The second algorithm is similar to the first algorithm, in the sense that, it is also an iterative algorithm.
The main aim of our paper is the development of an iterative algorithm for the minimization of (1.
Just like Weierstrass-Durand-Kerner (WDK) algorithm, Aberth Algorithm is an iterative algorithm to find all the roots of a polynomial, simultaneously.
Iterative algorithm of a gradient method used to determine a saddle point of a functional with constraints
In this paper, motivated by the research going on in this direction [4,5,7,9,10,13-17,19,20,22-25,27], we introduce a general iterative algorithm for the problem of finding a common element in the set of solutions to problem (1.
K-means uses an iterative algorithm that minimizes the sum of distances from each object to its cluster centroid, over all clusters (4).
Guinand, "An iterative algorithm for asynchronous coded multi-user detection," IEEE Commun.
To optimize reactive processing conditions and then design macromolecular materials according to requirements, a new semi-implicit iterative algorithm is proposed to deal with the complicated relationships among the various variables.