共查询到20条相似文献,搜索用时 15 毫秒
1.
Variable stepsize stability results are found for three representative multivalue methods. For the second order BDF method, a best possible result is found for a maximum stepsize ratio that will still guarantee A(0)-stability behaviour. It is found that under this same restriction, A()-stability holds for 70°. For a new two stage two value first order method, which is L-stable for constant stepsize, A(0)-stability is maintained for stepsize ratios as high as aproximately 2.94. For the third order BDF method, a best possible result of (1/2)(1+
) is found for a ratio bound that will still guarantee zero-stability. 相似文献
2.
Stability and Dynamics of Numerical Methods for Nonlinear Ordinary Differential Equations 总被引:5,自引:0,他引:5
Stability of numerical methods for nonlinear autonomous ordinarydifferential equations is approached from the point of viewof dynamical systems. It is proved that multistep methods (withnonlinear algebraic equations exactly solved) with bounded trajectoriesalways produce correct asymptotic behaviour, but this is notthe case with Runge-Kutta. Examples are given of Runge-Kuttaschemes converging to wrong solutions in a deceptively smoothmanner and a characterization of such two-stage methods is presented.PE(CE)m schemes are examined as well, and it is demonstratedthat they, like Runge-Kutta, may lead to false asymptotics. 相似文献
3.
本文讨论了一类并行计算常微分方程初值问题的带有高阶导数的块隐式混合单步方法,这种方法可以在K台处理机上并行进行数值计算,本文对方法的一般性质及收敛性进行了讨论,得知该方法的阶数为2l+1,并且指出当l=1,2时,方法是A-稳定的,最后给出了一个数值例子。 相似文献
4.
Algorithms for the solution of general systems of stiff differentialequations commonly use implicit integration formulae. The associatednon-linear equations at each step of the integration are efficientlysolved by an iteration such as the parallel chord method, wherethe matrix is an approximation for the Jacobian at a calculatedpoint of the solution. This iteration frequently gives sufficientlyrapid convergence over a number of integration steps beforeupdating and re-inversion of the matrix is required. When thedifferential equations have a special structure, satisfactoryconvergence may be maintained by updating a partition of theJacobian less frequently than the remainder and an efficientcomputational procedure consists in calculating the correspondingupdate of the inverse. Sufficient conditions for local convergencemay be expressed in terms of the difference between the iterationmatrix and the derivative at the solution or in terms of thedifference of the corresponding inverses. Similarly the asymptoticrate of convergence is estimated in terms of the norms of theseperturbations. To assess the effectiveness of updating a partitionof the Jacobian or its inverse we set the corresponding perturbationto zero and evaluate the estimate of the rate of convergence.Variable transformation and "weighting" of equations may beused to obtain more accurate computable estimates of convergencerates and tighter conditions for convergence. This is particularlyrelevant in non-linear stiff systems arising in applicationsfrom physics, chemistry and engineering and associated withfast and slow motions. Such systems exhibit special structurein the Jacobian and higher derivatives related to the sensitivityof the system to the components of the fast motion which makesthem particularly amenable to matrix updating techniques. Anumber of illustrative problems from the literature are cited.A worked example has been solved numerically using an inversewhose partitions are updated irregularly as required for convergenceand a comparison is made of iteration counts and inversion statisticswith updating of the full inverse. Computational savings maysometimes belarge. 相似文献
5.
The stability of methods for systems of second-order equationsis discussed. Stability regions are obtained for a single equationand the existence of stable step-sizes is shown for systems.An example is used as an illustration of the effect of the usualorder selection strategies on stability and accuracy. 相似文献
6.
In a recent paper Fox & Mayers discuss the numerical solutionof implicit ordinary differential equations of the form f(x,y(x), y'(x)) = 0. They find that numerical methods can be veryunreliable near the point where fy' = 0. In this paper we givea theoretical analysis of the problem which enables us to explainwhen to expect numerical difficulties. We suggest a possibleline of approach for the solution of such problems, and discusssome numerical examples.
Research supported by the National Science Foundation, the Officeof Naval Research, the Army Research, and the Air Force Officeof Scientific Research. Travel funding provided by the Universityof Toronto and the British Council. 相似文献
7.
E. Hairer 《BIT Numerical Mathematics》2001,41(5):996-1007
This article illustrates how classical integration methods for differential equations on manifolds can be modified in order to preserve certain geometric properties of the exact flow. Projection methods as well as integrators based on local coordinates are considered. The central ideas of this article have been presented at the 40th anniversary meeting of the journal BIT.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
8.
9.
The modelling of many real life phenomena for which either the parameter estimation is difficult, or which are subject to random noisy perturbations, is often carried out by using stochastic ordinary differential equations (SODEs). For this reason, in recent years much attention has been devoted to deriving numerical methods for approximating their solution. In particular, in this paper we consider the use of linear multistep formulae (LMF). Strong order convergence conditions up to order 1 are stated, for both commutative and non-commutative problems. The case of additive noise is further investigated, in order to obtain order improvements. The implementation of the methods is also considered, leading to a predictor-corrector approach. Some numerical tests on problems taken from the literature are also included. 相似文献
10.
11.
12.
This paper concerns with the numerical solution of a class of ordinary differential equations on G l(n), the set of all n×n nonsingular real matrices. In particular, we consider matrix dynamical systems of the form Y′=Y ?T F(Y). The presence of the inverse of the solution and of possible escape times make the numerical solution of this kind of differential equations somewhat worrisome. Here, we suggest some numerical techniques to avoid some problems arising in its numerical solution. 相似文献
13.
本文把文[1]、[2]的变换技巧推广到变系数线性系统(i=1,…,n),用函数方法,研究了n=2、3时零解的稳定性,得到了零解稳定的若干判据.有关系数a_(ij)(t)不必都限制为有界. 相似文献
14.
15.
Mathematical Notes - The method of Riccati’s equation is applied to find a stability criterion for systems of two first-order linear ordinary differential equations. The obtained result is... 相似文献
16.
We deal with linear multi-step methods for SDEs and study when the numerical approximation shares asymptotic properties in
the mean-square sense of the exact solution. As in deterministic numerical analysis we use a linear time-invariant test equation
and perform a linear stability analysis. Standard approaches used either to analyse deterministic multi-step methods or stochastic
one-step methods do not carry over to stochastic multi-step schemes. In order to obtain sufficient conditions for asymptotic
mean-square stability of stochastic linear two-step-Maruyama methods we construct and apply Lyapunov-type functionals. In
particular we study the asymptotic mean-square stability of stochastic counterparts of two-step Adams–Bashforth- and Adams–Moulton-methods,
the Milne–Simpson method and the BDF method.
AMS subject classification (2000) 60H35, 65C30, 65L06, 65L20 相似文献
17.
The eigenvalue problem for linear ordinary differential equationswith discontinuous terms is considered. It is shown that onecan effectively use Atkinson's product integration techniquestogether with a Green's function to solve the problem numerically. 相似文献
18.
This paper introduces the notion of scalar dichotomies, an analog of the Levinson dichotomic conditions for diagonal systems adapted to differential equations of order n. Using this concept, a general theory of asymptotic integration of the nonautonomous equation x(n) + (a1(t) + b1(t)) x(n-1) + ... + (an(t) + bn(t)) x = 0 is given, provided the solutions of the equation x(n) + a1(t)x(n-1) + ... + an(t)x = 0, up to the p-derivative, 0 p n - 1, are known. We study in details the constant coefficient case ai(t) = constant, where we obtain an extension of the Ghizzetti theorem. All results are obtained without using canonical forms. 相似文献
19.
20.
Mathematical Notes - 相似文献