Name | Description | Type | Package | Framework |
ABMPredictorCorrector | The Adams-Bashforth predictor and the Adams-Moulton corrector pair. | Interface | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
ABMPredictorCorrector1 | The Adams-Bashforth predictor and the Adams-Moulton corrector of order 1. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
ABMPredictorCorrector2 | The Adams-Bashforth predictor and the Adams-Moulton corrector of order 2. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
ABMPredictorCorrector3 | The Adams-Bashforth predictor and the Adams-Moulton corrector of order 3. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
ABMPredictorCorrector4 | The Adams-Bashforth predictor and the Adams-Moulton corrector of order 4. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
ABMPredictorCorrector5 | The Adams-Bashforth predictor and the Adams-Moulton corrector of order 5. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
AdamsBashforthMoulton | This class uses an Adams-Bashford predictor and an Adams-Moulton corrector of the specified order. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoulton | SuanShu |
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 | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.extrapolation | SuanShu |
EulerMethod | The Euler method is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver | SuanShu |
ODEIntegrator | This defines the interface for the numerical integration of a first order ODE, for a sequence of pre-defined steps. | Interface | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver | SuanShu |
ODESolution | Solution to an ODE problem. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver | SuanShu |
ODESolver | Solver for first order ODE problems. | Interface | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver | SuanShu |
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 | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta1 | This is the first-order Runge-Kutta formula, which is the same as the Euler method. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta10 | This is the tenth-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta2 | This is the second-order Runge-Kutta formula, which can be implemented efficiently with a three-step algorithm. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta3 | This is the third-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta4 | This is the fourth-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta5 | This is the fifth-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta6 | This is the sixth-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta7 | This is the seventh-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKutta8 | This is the eighth-order Runge-Kutta formula. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
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 | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKuttaIntegrator | This integrator works with a single-step stepper which estimates the solution for the next step given the solution of the current step. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu |
RungeKuttaStepper | Interface | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta | SuanShu | |
SemiImplicitExtrapolation | Semi-Implicit Extrapolation is a method of solving ordinary differential equations, that is similar to Burlisch-Stoer extrapolation. | Class | com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.extrapolation | SuanShu |