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
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
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
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
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,