ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 47D25  (1)
  • 1995-1999  (1)
Collection
Publisher
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Integral equations and operator theory 35 (1999), S. 125-171 
    ISSN: 1420-8989
    Keywords: Primary 46L60 ; 47D25 ; 42A16 ; 43A65 ; Secondary 46L45 ; 42A65 ; 41A15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is devoted to an approximation problem for operators in Hilbert space, that appears when one tries to study geometrically thecascade algorithm in wavelet theory. Let $$\mathcal{H}$$ be a Hilbert space, and let π be a representation ofL ∞( $$\mathbb{T}$$ ) on $$\mathcal{H}$$ . LetR be a positive operator inL ∞( $$\mathbb{T}$$ ) such thatR(1) =1, where1 denotes the constant function 1. We study operatorsM on $$\mathcal{H}$$ (bounded, but noncontractive) such that $$\pi (f){\rm M} = M\pi (f(z^2 ))andM*\pi (f)M = \pi (R*f),f \in L^\infty (\mathbb{T}),$$ where the * refers to Hilbert space adjoint. We give a complete orthogonal expansion of $$\mathcal{H}$$ which reduces π such thatM acts as a shift on one part, and the residual part is $$\mathcal{H}$$ (∞) = ∩ n [M n $$\mathcal{H}$$ ], where [M n $$\mathcal{H}$$ ] is the closure of the range ofM n . The shift part is present, we show, if and only if ker (M *)≠{0}. We apply the operator-theoretic results to the refinement operator (or cascade algorithm) from wavelet theory. Using the representation π, we show that, for this wavelet operatorM, the components in the decomposition are unitarily, and canonically, equivalent to spacesL 2(E n ) ⊂L 2(ℝ), whereE n ⊂ ℝ, n=1,2,3,..., ∞, are measurable subsets which form a tiling of ℝ; i.e., the union is ℝ up to zero measure, and pairwise intersections of differentE n 's have measure zero. We prove two results on the convergence of the cascale algorithm, and identify singular vectors for the starting point of the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...