Thank you for responding. I ended up resolving the issue several days ago by that method. The program is sufficiently fast now, requiring about 45 minutes to setup and solve about 25 sets of 120,000 linear algebraic equations. The memory requirement is also reasonable.
I need to efficiently store the indices of nonzero elements in very large sparse matrix in a F90/95 program. Every row of the matrix has at least one nonzero but the number of nonzeros in any given row varies. The nonzero indices are found one at a time by looping through an array. I don't want...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.