The Mapped Distance Matrix (MDM) of two sets
where
The problem might be augmented by weighting the contributions with a matrix
of weights
A particularly popular form of the problem (which is also what we treat in this
repository) occurs when weights are defined individually for the members of
In general
Practical applications usually require huge sets of points, which causes
memory errors on commonly used devices. This is why it's preferrable to
compute the vector
For most use cases this is enough.
- Algorithms
- Uniform grid algorithm
- Scattered points algorithm
- Fourier-transfor based algorithm
- Backends
- NumPy/Numba
- PyTorch
- JAX(?)
- Parallelization
- Multithreading/Multiprocessing
- GPU w/ PyTorch
- GPU w/ JAX
- CUDA kernels(?)
- Tests
- Documentation
- Benchmark (+comparison with competitors)
- CPU
- GPU
- Several different bin sizes
-
pts_per_future
- Future
- Periodicity
- More general about distance definitions