DG Poisson algebra and its universal enveloping algebra

We introduce the notions of differential graded (DG) Poisson algebra and DG Poisson module. Let A be any DG Poisson algebra. We construct the universal enveloping algebra of A explicitly, which is denoted by A^ue. We show that A^ue has a natural DG algebra structure and it satisfies certain universal property. As a consequence of the universal property, it is proved that the category of DG Poisson modules over A is isomorphic to the category of DG modules over A^ue. Furthermore, we prove that the notion of universal enveloping algebra A^ue is well-behaved under opposite algebra and tensor product of DG Poisson algebras. Practical examples of DG Poisson algebras are given throughout the paper including those arising from differential geometry and homological algebra.     

Compact DG modules and Gorenstein DG algebras

When the base connected cochain DG algebra is cohomologically bounded, it is proved that the difference between the amplitude of a compact DG module and that of the DG algebra is just the projective dimension of that module. This yields the unboundedness of the cohomology of non-trivial regular DG algebras. When A is a regular DG algebra such that H(A) is a Koszul graded algebra, H(A) is proved to have the finite global dimension. And we give an example to illustrate that the global dimension of H(A) may be infinite, if the condition that H(A) is Koszul is weakened to the condition that A is a Koszul DG algebra. For a general regular DG algebra A, we give some equivalent conditions for the Gorensteiness. For a finite connected DG algebra A, we prove that D^c(A) and D^c(A ^op) admit Auslander-Reiten triangles if and only if A and A ^op are Gorenstein DG algebras. When A is a non-trivial regular DG algebra such that H(A) is locally finite, D^c(A) does not admit Auslander-Reiten triangles. We turn to study the existence of Auslander-Reiten triangles in D_lf^b(A) and D_lf^b (A ^op) instead, when A is a regular DG algebra. This work was supported by the National Natural Science Foundation of China (Grant No. 10731070) and the Doctorate Foundation of Ministry of Education of China (Grant No. 20060246003)     

Deformation theory of objects in homotopy and derived categories I: General theory

This is the first paper in a series. We develop a general deformation theory of objects in homotopy and derived categories of DG categories. Namely, for a DG module E over a DG category we define four deformation functors Defh(E), coDefh(E), Def(E), coDef(E). The first two functors describe the deformations (and co-deformations) of E in the homotopy category, and the last two - in the derived category. We study their properties and relations. These functors are defined on the category of artinian (not necessarily commutative) DG algebras.     

A posteriori error estimates for discontinuous Galerkin method to the elasticity problem

This work concerns with the discontinuous Galerkin (DG) method for the time‐dependent linear elasticity problem. We derive the a posteriori error bounds for semidiscrete and fully discrete problems, by making use of the stationary elasticity reconstruction technique which allows to estimate the error for time‐dependent problem through the error estimation of the associated stationary elasticity problem. For fully discrete scheme, we make use of the backward‐Euler scheme and an appropriate space‐time reconstruction. The technique here can be applicable for a variety of DG methods as well.     

Duality for cochain DG algebras

This paper develops a duality theory for connected cochain DG algebras,with particular emphasis on the non-commutative aspects.One of the main items is a dualizing DG module which induces a duality between the derived categories of DG left-modules and DG right-modules with finitely generated cohomology.As an application,it is proved that if the canonical module k=A/A≥1 has a semi-free resolution where the cohomological degree of the generators is bounded above,then the same is true for each DG module with finitely generated cohomology.     

A space–time discontinuous Galerkin method for linear convection-dominated Sobolev equations

This article presents a space–time discontinuous Galerkin (DG) finite element method for linear convection-dominated Sobolev equations. The finite element method has basis functions that are continuous in space and discontinuous in time, and variable spatial meshes and time steps are allowed. In the discrete intervals of time, using properties of the Radau quadrature rule, eliminates the restriction to space–time meshes of convectional space–time Galerkin methods. The existence and uniqueness of the approximate solution are proved. An optimal priori error estimate in L^∞(H¹) is derived. Numerical experiments are presented to confirm theoretical results.     

A posteriori error estimates of discontinuous Galerkin methods for non-standard Volterra integro-differential equations

^** Email: jingtang{at}lsec.cc.ac.cn^*** Email: hermann{at}math.mun.ca In this paper we establish a posteriori error estimates forthe discontinuous Galerkin (DG) method applied to linear, semilinearand non-standard (non-linear) Volterra integro-differentialequations. We also present an analysis of the DG method withquadrature for the memory term. Numerical experiments basedon three integro-differential equations are used to illustratevarious aspects of the error analysis.     

Cone Length for DG Modules and Global Dimension of DG Algebras

As the definition of free class of differential modules over a commutative ring in [1 Avramov , L. L. , Buchweitz , R.-O. , Iyengar , S. ( 2007 ). Class and rank of differential modules . Invent. Math. 169 : 1 – 35 .[Crossref], [Web of Science ®] , [Google Scholar]], we define DG free class for semifree DG modules over an Adams connected DG algebra A. For any DG A-modules M, we define its cone length as the least DG free classes of all semifree resolutions of M. The cone length of a DG A-module plays a similar role as projective dimension of a module over a ring does in homological ring theory. The left (resp., right) global dimension of an Adams connected DG algebra A is defined as the supremum of the set of cone lengths of all DG A-modules (resp., A ^op -modules). It is proved that the definition is a generalization of that of graded algebras. Some relations between the global dimension of H(A) and the left (resp. right) global dimension of A are discovered. When A is homologically smooth, we prove that the left (right) global dimension of A is finite and the dimension of D(A) and D ^c (A) are not bigger than the DG free class of a minimal semifree resolution X of the DG A ^e -module A.     

Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems

We present guaranteed and computable both sided error bounds for the discontinuous Galerkin (DG) approximations of elliptic problems. These estimates are derived in the full DG-norm on purely functional grounds by the analysis of the respective differential problem, and thus, are applicable to any qualified DG approximation. Based on the triangle inequality, the underlying approach has the following steps for a given DG approximation: (1) computing a conforming approximation in the energy space using the Oswald interpolation operator, and (2) application of the existing functional a posteriori error estimates to the conforming approximation. Various numerical examples with varying difficulty in computing the error bounds, from simple problems of polynomial-type analytic solution to problems with analytic solution having sharp peaks, or problems with jumps in the coefficients of the partial differential equation operator, are presented which confirm the efficiency and the robustness of the estimates.     

A posteriori error estimates of mixed DG finite element methods for linear parabolic equations

In this article, we analyse a posteriori error estimates of mixed finite element discretizations for linear parabolic equations. The space discretization is done using the order λ?≥?1 Raviart–Thomas mixed finite elements, whereas the time discretization is based on discontinuous Galerkin (DG) methods (r?≥?1). Using the duality argument, we derive a posteriori l ^∞(L ²) error estimates for the scalar function, assuming that only the underlying mesh is static.     

On the Image of the Totaling Functor

Let A be a differential graded (DG) algebra with a trivial differential over a commutative unital ring. This paper investigates the image of the totaling functor, defined from the category of complexes of graded A-modules to the category of DG A-modules. Specifically, we exhibit a special class of semifree DG A-modules which can always be expressed as the totaling of some complex of graded free A-modules. As a corollary, we also provide results concerning the image of the totaling functor when A is a polynomial ring over a field.     

Analysis of the parareal approach based on discontinuous Galerkin method for time-dependent Stokes equations

This paper analyzes a parareal approach based on discontinuous Galerkin (DG) method for the time-dependent Stokes equations. A class of primal discontinuous Galerkin methods, namely variations of interior penalty methods, are adopted for the spatial discretization in the parareal algorithm (we call it parareal DG algorithm). We study three discontinuous Galerkin methods for the time-dependent Stokes equations, and the optimal continuous in time error estimates for the velocities and pressure are derived. Based on these error estimates, the proposed parareal DG algorithm is proved to be unconditionally stable and bounded by the error of discontinuous Galerkin discretization after a finite number of iterations. Finally, some numerical experiments are conducted which confirm our theoretical results, meanwhile, the efficiency of the parareal DG algorithm can be seen through a parallel experiment.     

MC elements in pronilpotent DG Lie algebras

Consider a pronilpotent DG (differential graded) Lie algebra over a field of characteristic 0. In the first part of the paper we introduce the reduced Deligne groupoid associated to this DG Lie algebra. We prove that a DG Lie quasi-isomorphism between two such algebras induces an equivalence between the corresponding reduced Deligne groupoids. This extends the famous result of Goldman–Millson (attributed to Deligne) to the unbounded pronilpotent case.In the second part of the paper we consider the Deligne 2-groupoid. We show it exists under more relaxed assumptions than known before (the DG Lie algebra is either nilpotent or of quasi quantum type). We prove that a DG Lie quasi-isomorphism between such DG Lie algebras induces a weak equivalence between the corresponding Deligne 2-groupoids.In the third part of the paper we prove that an L-infinity quasi-isomorphism between pronilpotent DG Lie algebras induces a bijection between the sets of gauge equivalence classes of Maurer–Cartan elements. This extends a result of Kontsevich and others to the pronilpotent case.     

Application of spectral filtering to discontinuous Galerkin methods on triangulations

We adapt the spectral viscosity (SV) formulation implemented as a modal filter to a discontinuous Galerkin (DG) method solving hyperbolic conservation laws on triangular grids. The connection between SV and spectral filtering, which is undertaken for the first time in the context of DG methods on unstructured grids, allows to specify conditions on the filter strength regarding time step choice and mesh refinement. A crucial advantage of this novel damping strategy is its low computational cost. We furthermore obtain new error bounds for filtered Dubiner expansions of smooth functions. While high order accuracy with respect to the polynomial degree N is proven for the filtering procedure in this case, an adaptive application is proposed to retain the high spatial approximation order. Although spectral filtering stabilizes the scheme, it leaves weaker oscillations. Therefore, as a postprocessing step, we apply the image processing technique of digital total variation (DTV) filtering in the new context of DG solutions and prove conservativity in the limit for this filtering procedure. Numerical experiments for scalar conservation laws confirm the designed order of accuracy of the DG scheme with adaptive modal filtering for polynomial degrees up to 8 and the viability of spectral and DTV filtering in case of shocks. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011     

Approximate multiplication of tensor matrices based on the individual filtering of factors

Algorithms are proposed for the approximate calculation of the matrix product $ \tilde C $ \tilde C ≈ C = A · B, where the matrices A and B are given by their tensor decompositions in either canonical or Tucker format of rank r. The matrix C is not calculated as a full array; instead, it is first represented by a similar decomposition with a redundant rank and is then reapproximated (compressed) within the prescribed accuracy to reduce the rank. The available reapproximation algorithms as applied to the above problem require that an array containing r ^2d elements be stored, where d is the dimension of the corresponding space. Due to the memory and speed limitations, these algorithms are inapplicable even for the typical values d = 3 and r ∼ 30. In this paper, methods are proposed that approximate the mode factors of C using individually chosen accuracy criteria. As an application, the three-dimensional Coulomb potential is calculated. It is shown that the proposed methods are efficient if r can be as large as several hundreds and the reapproximation (compression) of C has low complexity compared to the preliminary calculation of the factors in the tensor decomposition of C with a redundant rank.     

An invariant‐region‐preserving limiter for DG schemes to isentropic Euler equations

In this article, we introduce an invariant‐region‐preserving (IRP) limiter for the p‐system and the corresponding viscous p‐system, both of which share the same invariant region. Rigorous analysis is presented to show that for smooth solutions the order of approximation accuracy is not destroyed by the IRP limiter, provided the cell average stays away from the boundary of invariant region. Moreover, this limiter is explicit, and easy for computer implementation. A generic algorithm incorporating the IRP limiter is presented for high order finite volume type schemes as long as the evolved cell average of the underlying scheme stays strictly within the invariant region. For high order discontinuous Galerkin (DG) schemes to the p‐system, sufficient conditions are obtained for cell averages to stay in the invariant region. For the viscous p‐system, we design both second and third order IRP DG schemes. Numerical experiments are provided to test the proven properties of the IRP limiter and the performance of IRP DG schemes.     

What do multistep methods approximate?

Summary Standard analysis of multistep methods for ODE's assumes the application of an initialization routine that generates the starting points. Here ak-step method is considered directly as a mappingR ^kn R ⁿ . It is shown to approximate a mapping which is expressible directly in terms of the flow of the vector field. Some useful properties of that mapping are shown and for strictly stable methods these are applied to the question of invariant circles near a hyperbolic periodic solution.     

On inexact generalized proximal methods with a weakened error tolerance criterion

Two inexact versions of a Bregman-function-based proximal method for finding a zero of a maximal monotone operator, suggested in [J. Eckstein (1998). Approximate iterations in Bregman-function-based proximal algorithms. Math. Programming, 83, 113–123; P. da Silva, J. Eckstein and C. Humes (2001). Rescaling and stepsize selection in proximal methods using separable generalized distances. SIAM J. Optim., 12, 238–261], are considered. For a wide class of Bregman functions, including the standard entropy kernel and all strongly convex Bregman functions, convergence of these methods is proved under an essentially weaker accuracy condition on the iterates than in the original papers.

Also the error criterion of a logarithmic–quadratic proximal method, developed in [A. Auslender, M. Teboulle and S. Ben-Tiba (1999). A logarithmic-quadratic proximal method for variational inequalities. Computational Optimization and Applications, 12, 31–40], is relaxed, and convergence results for the inexact version of the proximal method with entropy-like distance functions are described.

For the methods mentioned, like in [R.T. Rockafellar (1976). Monotone operators and the proximal point algorithm. SIAM J. Control Optim., 14, 877–898] for the classical proximal point algorithm, only summability of the sequence of error vector norms is required.