You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/Numerics/RootFinding/RobustNewtonRaphson.cs
+12-2Lines changed: 12 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -60,8 +60,8 @@ public static double FindRoot(Func<double, double> f, Func<double, double> df, d
60
60
/// <summary>Find a solution of the equation f(x)=0.</summary>
61
61
/// <param name="f">The function to find roots from.</param>
62
62
/// <param name="df">The first derivative of the function to find roots from.</param>
63
-
/// <param name="lowerBound">The low value of the range where the root is supposed to be.</param>
64
-
/// <param name="upperBound">The high value of the range where the root is supposed to be.</param>
63
+
/// <param name="lowerBound">The low value of the range where the root is supposed to be (finite number).</param>
64
+
/// <param name="upperBound">The high value of the range where the root is supposed to be (finite number).</param>
65
65
/// <param name="accuracy">Desired accuracy. The root will be refined until the accuracy or the maximum number of iterations is reached. Example: 1e-14. Must be greater than 0.</param>
66
66
/// <param name="maxIterations">Maximum number of iterations. Example: 100.</param>
67
67
/// <param name="subdivision">How many parts an interval should be split into for zero crossing scanning in case of lacking bracketing. Example: 20.</param>
0 commit comments