1978
DOI: 10.1145/356502.356495
|View full text |Cite
|
Sign up to set email alerts
|

A stiffly stable integration process using cyclic composite methods

Abstract: A set of stiffly stable, cychc composite multlstep methods, expressed as l t a,~ymt+j-h ~ fl,jYmt+j=O with ~= 1,. ,l, j=--k+~ ]--I of orders 3 through 7 is established Each method exhibits better stability properties than those of the backward dffferentmtlon formula of the same order. A new varmble-step-slze, variable-order integration algorithm incorporating these new cyclic methods is described This algorithm, realized as a Fortran program, is ideally suited for the numemcal mtegratmn of stiff systems of fir… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1978
1978
1985
1985

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…(1.1) when some of the inequalities in (1.6) hold. In a recent study [8] four FORTRAN subroutines, namely STRIDE, BLEND, STINT, and DIRK [4,21,22,1], which should be suitable for problems with properties (1.4)-(1.6), were evaluated on the basis of their performance in solving a sequence of model problems. These problems were derived from the linear system of equations [9], for which the real components satisfy ~j _> -2 × 104, 1 _< j _< 488, and the imaginary components are greater than or equal to zero.…”
Section: Introductionmentioning
confidence: 99%
“…(1.1) when some of the inequalities in (1.6) hold. In a recent study [8] four FORTRAN subroutines, namely STRIDE, BLEND, STINT, and DIRK [4,21,22,1], which should be suitable for problems with properties (1.4)-(1.6), were evaluated on the basis of their performance in solving a sequence of model problems. These problems were derived from the linear system of equations [9], for which the real components satisfy ~j _> -2 × 104, 1 _< j _< 488, and the imaginary components are greater than or equal to zero.…”
Section: Introductionmentioning
confidence: 99%
“…This linear problem was also used by Tendler, Bickart and Picel [27] to demonstrate the performance of their code STINT (cf. [27], p. 355). Note, however, that they stop the integration at x1= 15 (in contrast to x~=25 of Ehle [3]).…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The eigenvalues of the Jacobian are _+i and 10_+90 i. The stability regions of the cyclic composite multistep methods of Tendler, Bickart and Picel [27] lead to a 45~ reduction of function evaluations when compared with GEAR, but COLODE and IDEC are still more efficient. An improvement of the performance of the BDF codes for problems of this type is to be expected from modified control mechanisms (compare Skelboe [24] and Shampine [23] The last example is case 3 of problem 1 of Byrne, Hindmarsh, Jackson and Brown [2].…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Mihelcic [1977] derives A(a)-stable cyclic LMFs that have order greater than their step number. Tendler et al [1978] derive A(a)-stable cyclic LMFs that are kth order, k step for k = 3, 4, . .…”
Section: Composite and Cyclic Multistep Formulasmentioning
confidence: 99%