نتایج جستجو برای: multistep methods

تعداد نتایج: 1879360  

Journal: :Math. Comput. 2006
Willem Hundsdorfer Steven J. Ruuth

In this paper an analysis is provided of nonlinear monotonicity and boundedness properties for linear multistep methods. Instead of strict monotonicity for arbitrary starting values we shall focus on generalized monotonicity or boundedness with Runge-Kutta starting procedures. This allows many multistep methods of practical interest to be included in the theory. In a related manner, we also con...

1999
J. C. Butcher

To obtain high order integration methods for ordinary differential equations which combine to some extent the advantages of RungeKutta methods on one hand and linear multistep methods on the other, the use of “modified multistep” or “hybrid” methods has been proPosedIll, PI, 131. In this paper formulae are derived for methods which use one extra intermediate point than in the previously pub lis...

1997
Y. C. Hon

In this paper, an interpolation method for solving linear diierential equations was developed using multiquadric scheme. Unlike most iterative formula , this method provides a global interpolation formulae for the solution. Numerical examples show that this method ooers a higher degree of accuracy than Runge-Kutta formula and the iterative multistep methods developed by Hyman (1978).

2014
X. Liu M. H. Song M. Z. Liu Leonid Shaikhet

This paper deals with the convergence and stability of linear multistep methods for impulsive differential equations. Numerical experiments demonstrate that both the mid-point rule and twostep BDFmethod are of order p 0when applied to impulsive differential equations. An improved linear multistep method is proposed. Convergence and stability conditions of the improved methods are given in the p...

2014
Mohammad Kamrul Hasan Mohammad Suzan Ahamed Mohammad Ashraful Huq Mohammad Shamsul Alam Mohammad Bellal Hossain

Recently an implicit method has been presented for solving first order singular initial value problem. The method is extended to solve second or higher order problems having a singular point. The method presents more correct result than those obtained by the implicit Euler and second order implicit Runge-Kutta (RK2) methods. The method is illustrated by suitable examples.

1999
Gerald D. Quinlan

The symmetric multistep methods developed by Quinlan and Tremaine (1990) are shown to suffer from resonances and instabilities at special stepsizes when used to integrate nonlinear equations. This property of symmetric multistep methods was missed in previous studies that considered only the linear stability of the methods. The resonances and instabilities are worse for high-order methods than ...

2014
Tong Zhang Yuan-Jun Song Xiao-Yang Zhang Jing-Yuan Wu

The shape of plasmonic nanostructures such as silver and gold is vital to their physical and chemical properties and potential applications. Recently, preparation of complex nanostructures with rich function by chemical multistep methods is the hotspot of research. In this review we introduce three typical multistep methods to prepare silver nanostructures with well-controlled shapes, including...

1996
J. G. Verwer

In many applications, large systems of ordinary di erential equations (ODEs) have to be solved numerically that have both sti and nonsti parts. A popular approach in such cases is to integrate the sti parts implicitly and the nonsti parts explicitly. In this paper we study a class of implicit-explicit (IMEX) linear multistep methods intended for such applications. The paper focuses on the linea...

2012
Ali K. Ezzeddine Gholamreza Hojjati

Abstract: In this paper, we present a class of multistep methods for the numerical solution of stiff ordinary differential equations. In these methods the first, second and third derivatives of the solution are used to improve the accuracy and absolute stability regions of the methods. The constructed methods are A-stable up to order 6 and A(α)-stable up to order 8 so that, as it is shown in th...

2017
Carmen Arévalo Gustaf Söderlind

A new polynomial formulation of variable step size linear multistep methods is presented, where each k-step method is characterized by a fixed set of k− 1 or k parameters. This construction includes all methods of maximal order (p = k for stiff, and p = k+1 for nonstiff problems). Supporting time step adaptivity by construction, the new formulation is not based on extending classical fixed step...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید