首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 468 毫秒
1.
A natural Runge-Kutta method is a special type of Runge-Kutta method for delay differential equations (DDEs); it is known that any one-step collocation method is equivalent to one of such methods. In this paper, we consider a linear constant-coefficient system of DDEs with a constant delay, and discuss the application of natural Runge-Kutta methods to the system. We show that anA-stable method preserves the asymptotic stability property of the analytical solutions of the system.  相似文献   

2.
Recently, we have proved that the Radau IA and Lobatto IIIC methods are P-stable, i.e., they have an analogous stability property to A-stability with respect to scalar delay differential equations (DDEs). In this paper, we study stability of those methods applied to multidimensional DDEs. We show that they have a similar property to P-stability with respect to multidimensional equations which satisfy certain conditions for asymptotic stability of the zero solutions. The conditions are closely related to stability criteria for DDEs considered in systems theory. Received October 8, 1996 / Revised version received February 21, 1997  相似文献   

3.
Summary. We consider systems of delay differential equations (DDEs) of the form with the initial condition . Recently, Torelli [10] introduced a concept of stability for numerical methods applied to dissipative nonlinear systems of DDEs (in some inner product norm), namely RN-stability, which is the straighforward generalization of the wellknown concept of BN-stability of numerical methods with respect to dissipative systems of ODEs. Dissipativity means that the solutions and corresponding to different initial functions and , respectively, satisfy the inequality , and is guaranteed by suitable conditions on the Lipschitz constants of the right-hand side function . A numerical method is said to be RN-stable if it preserves this contractivity property. After showing that, under slightly more stringent hypotheses on the Lipschitz constants and on the delay function , the solutions and are such that , in this paper we prove that RN-stable continuous Runge-Kutta methods preserve also this asymptotic stability property. Received March 29, 1996 / Revised version received August 12, 1996  相似文献   

4.
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.  相似文献   

5.
The stability of Runge-Kutta methods for systems of delay differentialequations (DDEs) with multiple delays is considered. The stabilityregions of explicit and implicit Runge-Kutta methods are discussedwhen they are applied to asymptotically stable linear DDEs withmultiple delays. A simple estimate on the stability regionsof explicit Runge-Kutta methods is presented. It is shown thatthe stable step-size for numerical integration of DDEs withmultiple delays can be easily selected by means of the estimate.  相似文献   

6.
1. IntroductionIn order to assess the asymptotic behavior of numerical methods for DDEs, much attention has been given in the literature to the scalar case (cL [1-6]). UP to now) only partialresults (of. [7-10]) have dealt with the delay systemswhere y(t) = (yi(t), so(t),' ) yp(t))" E Cd, which is unknown for t > 0, L and M areconstat complex p x Hmatrices, T > 0 is a constat delay and W(t) 6 CP is a specifiedinitial function.In [111, C.J. Zhang and S.Z. Zhou made an investigation on…  相似文献   

7.
In this paper, a class of two-step continuity Runge-Kutta(TSCRK) methods for solving singular delay differential equations(DDEs) is presented. Analysis of numerical stability of this methods is given. We consider the two distinct cases: (i)τ≥ h, (ii)τ 〈 h, where the delay τ and step size h of the two-step continuity Runge-Kutta methods are both constant. The absolute stability regions of some methods are plotted and numerical examples show the efficiency of the method.  相似文献   

8.
In this review, we present the recent work of the author in comparison with various related results obtained by other authors in literature. We first recall the stability, contractivity and asymptotic stability results of the true solution to nonlinear stiff Volterra functional differential equations (VFDEs), then a series of stability, contractivity, asymptotic stability and B-convergence results of Runge-Kutta methods for VFDEs is presented in detail. This work provides a unified theoretical foundation for the theoretical and numerical analysis of nonlinear stiff problems in delay differential equations (DDEs), integro-differential equations (IDEs), delayintegro-differential equations (DIDEs) and VFDEs of other type which appear in practice.   相似文献   

9.
Stability analysis of some representative numerical methods for systems of neutral delay-differential equations (NDDEs) is considered. After the establishment of a sufficient condition of asymptotic stability for linear NDDEs, the stability regions of linear multistep, explicit Runge-Kutta and implicitA-stable Runge-Kutta methods are discussed when they are applied to asymptotically stable linear NDDEs. Some mentioning about the extension of the results for the multiple delay case is given.  相似文献   

10.
Implicit Runge-Kutta methods are known as highly accurate and stable methods for solving differential equations. However, the iteration technique used to solve implicit Runge-Kutta methods requires a lot of computational efforts. To lessen the computational effort, one can iterate simultaneously at a number of points along the t-axis. In this paper, we extend the PDIRK (Parallel Diagonal Iterated Runge-Kutta) methods to delay differential equations (DDEs). We give the region of convergence and analyze the speed of convergence in three parts for the P-stability region of the Runge-Kutta corrector. It is proved that PDIRK methods to DDEs are efficient, and the diagonal matrix D of the PDIRK methods for DDES can be selected in the same way as for ordinary differential equations (ODEs).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号