اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGauss-Type Quadrature Rules Based on Identity-Type Functions
105
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Some Gauss-type quadrature rules over [0, 1], which involve values and/or the derivative of the integrand at 0 and/or 1, are investigated
قيم البحث
اقرأ أيضاً
In this work, we present a collocation method based on the Legendre wavelet combined with the Gauss--Jacobi quadrature formula for solving a class of fractional delay-type integro-differential equations. The problem is considered with either initial
or boundary conditions and the fractional derivative is described in the Caputo sense. First, an approximation of the unknown solution is considered in terms of the Legendre wavelet basis functions. Then, we substitute this approximation and its derivatives into the considered equation. The Caputo derivative of the unknown function is approximated using the Gauss--Jacobi quadrature formula. By collocating the obtained residual at the well-known shifted Chebyshev points, we get a system of nonlinear algebraic equations. In order to obtain a continuous solution, some conditions are added to the resulting system. Some error bounds are given for the Legendre wavelet approximation of an arbitrary function. Finally, some examples are included to show the efficiency and accuracy of this new technique.
Numerical integration is encountered in all fields of numerical analysis and the engineering sciences. By now, various efficient and accurate quadrature rules are known; for instance, Gauss-type quadrature rules. In many applications, however, it mig
ht be impractical---if not even impossible---to obtain data to fit known quadrature rules. Often, experimental measurements are performed at equidistant or even scattered points in space or time. In this work, we propose stable high order quadrature rules for experimental data, which can accurately handle general weight functions.
This paper presents a convergence analysis of kernel-based quadrature rules in misspecified settings, focusing on deterministic quadrature in Sobolev spaces. In particular, we deal with misspecified settings where a test integrand is less smooth than
a Sobolev RKHS based on which a quadrature rule is constructed. We provide convergence guarantees based on two different assumptions on a quadrature rule: one on quadrature weights, and the other on design points. More precisely, we show that convergence rates can be derived (i) if the sum of absolute weights remains constant (or does not increase quickly), or (ii) if the minimum distance between design points does not decrease very quickly. As a consequence of the latter result, we derive a rate of convergence for Bayesian quadrature in misspecified settings. We reveal a condition on design points to make Bayesian quadrature robust to misspecification, and show that, under this condition, it may adaptively achieve the optimal rate of convergence in the Sobolev space of a lesser order (i.e., of the unknown smoothness of a test integrand), under a slightly stronger regularity condition on the integrand.
This paper is concerned with the introduction of Tikhonov regularization into least squares approximation scheme on $[-1,1]$ by orthonormal polynomials, in order to handle noisy data. This scheme includes interpolation and hyperinterpolation as speci
al cases. With Gauss quadrature points employed as nodes, coefficients of the approximation polynomial with respect to given basis are derived in an entry-wise closed form. Under interpolatory conditions, the solution to the regularized approximation problem is rewritten in forms of two kinds of barycentric interpolation formulae, by introducing only a multiplicative correction factor into both classical barycentric formulae. An $L_2$ error bound and a uniform error bound are derived, providing similar information that Tikhonov regularization is able to reduce the operator norm (Lebesgue constant) and the error term related to the level of noise, both by multiplying a correction factor which is less than one. Numerical examples show the benefits of Tikhonov regularization when data is noisy or data size is relatively small.
In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive comput
ational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the mollified solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient finite element assembly.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
