نتایج جستجو برای: Approximating sequence

تعداد نتایج: 419159  

This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.

We prove a strong convergence result for a sequence generated by Halpern's type iteration for approximating a common fixed point of a countable family of quasi-Lipschitzian mappings in a real Hilbert space. Consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

Journal: :bulletin of the iranian mathematical society 2012
weerayuth nilsrakoo satit saejung

we prove a strong convergence result for a sequence generated by halpern's type iteration for approximating a common fixed point of a countable family of quasi-lipschitzian mappings in a real hilbert space. consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

‎In this article‎, ‎we discuss about solvability of infinite systems of singular integral equations with two variables in the Banach sequence space $C(I times I‎, ‎c)$ by applying measure of noncompactness‎ and Meir-Keeler condensing operators‎. By presenting an example, we have illustrated our results‎. ‎For validity of the results we introduce a modified semi-analytic method in the case of tw...

2000
Graham Cormode

There are several applications for schemes which approximately nd the distance between two sequences in a way that isòblivious' of one of the sequences up until a nal sublinear number of comparisons. This paper shows how sequences can be preprocessed obliviously to give a binary string, so that a simple vector distance between two bitstrings gives an approximation to a sequence distance of inte...

Journal: :Bulletin of the American Mathematical Society 1931

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید