✦ LIBER ✦

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

✍ Scribed by Bus, J. C. P.; Dekker, T. J.

Book ID: 124159575
Publisher: Association for Computing Machinery
Year: 1975
Tongue: English
Weight: 809 KB
Volume: 1
Category: Article
ISSN: 0098-3500
DOI: 10.1145/355656.355659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding zeros

An efficient algorithm for finding zeros of a real function of two variables

✍ Mrozowski, M. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 560 KB

Efficient Hybrid Algorithms for Finding

Efficient Hybrid Algorithms for Finding Zeros of Convex Functions

✍ Florian A. Potra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 533 KB

We consider two hybrid algorithms for finding an \(\varepsilon\)-approximation of a root of a convex real function that is twice differentiable and satisfies a certain growth condition on the intervial \([0, R]\). The first algorithm combines a binary search procedure with Newton's method. The binar

On the guaranteed convergence of new two

On the guaranteed convergence of new two-point root-finding methods for polynomial zeros

✍ Petković, Miodrag S.; Rančić, Lidija Z. 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 571 KB

Convergence of algorithms for finding sa

Convergence of algorithms for finding saddle points

✍ E. A. Nurminskii; P. I. Verchenko 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 415 KB

On a class of omnibus algorithms for zer

On a class of omnibus algorithms for zero-finding

✍ Andrzej Kozek; Anna Trzmielak-Staniseawska 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 730 KB

A modified orthogonal-descent algorithm

A modified orthogonal-descent algorithm for finding the zero of a complex function

✍ M. B. Shchepakin; I. A. Shubenkova 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 482 KB