Hot answers tagged

5 votes

Questions on the theory of distributed numerical algebraic computation

Building such a library from scratch is a serious undertaking. The SLATE library, which targets the functionality you're looking at, has taken about 6 years with 4-7 full-time developers, most of ...
Neil Lindquist's user avatar
3 votes
Accepted

Improvement to naive gradient descent implementation for the Thomson problem

Instead of using einsum to get compiled loops, one could also first use the provided tools of numpy for elementary array ...
Lutz Lehmann's user avatar
  • 5,249
2 votes

What is the fastest way to compute all eigenvalues of a very big and sparse adjacency matrix in python?

Also as an update to Daniel Shaperos answer: If you have a GPU (doesn't matter if NVidia or AMD) available, you can try cupy. Many numpy and scipy functions are available and can be used by replacing ...
Florian Q's user avatar
1 vote

Calculating Madelung constant via Ewald summation

There are a number of issues here (as I noted in the comments) Firstly you have the maths wrong in a number of places, both in the question and the implementation. The correct final formula should be $...
Ian Bush's user avatar
  • 491

Only top scored, non community-wiki answers of a minimum length are eligible