[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
norm of sparse matrices
From: |
Marco Caliari |
Subject: |
norm of sparse matrices |
Date: |
Fri, 25 Nov 2011 11:00:40 +0100 (CET) |
User-agent: |
Alpine 1.00 (DEB 882 2007-12-20) |
Dear users,
anybody knows which algorithm is used to compute the Euclidean norm of a
sparse matrix? An iterative method with a random initial value (such as in
normest)? Because I sometimes see different results on the same matrix:
octave:39> S=sprand(5,5,0.5);
octave:40> norm(S)
ans = 1.08208354239579e+00
octave:41> norm(S)
ans = 1.08208354232114e+00
octave:42> norm(S)
ans = 1.08208354232114e+00
(not easy to reproduce this behaviour). I'm using 3.4.1.
Cheers,
Marco
- norm of sparse matrices,
Marco Caliari <=