اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEquivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a Lax-Richtmyer type equivalence theorem -- a consistent method is convergent if and only if it is stable. We define consistency as convergence on a dense subspace and stability as discrete well-posedness. In some applications convergence is harder to prove than consistency or stability since convergence requires knowledge of the solution. An equivalence theorem can be useful in such settings. We give concrete instances of equivalence theorems for polynomial interpolation, numerical differentiation, numerical integration using quadrature rules and Monte Carlo integration.
قيم البحث
اقرأ أيضاً
The goal of this paper is twofold. First, we present a unified way of formulating numerical integration problems from both approximation theory and discrepancy theory. Second, we show how techniques, developed in approximation theory, work in proving
lower bounds for recently developed new type of discrepancy -- the smooth discrepancy.
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes formulas are not
stable, limiting the usable order of such formulas. Existing work showed that by the use of orthogonal polynomials, stable high-order quadrature formulas with equidistant points can be developed. We improve upon such work by making use of (orthogonal) Gram polynomials and deriving an iterative algorithm, together allowing us to reduce the space-complexity of the original algorithm significantly.
For linear elastic problems, it is well-known that mesh generation dominates the total analysis time. Different types of methods have been proposed to directly or indirectly alleviate this burden associated with mesh generation. We review in this pap
er a subset of such methods centred on tighter coupling between computer aided design (CAD) and analysis (finite element or boundary element methods). We focus specifically on frameworks which rely on constructing a discretisation directly from the functions used to describe the geometry of the object in CAD. Examples include B-spline subdivision surfaces, isogeometric analysis, NURBS-enhanced FEM and parametric-based implicit boundary definitions. We review recent advances in these methods and compare them to other paradigms which also aim at alleviating the burden of mesh generation in computational mechanics.
This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized) maximum angle c
ondition. In this paper, we present a new estimation in which the error is bounded in terms of the diameter and projected circumradius of the tetrahedron. Because we do not impose any geometric restrictions on the tetrahedron itself, our error estimation may be applied to any tetrahedralizations of domains including very thin tetrahedrons.
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a uniform m
esh on a unit interval, the explicit representation of B-spline basis functions for a fixed mesh size $h$ is given for $p=2,3,4$ and for $C^{0}$- and $C^{p-1}$-continuity. The presented methods show $h$- and (almost) $p$-independent convergence rates. Supporting numerical results for convergence factor and iterations count for AMLI cycles ($V$-, linear $W$-, nonlinear $W$-) are provided. Numerical tests are performed, in two-dimensions on square domain and quarter annulus, and in three-dimensions on quarter thick ring.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
