Fast 1D, 2D and 3D Integrations
Our core libraries allow fast 2D and 3D integration of arbitrarily complex but continuous numerical functions.
Fast 1D, 2D and 3D Multiple Root Discovery
Our core libraries allow fast search for zeros in arbitrarily complex but continuous 1D, 2D or 3D functions.
Fast 2D and 3D Point Cloud Manipulation
Our core libraries allow fast manipulation of 2D and 3D scatter points to rotate, translate, shear, flip and much more.
Fast 1D, 2D and 3D Min Max Finding
Sometimes finding roots is not enough or not appropriate due to the nature of the function. Our 1D, 2D, and 3D MinMax Finders optimally searches and discovers minima and maxima of arbitrarily complex yet continuous 1D, 2D and 3D functions.
Fast Directed and Undirected Graph Algorithms
Our core graphing libraries provide efficient shortest path, shortest distance, maximum flow, cycle detection, negative cycle detection, transitive equivalence, minimum equivalence, longest path, Hamiltonian cycle algorithms. Djikstra, Belman-Ford, Ford-Fulkerson, Floyd-Warshall, Johnson are some of the algorithms we have efficiently implemented to work in High Performance Computing (HPC) environments.
Special Math Structures
Our core libraries include special math structures like Symmetric Matrices, Boolean Matrices, Integer Matrices, Sparse Matrices, Sparse Symmetric Matrices, Specialized Cartesian and Spherical Coordinate Transformation Matrices, 2D/3D FieldMeshes, 2D/3D/ND KDTrees, and Disjoint sets. Some core statistical routines are also implemented: Chi-Squared Tests, Fisher Tests, Logistic Regression and Cohort Matching.