Results 1 to 10 of about 54,240 (145)

Fixed Point Iteration Based Algorithm for Asynchronous TOA-Based Source Localization. [PDF]

open access: yesSensors (Basel), 2022
This paper investigates the problem of source localization using signal time-of-arrival (TOA) measurements in the presence of unknown start transmission time.
Zou Y, Fan J, Wu L, Liu H.
europepmc   +2 more sources

Some fixed point iteration procedures [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1991
This paper provides a survey of iteration procedures that have been used to obtain fixed points for maps satisfying a variety of contractive conditions. The author does not claim to provide complete coverage of the literature, and admits to certain biases in the theorems that are cited herein.
B. E. Rhoades
openaire   +2 more sources

Fixed Point Iteration Method

open access: yesMANAS: Journal of Engineering, 2013
We discuss the problem of finding approximate solutions of the equation x)0 f()0 (1) In some cases it is possible to find the exact roots of the equation (1) for example when f(x) is a quadratic on cubic polynomial otherwise, in general, is interested in finding approximate solutions using some numerical methods. Here, we will discuss a method called
Mehmet Karakas
openaire   +3 more sources

Fixed point theorems in uniformly convex Banach spaces

open access: yesRatio Mathematica, 2023
In this article, we establish a concept of fixed point result in Uniformly convex Banach space. Our main finding uses the Ishikawa iteration technique in uniformly convex Banach space to demonstrate strong convergence.
Manoj Karuppasamy, R. Jahir Hussain
doaj   +1 more source

A New Modified Fixed-Point Iteration Process

open access: yesMathematics, 2021
In this paper, we present a new modified iteration process in the setting of uniformly convex Banach space. The newly obtained iteration process can be used to approximate a common fixed point of three nonexpansive mappings.
Chanchal Garodia   +2 more
doaj   +1 more source

Equivalence of Certain Iteration Processes Obtained by Two New Classes of Operators

open access: yesMathematics, 2021
The aim of this paper is two fold: the first is to define two new classes of mappings and show the existence and iterative approximation of their fixed points; the second is to show that the Ishikawa, Mann, and Krasnoselskij iteration methods defined for
Mujahid Abbas   +2 more
doaj   +1 more source

Iterative Schemes of Mean Nonexpansive Mapping

open access: yesJournal of Harbin University of Science and Technology, 2021
Based on Mann iteration, Ishikawa iteration and some other twostep iteration, threestep iteration methods, two new fourstep iteration schemes and one nstep iteration are constructed.
CUI Yunan , ZHANG Jiaxing
doaj   +1 more source

Differentiable Forward and Backward Fixed-Point Iteration Layers

open access: yesIEEE Access, 2021
Recently, several studies have proposed methods to utilize some classes of optimization problems in designing deep neural networks to encode constraints that conventional layers cannot capture.
Younghan Jeon   +2 more
doaj   +1 more source

Convergence and Stability of the Ishikawa Iterative Process for a class of ϕ-quasinonexpansive Mappings

open access: yesAfrican Scientific Reports, 2022
The paper analyzes the convergence of Ishikawa iteration to the fixed point of a class of '-quasinonexpansive mappings in uniformly convex Banach spaces, as well as the stability of the Ishikawa iteration used in approximating the fixed point.
F. D. Ajibade   +3 more
doaj   +1 more source

Introduction of new Picard–S hybrid iteration with application and some results for nonexpansive mappings [PDF]

open access: yesArab Journal of Mathematical Sciences, 2022
Purpose – In this paper, Picard–S hybrid iterative process is defined, which is a hybrid of Picard and S-iterative process. This new iteration converges faster than all of Picard, Krasnoselskii, Mann, Ishikawa, S-iteration, Picard–Mann hybrid, Picard ...
Julee Srivastava
doaj   +1 more source

Home - About - Disclaimer - Privacy