Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Modified Chebyshev Picard Iteration is a numerical method for integrating Ordinary Differential Equations. MCPI in a serial… 
2014
2014
For conservative systems, a common method for validating accuracy is that the Hamiltonian or a similar energy integral of a… 
2013
2013
Abstract : The choice of appropriate contract types is very situationally dependent, and a number of factors must be taken into… 
2008
2008
A hollow-core photonic crystal fiber Fabry-Perot interferometric (HC-PCF-FPI) strain sensing system is proposed and demonstrated… 
2006
2006
The Freiburger Personality Inventory (FPI) was administered to 49 people practicing the Transcendental Meditation technique… 
2006
2006
We establish a general theorem to approximate fixed points of z-operators on an ormed space through the Mann iteration process… 
2005
2005
This paper proposes a method of automatic gait recognition using Fourier descriptors and independent component analysis (ICA) for… 
2004
2004
We define a random iteration scheme and consider its convergence to a common random fixed point of two random operators defined… 
Highly Cited
2000
Highly Cited
2000
This paper presents a new approach to modeling end-toend performance for IP networks. Unlike earlier models, in which end… 
1985
1985
A methodology for handling a class of stiff multiparticle parabolic PDE's in one and two dimensions is presented. The particular…