Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDual Univariate Interpolatory Subdivision of Every Arity: Algebraic Characterization and Construction
96
0
0.0
(
0
)
Added by
Lucia Romani Prof.
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
The algebraic characterization of dual univariate interpolating subdivision schemes is investigated. Specifically, we provide a constructive approach for finding dual univariate interpolating subdivision schemes based on the solutions of certain associated polynomial equations. The proposed approach also makes possible to identify conditions for the existence of the sought schemes.
In this paper, we present a family of multivariate grid transfer operators appropriate for anisotropic multigrid methods. Our grid transfer operators are derived from a new family of anisotropic interpolatory subdivision schemes. We study the minimality, polynomial reproduction and convergence properties of these interpolatory schemes and link their properties to the convergence and optimality of the corresponding multigrid methods. We compare the performance of our interpolarory grid transfer operators with the ones derived from a family of corresponding approximating subdivision schemes.
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.
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.
We investigate properties of differential and difference operators annihilating certain finite-dimensional subspaces of exponential functions in two variables that are connected to the representation of real-valued trigonometric and hyperbolic functions. Although exponential functions appear in a variety of contexts, the motivation behind this work comes from considering subdivision schemes with the capability of preserving those exponential functions required for an exact description of surfaces parametrized in terms of trigonometric and hyperbolic functions.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
