Abstract
The problem of constructing an explicit formula for a majorant of a number sequence specified by recurrence relations is considered. Problems of this kind arise when estimating the error of recursive methods for calculating certain functions of a real variable. A special approach to studying the given recurrence relations is proposed in this work, based on which it is established that a majorant can be provided by a quite specific formula and belongs to the class of subexponential functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Yu. Solov’ev, “An algorithm for calculating logarithms through displacement,” Mosc. Univ. Comput. Math. Cybern. 37, 83 (2013).
V. V. Bykova, “Mathematical methods for the analysis of recursive algorithms,” Zh. Sib. Univ., Ser. Mat. Fiz. 1(3), 236–246 (2008).
V. A. Ilyin and E. G. Poznyak, Fundamentals of Mathematical Analysis (Nauka, Moscow, 1998; Mir, Moscow, 1982), Part 1.
V. A. Goloveshkin and M. V. Ul’yanov, “Complexity classification method for algorithms based on angular measure of functions’ asymptotic increase,” Vychisl. Tekhnol. 11(1), 52–62 (2006).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Russian Text © The Author(s), 2019, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2019, No. 2, pp. 19–27.
About this article
Cite this article
Goloveshkin, V.A., Solov’ev, S.Y. Error Estimate for the Displacement Method. MoscowUniv.Comput.Math.Cybern. 43, 65–73 (2019). https://doi.org/10.3103/S0278641919020043
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641919020043