A survey on the high convergence orders and computational convergence orders of sequences

Emil Cătinaş

Applied Mathematics and Computation, 2019, vol. 343, issue C, 1-20

Abstract: Twenty years after the classical book of Ortega and Rheinboldt was published, five definitions for the Q-convergence orders of sequences were independently and rigorously studied (i.e., some orders characterized in terms of others), by Potra (1989), resp. Beyer, Ebanks and Qualls (1990). The relationship between all the five definitions (only partially analyzed in each of the two papers) was not subsequently followed and, moreover, the second paper slept from the readers attention.

Keywords: Convergent sequences in Rn; Q-, C-, and R-convergence orders of sequences; Computational convergence orders (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318306453
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:343:y:2019:i:c:p:1-20

DOI: 10.1016/j.amc.2018.08.006

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().