𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient method for solving implicit and explicit stiff differential equations

✍ Scribed by H. Pasic


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
195 KB
Volume
48
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


When the s-stage fully implicit Runge}Kutta (RK) method is used to solve a system of n ordinary di!erential equations (ODE) the resulting algebraic system has a dimension ns. Its solution by Gauss elimination is expensive and requires 2sn/3 operations. In this paper we present an e$cient algorithm, which di!ers from the traditional RK method. The formal procedure for uncoupling the algebraic system into a block-diagonal matrix with s blocks of size n is derived for any s. Its solution is s/2 times faster than the original, nondiagonalized system, for s even, and s/(s!1) for s odd in terms of number of multiplications, as well as s times in terms of number of additions/multiplications. In particular, for s"3 the method has the same precision and stability properties as the well-known RK-based RadauIIA quadrature of Ehle, implemented by Hairer and Wanner in RADAU5 algorithm. Unlike RADAU5, however, the method is applicable with any s and not only to the explicit ODEs My"f (x, y), where M"const., but also to the general implicit ODEs of the form f (x, y, y)"0. The block-diagonal form of the algebraic system allows parallel processing. The algorithm formally di!ers from the implicit RK methods in that the solution for y is assumed to have a form of the algebraic polynomial whose coe$cients are found by enforcing y to satisfy the di!erential equation at the collocation points. Locations of those points are found from the derived stability function such as to guarantee either A-or ΒΈ-stability properties as well as a superior precision of the algorithm. If constructed such as to be ΒΈ-stable the method is a good candidate for solving di!erential-algebraic equations (DAEs). Although not limited to any speci"c "eld, the application of the method is illustrated by its implementation in the multibody dynamics described by both ODEs and DAEs.


πŸ“œ SIMILAR VOLUMES


A quasi-interpolation method for solving
✍ Y. C. Hon; Zongmin Wu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 94 KB πŸ‘ 2 views

Based on the idea of quasi-interpolation and radial basis functions approximation, a numerical method is developed to quasi-interpolate the forcing term of di erential equations by using radial basis functions. A highly accurate approximation for the solution can then be obtained by solving the corr

Explicit and implicit meshless methods f
✍ M. Zerroukat; K. Djidjeli; A. Charafi πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 293 KB πŸ‘ 1 views

Simple, mesh=grid free, explicit and implicit numerical schemes for the solution of linear advection-di usion problems is developed and validated herein. Unlike the mesh or grid-based methods, these schemes use well distributed quasi-random points and approximate the solution using global radial bas

An efficient method of solving the Navie
✍ H. M. Park; M. W. Lee πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 345 KB πŸ‘ 2 views

A new method of solving the Navier-Stokes equations e ciently by reducing their number of modes is proposed in the present paper. It is based on the Karhunen-LoΓ‚ eve decomposition which is a technique of obtaining empirical eigenfunctions from the experimental or numerical data of a system. Employin