994 resultados para generalized translation operator
Resumo:
2000 Mathematics Subject Classification: 42B20, 42B25, 42B35
Resumo:
MSC 2010: Primary: 447B37; Secondary: 47B38, 47A15
Resumo:
Generalized Bose operators correspond to reducible representations of the harmonic oscillator algebra. We demonstrate their relevance in the construction of topologically non-trivial solutions in noncommutative gauge theories, focusing our attention to flux tubes, vortices, and instantons. Our method provides a simple new relation between the topological charge and the number of times the basic irreducible representation occurs in the reducible representation underlying the generalized Bose operator. When used in conjunction with the noncommutative ADHM construction, we find that these new instantons are in general not unitarily equivalent to the ones currently known in literature.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
We show the existence of free dense subgroups, generated by two elements, in the holomorphic shear and overshear group of complex-Euclidean space and extend this result to the group of holomorphic automorphisms of Stein manifolds with the density property, provided there exists a generalized translation. The conjugation operator associated to this generalized translation is hypercyclic on the topological space of holomorphic automorphisms.
Resumo:
2000 Mathematics Subject Classification: 42B20, 42B25, 42B35
Resumo:
2000 Mathematics Subject Classification: 33D15, 33D90, 39A13
Resumo:
2000 Math. Subject Classification: Primary 42B20, 42B25, 42B35
Resumo:
With the development of seismic exploration, the target becomes more and more complex, which leads to a higher demand for the accuracy and efficiency in 3D exploration. Fourier finite-difference (FFD) method is one of the most valuable methods in complex structure exploration, which keeps the ability of finite-differenc method in dealing with laterally varing media and inherits the predominance of the phase-screen method in stablility and efficiency. In this thesis, the accuracy of the FFD operator is highly improved by using simulated annealing algorithm. This method takes the extrapolation step and band width into account, which is more suitable to various band width and discrete scale than the commonely-used optimized method based on velocity contrast alone. In this thesis, the FFD method is extended to viscoacoustic modeling. Based on one-way wave equation, the presented method is implemented in frequency domain; thus, it is more efficient than two-way methods, and is more convenient than time domain methods in handling attenuation and dispersion effects. The proposed method can handle large velocity contrast and has a high efficiency, which is helpful to further research on earth absorption and seismic resolution. Starting from the frequency dispersion of the acoustic VTI wave equation, this thesis extends the FFD migration method to the acoustic VTI media. Compared with the convetional FFD method, the presented method has a similar computational efficiency, and keeps the abilities of dealing with large velocity contrasts and steep dips. The numerical experiments based on the SEG salt model show that the presented method is a practical migration method for complex acoustical VTI media, because it can handle both large velocity contrasts and large anisotropy variations, and its accuracy is relatively high even in strong anisotropic media. In 3D case, the two-way splitting technique of FFD operator causes artificial azimuthal anisotropy. These artifacts become apparent with increasing dip angles and velocity contrasts, which prevent the application of the FFD method in 3D complex media. The current methods proposed to reduce the azimuthal anisotropy significantly increase the computational cost. In this thesis, the alternating-direction-implicit plus interpolation scheme is incorporated into the 3D FFD method to reduce the azimuthal anisotropy. By subtly utilizing the Fourier based scheme of the FFD method, the improved fast algorithm takes approximately no extra computation time. The resulting operator keeps both the accuracy and the efficiency of the FFD method, which is helpful to the inhancements of both the accuracy and the efficiency for prestack depth migration. The general comparison is presented between the FFD operator and the generalized-screen operator, which is valuable to choose the suitable method in practice. The percentage relative error curves and migration impulse responses show that the generalized-screen operator is much sensiutive to the velocity contrasts than the FFD operator. The FFD operator can handle various velocity contrasts, while the generalized-screen operator can only handle some range of the velocity contrasts. Both in large and weak velocity contrasts, the higher order term of the generalized-screen operator has little effect on improving accuracy. The FFD operator is more suitable to large velocity contrasts, while the generalized-screen operator is more suitable to middle velocity contrasts. Both the one-way implicit finite-difference migration and the two-way explicit finite-differenc modeling have been implemented, and then they are compared with the corresponding FFD methods respectively. This work gives a reference to the choosen of proper method. The FFD migration is illustrated to be more attractive in accuracy, efficiency and frequency dispertion than the widely-used implicit finite-difference migration. The FFD modeling can handle relatively coarse grids than the commonly-used explicit finite-differenc modeling, thus it is much faster in 3D modeling, especially for large-scale complex media.
Resumo:
Chan and Shapiro showed that each (non-trivial) translation operator acting on the Fréchet space of entire functions endowed with the topology of locally uniform convergence supports a universal function of exponential type zero. We show the existence of d-universal functions of exponential type zero for arbitrary finite tuples of pairwise distinct translation operators. We also show that every separable infinite-dimensional Fréchet space supports an arbitrarily large finite and commuting disjoint mixing collection of operators. When this space is a Banach space, it supports an arbitrarily large finite disjoint mixing collection of C0-semigroups. We also provide an easy proof of the result of Salas that every infinite-dimensional Banach space supports arbitrarily large tuples of dual d-hypercyclic operators, and construct an example of a mixing Hilbert space operator T so that (T,T2) is not d-mixing.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, developed by R. T. Rockafellar [16], for solving the problem (P) ”To find x ∈ H such that 0 ∈ T x” is the proximal point algorithm. Several generalizations have been considered by several authors: introduction of a perturbation, introduction of a variable metric in the perturbed algorithm, introduction of a pseudo-metric in place of the classical regularization, . . . We summarize some of these extensions by taking simultaneously into account a pseudo-metric as regularization and a perturbation in an inexact version of the algorithm.
Resumo:
Mathematics Subject Classification: Primary 42B20, 42B25, 42B35
Resumo:
The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and prove that the translation operator to the i’th node is invertible if and only if all eigenvectors are nonzero on the i’th node. Because of this dependency on the support of eigenvectors we study the characteristic set of Laplacian eigenvectors. We prove that the Fiedler vector of a planar graph cannot vanish on large neighborhoods and then explicitly construct a family of non-planar graphs that do exhibit this property. We then prove original results in modern analysis on graphs. We extend results on spectral graph wavelets to create vertex-dyanamic spectral graph wavelets whose support depends on both scale and translation parameters. We prove that Spielman’s Twice-Ramanujan graph sparsifying algorithm cannot outperform his conjectured optimal sparsification constant. Finally, we present numerical results on graph conditioning, in which edges of a graph are rescaled to best approximate the complete graph and reduce average commute time.