๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Mrozowski, M.

Book ID
114552116
Publisher
IEEE
Year
1988
Tongue
English
Weight
560 KB
Volume
36
Category
Article
ISSN
0018-9480

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

An efficient algorithm for finding a pat
An efficient algorithm for finding a path subject to two additive constraints
โœ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satisยฎes a number of QoS constraints. For two or more additive constraints, the problem of ยฎnding a feasible path is NP-complete that cannot be exactly solved