Integrate ustore-dev branch, Notes

[jbschroder]

A good explanation for what this branch does is Rob's comment from commit 6f7c71d """ When using the no-residual option, a better initial guess for Step() is the last solution computed by Step(). This is a solution of the homogeneous problem, not the FAS problem. This version of the code stores this better initial guess in a new array called wa[], which mimics the va[] array already in Braid. It is only used for the no-residual option. The value is updated in two places: Step() and Residual(). There are some subtleties related to the latter routine associated with maintaining a fixed-point iteration that need to be documented. Also, some discussion is needed about how to control when/where to use this option. One idea is to give the user control over each grid level individually (in much the same way as is done currently with the coarsening factor), since the additional storage and copying is not needed on levels where explicit schemes are used. """ Basically, this stores a better initial guess on coarse-grids for implicit methods, and I went back to Ben O'Neill's notes, and I think that this is worth keeping around.

• I believe the changes are small, but this is too old to do a pull request with.

• Need to do a diff between this branch and the braid-master from that same time, in order to see what needs to be changed