# Functions
GSS performs golden section search to find the minimum of a unimodal function, given correct bounds on the minimum.
LeastSquares3 computes the least squares solution to the equation Ax = b, where A is a matrix with rows vs, and b is a column matrix.
LeastSquaresReg3 is like LeastSquares3, but uses ridge regression with a penalty equal to lambda.
NewBiCGSTAB initializes the BiCGSTAB solver for the given linear system, as implement by op.
NewKMeans creates a KMeans object with K-means++ initialization.
NewMatrix2Columns creates a Matrix2 with the given coordinates as column entries.
NewMatrix2Rotation creates a rotation matrix that rotates column vectors by theta.
NewMatrix3Columns creates a Matrix3 with the given coordinates as column entries.
NewMatrix3Rotation creates a 3D rotation matrix.
NewMatrix4Columns creates a Matrix4 from the columns.
NewMatrix4Identity creates an identity matrix.
No description provided by the author
No description provided by the author
NewVec2RandomNormal creates a random normal vector.
NewVec2RandomUnit creates a unit-length Vec2 in a random direction.
NewVec3RandomNormal creates a random normal vector.
NewVec3RandomUnit creates a unit-length Vec3 in a random direction.
NewVec4RandomNormal creates a random normal vector.
NewVec4RandomUnit creates a unit-length Vec3 in a random direction.
# Constants
No description provided by the author
# Structs
BiCGSTAB implements the biconjugate gradient stabilized method for inverting a specific large asymmetric matrix.
BiCGSTABSolver implements LargeLinearSolver using the BiCGSTAB algorithm with a specified stopping condition.
A GridSearch2D implements 2D grid search for minimizing or maximizing 2D functions.
A GridSearch3D is like GridSearch2D, but for searching over a 3D volume instead of a 2D area.
KMeans stores the (intermediate) results of K-means clustering.
A LineSearch implements a 1D line search for minimizing or maximizing 1D functions.
A RecursiveLineSearch searches for an optimum in an N-dimensional space by recursively applying line searches along each axis.
SparseCholesky is a sparse LU decomposition of a symmetric matrix.
A SparseMatrix is a square matrix where entries can be set to non-zero values in any order, and not all entries must be set.
# Interfaces
A FiniteVector is a Vector with the extra constraint that it has a finite number of dimensions that can be accessed independently.
A LargeLinearSolver provides numerical solutions to linear systems that are implemented as functions on vectors.
The Vector interface type is meant to be used in type constraints as `T Vector[T]`.
# Type aliases
Matrix2 is a 2x2 matrix, stored in row-major order.
Matrix3 is a 3x3 matrix, stored in row-major order.
No description provided by the author
A Polynomial is an equation of the form
a0 + a1*x + a2*x^2 + a3*x^3 + ..
Vec is a vector of arbitrary dimension.
A Vec2 is a 2-dimensional tuple of floats.
A Vec3 is a 3-dimensional tuple of floats.
A Vec4 is a 4-dimensional tuple of floats.