✦ LIBER ✦

An infinite precision bracketing algorithm with guaranteed convergence

✍ Scribed by P. Favati; G. Lotti; O. Menchi; F. Romani

Book ID: 110385538
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 93 KB
Volume: 20
Category: Article
ISSN: 1017-1398
DOI: 10.1023/a:1019135313527

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ACO algorithms with guaranteed convergen

ACO algorithms with guaranteed convergence to the optimal solution

✍ Walter J. Gutjahr 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 105 KB

An algorithm for finding all shortest pa

An algorithm for finding all shortest paths using N2.81 infinite-precision multiplications

✍ G. Yuval 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Two Efficient Algorithms with Guaranteed

Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

✍ Bus, J. C. P.; Dekker, T. J. 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 809 KB

An Improved Adaptive Algorithm for Const

An Improved Adaptive Algorithm for Constrained Notch Filters with Guaranteed Stability

✍ Jiong Zhou; Gang Li 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 209 KB

Convergence and error estimate of cascad

Convergence and error estimate of cascade algorithms with infinitely supported masks inLp(ℝs)

✍ JianBin Yang; Song Li 📂 Article 📅 2011 🏛 SP Science China Press 🌐 English ⚖ 262 KB

Wittrick–Williams algorithm proof of bra

Wittrick–Williams algorithm proof of bracketing and convergence theorems for eigenvalues of constrained structures with positive and negative penalty parameters

✍ S. Ilanko; F. W. Williams 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

## Abstract The well‐established Wittrick–Williams algorithm is used to derive novel and general proofs that show that the eigenvalues of systems with constraints can be bracketed by replacing the constraints by positive and negative pairs of either ordinary or inertial penalty parameters. It is al