Abstract
This paper deals with the problem of approximate evaluation of a certain class of analytic functions. The choice of this class is motivated by the problem of the summation of moment sequences. By assuming that the information about the function is given by its Taylor coefficients, we are able to establish a lower bound on the error of an arbitrary algorithm. We present also an algorithm whose error is asymptotically at most twice the lower bound, thereby showing that our estimate is asymptotically sharp.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
