-
Notifications
You must be signed in to change notification settings - Fork 13
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
Use Observer for output #93
Conversation
Codecov Report
❗ Your organization is not using the GitHub App Integration. As a result you may experience degraded service beginning May 15th. Please install the Github App Integration for your organization. Read more. @@ Coverage Diff @@
## main #93 +/- ##
==========================================
- Coverage 79.25% 79.20% -0.05%
==========================================
Files 61 61
Lines 3442 3458 +16
==========================================
+ Hits 2728 2739 +11
- Misses 714 719 +5
|
Tests are passing, except for code coverage. (Can fix but it's a bit stringent when making large changes to the code.) |
Looks good, thanks! I think it makes sense to keep |
Good point regarding A good test case might be TCI when that goes in: there the solver can be simply overloaded, but the factorize step has to be customized to use the LDU method and return pivot information etc. I could envision doing this by completely overloading |
Yeah, I agree that we also want to more narrowly be able to customize the |
Agreed. I can use the upcoming PR to add TCI to also come up with a good
scheme for customizing the factorize step. Right now I'm thinking I'll wait
until the Waintal group's paper is out before adding it, though, since it
borrows heavily from their ideas (with their permission) and I don't want
to front-run them. I think it will be out in a month or so.
…On Tue, 11 Jul 2023 at 12:22, Matt Fishman ***@***.***> wrote:
Yeah, I agree that we also want to more narrowly be able to customize the
factorize step, since that could be quite different for general region
updates on trees (where the tools that @LinjianMa
<https://github.com/LinjianMa> is developing for factorizing a network
into a TTN will be helpful) or updating regions of general tensor networks,
especially if we want to account for different gauges (like isometric
gauges vs. the Vidal gauge).
—
Reply to this email directly, view it on GitHub
<#93 (comment)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/AAHJ3ROJKME544HSGCVIOMTXPV4UPANCNFSM6AAAAAAZRS3JHE>
.
You are receiving this because you authored the thread.Message ID:
***@***.***>
--
-=Miles Stoudenmire=-
***@***.***
***@***.***
http://itensor.org/miles/
|
This PR moves the task of printing output into helper functions which are put into Observers, either the step_observer! or the sweep_observer!. The
tdvp
function now takes advantage of this design to inject another function that prints the current time reached after each sweep.Some other changes include:
update!(step_observer!,...)
from insidelocal_update
to avoid returning too many variables fromlocal_update
(which makes me wonder iflocal_update
should just be inlined back intoupdate_step
?)update!
so that the observer can have access to it.update_sweep
todefault_sweep_regions