On a class of omnibus algorithms for zero-finding

Andrzej Kozek; Anna Trzmielak-Staniseawska

doi:10.1016/0885-064X(89)90014-9

On a class of omnibus algorithms for zero-finding

Andrzej Kozek^*, Anna Trzmielak-Staniseawska

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	80-95
Number of pages	16
Journal	Journal of Complexity
Volume	5
Issue number	1
DOIs	https://doi.org/10.1016/0885-064X(89)90014-9
Publication status	Published - 1989
Externally published	Yes

Access to Document

10.1016/0885-064X(89)90014-9

Cite this

@article{c1bd83912b354bddb51b02fe46f2af32,

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.",

author = "Andrzej Kozek and Anna Trzmielak-Staniseawska",

year = "1989",

doi = "10.1016/0885-064X(89)90014-9",

language = "English",

volume = "5",

pages = "80--95",

journal = "Journal of Complexity",

issn = "0885-064X",

publisher = "ACADEMIC PRESS INC ELSEVIER SCIENCE",

number = "1",

}

TY - JOUR

T1 - On a class of omnibus algorithms for zero-finding

AU - Kozek, Andrzej

AU - Trzmielak-Staniseawska, Anna

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=18044373291&partnerID=8YFLogxK

U2 - 10.1016/0885-064X(89)90014-9

DO - 10.1016/0885-064X(89)90014-9

M3 - Article

AN - SCOPUS:18044373291

SN - 0885-064X

VL - 5

SP - 80

EP - 95

JO - Journal of Complexity

JF - Journal of Complexity

IS - 1

ER -

On a class of omnibus algorithms for zero-finding

Abstract

Access to Document

Other files and links

Fingerprint

Cite this