An analog scheme for fixed point computation: I. Iheory

Borkar, V. S. ; Soumyanatha, K. (1997) An analog scheme for fixed point computation: I. Iheory IEEE Transactions on Circuits and Systems Part I: Fundamental Theory and Applications, 44 (4). pp. 351-355. ISSN 1057-7122

Full text not available from this repository.

Official URL:

Related URL:


An analog system for fixed point computation is described. The system is derived from a continuous time analog of the classical over-relaxed fixed point iteration. The dynamical system is proved to converge for nonexpansive mappings under all p norms, p∈(1,∞). This extends previously established results to not necessarily differentiable maps which are nonexpansive under the 8-norm. The system will always converge to a single fixed point in a connected set of fixed points. This allows the system to function as a complementary paradigm to energy minimization techniques for optimization in the analog domain. It is shown that the proposed technique is applicable to a large class of dynamic programming computations.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:81484
Deposited On:06 Feb 2012 04:56
Last Modified:06 Feb 2012 04:56

Repository Staff Only: item control page