✦ LIBER ✦

A new subdivision for computing fixed points with a homotopy algorithm

✍ Scribed by G. van der Laan; A. J. J. Talman

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 819 KB
Volume: 19
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581629

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simplicial homotopy algorithm for comp

A simplicial homotopy algorithm for computing zero points on polytopes

✍ Kaizhou Chen; Zaifu Yang; Zhengli Liang 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 568 KB

A restart algorithm for computing fixed

A restart algorithm for computing fixed points without an extra dimension

✍ G. van der Laan; A. J. J. Talman 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 562 KB

A globally convergent algorithm for comp

A globally convergent algorithm for computing fixed points of C2 maps

✍ Layne T. Watson 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 805 KB

A fixed point algorithm with economic ap

A fixed point algorithm with economic applications

✍ Arvind Khilnani; Edison Tse 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A new constrained fixed-point algorithm

A new constrained fixed-point algorithm for ordering independent components

✍ Hongjuan Zhang; Chonghui Guo; Zhenwei Shi; Enmin Feng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Independent component analysis (ICA) aims to recover a set of unknown mutually independent components (ICs) from their observed mixtures without knowledge of the mixing coefficients. In the classical ICA model there exists ICs' indeterminacy on permutation and dilation. Constrained ICA is one of met

A Two-Dimensional Bisection Envelope Alg

A Two-Dimensional Bisection Envelope Algorithm for Fixed Points

✍ Spencer Shellman; K. Sikorski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 512 KB