A CFL‐free explicit characteristic interior penalty scheme for linear advection‐reaction equations

We develop a CFL‐free, explicit characteristic interior penalty scheme (CHIPS) for one‐dimensional first‐order advection‐reaction equations by combining a Eulerian‐Lagrangian approach with a discontinuous Galerkin framework. The CHIPS method retains the numerical advantages of the discontinuous Galerkin methods as well as characteristic methods. An optimal‐order error estimate in the L² norm for the CHIPS method is derived and numerical experiments are presented to confirm the theoretical estimates. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Discontinuous finite volume element method for parabolic problems

In this article, we consider the semidiscrete and the backward Euler fully discrete discontinuous finite volume element methods for the second‐order parabolic problems and obtain the optimal order error estimates in a mesh dependent norm and in the L²‐norm. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Superconvergence of finite volume methods for the Stokes equations

A general superconvergence result of finite volume method for the Stokes equations is obtained by using a L² projection post‐processing technique. This superconvergence result can be applied to different finite volume methods and to general quasi‐uniform meshes.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2009     

Analysis and convergence of a MAC-like scheme for the generalized Stokes problem

We introduce a MAC-like scheme (a covolume method on rectangular grids) for approximating the generalized Stokes problem on an axiparallel domain. Two staggered grids are used in the derivation of the discretization. The velocity is approximated by conforming bilinears over rectangular elements, and the pressure by piecewise constants over macro-rectangular elements. The error in the velocity in the H¹ norm and the pressure in the L² norm are shown to be of first order, provided that the exact velocity is in H² and the exact pressure in H¹, and that the partition family of the domain is regular. © 1997 John Wiley & Sons, Inc.     

Evaluation of infinite series involving special products and their algebraic characterization

The aim of the paper is the investigation of special infinite series of the form

Lp error estimates and superconvergence for covolume or finite volume element methods

We consider convergence of the covolume or finite volume element solution to linear elliptic and parabolic problems. Error estimates and superconvergence results in the L^p norm, 2 ≤ p ≤ ∞, are derived. We also show second‐order convergence in the L^p norm between the covolume and the corresponding finite element solutions and between their gradients. The main tools used in this article are an extension of the “supercloseness” results in Chou and Li [Math Comp 69(229) (2000), 103–120] to the L^p based spaces, duality arguments, and the discrete Green's function method. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 463–486, 2003     

Weak Galerkin finite element methods for Parabolic equations

A newly developed weak Galerkin method is proposed to solve parabolic equations. This method allows the usage of totally discontinuous functions in approximation space and preserves the energy conservation law. Both continuous and discontinuous time weak Galerkin finite element schemes are developed and analyzed. Optimal‐order error estimates in both H¹ and L² norms are established. Numerical tests are performed and reported. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A-stable diagonally implicit Runge-Kutta-Nyström methods for parallel computers

In this paper, we study diagonally implicit Runge-Kutta-Nyström methods (DIRKN methods) for use on parallel computers. These methods are obtained by diagonally implicit iteration of fully implicit Runge-Kutta-Nyström methods (corrector methods). The number of iterations is chosen such that the method has the same order of accuracy as the corrector, and the iteration parameters serve to make the method at least A-stable. Since a large number of the stages can be computed in parallel, the methods are very efficient on parallel computers. We derive a number of A-stable, strongly A-stable and L-stable DIRKN methods of orderp withs ^* (p) sequential, singly diagonal-implicit stages wheres ^*(p)=[(p+1)/2] ors ^* (p)=[(p+1)/2]+1,[°] denoting the integer part function.These investigations were supported by the University of Amsterdam with a research grant to enable the author to spend a total of two years in Amsterdam.     

Elliptic equations in weighted Sobolev spaces of infinite order with L1 data

We deal with the existence and uniqueness of weak solutions for a class of strongly nonlinear boundary value problems of higher order with L¹ data in anisotropic‐weighted Sobolev spaces of infinite order. Copyright © 2009 John Wiley & Sons, Ltd.     

A posteriori error analysis of nonconforming finite volume elements for general second‐order elliptic PDEs

In this article, we study the a posteriori H¹ and L² error estimates for Crouzeix‐Raviart nonconforming finite volume element discretization of general second‐order elliptic problems in ?². The error estimators yield global upper and local lower bounds. Finally, numerical experiments are performed to illustrate the theoretical findings. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Constructing C3 shape preserving interpolating space curves

We present a method for constructing shape-preserving C ³ interpolants in R ³. The resulting curve is obtained by adding a polynomial perturbation of high degree to a curve which is shape-preserving but not sufficiently smooth. The degree of the perturbed curve is selected in order to maintain the shape properties of the basic curve.     

Speeding up Karmarkar's algorithm for multicommodity flows

We show how to speed up Karmarkar's linear programming algorithm for the case of multicommodity flows. The special structure of the constraint matrix is exploited to obtain an algorithm for the multicommodity flow problem which requires O(s ^3.5 v ^2.5 eL) arithmetic operations, each operation being performed to a precision of O (L) bits. Herev is the number of vertices ande is the number of edges in the given network,s is the number of commodities, andL is bounded by the number of bits in the input. We obtain a speed up of the order of (e ^0.5/v ^0.5)+(e ^2.5/v ^2.5s²) over Karmarkar's modified algorithm which is substantial for dense networks. The techniques in the paper can also be used to speed up any interior point algorithm for any linear programming problem whose constraint matrix is structurally similar to the one in the multicommodity flow problem. Research supported by a fellowship from the Shell Foundation. Research supported by NSF under grant NSF DCR-8404239.     

Compact difference schemes for heat equation with Neumann boundary conditions

In this article, two recent proposed compact schemes for the heat conduction problem with Neumann boundary conditions are analyzed. The first difference scheme was proposed by Zhao, Dai, and Niu (Numer Methods Partial Differential Eq 23, (2007), 949–959). The unconditional stability and convergence are proved by the energy methods. The convergence order is O(τ² + h^2.5) in a discrete maximum norm. Numerical examples demonstrate that the convergence order of the scheme can not exceeds O(τ² + h³). An improved compact scheme is presented, by which the approximate values at the boundary points can be obtained directly. The second scheme was given by Liao, Zhu, and Khaliq (Methods Partial Differential Eq 22, (2006), 600–616). The unconditional stability and convergence are also shown. By the way, it is reported how to avoid computing the values at the fictitious points. Some numerical examples are presented to show the theoretical results. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

On the amicability of orthogonal designs

Although it is known that the maximum number of variables in two amicable orthogonal designs of order 2ⁿp, where p is an odd integer, never exceeds 2n+2, not much is known about the existence of amicable orthogonal designs lacking zero entries that have 2n+2 variables in total. In this paper we develop two methods to construct amicable orthogonal designs of order 2ⁿp where p odd, with no zero entries and with the total number of variables equal or nearly equal to 2n+2. In doing so, we make a surprising connection between the two concepts of amicable sets of matrices and an amicable pair of matrices. With the recent discovery of a link between the theory of amicable orthogonal designs and space‐time codes, this paper may have applications in space‐time codes. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 240‐252, 2009     

Inertial manifolds and linear multi-step methods

We determine the existence and C ¹ convergence of an inertial manifold for a strongly A(α) stable, pth order, p≧1, linear multi-step method approximating a sectorial evolution equation that satisfies a gap condition. This inertial manifold gives rise to a one-step method that C ¹ approximates the inertial form of the evolution equation and yields further approximation properties of the multi-step method. This revised version was published online in June 2006 with corrections to the Cover Date.     

Algebraically stable general linear methods and the <Emphasis Type="Italic">G</Emphasis>-matrix

The standard algebraic stability condition for general linear methods (GLMs) is considered in a modified form, and connected to a branch of Control Theory concerned with the discrete algebraic Riccati equation (DARE). The DARE theory shows that, for an algebraically stable method, there is a minimal G-matrix, G ^*, satisfying an equation, rather than an inequality. This result, and another alternative reformulation of algebraic stability, are applied to construct new GLMs with 2 steps and 2 stages, one of which has order p=4 and stage order q=3. The construction process is simplified by method-equivalence, and Butcher’s simplified order conditions for the case p≤q+1.      

Negative Latin square type partial difference sets and amorphic association schemes with Galois rings

A partial difference set (PDS) having parameters (n², r(n?1), n+r²?3r, r²?r) is called a Latin square type PDS, while a PDS having parameters (n², r(n+1), ?n+r²+3r, r² +r) is called a negative Latin square type PDS. There are relatively few known constructions of negative Latin square type PDSs, and nearly all of these are in elementary abelian groups. We show that there are three different groups of order 256 that have all possible negative Latin square type parameters. We then give generalized constructions of negative Latin square type PDSs in 2‐groups. We conclude by discussing how these results fit into the context of amorphic association schemes and by stating some open problems. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 266‐282, 2009     

A P0–P0 weak Galerkin finite element method for solving singularly perturbed reaction–diffusion problems

This paper investigates the lowest-order weak Galerkin finite element (WGFE) method for solving reaction–diffusion equations with singular perturbations in two and three space dimensions. The system of linear equations for the new scheme is positive definite, and one might readily get the well-posedness of the system. Our numerical experiments confirmed our error analysis that our WGFE method of the lowest order could deliver numerical approximations of the order O(h^1/2) and O(h) in H¹ and L² norms, respectively.     

A characterization of the minimizer of a function

This paper is intended to give a characterization of the minimum point of a function in terms of the gradient of the function at some other point using some concepts from differential geometry. The function is assumed to have continuous partial derivatives up to and including order four. It is also assumed to have a positive-definite Hessian matrix onR ⁿ and a unique minimum point.     

A weak Galerkin mixed finite element method for the Helmholtz equation with large wave numbers

In this article, a new weak Galerkin mixed finite element method is introduced and analyzed for the Helmholtz equation with large wave numbers. The stability and well‐posedness of the method are established for any wave number k without mesh size constraint. Allowing the use of discontinuous approximating functions makes weak Galerkin mixed method highly flexible in term of little restrictions on approximations and meshes. In the weak Galerkin mixed finite element formulation, approximation functions can be piecewise polynomials with different degrees on different elements and meshes can consist elements with different shapes. Suboptimal order error estimates in both discrete H¹ and L² norms are established for the weak Galerkin mixed finite element solutions. Numerical examples are tested to support the theory.