[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Octave-bug-tracker] [bug #50796] calling find on diagonal matrix is slo
|
From: |
Juan Pablo Carbajal |
|
Subject: |
[Octave-bug-tracker] [bug #50796] calling find on diagonal matrix is slower than full matrix |
|
Date: |
Wed, 26 Apr 2017 20:24:55 -0400 (EDT) |
|
User-agent: |
Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/58.0.3029.81 Safari/537.36 |
Follow-up Comment #6, bug #50796 (project octave):
The script shows that that is not always true, it depends on the types of
elements of the matrix (compared bool vs double).
Also the complexities do not seem to differ that much.
What I meant is that finding on a diagonal matrices is just finding on the
vector of its diagonal, so the "overload" is just calling find on the diag
vector, i.e. find (diag(A),...)
_______________________________________________________
Reply to this item at:
<http://savannah.gnu.org/bugs/?50796>
_______________________________________________
Message sent via/by Savannah
http://savannah.gnu.org/