Nodes of different colours represent the following:
Solid arrows point from one derived type to another which extends (inherits from) it. Dashed arrows point from a derived type to another type containing it 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.
| Type | Visibility | Attributes | Name | Initial | |||
|---|---|---|---|---|---|---|---|
| type(ControlsType), | public | :: | Controls | ||||
| integer, | public | :: | StatusFlag | = | iStatusNone | ||
| integer, | public | :: | CurrentMethodType | = | iMethodNone | ||
| real(kind=r64), | public | :: | XCandidate | = | 0.0d0 | ||
| real(kind=r64), | public | :: | ConvergenceRate | = | 0.0d0 | ||
| type(PointType), | public | :: | Increment | ||||
| type(PointType), | public | :: | MinPoint | ||||
| type(PointType), | public | :: | MaxPoint | ||||
| type(PointType), | public | :: | LowerPoint | ||||
| type(PointType), | public | :: | UpperPoint | ||||
| type(PointType), | public | :: | CurrentPoint | ||||
| integer, | public | :: | NumHistory | = | 0 | ||
| type(PointType), | public | :: | History(3) |
TYPE RootFinderDataType
TYPE (ControlsType) :: Controls
INTEGER :: StatusFlag = iStatusNone ! Current status of root finder
! Valid values are any of the STATUS_<code> constants
INTEGER :: CurrentMethodType = iMethodNone ! Solution method used to perform current step
REAL(r64) :: XCandidate = 0.0d0 ! Candidate X value to use next when evaluating F(X)
REAL(r64) :: ConvergenceRate = 0.0d0 ! Convergence rate achieved over the last 2 successive iterations
TYPE (PointType) :: Increment ! Increment between last 2 iterations
TYPE (PointType) :: MinPoint ! Point { XMin, F(XMin) }
TYPE (PointType) :: MaxPoint ! Point { XMax, F(XMax) }
TYPE (PointType) :: LowerPoint ! Point { XLower, F(XLower) } so that XLower <= XRoot
TYPE (PointType) :: UpperPoint ! Point { XUpper, F(XUpper) } so that XRoot <= YUpper
TYPE (PointType) :: CurrentPoint ! Last evaluated point { X, F(X) }
INTEGER :: NumHistory = 0 ! Number of points stored in History
TYPE (PointType) :: History(3) ! Vector containing last 3 best iterates
END TYPE RootFinderDataType