[SciPy-dev] solution sparse matrix

[Lisandro Dalcin]

OK, but your matrix is really huge! Or has it very few nonzeros at each row?

Could you describe my your application, that is, how do to obtain that matrix?


On 3/6/08, jose luis Lopez Martinez <lopmart at gmail.com> wrote:
> hi
>
> the size of matrix sparse is 128^4(268,435,456 rows)x 128^4(268,435,456
> colums).
>
> the matrix have diagonald dominancies that is a sufficient condition
> for convergence of Jacobi iteration , gauss seidel and xor(relaxion method),
> but is slow for converge.
>
> it exist a command  in scipy  that solve sparse matrix using at the
> Gauss-Seidel iteration method o krylov iterative methods?
>
> thanks for your advisor
>
> _______________________________________________
>  Scipy-dev mailing list
>  Scipy-dev at scipy.org
>  http://projects.scipy.org/mailman/listinfo/scipy-dev
>
>


-- 
Lisandro Dalcín
---------------
Centro Internacional de Métodos Computacionales en Ingeniería (CIMEC)
Instituto de Desarrollo Tecnológico para la Industria Química (INTEC)
Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET)
PTLC - Güemes 3450, (3000) Santa Fe, Argentina
Tel/Fax: +54-(0)342-451.1594