{"action":"opened","issue":{"url":"https://api.github.com/repos/idaholab/moose/issues/7982","repository_url":"https://api.github.com/repos/idaholab/moose","labels_url":"https://api.github.com/repos/idaholab/moose/issues/7982/labels{/name}","comments_url":"https://api.github.com/repos/idaholab/moose/issues/7982/comments","events_url":"https://api.github.com/repos/idaholab/moose/issues/7982/events","html_url":"https://github.com/idaholab/moose/issues/7982","id":186413870,"number":7982,"title":"Create better solve time adaptive stepping algorithm...","user":{"login":"rwcarlsen","id":1351242,"avatar_url":"https://avatars.githubusercontent.com/u/1351242?v=3","gravatar_id":"","url":"https://api.github.com/users/rwcarlsen","html_url":"https://github.com/rwcarlsen","followers_url":"https://api.github.com/users/rwcarlsen/followers","following_url":"https://api.github.com/users/rwcarlsen/following{/other_user}","gists_url":"https://api.github.com/users/rwcarlsen/gists{/gist_id}","starred_url":"https://api.github.com/users/rwcarlsen/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rwcarlsen/subscriptions","organizations_url":"https://api.github.com/users/rwcarlsen/orgs","repos_url":"https://api.github.com/users/rwcarlsen/repos","events_url":"https://api.github.com/users/rwcarlsen/events{/privacy}","received_events_url":"https://api.github.com/users/rwcarlsen/received_events","type":"User","site_admin":false},"labels":[{"id":80663214,"url":"https://api.github.com/repos/idaholab/moose/labels/C:%20MOOSE","name":"C: MOOSE","color":"0052cc","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-10-31T22:17:32Z","updated_at":"2016-10-31T22:17:32Z","closed_at":null,"body":"The current SolutionTimeAdaptive time stepper adjusts dt up/down 10% (or user-specified %) in order to minimize the quantity ``(solution time) / (dt)``.  This neglects to use information about how the quantity is changing over multiple iterations.  A better algorithm would be something like a Golden section search (https://en.wikipedia.org/wiki/Golden_section_search) to minimize the solve_time/dt.  We could have it start with a modest dt and then grow by e.g. factors of two until it found a set of dt's that bracket the minimum - then switch to the golden search."}}
{"actor":{"display_login":"rwcarlsen"}}