Related papers: How to refine polynomial functions
We give a characterization of all Parseval wavelet frames arising from a given frame multiresolution analysis. As a consequence, we obtain a description of all Parseval wavelet frames associated with a frame multiresolution analysis. These…
Studying degenerate versions of various special polynomials have become an active area of research and yielded many interesting arithmetic and combinatorial results. Here we introduce a degenerate version of polylogarithm function, called…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
Using the Daubechies conditions of compact support, orthogonal, and regularity, we were able to derive bivariate scaling functions with which to reproduce linear functions (planes). We describe how to create all possible masks of refinement…
We described a wide class of $p$-adic refinable equations generating $p$-adic multiresolution analysis. A method for the construction of $p$-adic orthogonal wavelet bases within the framework of the MRA theory is suggested. A realization of…
We study the class of real-valued functions on convex subsets of R^n which are computed by the maximum of finitely many affine functionals with integer slopes. We prove several results to the effect that this property of a function can be…
A refinement of the multinomial distribution is presented where the number of inversions in the sequence of outcomes is tallied. This refinement of the multinomial distribution is its joint distribution with the number of inversions in the…
This review paper is intended to give a useful guide for those who want to apply discrete wavelets in their practice. The notion of wavelets and their use in practical computing and various applications are briefly described, but rigorous…
We provide a new representation of a refinable shift invariant space with a compactly supported generator, in terms of functions with a special property of homogeneity. In particular these functions include all the homogeneous polynomials…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…
An explicit description of all Walsh polynomials generating tight wavelet frames is given. An algorithm for finding the corresponding wavelet functions is suggested, and a general form for all wavelet frames generated by an appropriate…
In the paper we design a Parseval wavelet frame with a compact support and many vanishing moments. The corresponding refinement mask approximates an arbitrary continuous periodic function $f$, $f(0)=1$. The refinable function has stable…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
A refinement of manifold data is a computational process, which produces a denser set of discrete data from a given one. Such refinements are closely related to multiresolution representations of manifold data by pyramid transforms, and…
In the present work, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of new monogenic polynomials are provided based on 2-parameters weight functions. Such classes extend the well…
We make the interprecision transfers explicit in an algorithmic description of iterative refinement and obtain new insights into the algorithm. One example is the classic variant of iterative refinement where the matrix and the…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…