Popularity
0.7
Declining
Activity
1.3
Declining
3
2
0
Programming language: Go
Latest version: v1.0
rootfinding alternatives and similar packages
Based on the "Science and Data Analysis" category

gonum
Gonum is a set of numeric libraries for the Go programming language. It contains libraries for matrices, statistics, optimization, and more. 
gosl
Go scientific library for linear algebra, FFT, geometry, NURBS, numerical methods, probabilities, optimisation, differential equations, and more. 
gonum/mat64
The general purpose package for matrix computation. Package mat64 provides basic linear algebra operations for float64 matrices. 
TextRank
TextRank implementation in Golang with extendable features (summarization, weighting, phrase extraction) and multithreading (goroutine) support. 
sparse
Go Sparse matrix formats for linear algebra supporting scientific and machine learning applications, compatible with gonum matrix libraries. 
vectormath
Vectormath for Go, an adaptation of the scalar C functions from Sony's Vector Math library, as found in the Bullet2.79 source code. (currently inactive) 
triangolatte
2D triangulation library. Allows translating lines and polygons (both based on points) to the language of GPUs. 
ode
An ordinary differential equation (ODE) solver which supports extended states and channelbased iteration stop conditions. 
GoStats
GoStats is an Open Source GoLang library for math statistics mostly used in Machine Learning domains, it covers most of the Statistical measures functions. 
mudlarkgo
A collection of packages providing (hopefully) useful code for use in software using Google's Go programming language. 
calendarheatmap
Calendar heatmap in plain Go inspired by Github contribution activity.
Do you think we are missing an alternative of rootfinding or a related project?
Popular Comparisons
README
rootfinding
github.com/khezen/rootfinding
 Brent's Method
Example
package main
import(
"fmt"
"github.com/khezen/rootfinding"
)
func f(x float64) float64 {
return math.Pow(x, 4)  2*math.Pow(x, 2) + 0.25
}
const(
intervalStart = 100
intervalEnd = 100
precision = 6
)
func main(){
root, err := rootfinding.Brent(f, intervalStart, intervalEnd, precision)
if err != nil {
panic(err)
}
fmt.Println(root)
}
0.366025403784438