Results 1  10
of
707,749
CONVERGENCE THEORY FOR ITERATIVE PROCEDURES
"... We thank a CoEditor and two referees for comments and criticisms that led to signicant improvements in this paper. We also thank Roger Klein for providing us with Gauss code to compute his estimator. 1 ..."
Abstract
 Add to MetaCart
We thank a CoEditor and two referees for comments and criticisms that led to signicant improvements in this paper. We also thank Roger Klein for providing us with Gauss code to compute his estimator. 1
Accelerated Domain Decomposition Iterative Procedures for
"... A nonoverlapping domain decomposition iterative procedure based on Robin transmission conditions applicable to elliptic boundary problems was rst introduced by P. L. Lions and later discussed by a number of authors under the assumption that the weighting of the ux and the trace of the solution i ..."
Abstract
 Add to MetaCart
A nonoverlapping domain decomposition iterative procedure based on Robin transmission conditions applicable to elliptic boundary problems was rst introduced by P. L. Lions and later discussed by a number of authors under the assumption that the weighting of the ux and the trace of the solution
An iterative procedure for evaluating digraph competitions
 Annals of Operations Research
, 2002
"... Borm, P. E. M., van den Brink, J. R., & Slikker, M. (2000). An Iterative Procedure for Evaluating Digraph Competitions. (FEW Research Memorandum; Vol. 788). Tilburg: Microeconomics. General rights Copyright and moral rights for the publications made accessible in the public portal are retained ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Borm, P. E. M., van den Brink, J. R., & Slikker, M. (2000). An Iterative Procedure for Evaluating Digraph Competitions. (FEW Research Memorandum; Vol. 788). Tilburg: Microeconomics. General rights Copyright and moral rights for the publications made accessible in the public portal are retained
N.: Stability of Jungcktype iterative procedures
 International Journal of Mathematics and Mathematical Sciences
, 2005
"... We introduce and discuss the stability of Jungck and JungckMann iterative procedures for a pair of JungckOsiliketype maps on an arbitrary set with values in a metric or linear metric space. 1. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We introduce and discuss the stability of Jungck and JungckMann iterative procedures for a pair of JungckOsiliketype maps on an arbitrary set with values in a metric or linear metric space. 1.
An Iterative Procedure for Evaluating Digraph Competitions
, 2000
"... A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph. Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ranking) of the nodes as an allocation problem wh ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
where we redistribute the initial weights on the basis of insights from cooperative game theory. After describing the resulting procedure of redistributing the initial weights, we describe an iterative process is described which repeats this procedure: at each step the allocation obtained
Iterative procedure for multidimensional Euler equations
"... this paper. It is sometimes useful to introduce the integral substitution y = x which transforms (1.14) into ae(t n + #x) = (aev i )(t n + #x) = x i y i f n (y# y# (1.16) + 3 Z ;1 2 y) 1 T (t n # y) y: 2 Deterministic integration method, Par ..."
Abstract
 Add to MetaCart
this paper. It is sometimes useful to introduce the integral substitution y = x which transforms (1.14) into ae(t n + #x) = (aev i )(t n + #x) = x i y i f n (y# y# (1.16) + 3 Z ;1 2 y) 1 T (t n # y) y: 2 Deterministic integration method, Part I : The trapezoidal rule In this section we apply the trapezoidal rule to the integral representations (1.14). At the beginning we need a suOEciently large rectangular domain (2.1) so that the Maxwellian f n (y# c) in (1.15) is suOEciently small outside of R
Iterative Procedure for Uniform Continuous Mapping.
"... Let K be a closed convex nonempty subset of a normed linear space E and let {}N ii T 1 = be a finite family of self maps on K such that T1 is a uniformly continuous uniformly hemicontractive map and T1(K) is a bounded set with φ≠ = =))( ( 1 i N i TFF I, sufficient conditions for the strong converg ..."
Abstract
 Add to MetaCart
convergence of an Nstep iteration process to a fixed common point of the family are proved
Discrete signals constructed through the multiplicative iterative procedure
"... The specific features of signals generated by the multiplicative iterative procedure and of their discrete Fourier transforms are discussed. It is shown that such signals exhibit the property of selfaffinity in the time and the frequency domain. Several examples of multiplicative signals and of the ..."
Abstract
 Add to MetaCart
The specific features of signals generated by the multiplicative iterative procedure and of their discrete Fourier transforms are discussed. It is shown that such signals exhibit the property of selfaffinity in the time and the frequency domain. Several examples of multiplicative signals
Iterative decoding of binary block and convolutional codes
 IEEE Trans. Inform. Theory
, 1996
"... Abstract Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the ..."
Abstract

Cited by 600 (43 self)
 Add to MetaCart
Abstract Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms
An iterative image registration technique with an application to stereo vision
 In IJCAI81
, 1981
"... Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton ..."
Abstract

Cited by 2872 (35 self)
 Add to MetaCart
Raphson iteration. Our technique is faster because it examines far fewer potential matches between the images than existing techniques. Furthermore, this registration technique can be generalized to handle rotation, scaling and shearing. We show show our technique can be adapted for use in a stereo vision system. 2
Results 1  10
of
707,749