اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReliable operations on oscillatory functions
30
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Approximate $p$-point Leibniz derivation formulas as well as interpolatory Simpson quadrature sums adapted to oscillatory functions are discussed. Both theoretical considerations and numerical evidence concerning the dependence of the discretization errors on the frequency parameter of the oscillatory functions show that the accuracy gain of the present formulas over those based on the exponential fitting approach [L. Ixaru, Computer Physics Communications, 105 (1997) 1--19] is overwhelming.
قيم البحث
اقرأ أيضاً
We develop two classes of composite moment-free numerical quadratures for computing highly oscillatory integrals having integrable singularities and stationary points. The first class of the quadrature rules has a polynomial order of convergence and
the second class has an exponential order of convergence. We first modify the moment-free Filon-type method for the oscillatory integrals without a singularity or a stationary point to accelerate their convergence. We then consider the oscillatory integrals without a singularity or a stationary point and then those with singularities and stationary points. The composite quadrature rules are developed based on partitioning the integration domain according to the wave number and the singularity of the integrand. The integral defined on a subinterval has either a weak singularity without rapid oscillation or oscillation without a singularity. The classical quadrature rules for weakly singular integrals using graded points are employed for the singular integral without rapid oscillation and the modified moment-free Filon-type method is used for the oscillatory integrals without a singularity. Unlike the existing methods, the proposed methods do not have to compute the inverse of the oscillator. Numerical experiments are presented to demonstrate the approximation accuracy and the computational efficiency of the proposed methods. Numerical results show that the proposed methods outperform methods published most recently.
This work settles the problem of constructing entropy stable non-oscillatory (ESNO) fluxes by framing it as a least square optimization problem. A flux sign stability condition is introduced and utilized to construct arbitrary order entropy stable fl
ux as a convex combination of entropy conservative and non-oscillatory flux. This simple approach is robust which does not explicitly requires the computation of costly dissipation operator and high order reconstruction of scaled entropy variable for constructing the diffusion term. The numerical diffusion is optimized in the sense that entropy stable flux reduces to the underlying non-oscillatory flux. Different non-oscillatory entropy stable fluxes are constructed and used to compute the numerical solution of various standard scalar and systems test problems. Computational results show that entropy stable schemes are comparable in term of non-oscillatory nature of schemes using only the underlying non-oscillatory fluxes. Moreover, these entropy stable schemes maintains the formal order of accuracy of the lower order flux used in the convex combination.
In this paper, we present a Clenshaw-Curtis-Filon-type method for the weakly singular oscillatory integral with Fourier and Hankel kernels. By interpolating the non-oscillatory and nonsingular part of the integrand at $(N+1)$ Clenshaw-Curtis points,
the method can be implemented in $O(Nlog N)$ operations. The method requires the accurate computation of modified moments. We first give a method for the derivation of the recurrence relation for the modified moments, which can be applied to the derivation of the recurrence relation for the modified moments corresponding to other type oscillatory integrals. By using recurrence relation, special functions and classic quadrature methods, the modified moments can be computed accurately and efficiently. Then, we present the corresponding error bound in inverse powers of frequencies $k$ and $omega$ for the proposed method. Numerical examples are provided to support the theoretical results and show the efficiency and accuracy of the method.
We introduce a new strategy for coupling the parallel in time (parareal) iterative methodology with multiscale integrators. Following the parareal framework, the algorithm computes a low-cost approximation of all slow variables in the system using an
appropriate multiscale integrator, which is refined using parallel fine scale integrations. Convergence is obtained using an alignment algorithm for fast phase-like variables. The method may be used either to enhance the accuracy and range of applicability of the multiscale method in approximating only the slow variables, or to resolve all the state variables. The numerical scheme does not require that the system is split into slow and fast coordinates. Moreover, the dynamics may involve hidden slow variables, for example, due to resonances. We propose an alignment algorithm for almost-periodic solution, in which case convergence of the parareal iterations is proved. The applicability of the method is demonstrated in numerical examples.
Prolate spheroidal wave functions provide a natural and effective tool for computing with bandlimited functions defined on an interval. As demonstrated by Slepian et al., the so called generalized prolate spheroidal functions (GPSFs) extend this appa
ratus to higher dimensions. While the analytical and numerical apparatus in one dimension is fairly complete, the situation in higher dimensions is less satisfactory. This report attempts to improve the situation by providing analytical and numerical tools for GPSFs, including the efficient evaluation of eigenvalues, the construction of quadratures, interpolation formulae, etc. Our results are illustrated with several numerical examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
