1. 30 Nov, 2016 6 commits
  2. 29 Nov, 2016 3 commits
  3. 28 Nov, 2016 1 commit
  4. 25 Nov, 2016 3 commits
  5. 24 Nov, 2016 2 commits
  6. 23 Nov, 2016 5 commits
  7. 22 Nov, 2016 1 commit
  8. 21 Nov, 2016 3 commits
  9. 18 Nov, 2016 2 commits
  10. 16 Nov, 2016 4 commits
  11. 15 Nov, 2016 1 commit
  12. 10 Nov, 2016 1 commit
    • Gregory Ashton's avatar
      Adds initial check of the typical number of segments · d6edafae
      Gregory Ashton authored
      The motivating idea here is to give the user an idea of how well the
      MCMC is likely to perform: if the typical number of templates is of
      order millions or more then the MCMC will work like a random template
      back, jumping back and forth without finding a peak (for a long time).
      d6edafae
  13. 08 Nov, 2016 3 commits
  14. 07 Nov, 2016 2 commits
  15. 06 Nov, 2016 1 commit
  16. 04 Nov, 2016 1 commit
  17. 03 Nov, 2016 1 commit
    • Gregory Ashton's avatar
      Adds MCMCFollowUpSearch · 88856d78
      Gregory Ashton authored
      This adds a class to perform follow ups from semi-coherent to
      fully-coherent using an MCMC search.
      
      - Also changes the logic of the MCMC search to check for old data only
        in the run method.
      - The nsteps argument exists for the MCMCFOllowUP, but is unused.
      - Some work on the plot_walkers to allow for overplotting. It may be
        useful to use this for the usual calls as well so that we don't have
        an initial and walkers plot?
      88856d78