scholarly journals Construction of Compactly Supported Refinable Componentwise Polynomial Functions inℝ2

2011 ◽  
Vol 2011 ◽  
pp. 1-14
Author(s):  
Yanmei Xue ◽  
Ning Bi
Keyword(s):  
Iteration Algorithm ◽  
Sufficient Condition ◽  
Polynomial Functions ◽  
Refinable Functions ◽  
Compactly Supported ◽  
Polynomial Property

We provide a sufficient condition for constructing a class of compactly supported refinable functions with componentwise polynomial property inℝ2. An iteration algorithm is developed to compute the polynomial on each component of the functions' support. Finally, two examples for constructing the symmetric refinable componentwise polynomial functions are given.

scholarly journals On The Convolution of a Box Spline With a Compactly Supported Distribution: Linear Independence for the Integer Translates

1991 ◽  
Vol 43 (1) ◽  
pp. 19-33 ◽  
Author(s):  
Charles K. Chui ◽  
Amos Ron
Keyword(s):  
Laplace Transform ◽  
Critical Points ◽  
Linear Independence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Compactly Supported ◽  
Integer Translates ◽  
Box Spline ◽  
Finite Set ◽  
Necessary And Sufficient

AbstractThe problem of linear independence of the integer translates of μ * B, where μ is a compactly supported distribution and B is an exponential box spline, is considered in this paper. The main result relates the linear independence issue with the distribution of the zeros of the Fourier-Laplace transform, of μ on certain linear manifolds associated with B. The proof of our result makes an essential use of the necessary and sufficient condition derived in [12]. Several applications to specific situations are discussed. Particularly, it is shown that if the support of μ is small enough then linear independence is guaranteed provided that does not vanish at a certain finite set of critical points associated with B. Also, the results here provide a new proof of the linear independence condition for the translates of B itself.

Matrix representation of formal polynomials over max-plus algebra

2020 ◽  
pp. 2150216
Author(s):  
Cailu Wang ◽  
Yuegang Tao
Keyword(s):  
Matrix Method ◽  
Polynomial Algorithm ◽  
Polynomial Function ◽  
Matrix Representation ◽  
Sufficient Condition ◽  
Polynomial Functions ◽  
Canonical Forms ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Necessary And Sufficient

This paper proposes the matrix representation of formal polynomials over max-plus algebra and obtains the maximum and minimum canonical forms of a polynomial function by standardizing this representation into a canonical form. A necessary and sufficient condition for two formal polynomials corresponding to the same polynomial function is derived. Such a matrix method is constructive and intuitive, and leads to a polynomial algorithm for factorization of polynomial functions. Some illustrative examples are presented to demonstrate the results.

scholarly journals A SINISTER VIEW OF DILATION EQUATIONS

2005 ◽  
Vol 03 (01) ◽  
pp. 67-77
Author(s):  
DAVID MALONE
Keyword(s):  
Refinable Functions ◽  
Refinable Function ◽  
Compactly Supported ◽  
Rate Of Growth ◽  
Dilation Equation ◽  
Dilation Equations

We present a technique for studying refinable functions which are compactly supported. Refinable functions satisfy dilation equations and this technique focuses on the implications of the dilation equation at the edges of the support of the refinable function. This method is fruitful, producing new results regarding existence, uniqueness, smoothness and rate of growth of refinable functions.

COMPACTLY SUPPORTED MULTIVARIATE, PAIRS OF DUAL WAVELET FRAMES OBTAINED BY CONVOLUTION

2008 ◽  
Vol 06 (02) ◽  
pp. 183-208 ◽  
Author(s):  
MARTIN EHLER
Keyword(s):  
Approximation Order ◽  
Refinable Functions ◽  
Wavelet Frames ◽  
Refinable Function ◽  
Vanishing Moments ◽  
Wavelet System ◽  
Compactly Supported ◽  
Mask Size ◽  
Dual Wavelet Frames ◽  
Dual Wavelet

In this paper, we present a construction of compactly supported multivariate pairs of dual wavelet frames. The approach is based on the convolution of two refinable distributions. We obtain smooth wavelets with any preassigned number of vanishing moments. Their underlying refinable function is fundamental. In the examples, we obtain symmetric wavelets with small support from optimal refinable functions, i.e. the refinable function has minimal mask size with respect to smoothness and approximation order of its generated multiresolution analysis. The wavelet system has maximal approximation order with respect to the underlying refinable function.

scholarly journals Some Bivariate Smooth Compactly Supported Tight Framelets with Three Generators

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
A. San Antolín ◽  
R. A. Zalik
Keyword(s):  
Closed Form ◽  
Spectral Factorization ◽  
Extension Principle ◽  
Refinable Functions ◽  
Wavelet Frames ◽  
Compactly Supported ◽  
Slight Generalization ◽  
Dilation Matrix ◽  
Transcendental Functions ◽  
Low Degrees

For any dilation matrix with integer entries and , we construct a family of smooth compactly supported tight wavelet frames with three generators in . Our construction involves some compactly supported refinable functions, the oblique extension principle, and a slight generalization of a theorem of Lai and Stöckler. Estimates for the degrees of smoothness are given. With the exception of a polynomial whose coefficients must in general be computed by spectral factorization, the framelets are expressed in closed form in the frequency domain, in terms of elementary transcendental functions. By means of two examples we also show that for low degrees of smoothness the use of spectral factorization may be avoided.

scholarly journals Compactly Supported Tight and Sibling Frames Based on Generalized Bernstein Polynomials

2016 ◽  
Vol 2016 ◽  
pp. 1-13
Author(s):  
Ting Cheng ◽  
Xiaoyuan Yang
Keyword(s):  
Bernstein Polynomials ◽  
Approximation Order ◽  
Refinable Functions ◽  
Numerical Examples ◽  
Compactly Supported ◽  
Derived Properties ◽  
Cascade Algorithms ◽  
Generalized Bernstein Polynomials

We obtain a family of refinable functions based on generalized Bernstein polynomials to provide derived properties. The convergence of cascade algorithms associated with the new masks is proved, which guarantees the existence of refinable functions. Then, we analyze the symmetry, regularity, and approximation order of the refinable functions, which are of importance. Tight and sibling frames are constructed and interorthogonality of sibling frames is demonstrated. Finally, we give numerical examples to explicitly illustrate the construction of the proposed approach.

ŁOJASIEWICZ INEQUALITY ON NON-COMPACT DOMAINS AND SINGULARITIES AT INFINITY

2013 ◽  
Vol 24 (10) ◽  
pp. 1350079 ◽  
Author(s):  
DINH SI TIEP ◽  
KRZYSZTOF KURDYKA ◽  
OLIVIER LE GAL
Keyword(s):  
Sufficient Condition ◽  
Polynomial Functions ◽  
The Real ◽  
Polar Set ◽  
Several Variables ◽  
Łojasiewicz Inequality ◽  
Real Polynomials ◽  
Lojasiewicz Inequality

We give a version of the Łojasiewicz inequality for the real polynomials on non-compact domains. The inequality takes in account not only distance to a fiber, but also distance to a polar set. It improves the recent results of [D. S. Tiep, H. H. Vui and N. T. Thao, Łojasiewicz inequality for polynomial functions on non-compact domains, Int. J. Math.23(4) (2012), Article ID: 1250033, 28 pp., doi:10.1142/S0129167X12500334], since we consider a distance to a smaller set. Then we use this new version of the inequality to obtain a sufficient condition for the existence of a vanishing component at infinity for real polynomials in several variables.

Sign in / Sign up

Export Citation Format

Share Document