𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a class of omnibus algorithms for zero-finding

✍ Scribed by Andrzej Kozek; Anna Trzmielak-Staniseawska

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
730 KB
Volume
5
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 CONVERGENCE OF ZERO-FINDING EIGEN
ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS
✍ MOHAMMEDI R. ABDEL-AZIZ πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 2 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ΓΏnding technique for solving the non-linear eigenvalue problems. The main