Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Palabras claves o descriptores: FRAMES (Comienzo)
2 registros cumplieron la condición especificada en la base de información BIBCYT. ()
Registro 1 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Stevenson, Rob
Título: Adaptive Solution of Operator Equations Using Wavelet Frames
Páginas/Colación: pp. 1074 - 1100
Url: Ir a http://epubs.siam.org/sam-bin/dbq/article/40798http://epubs.siam.org/sam-bin/dbq/article/40798
Siam Journal on Numerical Analysis Vol. 41, no. 3 May/July 2004
Información de existenciaInformación de existencia

Palabras Claves: Palabras: ADAPTIVE METHODS ADAPTIVE METHODS, Palabras: BEST \(N\)-TERM APPROXIMATION BEST \(N\)-TERM APPROXIMATION, Palabras: FRAMES FRAMES, Palabras: OPERATOR EQUATIONS OPERATOR EQUATIONS, Palabras: OPTIMAL COMPUTATIONAL COMPLEXITY OPTIMAL COMPUTATIONAL COMPLEXITY, Palabras: WAVELETS WAVELETS

Resumen
In "Adaptive wavelet methods II---Beyond the elliptic case" of Cohen, Dahmen, and DeVore [Found. Comput. Math., 2 (2002), pp. 203--245], an adaptive method has been developed for solving general operator equations. Using a Riesz basis of wavelet type for the energy space, the operator equation is transformed into an equivalent matrix-vector system. This system is solved iteratively, where the application of the infinite stiffness matrix is replaced by an adaptive approximation. Assuming that the stiffness matrix is sufficiently compressible, i.e., that it can be sufficiently well approximated by sparse matrices, it was proved that the adaptive method has optimal computational complexity in the sense that it converges with the same rate as the best N-term approximation for the solution, assuming that the latter would be explicitly available. The condition concerning compressibility requires that, dependent on their order, the wavelets have sufficiently many vanishing moments, and that they be sufficiently smooth. However, except on tensor product domains, wavelets that satisfy this smoothness requirement are not easy to construct. In this paper we write the domain or manifold on which the operator equation is posed as an overlapping union of subdomains, each of them being the image under a smooth parametrization of the hypercube. By lifting wavelets on the hypercube to the subdomains, we obtain a {\em frame} for the energy space. With this frame the operator equation is transformed into a matrix-vector system, after which this system is solved iteratively by an adaptive method similar to the one from the work of Cohen, Dahmen, and DeVore. With this approach, frame elements that have sufficiently many vanishing moments and are sufficiently smooth, something needed for the compressibility, are easily constructed. By handling additional difficulties due to the fact that a frame gives rise to an underdetermined matrix-vector system, we prove that this adaptive method has optimal computational complexity.

Registro 2 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Kaftal, Victor ; Zhang, Shuang ; Larson, David R.
Título: Operator-Valued Frames
Páginas/Colación: pp.6349-6385
Fecha: December 2009
Transactions of the American Mathematical Society Vol. 361, no.12 December 2009
Información de existenciaInformación de existencia

Palabras Claves: Palabras: FRAMES FRAMES, Palabras: GROUP REPRESENTATIONS GROUP REPRESENTATIONS, Palabras: HOMOTOPY HOMOTOPY, Palabras: MULTIFRAMES MULTIFRAMES

Resumen
We, first, improve a theorem of B

We develop a natural generalization of vector-valued frame theory, which we term operator-valued frame theory, using operator-algebraic methods. This extends work of the second author and D. Han which can be viewed as the multiplicity one case and extends to higher multiplicity their dilation approach. We prove several results for operator-valued frames concerning duality, disjointedness, complementarity, and composition of operator-valued frames and the relationship between the two types of similarity (left and right) of such frames. A key technical tool is the parametrization of Parseval operator-valued frames in terms of a class of partial isometries in the Hilbert space of the analysis operator. We apply these notions to an analysis of multiframe generators for the action of a discrete group $ G$on a Hilbert space. One of the main results of the Han-Larson work was the parametrization of the Parseval frame generators in terms of the unitary operators in the von Neumann algebra generated by the group representation, and the resulting norm path-connectedness of the set of frame generators due to the connectedness of the group of unitary operators of an arbitrary von Neumann algebra. In this paper we generalize this multiplicity one result to operator-valued frames. However, both the parametrization and the proof of norm path-connectedness turn out to be necessarily more complicated, and this is at least in part the rationale for this paper. Our parametrization involves a class of partial isometries of a different von Neumann algebra. These partial isometries are not path-connected in the norm topology, but only in the strong operator topology. We prove that the set of operator frame generators is norm pathwise-connected precisely when the von Neumann algebra generated by the right representation of the group has no minimal projections. As in the multiplicity one theory there are analogous results for general (non-Parseval) frames.

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (3.139.107.241)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
3.139.107.241 (NTM) bajo el ambiente Apache/2.2.4 (Win32) PHP/5.2.2.
usando una conexión ODBC (RowCount) al manejador de bases de datos..
Versión de la base de información BIBCYT: 7.0.0 (con listas invertidas [2.0])

Cliente: 3.139.107.241
Salida con Javascript


** Back-end Alejandría BE 7.0.7b0 *