A smooth output interpolation process for BDF codes
When using the original BDF (backward differentiation formulae) codes developed by C. W. Gear for solving stiff problems discontinuous derivative approximations result at all mesh points and discontinuous solution approximation are produced at certain mesh points when a change in the order of the method takes place. The author discusses the changes necessary to eliminate these discrepancies and the modifications in order to produce a globally smooth interpolation process. These improvements are particularly important in the context of defining a mathematically sound root algorithm. Numerical examples are included.
- A \(C^ 1\) interpolant for codes based on backward differentiation formulae
- A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations
- Comparing numerical methods for stiff systems of O.D.E:s
- Global Error Estimates for Ordinary Differential Equations
- scientific article; zbMATH DE number 3911612 (Why is no real title available?)
- scientific article; zbMATH DE number 3711301 (Why is no real title available?)
- Local error and variable order Adams codes
- Rosenbrock methods for stiff ODEs: A comparison of Richardson extrapolation and embedding technique
- Smoother Interpolants for Adams Codes
- Stiff ODE solvers: A review of current and coming attractions
- Test Results on Initial Value Methods for Non-Stiff Ordinary Differential Equations
- The automatic integration of ordinary differential equations
This page was built for publication: A smooth output interpolation process for BDF codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124291)