Fixed-point iteration

Known as: Fixed point iteration, Fixed point algorithm, Fixed point iteration method 
In numerical analysis, fixed-point iteration is a method of computing fixed points of iterated functions. More specifically, given a function defined… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We discuss the problem of finding approximate solutions of the equation 0 ) (  x f (1) In some cases it is possible to find the… (More)
  • figure 1.1
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
Is this relevant?
2010
2010
In many iterative schemes, the precision of each step depends on the computational effort spent on that step. A method of… (More)
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Suppose that C is a nonempty closed convex subset of a real uniformly convex Banach space X . Let T : C→ C be an asymptotically… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The concept of weak contraction is introduced and compared to some known metrical contractive type mappings and then two fixed… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We study convergences of Mann and Ishikawa iteration processes for mappings of asymptotically quasi-nonexpansive type in Banach… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
As ontology development becomes a more ubiquitous and collaborative process, the developers face the problem of maintaining… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce a novel fast algorithm for independent component analysis, which can be used for blind source separation and feature… (More)
  • figure 4
  • table III
Is this relevant?
1992
1992
In the context of abstract interpretation we study the number of times a functional need to be unfolded in order to give the… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
1992
1992
This paper provides a link between the formulation of static program analyses using the framework of abstract interpretation… (More)
  • figure 2
Is this relevant?
1991
1991
Many climate models compute steady states via a fixed point or pseudo time-stepping algorithm. In order to optimize model… (More)
Is this relevant?