• GniCodes

  • Referenced in 8 articles [sw21086]
  • Runge-Kutta methods, composition and splitting methods, linear multistep methods, and algorithms for Hamiltonian problems...
  • LMEF

  • Referenced in 3 articles [sw13929]
  • program for the construction of linear multistep methods with exponential fitting for the numerical solution ... MATLAB, to calculate the coefficients of a linear multi-step method (explicit, implicit or backward...
  • mrms

  • Referenced in 2 articles [sw33953]
  • Minimal residual multistep methods for large stiff non-autonomous linear problems. The purpose of this ... general form of an explicit linear multistep method we suggest to adaptively choose its coefficients ... methods Minimal Residual Multistep (MRMS) methods. In the case of linear non-autonomous problem, besides...
  • ROWMAP

  • Referenced in 48 articles [sw09627]
  • problems. It is based on the ROW-methods of the code ROS4 of Hairer ... uses Krylov techniques for the solution of linear systems. A special multiple Arnoldi process ensures ... equations. Numerical tests and comparisons with the multistep code VODPK illustrate the efficiency of ROWMAP...
  • EXPODE

  • Referenced in 2 articles [sw20449]
  • Runge-Kutta- and Rosenbrock-methods, linearized and non-linearized multistep-methods and the EXP4...
  • CVODE

  • Referenced in 56 articles [sw04947]
  • CVODE are variable-order, variable-step multistep methods. For nonstiff problems, CVODE includes the Adams ... iteration. In the cases of a direct linear solver (dense or banded), the Newton iteration...
  • HBOQ(14)4

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

  • Referenced in 1 article [sw19645]
  • nonlinear difference equation. The non-linearity depends on a parameter ... 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...
  • BARON

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

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

  • Referenced in 21 articles [sw00151]
  • The authors show how mathematical concepts can be...
  • EXPFIT4

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

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

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

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

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

  • Referenced in 1642 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Maple

  • Referenced in 5124 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 5957 articles [sw00554]
  • Almost any workflow involves computing results, and that...