Results 11 to 20 of about 342 (213)
Refinement equations and spline functions [PDF]
Advances in Computational Mathematics, 2008 In this paper, we exploit the relation between the regularity of refinable functions with non-integer dilations and the distribution of powers of a fixed number modulo 1, and show the nonexistence of a non-trivial {\bf C}^{\infty} solution of the refinement equation with non-integer dilations.
Arturas Dubickas, Zhiqiang Xu 0001
openaire +2 more sources
Approximation by crystal-refinable functions [PDF]
Geometriae Dedicata, 2019 Let $Γ$ be a crystal group in $\mathbb R^d$. A function $φ:\mathbb R^d\longrightarrow \mathbb C$ is said to be {\em crystal-refinable} (or $Γ-$refinable) if it is a linear combination of finitely many of the rescaled and translated functions $φ(γ^{-1}(ax))$, where the {\em translations} $γ$ are taken on a crystal group $Γ$, and $a$ is an expansive ...
Ursula Molter +2 more
openaire +4 more sources
HOW TO REFINE POLYNOMIAL FUNCTIONS [PDF]
International Journal of Wavelets, Multiresolution and Information Processing, 2012 Research on refinable functions in wavelet theory is mostly focused to localized functions. However it is known, that polynomial functions are refinable, too. In our paper we investigate on conversions between refinement masks and polynomials and their uniqueness.
openaire +4 more sources
The regularity of refinable functions
Applied and Computational Harmonic Analysis, 2013 The regularity of refinable functions has been studied extensively in the past. A classical result by Daubechies and Lagarias states that a compactly supported refinable function in $\R$ of finite mask with integer dilation and translations cannot be in $C^\infty$.
Wang, Yang, Xu, Zhiqiang
openaire +3 more sources
Refinable functions for dilation families [PDF]
Advances in Computational Mathematics, 2011 Advances in Computational Mathematics, 36 (3)
openaire +4 more sources
Time refinement in a functional synchronous language [PDF]
Science of Computer Programming, 2013 Concurrent and reactive systems often exhibit multiple time scales. This situation occurs, for instance, in the discrete simulation of a sensor network where the time scale at which agents communicate is very different from the time scale used to model the internals of an agent.The paper presents reactive domains to simplify the programming of such ...
Mandel, Louis +2 more
openaire +2 more sources
Refinements of Fejér’s inequality for convex functions [PDF]
Periodica Mathematica Hungarica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kuei-Lin Tseng +2 more
openaire +2 more sources
Some Refinements of Inequalities for Circular Functions [PDF]
Journal of Applied Mathematics, 2011 We give new lower bound and upper bound for Papenfuss‐Bach inequality and improve Ruehr‐Shafer inequality by providing a new lower bound.
Zhengjie Sun, Ling Zhu
openaire +3 more sources
The limits of refinable functions [PDF]
Transactions of the American Mathematical Society, 2001 Summary: A function \(\phi\) is refinable (\(\phi \in S\)) if it is in the closed span of \(\{\phi(2x-k)\}\). This set \(S\) is not closed in \(L_{2}(\mathbb{R})\), and we characterize its closure. A necessary and sufficient condition for a function to be refinable is presented without any information on the refinement mask.
Strang, Gilbert, Zhou, Ding-Xuan
openaire +2 more sources
Refinements of the Lower Bounds of the Jensen Functional [PDF]
Abstract and Applied Analysis, 2011 The lower bounds of the functional defined as the difference of the right‐hand and the left‐hand side of the Jensen inequality are studied. Refinements of some previously known results are given by applying results from the theory of majorization. Furthermore, some interesting special cases are considered.
Iva Franjić +2 more
openaire +5 more sources