iterative method

(redirected from Iterative procedure)

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 ?
In the presented bending problem the full Newton-Raphson iterative procedure is chosen to solve the iteration process and nonlinear equations of motion.
Following [3], denoting the basic iterative procedure on each level by the operator T, the cascadic multigrid method can be rewritten as:
This is the iterative procedure and its length is determined by the quality of the communication, as well as the level of the users' criteria.
Zellner's iterative procedure has been used to estimate the model consisting of the cost Equation (1) along with the input demand Equations (2).
The same iterative procedure is, therefore, continued until the target safety/risk level is reached.
The solution to such a coupled problem often needs an iterative procedure.
To obtain more accurate results, in this paper, the catenary cable element was adopted to model the suspension bridges' main cable system, the sliding effect was considered in the form-finding procedure based on the assumption that the main cable on the saddles' aspect is tangent to the saddles' surface, and then, the calculation procedure for form-finding analysis under bridge finished state and tangent stiffness matrix for the flexibility iterative procedure were given and derived, respectively, the form-finding analysis for other construction stages was also discussed.
In this paper, an iterative procedure originating in spectroscopy in the 1930's, is adapted into a useful tool for solving a wide class of 2D nonlinear backward parabolic equations.
In 1953, Mann [27] introduced the Mann iterative procedure (cf.
Sastry and Babu [5] proved that any fixed point of a Lipschitzian pseudocontractive self mapping of a non-empty closed convex subset K of a Banach space X is unique and may be norm approximated by Mann iterative procedure (1.
It is found that the best and simplest way to solve the equation system is by an iterative procedure.
The initialization and reinicialization of the iterative procedure (34) is given by

Full browser ?