Results 21 to 30 of about 3,057 (141)
On the equivalence of probability spaces [PDF]
For a general class of Gaussian processes $W$, indexed by a sigma-algebra $\mathscr F$ of a general measure space $(M,\mathscr F, \sigma)$, we give necessary and sufficient conditions for the validity of a quadratic variation representation for such ...
Alpay, Daniel +2 more
core +3 more sources
A fractional spline collocation method for the fractional order logistic equation [PDF]
We construct a collocation method based on the fractional B-splines to solve a nonlinear differential problem that involves fractional derivative, i.e. the fractional order logistic equation.
Pezza, L., Pitolli, F.
core +1 more source
Orthogonality criteria for compactly supported refinable functions and refinable function vectors
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagarias, Jeffrey C., Wang, Yang
openaire +2 more sources
Multivariate Refinable Interpolating Functions
The author gives an algorithm for the construction of refinable interpolating functions for an arbitrary dilation matrix. This construction of refinable interpolating functions is an intermediate step in the construction of orthonormal wavelet bases and is of interest in its own right.
openaire +2 more sources
Refinable Functions with PV Dilations [PDF]
A PV number is an algebraic integer $α$ of degree $d \geq 2$ all of whose Galois conjugates other than itself have modulus less than $1$. Erdös \cite{erdos} proved that the Fourier transform $\widehat φ,$ of a nonzero compactly supported scalar valued function satisfying the refinement equation $φ(x) = \frac{|α|}{2}φ(αx) + \frac{|α|}{2}φ(αx-1)$ with ...
openaire +2 more sources
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if successive ...
Ingber, Amir +2 more
core +1 more source
A Matricial Algorithm for Polynomial Refinement [PDF]
In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are typically compactly
King, Emily J.
core
Regularity of anisotropic refinable functions [PDF]
This paper presents a detailed regularity analysis of anisotropic wavelet frames and subdivision. In the univariate setting, the smoothness of wavelet frames and subdivision is well understood by means of the matrix approach. In the multivariate setting, this approach has been extended only to the special case of isotropic refinement with the dilation ...
Charina, Maria, Protasov, Vladimir
openaire +4 more sources
Symmetric interpolatory dual wavelet frames [PDF]
For any symmetry group $H$ and any appropriate matrix dilation we give an explicit method for the construction of $H$-symmetric refinable interpolatory refinable masks which satisfy sum rule of arbitrary order $n$.
Krivoshein, A. V.
core
Proximately chain refinable functions
Summary: We define proximately chain refinable functions as a generalization of refinable maps and investigate some of their properties for Hausdorff paracompact spaces. We prove that the proximate fixed point property is preserved by proximate near homeomorphisms in paracompact Hausdorff spaces. This generalizes a previous result of \textit{E.
BUKLLA, Abdulla, MARKOSKİ, Gjorgji
openaire +3 more sources

