๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comparison of two algorithms for solving STIFF differential equations

โœ Scribed by G.P. Rangaiah


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
511 KB
Volume
20
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Robust Algorithms for Solving Stochastic
โœ M.J. Werner; P.D. Drummond ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB

nonlinear evolution, and B is the M ฯซ N dimensional noise term, which is a functional of , and multiplies an A robust semi-implicit central partial difference algorithm for the numerical solution of coupled stochastic parabolic partial differen-N dimensional real or complex Gaussian-distributed stot

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

Solving Stiff Differential Equations wit
โœ David Brydon; John Pearson; Michael Marder ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

We introduce a new method for solving very stiff sets of ordinary differential equations. The basic idea is to replace the original nonlinear equations with a set of equally stiff equations that are piecewise linear, and therefore can be solved exactly. We demonstrate the value of the method on smal

An efficient method for solving implicit
โœ H. Pasic ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB ๐Ÿ‘ 2 views

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,