-
Notifications
You must be signed in to change notification settings - Fork 73
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
RAM issues with Newton iteration #41
Comments
Hi, the devil is in the line X = round(XZ,eps,max_rank); |
Thank you very much. |
@dolgov Maybe add this to examples/tutorial? This is a neat example. |
well, I can add this to tests, but not the quick_start, as I don't have a latex of it. |
I tried to replicate some results from the "Approximation of 2^d x 2^d matrices" paper. There were results given for the approximate inverse of a 2D Laplacian with the Newton method. However, with my code it already takes more than 20GB of RAM to calculate this Newton iteration for a 2D Laplacian with d=9. What are the reasons for this? Am I even supposed to minimize the absolute as opposed to the relative residual?
The code:
And the output:
The text was updated successfully, but these errors were encountered: