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

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

Journal: :Computers & Mathematics with Applications 2001

Journal: :Journal of Computational and Applied Mathematics 1986

A new two-step implicit linear Obrechkoff twelfth algebraic order method with vanished phase-lag and its first, second, third and fourth derivatives is constructed in this paper. The purpose of this paper is to develop an efficient algorithm for the approximate solution of the one-dimensional radial Schrodinger equation and related problems. This algorithm belongs in the category of the multist...

1994
Roger Alexander

This lecture is a survey of the theory of stability and error bounds for numerical methods for stii initial value problems. We begin with problems in singular perturbation form, where the distinction between \fast" and \slow" variables is clearest. Next we explain Kreiss's characterization of stii problems that includes singular perturbation problems as a special case. The requirement of unifor...

2010
N. Oprea

In this paper, using the polynomial extrapolation, we solve an initial value problem in ordinary differential equations. The aim of this paper is to compare with the fourth-order Runge-Kutta method on the basis of accuracy for a given number of function evaluations.

Journal: :Applied Mathematics and Computation 2006
Basem S. Attili Khaled M. Furati Muhammed I. Syam

We will consider the efficient implementation of a fourth order two stage implicit Runge-Kutta method to solve periodic second order initial value problems. To solve the resulting systems, we will use the factorization of the discretized operator. Such proposed factorization involves both complex and real arithmetic. The latter case is considered here. The resulting system will be efficient and...

2005
Steven J. Ruuth Willem Hundsdorfer

We consider linear multistep methods that possess general monotonicity and boundedness properties. Strict monotonicity, in terms of arbitrary starting values for the multistep schemes, is only valid for a small class of methods, under very stringent step size restrictions. This makes them uncompetitive with the strong-stability-preserving (SSP) Runge– Kutta methods. By relaxing these strict mon...

1996
Wenjie Zhu Linda R. Petzold

In this paper, we consider the asymptotic stability of linear constant coeecient delay diierential-algebraic equations and of-methods, Runge-Kutta methods and linear multistep methods applied to these systems.

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

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