Equivalence solution algorithm¶
-
class
xc.
EquiSolnAlgo
¶ Bases:
xc.SolutionAlgorithm
-
class
xc.
EquiSolnConvAlgo
¶ Bases:
xc.EquiSolnAlgo
-
class
xc.
BFBRoydenBase
¶ Bases:
xc.EquiSolnConvAlgo
-
class
xc.
BFGS
¶ Bases:
xc.BFBRoydenBase
-
class
xc.
Broyden
¶ Bases:
xc.BFBRoydenBase
-
class
xc.
KrylovNewton
¶ Bases:
xc.EquiSolnAlgo
-
maxDimension
¶ max number of iterations until the tangent is reformed and the acceleration restarts (default = 3)
-
-
class
xc.
Linear
¶ Bases:
xc.EquiSolnAlgo
-
class
xc.
NewtonBased
¶ Bases:
xc.EquiSolnAlgo
-
class
xc.
ModifiedNewton
¶ Bases:
xc.NewtonBased
-
class
xc.
NewtonLineSearch
¶ Bases:
xc.EquiSolnAlgo
-
setLineSearchMethod
((NewtonLineSearch)arg1, (str)arg2) → bool :¶ set the line search method to use (bisection_line_search, initial_interpolated_line_search, regula_falsi_line_search, secant_line_search)
- C++ signature :
- bool setLineSearchMethod(XC::NewtonLineSearch {lvalue},std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)
-
-
class
xc.
NewtonRaphson
¶ Bases:
xc.NewtonBased
-
class
xc.
PeriodicNewton
¶ Bases:
xc.NewtonBased