octave-bug-tracker
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Octave-bug-tracker] [bug #41453] norm is really slow for sparse matrice


From: Massimiliano Fasi
Subject: [Octave-bug-tracker] [bug #41453] norm is really slow for sparse matrices
Date: Thu, 03 Apr 2014 08:58:30 +0000
User-agent: Mozilla/5.0 (X11; Ubuntu; Linux x86_64; rv:28.0) Gecko/20100101 Firefox/28.0

Follow-up Comment #18, bug #41453 (project octave):

Thank you! Well, I have in mind what should be done, and in my opinion there
are just a couple of modifications that would be necessary to have a good
sparse norm:

* implementing a - one-line probably - method to check wether a sparse matrix
is complex, equivalent to the is_complex_type () method you have suggested. It
can't be used in such environment because I'm dealing with SparseMatrix and
SparseComplexMatrix objects, not with octave_value. I cannot use the latter
because I'm working in liboctave.

* preparing a header file for eigs_base.cc. I don't know why that hasn't been
done before, and why also libinterp/dldfcn/__eigs__.cc includes the file I am
using as a .cc. Anyway, I don't think that using an header file instead would
mess up something.

I don't think it would make sense to discriminate between hermitian and
non-hermitian matrices as ARPACK doesn't provide different functions for these
two classes of matrices.

    _______________________________________________________

Reply to this item at:

  <http://savannah.gnu.org/bugs/?41453>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.gnu.org/




reply via email to

[Prev in Thread] Current Thread [Next in Thread]