Paper Info
Title
On a class of omnibus algorithms for zero-finding
Abstract
In this paper we consider a class of omnibus, stationary, adaptive iterative algorithms with finite memory (SAFM-algorithms) endowed with a partial order. We show that our modification MR of Bus and Dekker algorithm R is asymptotically better for this order than R- and M-algorithms and bisections.
Year
DOI
Venue
1989
10.1016/0885-064X(89)90014-9
J. Complexity
Keywords
DocType
Volume
omnibus algorithm
Journal
5
Issue
ISSN
Citations 
1
Journal of Complexity
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
A. Kozek100.34
A. Trzmielak-Stanislawska200.34