27.10.2014 Views

Вычислительная математика - ИСЭМ СО РАН

Вычислительная математика - ИСЭМ СО РАН

Вычислительная математика - ИСЭМ СО РАН

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

COMPUTATION OF STABILITY REGION OF SOME BLOCK METHODS AND<br />

THEIR APPLICATION TO NUMERICAL SOLUTIONS OF ODES<br />

Ming-Gong Lee, Rei-Wei Song, Yu-Hsang Hong<br />

Department of Applied Mathematics, Chung-Hua University, Taiwan<br />

email: mglee@chu.edu.tw<br />

Abstract. Classes of multistage and multistep integration methods which obtain of r new values<br />

at each step are studied. Their stability regions were sketched by MATLAB, and their regions are<br />

almostA(α)-stable. Their applications to numerical solutions of nonstiff and stiff equations were<br />

studied.<br />

Key words: Multistage and multistep methods, A(α)-stable, stiff equations.<br />

1. Introduction<br />

Numerical solutions for ordinary differential equations (ODEs) have great importance in scientific<br />

computation, as they were widely used to model in representing the world. The common methods<br />

used to solve these ODEs are categorized as one-step (multistage) methods and multistep (one stage)<br />

methods, which Runge-Kutta methods represent the former group, and Adams-Bashforth-Molton<br />

method represents the later group. Some multistage are also available in the community. Implicit<br />

one-step method has been studied by Stoller and Morrison [5], Butcher [2], and Shampine and<br />

Watts [6]. We will consider a class of implicit multistep and multistage methods for solving ordinary<br />

differential equations; we can call it block method. It can obtain a block of new values simultaneously<br />

which makes this implicit method more competitive. Our aim is to analyze the stability of this Block<br />

methods though graphing capability of MATLAB. The interval of stability of a numerical method<br />

is especially important in the choice of a method suitable for stiff system. Indeed, for stiff systems,<br />

an interval of stability as large as possible is required to avoid a very restricted stepsize h during<br />

numerical integration. A large interval of stability may be sufficient in the integration of some stiff<br />

ODEs; for example, when the Jacobian matrix of right-hand side function has eigenvalues which are<br />

located in a large, narrow strip along the negative axis. Such equations often arise when a second order<br />

hyperbolic differential equations in semi-discretized with respect to its space variable [7]. In section 2,<br />

we will introduce some known block implicit one-step method used by Shampine, and their numerical<br />

implementation by predictor and corrector method. In section 3, we will show the derivation of some<br />

of the block multistage/multistep method, and their stability regions will be given at section 4. In<br />

section 5, we will give numerical results of these block-type methods by solving some nonstiff and stiff<br />

ODEs, and finally section 6 is the conclusion.<br />

2. Block Implicit One-Step Method<br />

We wish to approximate the solution of a differential equation,<br />

y ′ (x) = f(x, y(x)), y(a) = y a (1)<br />

In the interval of [a, b], suppose functionf is continuous and satisfies<br />

|f(x, y) − f(x, u)| ≤ L |y − z| (2)<br />

on [a, b] × (−∞, ∞) guarantees the existence of a unique solutiony(x) ∈ C 1 [a, b].<br />

208

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!