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

Solving Stiff Differential Equations with the Method of Patches

โœ Scribed by David Brydon; John Pearson; Michael Marder

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
241 KB
Volume
144
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 small systems of equations for which some other methods are inefficient or produce spurious solutions, estimate error bounds, and discuss extensions of the method to larger systems of equations and to partial differential equations.

๐Ÿ“œ 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 ๐Ÿ‘ 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

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 ๐Ÿ‘ 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,