New a posteriori L∞(L2) and L2(L2)-error estimates of mixed finite element methods for general nonlinear parabolic optimal control problems

We study new a posteriori error estimates of the mixed finite element methods for general optimal control problems governed by nonlinear parabolic equations. The state and the co-state are discretized by the high order Raviart-Thomas mixed finite element spaces and the control is approximated by piecewise constant functions. We derive a posteriori error estimates in L^∞(J; L²Ω)-norm and L²(J; L²Ω)-norm for both the state, the co-state and the control approximation. Such estimates, which seem to be new, are an important step towards developing a reliable adaptive mixed finite element approximation for optimal control problems. Finally, the performance of the posteriori error estimators is assessed by two numerical examples.     

Superconvergence and recovery type a posteriori error estimation for hybrid stress finite element method

Superconvergence and recovery type a posteriori error estimators are analyzed for Pian and Sumihara's 4-node hybrid stress quadrilateral finite element method for linear elasticity problems. Superconvergence of order O(h~(1+min){α,1}) is established for both the displacement approximation in H~1-norm and the stress approximation in L~2-norm under a mesh assumption, where α 0 is a parameter characterizing the distortion of meshes from parallelograms to quadrilaterals. Recovery type approximations for the displacement gradients and the stress tensor are constructed, and a posteriori error estimators based on the recovered quantities are shown to be asymptotically exact. Numerical experiments confirm the theoretical results.     

A new mixed finite element method based on the Crank-Nicolson scheme for Burgers’ equation

In this paper, a new mixed finite element method is used to approximate the solution as well as the flux of the 2D Burgers’ equation. Based on this new formulation, we give the corresponding stable conforming finite element approximation for the P₀² ? P₁ pair by using the Crank-Nicolson time-discretization scheme. Optimal error estimates are obtained. Finally, numerical experiments show the efficiency of the new mixed method and justify the theoretical results.     

An hp finite element method for 4th order singularly perturbed problems

We present the analysis for the hp finite element approximation of the solution to singularly perturbed fourth order problems, using a balanced norm. In Panaseti et al. (2016) it was shown that the hp version of the Finite Element Method (FEM) on the so-called Spectral Boundary Layer Mesh yields robust exponential convergence when the error is measured in the natural energy norm associated with the problem. In the present article we sharpen the result by showing that the same hp-FEM on the Spectral Boundary Layer Mesh gives robust exponential convergence in a stronger, more balanced norm. As a corollary we also get robust exponential convergence in the maximum norm. The analysis is based on the ideas in Roos and Franz (Calcolo 51, 423–440, 2014) and Roos and Schopf (ZAMM 95, 551–565, 2015) and the recent results in Melenk and Xenophontos (2016). Numerical examples illustrating the theory are also presented.     

Analysis of some numerical methods on layer adapted meshes for singularly perturbed quasilinear systems

We consider a coupled system of first-order singularly perturbed quasilinear differential equations with given initial conditions. The leading term of each equation is multiplied by a distinct small positive parameter, which induces overlapping layers. The quasilinear system is discretized by using first and second order accurate finite difference schemes for which we derive general error estimates in the discrete maximum norm. As consequences of these error estimates we establish nodal convergence of O((N ^?1 lnN) ^p ),p=1,2, on the Shishkin mesh and O(N ^?p ),p=1,2, on the Bakhvalov mesh, where N is the number of mesh intervals and the convergence is robust in all of the parameters. Numerical computations are included which confirm the theoretical results.     

A unified approach to estimation of noncentrality parameters,the multiple correlation coefficient,and mixture models

We consider a class of mixture models for positive continuous data and the estimation of an underlying parameter θ of the mixing distribution. With a unified approach, we obtain classes of dominating estimators under squared error loss of an unbiased estimator, which include smooth estimators. Applications include estimating noncentrality parameters of chi-square and F-distributions, as well as ρ ²/(1 ? ρ ²), where ρ is amultivariate correlation coefficient in a multivariate normal set-up. Finally, the findings are extended to situations, where there exists a lower bound constraint on θ.     

Instance Optimality of the Adaptive Maximum Strategy

In this paper, we prove that the standard adaptive finite element method with a (modified) maximum marking strategy is instance optimal for the total error, being the square root of the squared energy error plus the squared oscillation. This result will be derived in the model setting of Poisson’s equation on a polygon, linear finite elements, and conforming triangulations created by newest vertex bisection.     

Test elements in pro-<Emphasis Type="Italic">p</Emphasis> groups with applications in discrete groups

Let G be a group. An element g ∈ G is called a test element of G if for every endomorphism ? : G → G, ?(g) = g implies ? is an automorphism. We prove that for a finitely generated profinite group G, g ∈ G is a test element of G if and only if it is not contained in a proper retract of G. Using this result we prove that an endomorphism of a free pro-p group of finite rank which preserves an automorphic orbit of a nontrivial element must be an automorphism. We give numerous explicit examples of test elements in free pro-p groups and Demushkin groups. By relating test elements in finitely generated residually finite-p Turner groups to test elements in their pro-p completions, we provide new examples of test elements in free discrete groups and surface groups. Moreover, we prove that the set of test elements of a free discrete group of finite rank is dense in the profinite topology.     

A priori error estimates of finite volume method for nonlinear optimal control problem

In this paper, we study a priori error estimates for the finite volume element approximation of nonlinear optimal control problem. The schemes use discretizations based on a finite volume method. For the variational inequality, we use the method of the variational discretization concept to obtain the control. Under some reasonable assumptions, we obtain some optimal order error estimates. The approximate order for the state, costate and control variables is O(h ²) or \(O\left( {{h^2}\sqrt {\left| {\ln h} \right|} } \right)\) in the sense of L ²-norm or L ^∞-norm. A numerical experiment is presented to test the theoretical results. Finally, we give some conclusions and future works.     

Quasirecognition by prime graph of <Emphasis Type="Italic">L</Emphasis><Subscript>10</Subscript>(2)

Let G be a finite group. The prime graph of G is denoted by Γ(G). The main result we prove is as follows: If G is a finite group such that Γ(G) = Γ(L ₁₀(2)) then G/O ₂(G) is isomorphic to L ₁₀(2). In fact we obtain the first example of a finite group with the connected prime graph which is quasirecognizable by its prime graph. As a consequence of this result we can give a new proof for the fact that the simple group L ₁₀(2) is uniquely determined by the set of its element orders.     

Galerkin finite element method and error analysis for the fractional cable equation

The cable equation is one of the most fundamental equations for modeling neuronal dynamics. These equations can be derived from the Nernst-Planck equation for electro-diffusion in smooth homogeneous cylinders. Fractional cable equations are introduced to model electrotonic properties of spiny neuronal dendrites. In this paper, a Galerkin finite element method(GFEM) is presented for the numerical simulation of the fractional cable equation(FCE) involving two integro-differential operators. The proposed method is based on a semi-discrete finite difference approximation in time and Galerkin finite element method in space. We prove that the numerical solution converges to the exact solution with order O(τ+h^l+1) for the lth-order finite element method. Further, a novel Galerkin finite element approximation for improving the order of convergence is also proposed. Finally, some numerical results are given to demonstrate the theoretical analysis. The results show that the numerical solution obtained by the improved Galerkin finite element approximation converges to the exact solution with order O(τ²+h^l+1).     

Residual <Emphasis Type="Italic">p</Emphasis>-finiteness of generalized free products of groups

Let p be a prime number. Recall that a group G is said to be a residually finite p-group if for every non-identity element a of G there exists a homomorphism of the group G onto a finite p-group such that the image of a does not coincide with the identity. We obtain a necessary and sufficient condition for the free product of two residually finite p-groups with finite amalgamated subgroup to be a residually finite p-group. This result is a generalization of Higman’s theorem on the free product of two finite p-groups with amalgamated subgroup.     

Characterizing fully principal congruence representable distributive lattices

Motivated by a recent paper of G. Grätzer, a finite distributive lattice D is called fully principal congruence representable if for every subset Q of D containing 0, 1, and the set J(D) of nonzero join-irreducible elements of D, there exists a finite lattice L and an isomorphism from the congruence lattice of L onto D such that Q corresponds to the set of principal congruences of L under this isomorphism. A separate paper of the present author contains a necessary condition of full principal congruence representability: D should be planar with at most one join-reducible coatom. Here we prove that this condition is sufficient. Furthermore, even the automorphism group of L can arbitrarily be stipulated in this case. Also, we generalize a recent result of G. Grätzer on principal congruence representable subsets of a distributive lattice whose top element is join-irreducible by proving that the automorphism group of the lattice we construct can be arbitrary.     

X-quasinormal subgroups

Considering two subgroups A and B of a group G and ? ≠ X ? G, we say that A is X-permutable with B if AB ^x = B ^x A for some element x ∈ X. We use this concept to give new characterizations of the classes of solvable, supersolvable, and nilpotent finite groups.     

On the <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-consistency of wavelet estimators

This paper deals with the L ^p -consistency of wavelet estimators for a density function based on size-biased random samples. More precisely, we firstly show the L ^p -consistency of wavelet estimators for independent and identically distributed random vectors in R ^d . Then a similar result is obtained for negatively associated samples under the additional assumptions d = 1 and the monotonicity of the weight function.     

A characterization of the simple group PSL<Subscript>5</Subscript>(5) by the set of its element orders

Let G be a finite group and let ω(G) denote the set of the element orders of G. For the simple group PSL₅(5) we prove that if G is a finite group with ω(G) = ω(PSL₅(5)), then either G ? PSL₅(5) or G ? PSL₅(5): 〈θ〉 where θ is a graph automorphism of PSL₅(5) of order 2.     

A weak Galerkin finite element method for the stokes equations

This paper introduces a weak Galerkin (WG) finite element method for the Stokes equations in the primal velocity-pressure formulation. This WG method is equipped with stable finite elements consisting of usual polynomials of degree k≥1 for the velocity and polynomials of degree k?1 for the pressure, both are discontinuous. The velocity element is enhanced by polynomials of degree k?1 on the interface of the finite element partition. All the finite element functions are discontinuous for which the usual gradient and divergence operators are implemented as distributions in properly-defined spaces. Optimal-order error estimates are established for the corresponding numerical approximation in various norms. It must be emphasized that the WG finite element method is designed on finite element partitions consisting of arbitrary shape of polygons or polyhedra which are shape regular.     

2-Recognizability by prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis><Superscript>2</Superscript>)

Let G be a finite group and let Γ(G) be the prime graph of G. Assume p prime. We determine the finite groups G such that Γ(G) = Γ(PSL(2, p ²)) and prove that if p ≠ 2, 3, 7 is a prime then k(Γ(PSL(2, p ²))) = 2. We infer that if G is a finite group satisfying |G| = |PSL(2, p ²)| and Γ(G) = Γ(PSL(2, p ²)) then G ? PSL(2, p ²). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications are also considered of this result to the problem of recognition of finite groups by element orders.     

New schemes with fractal error compensation for PDE eigenvalue computations

With an error compensation term in the fractal Rayleigh quotient of PDE eigen-problems,we propose a new scheme by perturbing the mass matrix Mhto Mh=Mh+Ch2mKh,where Khis the corresponding stif matrix of a 2m 1 degree conforming finite element with mesh size h for a 2m-order self-adjoint PDE,and the constant C exists in the priority error estimationλh jλj~Ch2mλ2j.In particular,for Laplace eigenproblems over regular domains in uniform mesh,e.g.,cube,equilateral triangle and regular hexagon,etc.,we find the constant C=I h 1Mh2 hKh and show that in this case the computation accuracy can raise two orders,i.e.,fromλh jλj=O(h2)to O(h4).Some numerical tests in 2-D and 3-D are given to verify the above arguments.