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
A Method for Solving Certain Stiff Differential Equations
โ Scribed by Richard J. Clasen, David Garfinkel, Norman Z. Shapiro and Gruia-Catalin Roman
- Book ID
- 124874676
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1978
- Tongue
- English
- Weight
- 919 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0036-1399
- DOI
- 10.2307/2100739
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Computer simulation of dynamic systems very often leads to the solution of a set of stiff ordinary differential equations. The solution of this set of equations involves the eigenvalues of its Jacobian matrix. The greater the spread in eigenvalues, the more time consuming the solutions become
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
Radau IIA methods are successful algorithms for the numerical solution of sti di erential equations. This article describes RADAU, a new implementation of these methods with a variable order strategy. The paper starts with a survey on the historical development of the methods and the discoveries of
## Communicated by E. Y. Rodin AImraet--A study of Rosenbrock-Wanner (ROW) methods showed that they are not AN-stable. A second-order improved ROW-method, which is AN-stable and with local error estimate is presented with some numerical results.
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,