Altaxo.Calc.RootFinding Namespace |
[Missing <summary> documentation for "N:Altaxo.Calc.RootFinding"]
Classes| | Class | Description |
|---|
 | AbstractRootFinder |
Base class for one-dimensional root-finding algorithms.
|
| Bisection |
Bisection root-finding algorithm.
|
| BisectionRootFinder |
Root finder using the bisection method.
|
| Brent |
Algorithm by Brent, Van Wijngaarden, Dekker et al.
Implementation inspired by Press, Teukolsky, Vetterling, and Flannery, "Numerical Recipes in C", 2nd edition, Cambridge University Press
|
| BrentRootFinder |
Root finder using Brent's method.
|
| Broyden |
Algorithm by Broyden.
Implementation inspired by Press, Teukolsky, Vetterling, and Flannery, "Numerical Recipes in C", 2nd edition, Cambridge University Press
|
| ComplexPolynomialRootFinder_JenkinsTraub |
Implements the Jenkins–Traub algorithm for polynomials with complex coefficients.
|
| Cubic |
Finds roots to the cubic equation x^3 + a2*x^2 + a1*x + a0 = 0
Implements the cubic formula in http://mathworld.wolfram.com/CubicFormula.html
|
| FalsePositionRootFinder |
Root finder using the false-position (regula falsi) method.
|
| NewtonRaphson |
Pure Newton-Raphson root-finding algorithm without any recovery measures in cases it behaves badly.
The algorithm aborts immediately if the root leaves the bound interval.
|
| NewtonRootFinder |
Root finder using Newton's method.
|
| QuickRootFinding |
Provides static methods for quick and dirty root finding without instantiating a class.
|
| RealPolynomialRootFinder_JenkinsTraub |
Implements the Jenkins-Traub algorithm for polynoms with real coefficients.
|
| RidderRootFinder |
Root finder that implements Ridder's method for locating a root of a continuous real-valued function on an interval.
|
| RobustNewtonRaphson |
Robust Newton-Raphson root-finding algorithm that falls back to bisection when overshooting or converging too slow, or to subdivision on lacking bracketing.
|
| RootFinderException |
Exception thrown by root-finding algorithms when a root cannot be found or the accuracy goal is not reached.
|
| Secant |
Pure Secant root-finding algorithm without any recovery measures in cases it behaves badly.
The algorithm aborts immediately if the root leaves the bound interval.
|
| SecantRootFinder |
Root finder that implements the secant method for locating a root of a real-valued function.
|
| UnaryFunctions |
Provides helpers for creating and composing unary functions (FuncT, TResult with Double input and output).
|
| ZeroCrossingBracketing | |
Structures | | Structure | Description |
|---|
 | Range |
Represents a numeric interval used by root-finding algorithms.
|
