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

[Carlo de Falco]

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

Massimiliano,

That is an improvement in the algorithm, and is going
in the right direction.

I agree though that including a .cc file is a really really really dirty
hack.

I understand you are trying to produce something quick 
to impress us during the GSoC selection period, but proposing
a well thought plan which shows you understand what the real 
problem is here and what would be the correct way to solve
it would serve this purpose much better.

So before rushing into coding, I suggest you take some time 
to discuss:

1) What is the best algorithm for computing the 2-norm of a SparseMatrix

2) What facilities the Octave numerical libraries offer that could help in
implementing that algorithm.

3) What changes, if any, would be required to the Octave code-base in order to
make those facilities available to oct-norm.cc

after clearing up these points you can go back to coding.

P.S. to discriminate between real and complex matrices, have a look at the
"is_complex_type ()" method. Do you think it would also make sense to
discriminate Hermitian and non Hermitian matrices?
 

    _______________________________________________________

Reply to this item at:

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

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