Rust Optimal Transport solvers
-
Updated
Mar 31, 2024 - C++
Rust Optimal Transport solvers
A simple iterative method to approach the double stochastic matrix is to alternately rescale all rows and all columns of A to sum to 1. Both CPU and GPU parallelism is exploited.
Add a description, image, and links to the sinkhorn-knopp topic page so that developers can more easily learn about it.
To associate your repository with the sinkhorn-knopp topic, visit your repo's landing page and select "manage topics."