Approximating the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e331" altimg="si11.svg"><mml:mi>p</mml:mi></mml:math>th root by composite rational functions
نویسندگان
چکیده
A landmark result from rational approximation theory states that x1∕p on [0,1] can be approximated by a type-(n,n) function with root-exponential accuracy. Motivated the recursive optimality property of Zolotarev functions (for square root and sign functions), we investigate approximating composite form rk(x,rk−1(x,rk−2(⋯(x,r1(x,1))))). While this class ceases to contain minimax (best) approximant for p≥3, show it achieves approximately pth-root exponential convergence respect degree. Moreover, crucially, is doubly number degrees freedom, suggesting are able approximate related (such as |x| sector function) exceptional efficiency.
منابع مشابه
Approximating poles of complex rational functions
In this paper we investigate the application of the Nelder– Mead simplex method to approximate poles of complex rational functions. To our knowledge, there isn’t any algorithm which is able to find the poles of a function when only the values on the unit circle are given. We will show that this method can accurately approximate 1, 2 or even 3 poles without any preliminary knowledge of their loc...
متن کاملA Lanczos method for approximating composite functions
We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We present a Lanczos-based procedure that implicitly approximates g with a polynomial of f . By constructing a quadrature rule for the density function of f , we c...
متن کاملApproximating Rational Numbers by Fractions
In this paper we show a polynomial-time algorithm to find the best rational approximation of a given rational number within a given interval. As a special case, we show how to find the best rational number that after evaluating and rounding exactly matches the input number. In both results, “best” means “having the smallest possible denominator”.
متن کاملApproximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximating Boolean functions with respect to given distributions on the inputs. We present a new type of reduction for one–round communication problems that is suitable for approximations. Using this new type of reduction, we ...
متن کاملApproximating Ropelength by Energy Functions
The ropelength of a knot is the quotient of its length by its thickness. We consider a family of energy functions R for knots, depending on a power p, which approach ropelength as p increases. We describe a numerically computed trefoil knot which seems to be a local minimum for ropelength; there are nearby critical points for R, which are evidently local minima for large enough p. 1. Thickness ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2021
ISSN: ['0021-9045', '1096-0430']
DOI: https://doi.org/10.1016/j.jat.2021.105577