Two-grid Methods for Finite Volume Element Approximations of Nonlinear Sobolev Equations

In this article, two-grid methods are studied for solving nonlinear Sobolev equation using the finite volume element method. The methods are based on one coarse grid space and one fine grid space. The nonsymmetric and nonlinear iterations are only executed on the coarse grid (with grid size H), and the fine grid solution (with grid size h) can be obtained in a single symmetric and linear step. The optimal H¹ error estimates are presented for the proposed methods, which show that the two-grid methods achieve optimal approximation as long as the mesh sizes satisfy h = 𝒪(H³|ln H|). As a result, solving such a large class of nonlinear Sobolev equations will not be much more difficult than solving one linearized equation.     

Variational approach to some damped Dirichlet problems with impulses

In this paper, we study the existence of solutions for damped nonlinear impulsive differential equations with Dirichlet boundary conditions. By using critical point theory and variational methods, we give some new criteria to guarantee that the impulsive problems have at least one solution. Some recent results are extended and significantly improved. Finally, some examples are presented to illustrate our main results. Copyright © 2013 John Wiley & Sons, Ltd.     

Convergence of one-leg methods for nonlinear neutral delay integro-differential equations

Some convergence results of one-leg methods for nonlinear neutral delay integro-differential equations (NDIDEs) are obtained. It is proved that a one-leg method is E (or EB) -convergent of order p for nonlinear NDIDEs if and only if it is A-stable and consistent of order p in classical sense for ODEs, where p = 1, 2. A numerical example that confirms the theoretical results is given in the end of this paper. This work was supported by National Natural Science Foundation of China (Grant No. 10871164), the Natural Science Foundation of Hunan Province (Grant No. 08JJ6002), and the Scientific Research Fund of Changsha University of Science and Technology (Grant No. 1004259)     

Numerical Solutions for second-kind Volterra integral equations by Galerkin methods

In this paper, we study the global convergence for the numerical solutions of nonlinear Volterra integral equations of the second kind by means of Galerkin finite element methods. Global superconvergence properties are discussed by iterated finite element methods and interpolated finite element methods. Local superconvergence and iterative correction schemes are also considered by iterated finite element methods. We improve the corresponding results obtained by collocation methods in the recent papers [6] and [9] by H. Brunner, Q. Lin and N. Yan. Moreover, using an interpolation post-processing technique, we obtain a global superconvergence of the O(h ^2r )-convergence rate in the piecewise-polynomial space of degree not exceeding (r–1). As a by-product of our results, all these higher order numerical methods can also provide an a posteriori error estimator, which gives critical and useful information in the code development.     

Solitary wave solutions to some classes of nonlinear evolution type equations using inverse variational methods

Invariants of reduced forms of a p.d.e. are obtainable from a variational principle even though the p.d.e. itself does not admit a Lagrangian. The reductions carry all the advantages regarding Noether symmetries and double reductions via first integrals or conserved quantities. The examples we consider are nonlinear evolution type equations like the general form of the Fizhugh–Nagumo and KdV–Burgers equations. Some aspects of Painlevé properties of the reduced equations are also obtained.     

Regularity for Fully Nonlinear Elliptic Equations with Neumann Boundary Data

We obtain local C ^α, C ^1,α, and C ^2,α regularity results up to the boundary for viscosity solutions of fully nonlinear uniformly elliptic second order equations with Neumann boundary conditions.     

Stability Analysis of Runge-Kutta Methods for Non-Linear Delay Differential Equations

This paper is concerned with the numerical solution of delay differential equations(DDEs). We focus on the stability behaviour of Runge-Kutta methods for nonlinear DDEs. The new concepts of GR(l)-stability, GAR(l)-stability and weak GAR(l)-stability are further introduced. We investigate these stability properties for (k, l)-algebraically stable Runge-Kutta methods with a piecewise constant or linear interpolation procedure.     

Long time stability and convergence for fully discrete nonlinear galerkin methods

The aim of this paper is to analyze the fully discrete nonlinear Galerkin methods, which are well suited to the long time integration of dissipative partial differential equations.

With the help of several time discrete Gronwall lemmas, we are able to prove L ^∞(IR⁺,H ^α ) (α=0,1) stabilities of the fully discrete nonlinear Galerkin methods under a less restrictive time step constraint than that of the classical Galerkin methods.     

Generalized Stokes resolvent equations in an infinite layer with mixed boundary conditions

In this paper we prove unique solvability of the generalized Stokes resolvent equations in an infinite layer Ω₀ = ℝ^{n –1} × (–1, 1), n ≥ 2, in L^q ‐Sobolev spaces, 1 < q < ∞, with slip boundary condition of on the “upper boundary” ∂Ω⁺₀ = ℝ^{n –1} × {1} and non‐slip boundary condition on the “lower boundary” ∂Ω^–₀ = ℝ^{n –1} × {–1}. The solution operator to the Stokes system will be expressed with the aid of the solution operators of the Laplace resolvent equation and a Mikhlin multiplier operator acting on the boundary. The present result is the first step to establish an L^q ‐theory for the free boundary value problem studied by Beale [9] and Sylvester [22] in L ²‐spaces. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A class of Steffensen type methods with optimal order of convergence

In this paper, a family of Steffensen type methods of fourth-order convergence for solving nonlinear smooth equations is suggested. In the proposed methods, a linear combination of divided differences is used to get a better approximation to the derivative of the given function. Each derivative-free member of the family requires only three evaluations of the given function per iteration. Therefore, this class of methods has efficiency index equal to 1.587. Kung and Traub conjectured that the order of convergence of any multipoint method without memory cannot exceed the bound 2^d-1, where d is the number of functional evaluations per step. The new class of methods agrees with this conjecture for the case d=3. Numerical examples are made to show the performance of the presented methods, on smooth and nonsmooth equations, and to compare with other ones.     

A finite volume method on general surfaces and its error estimates

In this paper, we study a finite volume method and its error estimates for the numerical solution of some model second order elliptic partial differential equations defined on a smooth surface. The discretization is defined via a surface mesh consisting of piecewise planar triangles and piecewise polygons. The optimal error estimates of the approximate solution are proved in both the H¹ and L² norms which are of first order and second order respectively under mesh regularity assumptions. Some numerical tests are also carried out to experimentally verify our theoretical analysis.     

Two‐Grid method for nonlinear parabolic equations by expanded mixed finite element methods

In this article, we develop a two‐grid algorithm for nonlinear reaction diffusion equation (with nonlinear compressibility coefficient) discretized by expanded mixed finite element method. The key point is to use two‐grid scheme to linearize the nonlinear term in the equations. The main procedure of the algorithm is solving a small‐scaled nonlinear equations on the coarse grid and dealing with a linearized system on the fine space using the Newton iteration with the coarse grid solution. Error estimation to the expanded mixed finite element solution is analyzed in detail. We also show that two‐grid solution achieves the same accuracy as long as the mesh sizes satisfy H = O(h^1/2). Two numerical experiments are given to verify the effectiveness of the algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

EXISTENCE AND UNIQUENESS OF SOLUTIONS FOR NONLINEAR FRACTIONAL DIFFERENTIAL EQUATIONS WITH NON-SEPARATED TYPE INTEGRAL BOUNDARY CONDITIONS

In this paper, we study a boundary value problem of nonlinear fractional differential equations of order q (1 < q ≤ 2) with non-separated integral boundary conditions. Some new existence and uniqueness results are obtained by using some standard fixed point theorems and Leray-Schauder degree theory. Some illustrative examples are also presented. We extend previous results even in the integer case q = 2.     

Space-time means and solutions to a class of nonlinear parabolic equations

Cauchy problem and initial boundary value problem for nonlinear parabolic equation inCB([0,T):L ^p ) orL ^q (0,T; L ^p ) type space are considered. Similar to wave equation and dispersive wave equation, the space-time means for linear parabolic equation are shown and a series of nonlinear estimates for some nonlinear functions are obtained by space-time means. By Banach fixed point principle and usual iterative technique a local mild solution of Cauchy problem or IBV problem is constructed for a class of nonlinear parabolic equations inCB([0,T);L ^p orL ^q (0,T; L ^p ) with ϕ(x)∈L ^r . In critical nonlinear case it is also proved thatT can be taken as infinity provided that ||ϕ(x)||_r is sufficiently small, where (p,q,r) is an admissible triple. Project supported by the National Natural Science Foundation of China (Grant No. 19601005).     

Mono-Implicit Runge-Kutta-Nyström Methods with Application to Boundary Value Ordinary Differential Equations

The successful use of mono-implicit Runge—Kutta methods has been demonstrated by several researchers who have employed these methods in software packages for the numerical solution of boundary value ordinary differential equations. However, these methods are only applicable to first order systems of equations while many boundary value systems involve higher order equations. While it is straightforward to convert such systems to first order, several advantages, including substantial gains in efficiency, higher continuity of the approximate solution, and lower storage requirements, are realized when the equations can be treated in their original higher order form. In this paper, we consider generalizations of mono-implicit Runge—Kutta methods, called mono-implicit Runge—Kutta—Nyström methods, suitable for systems of second order ordinary differential equations having the general form, y(t) = f(t,y(t),y(t)), and derive optimal symmetric methods of orders two, four, and six. We also introduce continuous mono-implicit Runge—Kutta—Nyström methods which allow us to provide continuous solution and derivative approximations. Numerical results are included to demonstrate the effectiveness of these methods; savings of 65% are attained in some instances.This revised version was published online in October 2005 with corrections to the Cover Date.     

A Classification of Quasi-Newton Methods

In this paper, we consider quasi-Newton methods of the form x _k+1=x _k + _k f(x _k ), k=0,1,. . ., for the solution of the system of nonlinear equations f(x)=0. We present a classification of such methods based on different structures for the matrix _k and various criteria for its computation, issued from three different formulae. Many known methods can be put into this framework and new methods are also obtained.     

The mean field kinetic equation for interacting particle systems with non-Lipschitz force

In this paper, we prove the global existence of the weak solution to the mean field kinetic equation derived from the N-particle Newtonian system. For L¹∩L^∞ initial data, the solvability of the mean field kinetic equation can be obtained by using uniform estimates and compactness arguments while the difficulties arising from the nonlocal nonlinear interaction are tackled appropriately using the Aubin-Lions compact embedding theorem.     

On Two Iterative Least-Squares Finite Element Schemes for the Incompressible Navier–Stokes Problem

This paper is mainly devoted to a comparative study of two iterative least-squares finite element schemes for solving the stationary incompressible Navier–Stokes equations with velocity boundary condition. Introducing vorticity as an additional unknown variable, we recast the Navier–Stokes problem into a first-order quasilinear velocity–vorticity–pressure system. Two Picard-type iterative least-squares finite element schemes are proposed to approximate the solution to the nonlinear first-order problem. In each iteration, we adopt the usual L ² least-squares scheme or a weighted L ² least-squares scheme to solve the corresponding Oseen problem and provide error estimates. We concentrate on two-dimensional model problems using continuous piecewise polynomial finite elements on uniform meshes for both iterative least-squares schemes. Numerical evidences show that the iterative L ² least-squares scheme is somewhat suitable for low Reynolds number flow problems, whereas for flows with relatively higher Reynolds numbers the iterative weighted L ² least-squares scheme seems to be better than the iterative L ² least-squares scheme. Numerical simulations of the two-dimensional driven cavity flow are presented to demonstrate the effectiveness of the iterative least-squares finite element approach.     

Two-point and three-point boundary value problems for n th-order nonlinear differential equations

In this article, we are concerned with existence and uniqueness of solutions of four kinds of two-point boundary value problems for nth-order nonlinear differential equations by “Shooting” method, and studied existence and uniqueness of solutions of a kind of three-point boundary value problems for nth-order nonlinear differential equations by “Matching” method.     

On an initial-value method for quickly solving Volterra integral equations: A review

A method of converting nonlinear Volterra equations to systems of ordinary differential equations is compared with a standard technique, themethod of moments, for linear Fredholm equations. The method amounts to constructing a Galerkin approximation when the kernel is either finitely decomposable or approximated by a certain Fourier sum. Numerical experiments from recent work by Bownds and Wood serve to compare several standard approximation methods as they apply to smooth kernels. It is shown that, if the original kernel decomposes exactly, then the method produces a numerical solution which is as accurate as the method used to solve the corresponding differential system. If the kernel requires an approximation, the error is greater, but in examples seems to be around 0.5% for a reasonably small number of approximating terms. In any case, the problem of excessive kernel evaluations is circumvented by the conversion to the system of ordinary differential equations.