Superconvergence of finite volume element method for a nonlinear elliptic problem

In this article, we consider the finite volume element method for the second‐order nonlinear elliptic problem and obtain the H¹ and W^1,∞ superconvergence estimates between the solution of the finite volume element method and that of the finite element method, which reveal that the finite volume element method is in close relationship with the finite element method. With these superconvergence estimates, we establish the L^p and W^1,p (2 < p ≤ ∞) error estimates for the finite volume element method for the second‐order nonlinear elliptic problem. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Application of wavelet bases in linear and nonlinear approximation to functions from Besov spaces

Linear and nonlinear approximations to functions from Besov spaces B _{p, q} ^σ ([0, 1]), σ > 0, 1 ≤ p, q ≤ ∞ in a wavelet basis are considered. It is shown that an optimal linear approximation by a D-dimensional subspace of basis wavelet functions has an error of order D ^{-min(σ, σ + 1/2 ? 1/p)} for all 1 ≤ p ≤ ∞ and σ > max(1/p ? 1/2, 0). An original scheme is proposed for optimal nonlinear approximation. It is shown how a D-dimensional subspace of basis wavelet functions is to be chosen depending on the approximated function so that the error is on the order of D ^?σ for all 1 ≤ p ≤ ∞ and σ > max(1/p ? 1/2, 0). The nonlinear approximation scheme proposed does not require any a priori information on the approximated function.     

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     

THE GROUPS OF ORDER qn · p

We describe a method to determine up to isomorphism the groups of order q ⁿ · p for a fixed prime-power q ⁿ and indeterminate prime p ≠ q. We report on the explicit construction of all groups of order 2 ⁿ · p for n ≤ 8 and 3 ⁿ · p for n ≤ 6. In particular, we show that there are 1 090 235 groups of order 768.     

A second order explicit finite element scheme to multidimensional conservation laws and its convergence

A second order explicit finite element scheme is given for the numerical computation to multi-dimensional scalar conservation laws.L ^p convergence to entropy solutions is proved under some usual conditions. For two-dimensional problems, uniform mesh, and sufficiently smooth solutions a second order error estimate inL ² is proved under a stronger condition, Δt≤Ch ^2/4     

Finite Exceptional p-Groups of Small Order

A finite group is said to be exceptional if its minimal degree of a faithful permutation representation is strictly less than that of one of its factor groups, called a distinguished quotient. It was previously unknown if exceptional p-groups of order less than p ⁶ existed for p an odd prime. The author proved in his M.Sc thesis that there are none of order ≤p ⁴ and gave restrictions on the possible existence of distinguished quotients of exceptional groups of order p ⁵. In this article, an exceptional p-group of order p ⁵ is exhibited for p any odd prime.     

Classification and geometric aspects of vector valued Fourier transforms

It is shown that for any locally compact abelian group ?? and 1 ≤ p ≤ 2, the Fourier type p norm with respect to ?? of a bounded linear operator T between Banach spaces, denoted by ‖T |???^??_p‖, satisfies ‖T |???^??_p‖ ≤ ‖T |???^??_p‖, where ?? is the direct product of ?₂, ?₃, ?₄, … It is also shown that if ?? is not of bounded order then Cⁿ_p ‖T |???^??_p‖ ≤ ‖T |???^??_p‖, where ?? is the circle group, n is a onnegative integer and C^p = . From these inequalities, for any locally compact abelian group ?? ‖T |???^??₂‖ ≤ ‖T |???^??₂‖, and moreover if ?? is not of bounded order then ‖T |???^??₂‖ = ‖T |???^??₂‖. The Hilbertian property and B‐convexity are discussed in the framework of Fourier type p norms. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Commutativity of association schemes of prime square order having non-trivial thin closed subsets

Through a study of the structure of the modular adjacency algebra over a field of positive characteristic p for a scheme of prime order p and utilizing the fact that every scheme of prime order is commutative, we show that every association scheme of prime square order having a non-trivial thin closed subset is commutative. The second author was supported by Korea Research Foundation Grant (KRF-2006-003-00008).     

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary preassigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted ??^p‐penalties on the coefficients of such expansions, with 1 ≤ p ≤ 2, still regularizes the problem. Use of such ??^p‐penalized problems with p < 2 is often advocated when one expects the underlying ideal noiseless solution to have a sparse expansion with respect to the basis under consideration. To compute the corresponding regularized solutions, we analyze an iterative algorithm that amounts to a Landweber iteration with thresholding (or nonlinear shrinkage) applied at each iteration step. We prove that this algorithm converges in norm. © 2004 Wiley Periodicals, Inc.     

Analysis of the immersed boundary method for a finite element Stokes problem

Convergence results are presented for the immersed boundary (IB) method applied to a model Stokes problem. As a discretization method, we use the finite element method. First, the immersed force field is approximated using a regularized delta function. Its error in the W^{?1, p} norm is examined for 1 ≤ p < n/(n ? 1), with n representing the space dimension. Subsequently, we consider IB discretization of the Stokes problem and examine the regularization and discretization errors separately. Consequently, error estimate of order h^{1 ? α} in the W^{1, 1} × L¹ norm for the velocity and pressure is derived, where α is an arbitrary small positive number. The validity of those theoretical results is confirmed from numerical examples.     

Alternative rings of small order

We construct all the alternative (but not associative) algebras of dimension at most 5 over a perfect field. For any prime p, we show that there are fifteen alternative rings of prime power order pⁿ ,n≤5, which are not associative. None of these rings is nil. Just one has a unity.     

Quadratic invariant curves for a planar mapping

A planar mapping was derived from a second order delay differential equation with a piecewise constant argument. Invariant curves for the planar mapping reflects on the dynamics of the differential equation. Results were reported on a planar mapping admitting quadratic invariant curves y=x ²+C, except for the case -3/4≥C≤0. This remaining case is now resolved, and we describe the solutions of the functional equation K(x ²+C)+k(x)=x by iterations of y.     

Error estimates for finite volume element methods for general second‐order elliptic problems

We treat the finite volume element method (FVE) for solving general second order elliptic problems as a perturbation of the linear finite element method (FEM), and obtain the optimal H¹ error estimate, H¹ superconvergence and L^p (1 < p ≤ ∞) error estimates between the solution of the FVE and that of the FEM. In particular, the superconvergence result does not require any extra assumptions on the mesh except quasi‐uniform. Thus the error estimates of the FVE can be derived by the standard error estimates of the FEM. Moreover we consider the effects of numerical integration and prove that the use of barycenter quadrature rule does not decrease the convergence orders of the FVE. The results of this article reveal that the FVE is in close relationship with the FEM. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 693–708, 2003.     

Merging percolation on Zd and classical random graphs: Phase transition

We study a random graph model which is a superposition of bond percolation on Z^d with parameter p, and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so‐called “rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on the set of parameters c ≥ 0 and 0 ≤ p < p_c, where p_c = p_c(d) is the critical probability for the bond percolation on Z^d. The phase transition is of second order as in the classical random graph. We find the scaled size of the largest connected component in the supercritical regime. We also provide a sharp upper bound for the largest connected component in the subcritical regime. The latter is a new result for inhomogeneous random graphs with unbounded kernels. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

Technical note: A fourth‐order finite difference scheme for a system of a 2D nonlinear elliptic partial differential equations

In this article we present a fourth‐order finite difference scheme, for a system of two‐dimensional, second‐order, nonlinear elliptic partial differential equations with mixed spatial derivative terms, using 13‐point stencils with a uniform mesh size h on a square region R subject to Dirichlet boundary conditions. The scheme of order h⁴ is derived using the local solution of the system on a single stencil. The resulting system of algebraic equations can be solved by iterative methods. The difference scheme can be easily modified to obtain formulae for grid points near the boundary. Computational results are given to demonstrate the performance of the scheme on some problems including Navier‐Stokes equations. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 43–53, 2001     

A note on the sunouchi operator with respect to the walsh—kaczmarz system

An analogue of the so—called Sunouchi operator with respect to the Walsh—Kaczmarz system will be investigated. We show the boundedness of this operator if we take it as a map from the dyadic Hardy space H ^p to L ^p for all 0<p≤1.. For the proof we consider a multiplier operator and prove its (H ^p H ^p)—boundedness for 0<p≤1. Since the multiplier is obviously bounded from L ² to L ², a theorem on interpolation of operators can be applied to show that our multiplier is of weak type (1,1) and of type (q q) for all 1<q<∞. The same statements follow also for the Sunouchi operator.     

Riesz transforms on a solvable Lie group of polynomial growth

We study Riesz transforms associated with a sublaplacian H on a solvable Lie group G, where G has polynomial volume growth. It is known that the standard second order Riesz transforms corresponding to H are generally unbounded in L^p(G). In this paper, we establish boundedness in L^p for modified second order Riesz transforms, which are defined using derivatives on a nilpotent group G_N associated with G. Our method utilizes a new algebraic approach which associates a distinguished choice of Cartan subalgebra with the sublaplacian H. We also obtain estimates for higher derivatives of the heat kernel of H, and give a new proof (without the use of homogenization theory) of the boundedness of first order Riesz transforms. Our results can be generalized to an arbitrary (possibly non-solvable) Lie group of polynomial growth.     

Solvability in Hardy space for second order elliptic equations

We obtain a priori estimates and solvability in Hardy type space in a bounded domain of R ⁿ for second order elliptic equations with coefficients of limited smoothness. Such a result can be served as an endpoint case of the classical L ^p (1 < p < ∞) theory for second order elliptic equations. Our approach is based on a standard technique of perturbation rather than that of integral representation formula.     

A finite difference scheme of improved accuracy on a priori adapted grids for a singularly perturbed parabolic convection-diffusion equation

In the case of the Dirichlet problem for a singularly perturbed parabolic convection-diffusion equation with a small parameter ɛ multiplying the higher order derivative, a finite difference scheme of improved order of accuracy that converges almost ɛ-uniformly (that is, the convergence rate of this scheme weakly depends on ɛ) is constructed. When ɛ is not very small, this scheme converges with an order of accuracy close to two. For the construction of the scheme, we use the classical monotone (of the first order of accuracy) approximations of the differential equation on a priori adapted locally uniform grids that are uniform in the domains where the solution is improved. The boundaries of such domains are determined using a majorant of the singular component of the grid solution. The accuracy of the scheme is improved using the Richardson technique based on two embedded grids. The resulting scheme converges at the rate of O((ɛ⁻¹ N ^−K ln² N)² + N ⁻²ln⁴ N + N ₀⁻²) as N, N ₀ → ∞, where N and N ₀ determine the number of points in the meshes in x and in t, respectively, and K is a prescribed number of iteration steps used to improve the grid solution. Outside the σ-neighborhood of the lateral boundary near which the boundary layer arises, the scheme converges with the second order in t and with the second order up to a logarithmic factor in x; here, σ = O(N ^{−(K − 1)}ln² N). The almost ɛ-uniformly convergent finite difference scheme converges with the defect of ɛ-uniform convergence ν, namely, under the condition N ⁻¹ ≪ ɛ^ν, where ν determining the required number of iteration steps K (K = K(ν)) can be chosen sufficiently small in the interval (0, 1]. When ɛ⁻¹ = O(N ^{K − 1}), the scheme converges at the rate of O(N ⁻²ln⁴ N + N ₀⁻²).     

New energy identities and super convergence analysis of the energy conserved splitting FDTD methods for 3D Maxwell's equations

The energy‐conserved splitting finite‐difference time‐domain (EC‐S‐FDTD) method has recently been proposed to solve the Maxwell equations with second order accuracy while numerically keep the L² energy conservation laws of the equations. In this paper, the EC‐S‐FDTD scheme for the 3D Maxwell equations is proved to be energy‐conserved and unconditionally stable in the discrete H¹ norm. The EC‐S‐FDTD scheme is of second‐order accuracy both in time step and spatial steps, which suggests the super‐convergence of this scheme in the discrete H¹ norm. And the divergence of the electric field of the EC‐S‐FDTD scheme in the discrete L² norm is second‐order accurate. Numerical experiments confirm our theoretical analysis. Copyright © 2012 John Wiley & Sons, Ltd.