Results 251 to 260 of about 81,407 (290)
Some of the next articles are maybe not open access.
A stiff ODE solver for an attached processor
Computer Physics Communications, 1982Abstract We present an implementation of a stiff ODE solver on the AP120B, and discuss design considerations which should be generally applicable to ODE software on attached processors of this type.
J.D. Pryce, J.W. Paine
openaire +1 more source
Computational experiments with algorithms for stiff ODEs
Computing, 1987The numerical performance of computer codes available to solve stiff systems of ODEs is evaluated. Three widely used codes of Gear/Hindmarsh, Gottwald/Wanner and Deuflhard/Bader are tested by numerous randomly generated examples which permit an arbitrary choice of the position and the number of the eigenvalues of the Jacobian.
openaire +1 more source
Methods for parallel integration of stiff systems of odes
BIT, 1992Parallelization of implicit Euler-type integration methods for stiff ordinary differential equations (ODEs) is obtained by decoupling the system into \(p\) subsystems for \(p\) processors. ``Internal'' solution components in each subsystem are treated implicitly, ``external'' solution components are extrapolated. The paper deals with the theory of this
openaire +2 more sources
Description and Evaluation of a Stiff ODE Code DSTIFF
SIAM Journal on Scientific and Statistical Computing, 1985The paper describes and evaluates DSTIFF, a set of subroutines for solving stiff ordinary differential equations. The code is somewhat similar to the well-known packages LSODE, GEAR and DIFSUB but the present set of subroutines are based on least squares multistep formulas rather than the BDF.
openaire +1 more source
Practical improvements to SIMPR codes for stiff ODEs
Proceedings of the conference on Numerical ordinary differential equations, 1989The paper discusses codes using extrapolation of the semi-implicit mid- point rule for the solution of stiff ordinary differential equations (ODEs). Some comparisons are made between applying such a code to systems of equations in autonomous form or non-autonomous form.
openaire +1 more source
Diagonally implicit Runge–Kutta methods for stiff ODEs
Applied Numerical Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kennedy, Christopher A. +1 more
openaire +1 more source
Reduced storage matrix methods in stiff ODE systems
Proceedings of the conference on Numerical ordinary differential equations, 1989In a previous paper [SIAM J. Numer. Anal. 23, 610-638 (1986; Zbl 0615.65078)] the authors considered the use of Krylov-subspace projection methods in solving large stiff systems of ODE's that arise from PDE systems by the method of lines. In this long paper (50 pages) the investigation is continued with particular emphasis on the importance of ...
Peter N. Brown, Alan C. Hindmarsh
openaire +3 more sources
A parallel stiff ODE solver based on MIRKs
Advances in Computational Mathematics, 1997The theory for parallelization of multi-implicit Runge-Kutta methods (MIRKs) ``across the method'' , i.e. for an \(s\)-stage method of order \(s\) with \(p=s\) processors can be used. Discussion of implementation and presentation of numerical results on an IBM SP with the ParSODES code for methods of order 5 and 8.
openaire +1 more source
High order implicit method for odes stiff systems
Korean Journal of Computational & Applied Mathematics, 2001A doubly implicit A-stable difference scheme with order six is proposed for the numerical solution of stiff systems of ordinary differential equations (ODEs). The integration step is selected according a difference scheme derived from the proposed method and a one step scheme of fourth order of approximation. Numerical tests are also included.
Vasilyeva, Tatiana, Vasilev, Eugeny
openaire +2 more sources
Efficient implementation of a 2nd derivative method for stiff ODEs
Computing, 1994Padé or Obrechkoff methods based on diagonal or sub-diagonal Padé approximations for the exponential function usually yield high accuracy and good stability. But the occurrence of higher derivatives makes their implementation difficult. For a third-order sub-diagonal second derivative method, the authors suggest an effective procedure for moderately ...
Ya. Hlynsky, Yu. Panchyshyn
openaire +1 more source

