RootFinding: F# module

src/FSharp/FSharp.fsproj

@@ -71,8 +71,9 @@
     <Compile Include="BigIntegerExtensions.fs" />
     <Compile Include="BigRational.fsi" />
     <Compile Include="BigRational.fs" />
-    <Compile Include="Fit.fs" />
     <Compile Include="RandomVariable.fs" />
+    <Compile Include="Fit.fs" />
+    <Compile Include="FindRoots.fs" />
   </ItemGroup>
   <ItemGroup>
     <Reference Include="FSharp.Core" />

src/FSharp/FindRoots.fs

@@ -0,0 +1,61 @@
+// <copyright file="FindRoots.fs" company="Math.NET">
+// Math.NET Numerics, part of the Math.NET Project
+// http://numerics.mathdotnet.com
+// http://github.com/mathnet/mathnet-numerics
+// http://mathnetnumerics.codeplex.com
+//
+// Copyright (c) 2009-2013 Math.NET
+//
+// Permission is hereby granted, free of charge, to any person
+// obtaining a copy of this software and associated documentation
+// files (the "Software"), to deal in the Software without
+// restriction, including without limitation the rights to use,
+// copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the
+// Software is furnished to do so, subject to the following
+// conditions:
+//
+// The above copyright notice and this permission notice shall be
+// included in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+// OTHER DEALINGS IN THE SOFTWARE.
+// </copyright>
+
+namespace MathNet.Numerics
+
+open System
+open MathNet.Numerics.RootFinding
+
+[<CompilationRepresentation(CompilationRepresentationFlags.ModuleSuffix)>]
+module FindRoots =
+
+    let private tobcl (f:'a->'b) = Func<'a,'b>(f)
+    let private (|>|) option orElse = match option with | Some x -> Some x | None -> orElse() 
+
+    // direct algorithms
+
+    let brent maxIterations accuracy lowerBound upperBound (f:double->double) =
+        match Brent.TryFindRoot(tobcl f, lowerBound, upperBound, accuracy, maxIterations) with
+        | true, root -> Some root
+        | false, _ -> None
+
+    let newtonRaphsonRobust maxIterations subdivision accuracy lowerBound upperBound (f:double->double) (df:double->double) =
+        match RobustNewtonRaphson.TryFindRoot(tobcl f, tobcl df, lowerBound, upperBound, accuracy, maxIterations, subdivision) with
+        | true, root -> Some root
+        | false, _ -> None
+
+
+    // simple usage
+
+    let ofFunction lowerBound upperBound (f:double->double) = brent 100 1e-8 lowerBound upperBound f
+
+    let ofFunctionAndDerivative lowerBound upperBound (f:double->double) (df:double->double) =
+        newtonRaphsonRobust 100 20 1e-8 lowerBound upperBound f df
+        |>| fun () -> brent 100 1e-8 lowerBound upperBound f

src/FSharpPortable/FSharpPortable.fsproj

@@ -80,6 +80,9 @@
     <Compile Include="..\FSharp\Fit.fs">
       <Link>Fit.fs</Link>
     </Compile>
+    <Compile Include="..\FSharp\FindRoots.fs">
+      <Link>FindRoots.fs</Link>
+    </Compile>
     <Compile Include="..\FSharp\RandomVariable.fs">
       <Link>RandomVariable.fs</Link>
     </Compile>