A POSTERIORI ERROR CONTROL OF DISCONTINUOUS GALERKIN METHODS FOR ELLIPTIC OBSTACLE PROBLEMS

In this article, we derive an a posteriori error estimator for various discontinuous Galerkin (DG) methods that are proposed in (Wang, Han and Cheng, SIAM J. Numer. Anal., 48: 708-733, 2010) for an elliptic obstacle problem. Using a key property of DG methods, we perform the analysis in a general framework. The error estimator we have obtained for DG methods is comparable with the estimator for the conforming Galerkin (CG) finite element method. In the analysis, we construct a non-linear smoothing function mapping DG finite element space to CG finite element space and use it as a key tool. The error estimator consists of a discrete Lagrange multiplier associated with the obstacle constraint. It is shown for non-over-penalized DG methods that the discrete Lagrange multiplier is uniformly stable on non-uniform meshes. Finally, numerical results demonstrating the performance of the error estimator are presented.

Modelling of Effect of Non-Uniform Current Density on the Performance of Soluble Lead Redox Flow Batteries

Soluble lead acid redox flow battery (SLRFB) offers a number of advantages. These advantages can be harnessed after problems associated with buildup of active material on. electrodes (residue) are resolved. A mathematical model is developed to understand residue formation in SLRFB. The model incorporates fluid flow, ion transport, electrode reactions, and non-uniform current distribution on electrode surfaces. A number of limiting cases are studied to conclude that ion transport and electrode reaction on anode simultaneously control battery performance. The model fits the reported cell voltage vs. time profiles very well. During the discharge cycle, the model predicts complete dissolution of deposited material from trailing edge side of the electrodes. With time, the active surface area of electrodes decreases rapidly. The corresponding increase in current density leads to precipitous decrease in cell potential before all the deposited material is dissolved. The successive charge-discharge cycles add to the residue. The model correctly captures the marginal effect of flow rate on cell voltage profiles, and identifies flow rate and flow direction as new variables for controlling residue buildup. Simulations carried out with alternating flow direction and a SLRFB with cylindrical electrodes show improved performance with respect to energy efficiency and residue buildup. (C) 2014 The Electrochemical Society. All rights reserved.

Modified Adomian Decomposition Method for Van der Pol equations

In the paper, the well known Adomian Decomposition Method (ADM) is modified to solve the parabolic equations. The present method is quite different than the numerical method. The results are compared with the existing exact or analytical method. The already known existing Adomian Decomposition Method is modified to improve the accuracy and convergence. Thus, the modified method is named as Modified Adomian Decomposition Method (MADM). The Modified Adomian Decomposition Method results are found to converge very quickly and are more accurate compared to ADM and numerical methods. MADM is quite efficient and is practically well suited for use in these problems. Several examples are given to check the reliability of the present method. Modified Adomian Decomposition Method is a non-numerical method which can be adapted for solving parabolic equations. In the current paper, the principle of the decomposition method is described, and its advantages are shown in the form of parabolic equations. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).

Optimal error estimate using mesh equidistribution technique for singularly perturbed system of reaction-diffusion boundary-value problems

In this article, we study the problem of determining an appropriate grading of meshes for a system of coupled singularly perturbed reaction-diffusion problems having diffusion parameters with different magnitudes. The central difference scheme is used to discretize the problem on adaptively generated mesh where the mesh equation is derived using an equidistribution principle. An a priori monitor function is obtained from the error estimate. A suitable a posteriori analogue of this monitor function is also derived for the mesh construction which will lead to an optimal second-order parameter uniform convergence. We present the results of numerical experiments for linear and semilinear reaction-diffusion systems to support the effectiveness of our preferred monitor function obtained from theoretical analysis. (C) 2014 Elsevier Inc. All rights reserved.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .