Skip to main content
Share Your Experience: Take the 2024 Developer Survey
6 votes

Algorithm to find local minima of function which is unbounded from below

If the "basin of attraction" for the best local minimum occupies 1% of the volume of the bounding box, then the following strategy suffices: Repeat a few hundred times: Pick a random ...
D.W.'s user avatar
  • 462
2 votes

stupid + stupid = brilliant in scientific computing

Gauss-Seidel solvers can be presented as Jacobi iteration solvers where one has made the "bug" of overwriting into a single vector instead of using two separate buffers as in a correct ...
Gilbert Bernstein's user avatar

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