Matt Piekenbrock

Sorry for the delayed response. Here is my review: I think there's a few issues with the code that must be fixed prior to merging, both theoretically and computationally. Overall,...

I've added a preliminary [branch](https://github.com/mhahsler/dbscan/tree/kdtree_extensions) that allows the use of a pre-built kd tree with dbscan. You could try using that, although again it's worth noting there still seem to...

I would love to have this as well. One could probably precompute the core distances only, and then change the MST code to compute the mutual reachability distances on demand....

It would nice is Pymanopt supported something like this, even in a similar way as Manopt does w/ [costgrad](https://www.manopt.org/tutorial.html#costdescription)

For anyone who comes across this in the future---if one can guarantee csc format from scipy, then here's a quick a dirty solution in pybind11: ```cpp void to_sparse(const py::object& S,...

Has anyone been able to get an example that produces similar results as computed with e.g. the geigen package?

As an aside, I found the solver interfaces (such as `SymEigsSolver`) to be a little too restrictive for my use case. For example, there are use-cases where one may want...

Can confirm this doesn't work on OS X (x86_64)

Yes. I was confused at the time as the material I was reading suggested this was possible, but none of the Lanczos software I could find seemed to support this,...

> The real problem is to compute all eigenvalues using iterative methods like Lanczos and Jacobi-Davidson. In my opinion, they are designed to compute just a few eigenvalueMs. Right I...