Nodes of different colours represent the following:
Solid arrows point from a submodule to the (sub)module which it is
descended from. Dashed arrows point from a module or program unit to
modules which it uses.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Nodes of different colours represent the following:
Solid arrows point from a submodule to the (sub)module which it is
descended from. Dashed arrows point from a module or program unit to
modules which it uses.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
This class is an implementation of the stabilized quasi newton optimization method.
More informations about the algorithm can be found here: https://aip.scitation.org/doi/10.1063/1.4905665
Nodes of different colours represent the following:
Solid arrows point from a derived type to the parent type which it
extends. Dashed arrows point from a derived type to the other
types it contains as a components, with a label listing the name(s) of
said component(s).
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Nodes of different colours represent the following:
Solid arrows point from a derived type to the parent type which it
extends. Dashed arrows point from a derived type to the other
types it contains as a components, with a label listing the name(s) of
said component(s).
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Calculates a set of new coordinates based on the function value and
derivatives provide on input.
The idea behind this function is, that the user evaluates the function at the new
point this method suggested and
then calls this method again with the function value at the new point until
convergence was reached.
x :
real(c_double) (dim: (t%ndim)) [in]– Array containg position vector x.
f_of_x :
real(c_double) [in]– Value of target function at point x.
df_dx :
real(c_double) (dim: (t%ndim)) [in]– derivative of function f with respect to x.
dir_of_descent :
real(c_double) (dim: (t%ndim)) [out]– Direction of descent x+dir_of_descent is the new point
of the function that should be evaluated by the user.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.