Results 251 to 260 of about 9,422,773 (291)
Some of the next articles are maybe not open access.
Iterative Lexicographic Path Orders
2006We relate Kamin and Levy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem.
Jan Willem Klop +2 more
openaire +6 more sources
Canadian Journal of Mathematics, 1950
The body of this paper is a complete answer to the following question:Let E be any space whatever. g(x) is a function mapping E into E. When does there exist a function f(x), of the same type, such that(1)
openaire +1 more source
The body of this paper is a complete answer to the following question:Let E be any space whatever. g(x) is a function mapping E into E. When does there exist a function f(x), of the same type, such that(1)
openaire +1 more source
The College Mathematics Journal, 1999
(1999). Second Order Iterations. The College Mathematics Journal: Vol. 30, No. 5, pp. 393-396.
Joseph J. Roseman, Gideon Zwas
openaire +1 more source
(1999). Second Order Iterations. The College Mathematics Journal: Vol. 30, No. 5, pp. 393-396.
Joseph J. Roseman, Gideon Zwas
openaire +1 more source
Orders of Convergence for Iterative Procedures
SIAM Journal on Numerical Analysis, 1971This paper is concerned with the order of convergence of iterative procedures for finding a zero of a nonlinear function defined on $R^n $. Some of the results provide conditions for determining the precise order of convergence of a method rather than the usual lower bound on the order.
openaire +2 more sources
Supporting Partial Ordering with the Parallel Iterator
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, 2009With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a program rests within iterative computations. In object-oriented languages these are commonly handled using iterators which are inadequate for parallel programming. Consequently,
Nasser Giacaman, Oliver Sinnen
openaire +2 more sources
On a Multivalued Iterative Equation of Order n
Journal of Convex Analysis, 2011Because of no Lipschitz condition for upper semi-continuous (usc for short) multifunctions and some other technical difficulties, only the second order polynomial-like iterative equation with multifunctions was discussed but the general case of order n remains open.
Xu, Bing +2 more
openaire +2 more sources
Optimal Eighth Order Iterative Methods
Mathematics in Computer Science, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Dynamics of a fifth-order iterative method
International Journal of Computer Mathematics, 2012In this paper, we study the dynamical behaviour of a two-point iterative method with order of convergence five to solve nonlinear equations in the complex plane. In fact, we complement the dynamical study started in previous works with a more systematic analysis for polynomials with at most two different roots and different multiplicities. In addition,
José Manuel Gutiérrez Jiménez +2 more
openaire +1 more source
The dual iteration for fixed-order control
IEEE Transactions on Automatic Control, 1997Summary: This paper proposes a new heuristic algorithm for fixed-order control problems using linear matrix inequalities. The authors call the algorithm the dual iteration because it is based on the iteration of two design steps, state feedback and filtering, which are dual to each other. Extensive numerical experiments will show that the algorithm has
openaire +2 more sources
Iterated line graphs are maximally ordered
Journal of Graph Theory, 2006AbstractA graph G is k‐ordered if for every ordered sequence of k vertices, there is a cycle in G that encounters the vertices of the sequence in the given order. We prove that if G is a connected graph distinct from a path, then there is a number tG such that for every t ≥ tG the t‐iterated line graph of G, Lt (G), is (δ(Lt (G)) + 1)‐ordered.
Martin Knor, Ludovít Niepel
openaire +3 more sources

