Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Algorithm: DDS #155

Closed
philippkraft opened this issue May 8, 2018 · 1 comment
Closed

Algorithm: DDS #155

philippkraft opened this issue May 8, 2018 · 1 comment

Comments

@philippkraft
Copy link
Collaborator

The "Dynamically dimensioned search algorithm for computationally efficient watershed model calibration" algorithm by Tolson & Shoemaker 2007, looks like a good candidate for spotpy - especially for cases where a small number of model evaluation is more important than parameter precision. The paper compares SCE-UA with their new DDS algorithm and this comparison has been challanged in a commentary to that paper Behrangi et al. 2008 - however the commentary agrees on a faster yet not that exact convergance of the algorithm.

Implementation in R is available on GitHub: https://github.com/bdb67/Dynamically-Dimensioned-Search

@thouska
Copy link
Owner

thouska commented Feb 18, 2019

This is available now (#195) thanks to @bees4ever

@thouska thouska closed this as completed Feb 18, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants