اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLocally supported, quasi-interpolatory bases on graphs
143
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Lagrange functions are localized bases that have many applications in signal processing and data approximation. Their structure and fast decay make them excellent tools for constructing approximations. Here, we propose perturbations of Lagrange functions on graphs that maintain the nice properties of Lagrange functions while also having the added benefit of being locally supported. Moreover, their local construction means that they can be computed in parallel, and they are easily implemented via quasi-interpolation.
قيم البحث
اقرأ أيضاً
Positive interpolatory cubature formulas (CFs) are constructed for quite general integration domains and weight functions. These CFs are exact for general vector spaces of continuous real-valued functions that contain constants. At the same time, the
number of data points -- all of which lie inside the domain of integration -- and cubature weights -- all positive -- is less or equal to the dimension of that vector space. The existence of such CFs has been ensured by Tchakaloff in 1957. Yet, to the best of the authors knowledge, this work is the first to provide a procedure to successfully construct them.
We introduce intrinsic interpolatory bases for data structured on graphs and derive properties of those bases. Polyharmonic Lagrange functions are shown to satisfy exponential decay away from their centers. The decay depends on the density of the zer
os of the Lagrange function, showing that they scale with the density of the data. These results indicate that Lagrange-type bases are ideal building blocks for analyzing data on graphs, and we illustrate their use in kernel-based machine learning applications.
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise interpolants. A
complete algebraic characterization, which covers every arity, is given in terms of identities of trigonometric polynomials associated to the schemes. This characterization is based on a necessary condition for refinable functions to have prescribed values at the nodes of a uniform lattice, as a consequence of the Poisson summation formula. A strategy for the construction is then showed, alongside meaningful examples for applications that have comparable or even superior properties, in terms of regularity, length of the support and/or polynomial reproduction, with respect to the primal counterparts.
We provide a detailed analysis of the obstruction (studied first by S. Durand and later by R. Yin and one of us) in the construction of multidirectional wavelet orthonormal bases corresponding to any admissible frequency partition in the framework of
subband filtering with non-uniform subsampling. To contextualize our analysis, we build, in particular, multidirectional alias-free hexagonal wavelet bases and low-redundancy frames with optimal spatial decay. In addition, we show that a 2D cutting lemma can be used to subdivide the obtained wavelet systems in higher frequency rings so as to generate bases or frames that satisfy the ``parabolic scaling law enjoyed by curvelets and shearlets. Numerical experiments on high bit-rate image compression are conducted to illustrate the potential of the proposed systems.
In this article, we construct and analyse explicit numerical splitting methods for a class of semi-linear stochastic differential equations (SDEs) with additive noise, where the drift is allowed to grow polynomially and satisfies a global one-sided L
ipschitz condition. The methods are proved to be mean-square convergent of order 1 and to preserve important structural properties of the SDE. In particular, first, they are hypoelliptic in every iteration step. Second, they are geometrically ergodic and have asymptotically bounded second moments. Third, they preserve oscillatory dynamics, such as amplitudes, frequencies and phases of oscillations, even for large time steps. Our results are illustrated on the stochastic FitzHugh-Nagumo model and compared with known mean-square convergent tamed/truncated variants of the Euler-Maruyama method. The capability of the proposed splitting methods to preserve the aforementioned properties makes them applicable within different statistical inference procedures. In contrast, known Euler-Maruyama type methods commonly fail in preserving such properties, yielding ill-conditioned likelihood-based estimation tools or computationally infeasible simulation-based inference algorithms.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
