This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
nu_rnet [2014/06/06 08:50] schutrumpg |
nu_rnet [2014/06/06 09:18] (current) schutrumpg |
||
---|---|---|---|
Line 62: | Line 62: | ||
===Matrix Solver=== | ===Matrix Solver=== | ||
- | The standart matrix solver included in the xnet programm "LAPACK" is too slow to solve a network like this. Faster solutions are sparse matrix solver. Two interfaces are included in xnet: For MA48 and Pardiso. Instructions to include these matrix solvers in the code can be found in the documentation of the code. We experienced problems for both with Linux: Pardiso should be much faster than MA48 needs a full compiled LAPACK library. This is included in the ifort compiler. Finally we succeeded in compiling Pardiso version with ifort. The program can be found [[here]][[https://docmgmt.nscl.msu.edu/share/page/site/TALENT/documentlibrary#filter=path|/Course7_2014/Projects/Project1/nuRnet&page=1]]. | + | The standart matrix solver included in the xnet programm "LAPACK" is too slow to solve a network like this. Faster solutions are sparse matrix solver. Two interfaces are included in xnet: For MA48 and Pardiso. Instructions to include these matrix solvers in the code can be found in the documentation of the code. We experienced problems for both with Linux: Pardiso should be much faster than MA48 needs a full compiled LAPACK library. This is included in the ifort compiler. Finally we succeeded in compiling Pardiso version with ifort. The program can be found in the document server. |
====Results==== | ====Results==== | ||
- | ==$Y_e=0.2$== | + | ==$Y_e=0.15$== |
{{ :ev15.png?400 |}} | {{ :ev15.png?400 |}} | ||
==$Y_e=0.25$== | ==$Y_e=0.25$== |