No abstract uploaded!

Using a geometric method, we characterize all entire functions that transform the Bloch space into a Bergman space by superposition in terms of their order and type. We also prove that all superposition operators induced by such entire functions act boundedly. Similar results hold for superpositions from BMOA into Bergman spaces and from the Bloch space into certain weighted Hardy spaces.

Some filtrations of the tensor product of a highest weight module and a lowest weight module over quantum group Uq(g)are constructed in[1]and one can use them to define a two-sided ideal of the modified quantized enveloping algebra. It is shown that the quotient algebra inherits a canonical basis from the modified quantized enveloping algebra and is dual to the quantum coordinate algebra defined by Kashiwara for a symmetrizable Kac–Moody algebra g.

In this paper, high order central finite difference schemes in a finite interval are analyzed for the diffusion equation. Boundary conditions of the initial-boundary value problem (IBVP) are treated by the simplified inverse Lax-Wendroff (SILW) procedure. For the fully discrete case, a third order explicit Runge-Kutta method is used as an example for the analysis. Stability is analyzed by both the GKS (Gustafsson, Kreiss and Sundstr\"om) theory and the eigenvalue visualization method on both semi-discrete and fully discrete schemes. The two different analysis techniques yield consistent results. Numerical tests are performed to demonstrate and validate the analysis results.

We consider the numerical solution of the time-fractional diffusion-wave equation on two-dimensional and three-dimensional unbounded spatial domains. Introduce an artificial boundary and find the exact and approximate artificial boundary conditions for the given problem, which lead to a bounded computational domain. Using the exact or approximating boundary conditions on the artificial boundary, the original problem is reduced to an initial-boundary-value problem on the bounded computational domain which is respectively equivalent to or approximates the original problem. Finite difference methods are used to solve the reduced problems on the bounded computational domain and the stability of these finite difference methods are proved. The numerical results demonstrate that the method given in this paper is effective and feasible.