Recently, Tsai-Tseng-Yau constructed new invariants of symplectic manifolds: a sequence of A-infinity algebras built of differential forms on the symplectic manifold. We show that these symplectic A-infinity algebras have a simple topological interpretation. Namely, when the cohomology class of the symplectic form is integral, these A-infinity algebras are equivalent to the standard de Rham differential graded algebra on certain odd dimensional sphere bundles over the symplectic manifold. From this equivalence, we deduce for a closed symplectic manifold that Tsai-Tseng-Yau's symplectic A-infinity algebras satisfy the Calabi-Yau property, and importantly, that they can be used to define an intersection theory for coisotropic/isotropic chains. We further demonstrate that these symplectic A-infinity algebras satisfy several functorial properties and lay the groundwork for addressing Weinstein functoriality and invariance in the smooth category.

In this paper, we study the superconvergence of the error for the discontinuous Galerkin (DG) finite element method for linear conservation laws when upwind fluxes are used. We prove that if we apply piecewise $k$-th degree polynomials, the error between the DG solution and the exact solution is ($k+2$)-th order superconvergent at the downwind-biased Radau points with suitable initial discretization. Moreover, we also prove the DG solution is ($k+2$)-th order superconvergent both for the cell averages and for the error to a particular projection of the exact solution. The superconvergence result in this paper leads to a new {\em a posteriori} error estimate. Our analysis is valid for arbitrary regular meshes and for $\mathcal{P}^k$ polynomials with arbitrary $k\geq1$, and for both periodic boundary conditions and for initial-boundary value problems. We perform numerical experiments to demonstrate that the superconvergence rate proved in this paper is optimal.

No abstract uploaded!

No abstract uploaded!

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.