一类无条件稳定的显式方法

众所周知,在使用线性方法(如线性多步法,Runge-Kutta方法,合成多步法等)对Stiff常微分方程组初值问题进行数值积分时,为了保证该初值问题数值解是稳定的,则要求数值方法在某种意义下是无条件稳定的.为此,所使用的线性方法首先必须是隐式的.在使用隐式线性方法对Stiff系统初值问题进行数值解时,每向前积分一步,往往     

多时滞微分方程数值稳定性

考虑了时滞微分方程的初值问题,分析了用线性多步法求解一类滞后型微分系统数值解的稳定性,在一定的Lagrange插值条件下,给出并证明了求解滞后型微分系统的线性多步法数值稳定的充分必要条件.     

用加权平均方法构造新的隐式线性多步法公式

在已知的线性多步法公式中,用两个较适合的线性多步法进行加权平均就能构造出一系列新的隐式线性多步法公式,而且其中有些公式可能具有较好的性质,如稳定域增大.从而使得解刚性方程时,可以根据对稳定域与截断误差不同的需求来选择公式,以达到在适合的稳定域下,截断误差最小.经过数值试验验证,本文举出的实例中用加权平均方法构造出的有些新公式的稳定域大于原来两个公式任一个的稳定域,可应用于求解常微分方程初值问题的刚性问题.     

一类修正的BDF方法

1.引言 在常微分方程初值问题的数值方法中,线性多步法是最简单、使用最广泛的方法之一.但在刚性(Stiff)微分方程中,由于数值稳定性问题,线性多步法的应用受到很大限制.G.Dahlquist指出,A-稳定线性多步法的最高可达阶是2,而梯形公式是2阶A-稳定线性多步法中误差常数最小的方法.因此,人们不再致力于探索高阶A-稳定线性多     

求解非线性刚性初值问题的隐显线性多步方法的误差分析

隐显线性多步方法由隐式线性多步方法和显式线性多步法组合而成.本文主要讨论求解满足单边Lipschitz条件的非线性刚性初值问题和一类奇异摄动初值问题的隐显线性多步方法的误差分析.最后,由数值例子验证了所获的理论结果的正确性及方法处理这两类问题的有效性.     

解常微分方程的差分算子法

一 引言 差分方法是常微分方程初值问题数值解法中最基本、最重要的方法。已经有多种途径构造出许多差分格式,本文超出一般线性多步法的范围,构造适于解stiff常微分方程的A-稳定的隐式单步法。     

广义时滞微分方程的渐近稳定性和数值分析

考虑了广义时滞微分方程的初值问题，分析了用线性多步法求解一类广义滞后型微分系统数值解的稳定性，在一定的Lagrange插值条件下，给出并证明了求解广义滞后型微分系统的线性多步法数值稳定的充分必要条件。     

一类线性隐式A稳定的单步法

1.引言 对于Stiff方程组初值问题的数值解法,Dahlquist在[1]中引进了 A稳定的概念,并且证明了显式的线性多步法(包括显式的Runge-Kutta方法)不可能是A稳定的.现在已经有许许多多隐式A稳定或Stiff稳定的方法,但绝大多数在数值解的过程中必须解由于隐式方法所产生的非线性方程组,而非线性方程组的求解过程往往又要采用Newton-Raphson迭代方法,因此需要计算方程y’=f(x,y)的右函数f(x,y)的Jacobi矩阵以及与此有关的逆矩阵.本文的主要思想是:既然在数值解过程中要计算f(x,y)的Jacobi矩阵,那么不妨在数值公式中明显的出现f(x,y)的一阶偏导数.我们将A稳定公式     

线性Volterra多延迟积分微分方程线性多步法的GPm稳定性

讨论了多步法求解线性Volterra多延迟积分微分方程数值方法的GPm稳定.证明了对任给的步长h>0,A-稳定的线性多步法保持原线性系统的渐近稳定性,从而是GPm稳定.     

一类stiff稳定的线性多步法

§1.引言 在常微分方程初值问题的数值方法中,线性多步法是最简单、使用最广泛的方法之一.但由于现存的线性多步方法的绝对稳定区域较小,以致在解刚性(Stiff)微分方程中受到很大限制.本文在BDF方法及[2]的基础上增加二个修正项,构造一类修正BDF的线性多步法,具有较大的绝对稳定区域.其结果如下:此类修正方法的阶与同步数的BDF方法的阶一致,其绝对稳定区域与低二阶的BDF方法大致相同,甚至更好,并给出了参数的取值范围.     

两类线性隐式方法

众所周知,在Stiff常微分方程组初值问题的数值解法中,向后微分公式(即Gear方法)是目前最通用的方法之一(见[1]).但是,Gear方法是一类隐式方法,在数值解的过程中,一般说来,每向前积分一步,需要解一个非线性方程组,它的求解是采用Newton-Raphson迭代方法,因此需要给出适当精度的预估值和计算右函数f(t,y)的Jacobi阵以     

Linearly implicit methods for nonlinear parabolic equations

We construct and analyze combinations of rational implicit and explicit multistep methods for nonlinear parabolic equations. The resulting schemes are linearly implicit and include as particular cases implicit-explicit multistep schemes as well as the combination of implicit Runge-Kutta schemes and extrapolation. An optimal condition for the stability constant is derived under which the schemes are locally stable. We establish optimal order error estimates.

     

Local error estimation for multistep collocation methods

Multistep collocation methods for initial value problems in ordinary differential equations are known to be a subclass of multistep Runge-Kutta methods and a generalisation of the well-known class of one-step collocation methods as well as of the one-leg methods of Dahlquist. In this paper we derive an error estimation method of embedded type for multistep collocation methods based on perturbed multistep collocation methods. This parallels and generalizes the results for one-step collocation methods by Nørsett and Wanner. Simple numerical experiments show that this error estimator agrees well with a theoretical error estimate which is a generalisation of an error estimate first derived by Dahlquist for one-leg methods.     

求解刚性Volterra延迟积分微分方程的隐显单支方法的稳定性与误差分析

本文主要研究用隐显单支方法求解一类刚性Volterra延迟积分微分方程初值问题时的稳定性与误差分析.我们获得并证明了结论:若隐显单支方法满足2阶相容条件,且其中的隐式单支方法是A-稳定的,则隐显单支方法是2阶收敛且关于初值扰动是稳定的.最后,由数值算例验证了相关结论.     

One-leg variable-coefficient formulas for ordinary differential equations and local–global step size control

In this paper we discuss a class of numerical algorithms termed one-leg methods. This concept was introduced by Dahlquist in 1975 with the purpose of studying nonlinear stability properties of multistep methods for ordinary differential equations. Later, it was found out that these methods are themselves suitable for numerical integration because of good stability. Here, we investigate one-leg formulas on nonuniform grids. We prove that there exist zero-stable one-leg variable-coefficient methods at least up to order 11 and give examples of two-step methods of orders 2 and 3. In this paper we also develop local and global error estimation techniques for one-leg methods and implement them with the local–global step size selection suggested by Kulikov and Shindin in 1999. The goal of this error control is to obtain automatically numerical solutions for any reasonable accuracy set by the user. We show that the error control is more complicated in one-leg methods, especially when applied to stiff problems. Thus, we adapt our local–global step size selection strategy to one-leg methods.     

QUADRATIC INVARIANTS AND SYMPLECTIC STRUCTURE OF GENERAL LINEAR METHODS

1. IntroductionInvestigating whether a numerical method inherits some dynamical properties possessed bythe differential equation systems being integrated is an important field of numerical analysisand has received much attention in recent years See the review articlesof Sanz-Serna[9] and Section 11.16 of Hairer et. al.[2] for more detail concerning the symplectic methods. Most of the work on canonical iotegrators has dealt with one-step formulaesuch as Runge-Kutta methods and Runge'methods …     

Convergence of linear multistep and one-leg methods for stiff nonlinear initial value problems

To prove convergence of numerical methods for stiff initial value problems, stability is needed but also estimates for the local errors which are not affected by stiffness. In this paper global error bounds are derived for one-leg and linear multistep methods applied to classes of arbitrarily stiff, nonlinear initial value problems. It will be shown that under suitable stability assumptions the multistep methods are convergent for stiff problems with the same order of convergence as for nonstiff problems, provided that the stepsize variation is sufficiently regular.     

Boundedness and Asymptotic Stability of Multistep Methods for Generalized Pantograph Equations

In this paper, we deal with the boundedness and the asymptotic stability of linear and one-leg multistep methods for generalized pantograph equations of neutral type, which arise from some fields of engineering. Some criteria of the boundedness and the asymptotic stability for the methods are obtained.     

Non-linear stability of a general class of differential equation methods

For a class of methods sufficiently general as to include linear multistep and Runge-Kutta methods as special cases, a concept known as algebraic stability is defined. This property is based on a non-linear test problem and extends existing results on Runge-Kutta methods and on linear multistep and one-leg methods. The algebraic stability properties of a number of particular methods in these families are studied and a generalization is made which enables estimates of error growth to be provided for certain classes of methods.