Modifier and Type | Class and Description |
---|---|
class |
EulerMethod
The Euler method is a first-order numerical procedure for solving ordinary differential equations
(ODEs) with a given initial value.
|
Modifier and Type | Class and Description |
---|---|
class |
BurlischStoerExtrapolation
Burlisch-Stoer extrapolation (or Gragg-Bulirsch-Stoer (GBS)) algorithm combines three powerful
ideas: Richardson extrapolation, the use of rational function extrapolation in Richardson-type
applications, and the modified midpoint method, to obtain numerical solutions to ordinary
differential equations (ODEs) with high accuracy and comparatively little computational effort.
|
class |
SemiImplicitExtrapolation
Semi-Implicit Extrapolation is a method of solving ordinary differential equations, that is
similar to Burlisch-Stoer extrapolation.
|
Modifier and Type | Class and Description |
---|---|
class |
AdamsBashforthMoulton
This class uses an Adams-Bashford predictor and an Adams-Moulton corrector of the specified
order.
|
Modifier and Type | Class and Description |
---|---|
class |
RungeKutta
The Runge-Kutta methods are an important family of implicit and explicit iterative methods for
the approximation of solutions of ordinary differential equations.
|
class |
RungeKuttaFehlberg
The Runge-Kutta-Fehlberg method is a version of the classic Runge-Kutta method, which
additionally uses step-size control and hence allows specification of a local truncation error
bound.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.