[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: |
Carlo de Falco |
Subject: |
[Octave-bug-tracker] [bug #41453] norm is really slow for sparse matrices |
Date: |
Sun, 30 Mar 2014 18:12:59 +0000 |
User-agent: |
Mozilla/5.0 (Macintosh; Intel Mac OS X 10.9; rv:28.0) Gecko/20100101 Firefox/28.0 |
Follow-up Comment #6, bug #41453 (project octave):
no it is not clean.
having to use a different
function to compute the norm of a sparse matrix
is not compatible and is no improvement at all
with having to call
svds (A, 1);
yes you can call an m-file function from c++
but that is not a clean solution either.
did you try to look at what svds does internally?
it will somehow rely on arpack in the end, and arpack
is a fortran library, not m-code.
do you think you would be able to implement this
using calls to arpack instead of svds.m?
_______________________________________________________
Reply to this item at:
<http://savannah.gnu.org/bugs/?41453>
_______________________________________________
Message sent via/by Savannah
http://savannah.gnu.org/