Back to Search
Start Over
A survey on the high convergence orders and computational convergence orders of sequences.
- Source :
-
Applied Mathematics & Computation . Feb2019, Vol. 343, p1-20. 20p. - Publication Year :
- 2019
-
Abstract
- 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. The main aim of this paper is to provide a rigorous, selfcontained, and, as much as possible, a comprehensive picture of the theoretical aspects of this topic, as the current literature has taken away the credit from authors who obtained important results long ago. Moreover, this paper provides rigorous support for the numerical examples recently presented in an increasing number of papers, where the authors check the convergence orders of different iterative methods for solving nonlinear (systems of) equations. Tight connections between some asymptotic quantities defined by theoretical and computational elements are shown to hold. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 343
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 132578308
- Full Text :
- https://doi.org/10.1016/j.amc.2018.08.006