Add documentation for Muller's method

Author: fgittins

docs/src/native/bracketingnonlinearsolve.md

@@ -18,4 +18,5 @@ Bisection
 Falsi
 Ridder
 Brent
+Muller
 ```

docs/src/solvers/bracketing_solvers.md

@@ -26,13 +26,14 @@ This gives a robust and fast method, which therefore enjoys considerable popular
 
 ## Full List of Methods
 
-### SimpleNonlinearSolve.jl
+### BracketingNonlinearSolve.jl
 
 These methods are automatically included as part of NonlinearSolve.jl. Though, one can use
-SimpleNonlinearSolve.jl directly to decrease the dependencies and improve load time.
+BracketingNonlinearSolve.jl directly to decrease the dependencies and improve load time.
 
   - [`ITP`](@ref): A non-allocating ITP (Interpolate, Truncate & Project) method
   - [`Falsi`](@ref): A non-allocating regula falsi method
   - [`Bisection`](@ref): A common bisection method
   - [`Ridder`](@ref): A non-allocating Ridder method
   - [`Brent`](@ref): A non-allocating Brent method
+  - [`Muller`](@ref): A non-allocating Muller's method

lib/BracketingNonlinearSolve/src/muller.jl

@@ -1,10 +1,20 @@
 """
     Muller(; middle = nothing)
 
-Muller's method for determining a root of a univariate, scalar function. The
-algorithm, described in Sec. 9.5.2 of
-[Press et al. (2007)](https://numerical.recipes/book.html), requires three
-initial guesses `(left, middle, right)` for the root.
+Muller's method for determining a root of a univariate, scalar function.
+
+The algorithm, described in Sec. 9.5.2 of
+[Press et al. (2007)](https://numerical.recipes/book.html), is a generalization
+of the secant method, using quadratic interpolation of three points to find the
+next estimate for the root. Due to the quadratic interpolation, the method is
+well suited for obtaining complex roots.
+
+This method requires three initial guesses `(left, middle, right)` for the
+solution. The guesses `(left, right) = tspan` are provided by the
+`IntervalNonlinearProblem`, while the `middle` guess may be specified as an
+optional keyword argument. In notable contrast to the other
+`BracketingNonlinearSolve.jl` solvers, the `Muller` algorithm does not need
+`(left, right)` to bracket the root.
 
 ### Keyword Arguments