On a class of omnibus algorithms for zero-finding

Andrzej Kozek*, Anna Trzmielak-Staniseawska

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)80-95
Number of pages16
JournalJournal of Complexity
Volume5
Issue number1
DOIs
Publication statusPublished - 1989
Externally publishedYes

Fingerprint Dive into the research topics of 'On a class of omnibus algorithms for zero-finding'. Together they form a unique fingerprint.

Cite this