We consider linear first order scalar equations of the form ρt + div(ρv) + aρ = f with appropriate initial and boundary conditions. It is shown that approximate solutions computed using the discontinuous Galerkin method will converge in L[0, T ;L(Ω)] when the coefficients v and a and data f satisfy the minimal assumptions required to establish existence and uniqueness of solutions. In particula...

The initial proposal submitted in September of 2012 discussing the implementation of the Discontinuous Galerkin (DG) methods and strand methods requires restructuring of the schedule and the deliverables due to difficulties encountered. The original proposal indicated that the one dimensional discontinuous Galerkin flow solver was scheduled to be completed by October 31, 2012, the two dimension...

In this paper we present two different kinds of error estimators for acoustic problems: a residual-based and a dual weighted residual one. The former error estimator is explicit and cheap to compute. The latter is based on a duality argument and it is capable of computing accurate and reliable estimations of quantities of interest, which can be safely used for finite element analysis and model ...

We investigate the perfect derived category dgPer(A) of a positively graded differential graded (dg) algebra A whose degree zero part is a dg subalgebra and semisimple as a ring. We introduce an equivalent subcategory of dgPer(A) whose objects are easy to describe, define a t-structure on dgPer(A) and study its heart. We show that dgPer(A) is a Krull-RemakSchmidt category and consider the case ...

DG development and integration in the liberalised market An extended methodology to support the integration of DG/RES into a liberalised market has been developed in the EC funded BUSMOD project. The methodology does not address technical aspects; it assures the transparent process to evaluate the economical worth of DG/RES. An important aspect is the access to data relevant to DG/RES productio...

For any k ∈ N, the k−distance graph DG has the same vertex set of G, and two vertices of DG are adjacent if they are exactly distance k apart in the original graph G. In this paper, we consider the connectivity of DG and state the conditions for graph G and integer k such that the graph DG is connected.