Results 31 to 40 of about 560,761 (277)
A generalization of contraction principle
In this paper, a generalized mean value contraction is introduced. This contraction is an extension of the contractions of earlier researchers and of the generalized mean value non-expansive mapping.
K. M. Ghosh
doaj +1 more source
A fixed point theorem involving rational expressions without using Picard iteration
In this paper, we consider a certain fixed point theorem that contains some rational expressions. The main aim of this paper is to prove a fixed point theorem without using the Picard iteration.
Fulga Andreea
doaj +1 more source
Elimination and fixed point iterations
In fixed point iterations for linear systems, partial elimination effects a reduction of the spectral radii of Jacobi and Gauss-Seidel iteration matrices if the original Jacobi matrix is nonnegative. In the present paper the authors show that similar results also hold for nonlinear systems if the corresponding Jacobian matrix is nonnegative.
Milaszewicz, J.P., Abdel Masih, S.
openaire +1 more source
Fixed points and iteration homotopies [PDF]
Suppose that Ф is a topological space equipped with a Hausdorff topology and that T is a continuous function mapping Ф into Ф. We discuss the existence and uniqueness of fixed points of T and the convergence of the Picard sequence of iterates, from the viewpoint of the existence of a homotopy with special properties.
openaire +1 more source
This work proposes the Enhanced Fixed Point Method (EFPM) as a straightforward modification to the problem of finding an exact or approximate solution for a linear or nonlinear algebraic equation.
Uriel Filobello-Nino +6 more
doaj +1 more source
Numerical reckoning fixed points via new faster iteration process
In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlinear Convex Anal. 8, no. 1 (2007), 61-79], Thakur et al. [App. Math. Comp. 275 (2016), 147-155] and M [Filomat 32, no.
Kifayat Ullah +2 more
doaj +1 more source
A logic with temporally accessible iteration [PDF]
Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc.
Lisitsa, Alexei
core +2 more sources
Fixed-point elimination in the intuitionistic propositional calculus
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras are not complete
A Arnold +21 more
core +2 more sources
ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro +10 more
wiley +1 more source
Algorithms Based on Unions of Nonexpansive Maps
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be expressed as ...
Tam, Matthew K.
core +1 more source

