|
From: | Rik |
Subject: | [Octave-bug-tracker] [bug #53140] Solution of a system of linear equations takes forever and hurts OS performance. |
Date: | Tue, 20 Feb 2018 09:49:33 -0500 (EST) |
User-agent: | Mozilla/5.0 (X11; Ubuntu; Linux x86_64; rv:55.0) Gecko/20100101 Firefox/55.0 |
Follow-up Comment #16, bug #53140 (project octave): The original issue, why it was taking 10 hours, was definitely caused by problems of memory allocation. However, I doubt that this explains the ~2.5X speed advantage of the LU approach. When I had the backslash code instrumented with std::cerr statements I found that the output was resized ~10 times. In each case it didn't seem to take very long. One way to check would be to hardcode the matrix size to be the final size of x at the beginning of the algorithm. The resize code would never be activated and you could compare just algorithm times. _______________________________________________________ Reply to this item at: <http://savannah.gnu.org/bugs/?53140> _______________________________________________ Message sent via/by Savannah http://savannah.gnu.org/
[Prev in Thread] | Current Thread | [Next in Thread] |