search

thegooglecodearchive / sfepy

Automatically exported from code.google.com/p/sfepy
0 stars 0 forks source link

iterative sparse linear solvers #18

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
Using a direct sparse linear solver (umfpack) is very convenient as it can
solve any nonsingular system very quickly. If the LU-decomposed matrix fits
into memory, that is.

-> Iterative solvers are needed. First, let us try PETSc, via petsc4py.

Original issue reported on code.google.com by robert.c...@gmail.com on 11 Feb 2008 at 2:21

GoogleCodeExporter commented 9 years ago

Original comment by robert.c...@gmail.com on 11 Feb 2008 at 2:22

GoogleCodeExporter commented 9 years ago 
Revision 65(341c69bf86f3) partially solved this, as all iterative solvers of 
Scipy
are now accessible. The next step is Petsc.

Original comment by robert.c...@gmail.com on 25 Feb 2008 at 9:32

GoogleCodeExporter commented 9 years ago 
Revision 170(8544e03cb008) made PyAMG solvers accessible. Shall we close this? 
PETSc
can wait.

Original comment by robert.c...@gmail.com on 7 May 2008 at 2:30

GoogleCodeExporter commented 9 years ago 
Let's close it.

Original comment by ondrej.c...@gmail.com on 7 May 2008 at 2:38

GoogleCodeExporter commented 9 years ago 
Migrated to http://github.com/sfepy/sfepy/issues/22

Original comment by robert.c...@gmail.com on 30 Jan 2012 at 10:24