Results 261 to 270 of about 9,422,773 (291)
Some of the next articles are maybe not open access.
Ordering of the iterative parameters in the cyclical Chebyshev iterative method
USSR Computational Mathematics and Mathematical Physics, 1971Abstract A SOLUTION is offered for the problem of ordering the parameters in a cyclical iterative method used for solving the equation Au = f, in such a way as to eliminate computational instability.
Lebedev, V. I., Finogenov, S. A.
openaire +3 more sources
High‐order iterative bracketing methods
International Journal for Numerical Methods in Engineering, 2013SUMMARYThis paper presents high‐order, single‐point, iterative methods for the numerical solution of the general non‐linear equilibrium equation. The methods are designed so that the approximations provided by the iterative process alternate about the targeted root, thus providing progressively better upper, as well as lower bounds on the sought root ...
openaire +1 more source
A Survey on Fractional-Order Iterative Learning Control
Journal of Optimization Theory and Applications, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Li 0004 +3 more
openaire +1 more source
Optimal Order of One-Point and Multipoint Iteration
Journal of the ACM, 1974The problem is to calculate a simple zero of a nonlinear function ƒ by iteration. There is exhibited a family of iterations of order 2 n -1 which use n evaluations of ƒ and no derivative ...
H. T. Kung 0001, Joseph F. Traub
openaire +3 more sources
Higher-order chaotic iteration sequences
1993Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for Prolog programs and in abstract interpretation when only parts of a fixpoint result is needed to perform program optimisations. In the first part of this paper we reexamine the
openaire +2 more sources
Recursion versus iteration at higher-orders
1997We extend the well-known analysis of recursion-removal in first-order program schemes to a higher-order language of finitely typed and polymorphically typed functional programs, the semantics of which is based on call-by-name parameter-passing. We introduce methods for recursion-removal, i.e.
openaire +2 more sources
Orders of convergence for superlineary convergent chaotic iterations
Computing, 1991If on computers with multiprocessors individual processors are allowed to proceed without waiting for each other it is natural to consider so- called chaotic iterations for computations on such computers. The author proves a theorem giving conditions for superlinear convergence of chaotic iterations in an appropriate setting.
openaire +2 more sources
2017
We develop sixth-order iterative methods in order to approximate zeros x of the function f defined on the real line. This method can be used to solve many 64problems from computational sciences and other disciplines [14,17,25,34,36,37].
Argyros, Ioannis K +1 more
openaire +2 more sources
We develop sixth-order iterative methods in order to approximate zeros x of the function f defined on the real line. This method can be used to solve many 64problems from computational sciences and other disciplines [14,17,25,34,36,37].
Argyros, Ioannis K +1 more
openaire +2 more sources