#
sparse-matrix-computation
Here is 1 public repository matching this topic...
Rust + WASM sublinear-time solver for asymmetric diagonally dominant systems. Exposes Neumann series, push, and hybrid random-walk algorithms with npm/npx CLI and Flow-Nexus HTTP streaming for swarm cost propagation and verification.
pagerank-algorithmscientific-computingsparse-linear-solvernumerical-linear-algebrarust-wasmiterative-solversgraph-laplaciansublinear-algorithmstemporal-computingmodel-context-protocolmcp-toolsdiagonally-dominantconjugate-gradient-methodneumann-seriesnetwork-flow-optimizationsparse-matrix-computationedge-computing-algorithmsasymmetric-matricesdistributed-solvers
- Updated
Oct 7, 2025 - Rust
Improve this page
Add a description, image, and links to thesparse-matrix-computation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thesparse-matrix-computation topic, visit your repo's landing page and select "manage topics."