Expand description
Sublinear time solver with guaranteed O(log n) complexity
This module implements mathematically rigorous sublinear algorithms that achieve true O(log n) time complexity through dimension reduction and spectral methods.
Structs§
- JLEmbedding
- Johnson-Lindenstrauss embedding for dimension reduction
- Sublinear
Config - Sublinear solver configuration
- Sublinear
Neumann Result - Result of sublinear Neumann solver
- Sublinear
Neumann Solver - Sublinear Neumann solver with guaranteed O(log n) complexity
Enums§
- Complexity
Bound - Complexity bound for sublinear algorithms
Type Aliases§
- Precision
- Precision type for all calculations