Procedure | Location | Procedure Type | Description |
---|---|---|---|
anderson_bjorck | root_module | Subroutine | Compute the zero of the function f(x) in the interval ax,bx using the Anderson-Bjorck method. |
anderson_bjorck_king | root_module | Subroutine | Modified anderson-bjorck-king method. Same as anderson_bjorck, but with an extra initial bisection step. |
barycentric | root_module | Subroutine | Barycentric interpolation method. |
bdqrf | root_module | Subroutine | Bisected Direct Quadratic Regula Falsi (BDQRF) root solver method to find the root of a 1D function. |
bisect | root_module | Function | Bisection step. |
bisection | root_module | Subroutine | Compute the zero of the function f(x) in the interval ax,bx using the bisection method. |
blendtf | root_module | Subroutine | BlendTF blended method of trisection and false position methods. |
brent | root_module | Subroutine | Find a zero of the function in the given interval to within a tolerance , where is the relative machine precision defined as the smallest representable number such that . |
brenth | root_module | Subroutine | Brent's method with hyperbolic extrapolation. |
brentq | root_module | Subroutine | Classic Brent's method to find a zero of the function f on the sign changing interval [ax, bx], but with a different formula for the extrapolation step. |
chandrupatla | root_module | Subroutine | Chandrupatla's method. |
choose_best | root_module | Subroutine | Given two points with two function evaluations, choose the best one (the one closest to the root). |
converged | root_module | Function | Determines convergence in x based on if the reltol or abstol is satisfied. |
get_fa_fb | root_module | Subroutine | Returns the function values at |
illinois | root_module | Subroutine | Illinois method. |
initialize_root_solver | root_module | Subroutine | Initialize the root_solver class. |
itp | root_module | Subroutine | Compute the zero of the function f(x) in the interval ax,bx using the Interpolate Truncate and Project (ITP) method. |
itp_optional_inputs | root_module | Subroutine | For the itp method, set the optional inputs. |
lowercase | root_module | Function | lowercase a string. |
muller | root_module | Subroutine | Improved Muller method (for real roots only). Will fall back to bisection if any step fails. |
pegasus | root_module | Subroutine | Pegasus method to find a root of f(x). |
regula_falsi | root_module | Subroutine | Compute the zero of the function f(x) in the interval ax,bx using the regula falsi method. |
regula_falsi_step | root_module | Function | Regula Falsi step. With a protection to fall back to bisection if: |
ridders | root_module | Subroutine | Ridders method to find a root of f(x). |
root_name_to_method | root_module | Function | Convert a root method name to the corresponding root_method enum type. |
root_scalar | root_module | Interface | |
root_scalar_by_name | root_module | Subroutine | Non-object-oriented wrapper. |
root_scalar_by_type | root_module | Subroutine | Non-object-oriented wrapper. |
secant | root_module | Function | Secent step. With a protection to fall back to bisection if: |
solution | root_module | Function | Returns true if this is a solution and sets |
solve | root_module | Subroutine | Main wrapper routine for all the methods. |
swap | root_module | Subroutine | Swap two real(wp) values. |
toms748 | root_module | Subroutine | TOMS748 rootfinding method. |
zhang | root_module | Subroutine | Zhang's method (with corrections from Stage). |