Root finding algorithms for scalar functions.
#include <cmath>#include <limits>#include <type_traits>#include <dumux/common/exceptions.hh>#include <dumux/common/parameters.hh>#include <dumux/common/numericdifferentiation.hh>Go to the source code of this file.
| Namespaces | |
| namespace | Dumux | 
| Functions | |
| template<class Scalar, class ResFunc, class DerivFunc, typename std::enable_if_t< std::is_invocable_r_v< Scalar, ResFunc, Scalar > &&std::is_invocable_r_v< Scalar, DerivFunc, Scalar > > ...> | |
| Scalar | Dumux::findScalarRootNewton (Scalar xOld, const ResFunc &residual, const DerivFunc &derivative, const Scalar tol=1e-13, const int maxIter=200) | 
| Newton's root finding algorithm for scalar functions (secant method) | |
| template<class Scalar, class ResFunc, typename std::enable_if_t< std::is_invocable_r_v< Scalar, ResFunc, Scalar > > ...> | |
| Scalar | Dumux::findScalarRootNewton (Scalar xOld, const ResFunc &residual, const Scalar tol=1e-13, const int maxIter=200) | 
| Newton's root finding algorithm for scalar functions (secant method) | |
| template<class Scalar, class ResFunc, typename std::enable_if_t< std::is_invocable_r_v< Scalar, ResFunc, Scalar > > ...> | |
| Scalar | Dumux::findScalarRootBrent (Scalar a, Scalar b, const ResFunc &residual, const Scalar tol=1e-13, const int maxIter=200) | 
| Brent's root finding algorithm for scalar functions. | |