高阶单步A-稳定指数拟合法

In this paper,the necessary and sutlicient conditions for general one-step methoos to be exponentially fitted at q0∈C are given, A class of multtderivative hybrid one-step methods of order at least s 1 is constructed with s 1 parameters,where s is the order of derivative. The necessary and sufficient conditions for these methods to be A-stable and exponentially fitted is proved, Furthermore,a class of A-stable 2 parameters hybrid one-step methods of order at least 8 are constructed,which use 4th order derivative,These methods are exponentially fitted at q0 if and only its fitted function f(q) satisfies f(q0)= 0, Finally,an A-stable exponentlally fitted method of order 8 is obtained.     

Third order iterative methods free from second derivative for nonlinear systems

In this work we present a family of predictor-corrector methods free from second derivative for solving nonlinear systems. We prove that the methods of this family are of third order convergence. We also perform numerical tests that allow us to compare these methods with Newton’s method. In addition, the numerical examples improve theoretical results, showing super cubic convergence for some methods of this family.     

Superconvergent error estimates for a class of discretization methods for a coupled first‐order system with discontinuous coefficients

Lithological discontinuities in a reservoir generate discontinuous coefficients for the first‐order system of equations used in the simulation of fluid flow in porous media. Systems of conservation laws with discontinuous coefficients also arise in many other physical applications. In this article, we present a class of discretization schemes that include variants of mixed finite element methods, finite volume element methods, and cell‐centered finite difference equations as special cases. Error estimates of the order O(h²) in certain discrete L²‐norms are established for both the primary independent variable and its flux, even in the presence of discontinuous coefficients in the flux term. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 267–283, 1999     

Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part I: Low order conforming, nonconforming, and mixed FEM

Averaging techniques are popular tools in adaptive finite element methods for the numerical treatment of second order partial differential equations since they provide efficient a posteriori error estimates by a simple postprocessing. In this paper, their reliablility is shown for conforming, nonconforming, and mixed low order finite element methods in a model situation: the Laplace equation with mixed boundary conditions. Emphasis is on possibly unstructured grids, nonsmoothness of exact solutions, and a wide class of averaging techniques. Theoretical and numerical evidence supports that the reliability is up to the smoothness of given right-hand sides.

     

Development and Analysis of Higher Order Finite Volume Methods over Rectangles for Elliptic Equations

Currently used finite volume methods are essentially low order methods. In this paper, we present a systematic way to derive higher order finite volume schemes from higher order mixed finite element methods. Mostly for convenience but sometimes from necessity, our procedure starts from the hybridization of the mixed method. It then approximates the inner product of vector functions by an appropriate, critical quadrature rule; this allows the elimination of the flux and Lagrange multiplier parameters so as to obtain equations in the scalar variable, which will define the finite volume method. Following this derivation with different mixed finite element spaces leads to a variety of finite volume schemes. In particular, we restrict ourselves to finite volume methods posed over rectangular partitions and begin by studying an efficient second-order finite volume method based on the Brezzi–Douglas–Fortin–Marini space of index two. Then, we present a general global analysis of the difference between the solution of the underlying mixed finite element method and its related finite volume method. Then, we derive finite volume methods of all orders from the Raviart–Thomas two-dimensional rectangular elements; we also find finite volume methods to associate with BDFM ₂ three-dimensional rectangles. In each case, we obtain optimal error estimates for both the scalar variable and the recovered flux.     

Numerical simulations of the improved Boussinesq equation

In this study, numerical simulations of the improved Boussinesq equation are obtained using two finite difference schemes and two finite element methods, based on the second‐and third‐order time discretization. The methods are tested on the problems of propagation of a soliton and interaction of two solitons. After the L_∞ error norm is used to measure differences between the exact and numerical solutions, the results obtained by the proposed methods are compared with recently published results. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Total variation diminishing Runge-Kutta schemes

In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in a paper by Shu and Osher, suitable for solving hyperbolic conservation laws with stable spatial discretizations. We illustrate with numerical examples that non-TVD but linearly stable Runge-Kutta time discretization can generate oscillations even for TVD (total variation diminishing) spatial discretization, verifying the claim that TVD Runge-Kutta methods are important for such applications. We then explore the issue of optimal TVD Runge-Kutta methods for second, third and fourth order, and for low storage Runge-Kutta methods.

     

Superconvergent Nyström and degenerate kernel methods for eigenvalue problems

The Nyström and degenerate kernel methods, based on projections at Gauss points onto the space of (discontinuous) piecewise polynomials of degree ?r-1, for the approximate solution of eigenvalue problems for an integral operator with a smooth kernel, exhibit order 2r. We propose new superconvergent Nyström and degenerate kernel methods that improve this convergence order to 4r for eigenvalue approximation and to 3r for spectral subspace approximation in the case where the kernel is sufficiently smooth. Moreover for a simple eigenvalue, we show that by using an iteration technique, an eigenvector approximation of order 4r can be obtained. The methods introduced here are similar to that studied by Kulkarni in [10] and exhibit the same convergence orders, so a comparison with these methods is worked out in detail. Also, the error terms are analyzed and the obtained methods are numerically tested. Finally, these methods are extended to the case of discontinuous kernel along the diagonal and superconvergence results are also obtained.     

An optimal Steffensen-type family for solving nonlinear equations

In this paper, a general family of Steffensen-type methods with optimal order of convergence for solving nonlinear equations is constructed by using Newton’s iteration for the direct Newtonian interpolation. It satisfies the conjecture proposed by Kung and Traub [H.T. Kung, J.F. Traub, Optimal order of one-point and multipoint iteration, J. Assoc. Comput. Math. 21 (1974) 634-651] that an iterative method based on m evaluations per iteration without memory would arrive at the optimal convergence of order 2^m−1. Its error equations and asymptotic convergence constants are obtained. Finally, it is compared with the related methods for solving nonlinear equations in the numerical examples.     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.     

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.     

Symplectic Runge-Kutta methods of high order based on W-transformation

In this paper , characterizations of symmetric and symplectic Runge-Kutta methods based on the W-transformation of Hairer and Wanner are presented. Using these characterizations, we construct two families symplectic (symmetric and algebraically stable or algebraically stable) Runge-Kutta methods of high order. Methods constructed in this way and presented in this paper include and extend the known classes of high order implicit Runge-Kutta methods.     

A Family of Fifth-Order Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.     

Generalized Lagrange Jacobi-Gauss-Lobatto vs Jacobi-Gauss-Lobatto collocation approximations for solving (2 + 1)-dimensional Sine-Gordon equations

The Sine-Gordon (SG) equations are very important in that they can accurately model many essential physical phenomena. In this paper, the Jacobi-Gauss-Lobatto collocation (JGL-C) and Generalized Lagrange Jacobi-Gauss-Lobatto collocation (GLJGL-C) methods are adopted and compared to simulate the (2 + 1)-dimensional nonlinear SG equations. In order to discretize the time variable t, the Crank-Nicolson method is employed. For the space variables, two numerical methods based on the aforementioned collocation methods are applied. Furthermore, error estimation for both methods is provided. The present numerical method is truly effective, free of integration and derivative, and easy to implement. The given examples and the results assert that the GLJGL-C method outperforms the JGL-C method in terms of computation speed. Also, the presented methods are very valid, effective, and reliable.     

B-splines methods with redefined basis functions for solving fourth order parabolic partial differential equations

In this work, we discuss two methods for solving a fourth order parabolic partial differential equation. In Method-I, we decompose the given equation into a system of second order equations and solve them by using cubic B-spline method with redefined basis functions. In Method-II, the equation is solved directly by applying quintic B-spline method with redefined basis functions. Stability of these methods have been discussed. Both methods are unconditionally stable. These methods are tested on four examples. The computed results are compared wherever possible with those already available in literature. We have developed Method-I for fourth order non homogeneous parabolic partial differential equation from which we can obtain displacement and bending moment both simultaneously, while Method-II gives only displacement. The results show that the derived methods are easily implemented and approximate the exact solution very well.     

Symplectic RK Methods and Symplectic PRK Methods with Real Eigenvalues

Properties of symplectic Runge-Kutta (RK) methods and symplectic partitioned Runge-Kutta (PRK) methods with real eigenvalues are discussed in this paper. It is shown that an s stage such method can‘t reach order more than s 1. Particularly, we prove that no symplectic RK method with real eigenvalues exists in stage s of order s 1 when s is even. But an example constructed by using the W-transformation shows that PRK method of this type does not necessarily meet this order barrier. Another useful way other than W-transformation to construct symplectic PRK method with real eigenvalues is then presented. Finally, a class of efficient symplectic methods is recommended.     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

Two new families of sixth-order methods for solving non-linear equations

In this paper, we developed two new families of sixth-order methods for solving simple roots of non-linear equations. Per iteration these methods require two evaluations of the function and two evaluations of the first-order derivatives, which implies that the efficiency indexes of our methods are 1.565. These methods have more advantages than Newton’s method and other methods with the same convergence order, as shown in the illustration examples. Finally, using the developing methodology described in this paper, two new families of improvements of Jarratt method with sixth-order convergence are derived in a straightforward manner. Notice that Kou’s method in [Jisheng Kou, Yitian Li, An improvement of the Jarratt method, Appl. Math. Comput. 189 (2007) 1816-1821] and Wang’s method in [Xiuhua Wang, Jisheng Kou, Yitian Li, A variant of Jarratt method with sixth-order convergence, Appl. Math. Comput. 204 (2008) 14-19] are the special cases of the new improvements.     

两类五阶解非线性方程组的迭代算法

本文首先根据Runge-Kutta方法的思想,结合Newton迭代法,提出了一类带参数的解非线性方程组F(x)=0的迭代算法,然后基于解非线性方程f(x)=0的King算法,给出第二类解非线性方程组的迭代算法,收敛性分析表明这两类算法都是五阶收敛的.其次给出了本文两类算法的效率指数,以及一些已知算法的效率指数,并且将本文算法的效率指数与其它方法进行详细的比较,通过效率比率R_(i,j)可知本文算法具有较高的计算效率.最后给出了四个数值实例,将本文两类算法与现有的几种算法进行比较,实验结果说明本文算法收敛速度快,迭代次数少,有明显的优势.     

解初值问题y″=g(x，y)的含参数块方法

1引言对于二阶常微分方程的初值问题y″=g(x,y),y(x_0)=y_0,y′(x_0)=y_0′,x_0(?)x(?)T(1)的数值解法的研究引起人们的广泛兴趣．对于直接积分(1),自从1976年J．D．Lambert和I．A．Waston提出二阶P-稳定方法和1978年G．Dahlquist证明P-稳定常系数线性多步方法的最高相容阶不超过2的重要结论以来,截止目前,已积累了许多高于2阶的P-稳定方法．例如,修正的Numerov方法,混合法(特殊形式RK的方法),多导法,Obrechkoff方法,显式RKN方法,单隐方法和对角隐式RKN方法等(顺便指出,文献[5,16]中所说的高阶方法的相容阶均不超过4)．所有这些方法,有些相