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

Problem approximation for stiff ordinary differential equations

โœ Scribed by R. C. Aiken; Leon Lapidus

Publisher
American Institute of Chemical Engineers
Year
1975
Tongue
English
Weight
474 KB
Volume
21
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A quasi-interpolation method for solving
A quasi-interpolation method for solving stiff ordinary differential equations
โœ Y. C. Hon; Zongmin Wu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 94 KB ๐Ÿ‘ 1 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

Sequential function approximation for th
Sequential function approximation for the solution of differential equations
โœ Meade, Andrew J. ;Kokkolaras, Michael ;Zeldin, Boris A. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 2 views

A computational method for the solution of dierential equations is proposed. With this method an accurate approximation is built by incremental additions of optimal local basis functions. The parallel direct search software package (PDS), that supports parallel objective function evaluations, is use

An efficient method for solving implicit
An efficient method for solving implicit and explicit stiff differential equations
โœ H. Pasic ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB ๐Ÿ‘ 1 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,