اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدError estimates with explicit constants for the Sinc approximation over infinite intervals
247
0
0.0
(
0
)
تأليف
Tomoaki Okayama
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined with a proper variable transformation. The convergence rate has been analyzed for typical cases including finite, semi-infinite, and infinite intervals. Recently, for verified numerical computations, a more explicit, computable error bound has been given in the case of a finite interval. In this paper, such explicit error bounds are derived for other cases.
قيم البحث
اقرأ أيضاً
The Sinc quadrature and the Sinc indefinite integration are approximation formulas for definite integration and indefinite integration, respectively, which can be applied on any interval by using an appropriate variable transformation. Their converge
nce rates have been analyzed for typical cases including finite, semi-infinite, and infinite intervals. In addition, for verified automatic integration, more explicit error bounds that are computable have been recently given on a finite interval. In this paper, such explicit error bounds are given in the remaining cases on semi-infinite and infinite intervals.
The Sinc approximation has shown high efficiency for numerical methods in many fields. Conformal maps play an important role in the success, i.e., appropriate conformal map must be employed to elicit high performance of the Sinc approximation. Approp
riate conformal maps have been proposed for typical cases; however, such maps may not be optimal. Thus, the performance of the Sinc approximation may be improved by using another conformal map rather than an existing map. In this paper, we propose a new conformal map for the case where functions are defined over the semi-infinite interval and decay exponentially. Then, we demonstrate in both theoretical and numerical ways that the convergence rate is improved by replacing the existing conformal map with the proposed map.
This paper reinforces numerical iterated integration developed by Muhammad--Mori in the following two points: 1) the approximation formula is modified so that it can achieve a better convergence rate in more general cases, and 2) explicit error bound
is given in a computable form for the modified formula. The formula works quite efficiently, especially if the integrand is of a product type. Numerical examples that confirm it are also presented.
Benfords law states that for many random variables X > 0 its leading digit D = D(X) satisfies approximately the equation P(D = d) = log_{10}(1 + 1/d) for d = 1,2,...,9. This phenomenon follows from another, maybe more intuitive fact, applied to Y :=
log_{10}(X): For many real random variables Y, the remainder U := Y - floor(Y) is approximately uniformly distributed on [0,1). The present paper provides new explicit bounds for the latter approximation in terms of the total variation of the density of Y or some derivative of it. These bounds are an interesting alternative to traditional Fourier methods which yield mostly qualitative results. As a by-product we obtain explicit bounds for the approximation error in Benfords law.
In this paper we present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any cases. This approach allows to give a notion of divisibility and in some
cases an euclidian division. We introduce differential calculus and give some applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
