نتایج جستجو برای: ishikawa iteration scheme

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

Journal: :J. Applied Mathematics 2013
Shin Min Kang Arif Rafiq Young Chel Kwun

Journal: :J. Optimization Theory and Applications 2014
Jonathan M. Borwein Matthew K. Tam

In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...

Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...

2009
W. Dahmen T. Rohwedder R. Schneider A. Zeiser

This article is concerned with recent developments of adaptive wavelet solvers for elliptic eigenvalue problems. We describe the underlying abstract iteration scheme of the preconditioned perturbed iteration. We apply the iteration to a simple model problem in order to identify the main ideas which a numerical realization of the abstract scheme is based upon. This indicates how these concepts c...

Journal: :Physical review. D, Particles and fields 1995
Deruelle Langlois

We clarify the links between a recently developped long wavelength iteration scheme of Einstein’s equations, the Belinski Khalatnikov Lifchitz (BKL) general solution near a singularity and the antinewtonian scheme of Tomita’s. We determine the regimes when the long wavelength or antinewtonian scheme is directly applicable and show how it can otherwise be implemented to yield the BKL oscillatory...

2011
B. E. Rhoades Zhiqun Xue Juan J. Nieto

Let X, d be a complete metric space, and let T be a self-map of X. If T has a unique fixed point, which can be obtained as the limit of the sequence {pn}, where pn Tp0, p0 any point of X, then T is called a Picard operator see, e.g., 1 , and the iteration defined by {pn} is called Picard iteration. One of the most general contractive conditions for which a map T is a Picard operator is that of ...

2016
Krzysztof Gdawiec

In this paper we propose to replace the standard Picard iteration in the Newton–Raphson method by Mann and Ishikawa iterations. This iteration’s replacement influence the solution finding process that can be visualized as polynomiographs for the square systems of equations. Polynomiographs presented in the paper, in some sense, are generalization of Kalantari’s polynomiography from a single pol...

Journal: :Journal of Mathematical Analysis and Applications 1973

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

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