• CVODE

  • Referenced in 37 articles [sw04947]
  • CVODE are variable-order, variable-step multistep methods. For nonstiff problems, CVODE includes the Adams...
  • A-EBDF

  • Referenced in 11 articles [sw09190]
  • EBDF methods we propose a multistep method whose region of absolute stability is larger than...
  • GniCodes

  • Referenced in 7 articles [sw21086]
  • methods, composition and splitting methods, linear multistep methods, and algorithms for Hamiltonian problems on manifolds ... implicit Runge-Kutta, composition, and multistep methods. The final Section 5 gives a comparison...
  • LMEF

  • Referenced in 2 articles [sw13929]
  • program for the construction of linear multistep methods with exponential fitting for the numerical solution...
  • EXPODE

  • Referenced in 1 article [sw20449]
  • Rosenbrock-methods, linearized and non-linearized multistep-methods and the EXP4. We support evaluation...
  • ROWMAP

  • Referenced in 40 articles [sw09627]
  • problems. It is based on the ROW-methods of the code ROS4 of Hairer ... equations. Numerical tests and comparisons with the multistep code VODPK illustrate the efficiency of ROWMAP...
  • INTEGRATOR

  • Referenced in 1 article [sw02525]
  • index 1 differential-algebraic systems by multistep methods with any automatically obtained reasonable accuracy...
  • VarInt

  • Referenced in 1 article [sw11255]
  • advantageous, as they include adaptive and multistep methods, which can be both accurate and fast...
  • Rk-opt

  • Referenced in 1 article [sw17497]
  • coeff-opt: Find optimal Runge-Kutta method coefficients, for a prescribed order of accuracy ... monotonicity. Includes capabilities for both multistep and multistage methods. polyopt: Find optimal stability polynomials...
  • HBOQ(14)4

  • Referenced in 1 article [sw09635]
  • Obrechkoff methods. Forcing a Taylor expansion of the numerical solution to agree with an expansion ... true solution leads to multistep- and Runge-Kutta-type order conditions which are reorganized into...
  • OptimalAdvertising

  • Referenced in 1 article [sw19645]
  • advertising expenditure. This problem is a discrete multistep optimal control problem, where an advertising expenditure ... problem can be solved explicitly. The Bellman method of dynaming programming is used to study...
  • PRIP_ENHANCE

  • Referenced in 1 article [sw10748]
  • visual pattern recognition in imaging detectors: Solution method: A filtering-based preprocessing algorithm to discern ... fine multiresolution survey of image through a multistep approach based on the Hierarchical Discrete Correlation...
  • BARON

  • Referenced in 228 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • BPOLY

  • Referenced in 11 articles [sw00089]
  • Algorithm 812: BPOLY: An object-oriented library of...
  • EXPFIT4

  • Referenced in 9 articles [sw00257]
  • EXPFIT4 - a Fortran program for the numerical solution...
  • Expokit

  • Referenced in 115 articles [sw00258]
  • Expokit provides a set of routines aimed at...
  • Gmsh

  • Referenced in 221 articles [sw00366]
  • Gmsh is a 3D finite element grid generator...
  • Hopscotch

  • Referenced in 42 articles [sw00413]
  • Hopscotch: a fast second order partial differential equations...
  • IRKC

  • Referenced in 17 articles [sw00452]
  • The Fortran 90 code IRKC is intended for...
  • KORALZ

  • Referenced in 14 articles [sw00493]
  • rief information on new features of KORALZ version...