Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver Classes and Interfaces - 26 results found.
NameDescriptionTypePackageFramework
ABMPredictorCorrectorThe Adams-Bashforth predictor and the Adams-Moulton corrector pair.Interfacecom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
ABMPredictorCorrector1The Adams-Bashforth predictor and the Adams-Moulton corrector of order 1.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
ABMPredictorCorrector2The Adams-Bashforth predictor and the Adams-Moulton corrector of order 2.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
ABMPredictorCorrector3The Adams-Bashforth predictor and the Adams-Moulton corrector of order 3.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
ABMPredictorCorrector4The Adams-Bashforth predictor and the Adams-Moulton corrector of order 4.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
ABMPredictorCorrector5The Adams-Bashforth predictor and the Adams-Moulton corrector of order 5.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
AdamsBashforthMoultonThis class uses an Adams-Bashford predictor and an Adams-Moulton corrector of the specified order.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.multistep.adamsbashforthmoultonSuanShu
BurlischStoerExtrapolationBurlisch-Stoer extrapolation (or Gragg-Bulirsch-Stoer (GBS)) algorithm combines three powerful ideas: Richardson extrapolation, the use of rational function extrapolation in Richardson-typeClasscom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.extrapolationSuanShu
EulerMethodThe Euler method is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solverSuanShu
ODEIntegratorThis defines the interface for the numerical integration of a first order ODE, for a sequence of pre-defined steps.Interfacecom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solverSuanShu
ODESolutionSolution to an ODE problem.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solverSuanShu
ODESolverSolver for first order ODE problems.Interfacecom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solverSuanShu
RungeKuttaThe Runge-Kutta methods are an important family of implicit and explicit iterative methods for the approximation of solutions of ordinary differential equations.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta1This is the first-order Runge-Kutta formula, which is the same as the Euler method.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta10This is the tenth-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta2This is the second-order Runge-Kutta formula, which can be implemented efficiently with a three-step algorithm.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta3This is the third-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta4This is the fourth-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta5This is the fifth-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta6This is the sixth-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta7This is the seventh-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKutta8This is the eighth-order Runge-Kutta formula.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKuttaFehlbergThe 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 errorClasscom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKuttaIntegratorThis integrator works with a single-step stepper which estimates the solution for the next step given the solution of the current step.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
RungeKuttaStepperInterfacecom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekuttaSuanShu
SemiImplicitExtrapolationSemi-Implicit Extrapolation is a method of solving ordinary differential equations, that is similar to Burlisch-Stoer extrapolation.Classcom.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.extrapolationSuanShu