This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
nu_rnet [2014/06/05 16:52] schutrumpg |
nu_rnet [2014/06/05 17:20] schutrumpg |
||
---|---|---|---|
Line 13: | Line 13: | ||
It is possible that electron fraction Ye will affect the neutron density resulting in the abundance pattern of the r-process. | It is possible that electron fraction Ye will affect the neutron density resulting in the abundance pattern of the r-process. | ||
- | {{:core-collapse_figure.png?650|}} | + | {{:core-collapse_figure.png?650|Schematic representation of the evolutionary stages from stellar core collapse. (Ref. H.Th. Janka, arXiv:astro-ph/0612072)}} |
- | + | ||
- | Fig. Schematic representation of the evolutionary stages from stellar core collapse. (Ref. H.Th. Janka, arXiv:astro-ph/0612072) | + | |
=====Method and aims:===== | =====Method and aims:===== | ||
Line 64: | Line 62: | ||
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. | 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. | ||
+ | |||
+ | ====Results==== | ||
+ | ==$Y_e=0.2$== | ||
+ | {{ :ev20.png?400 |}} | ||
+ | ==$Y_e=0.25$== | ||
+ | {{ :ev25.png?400 |}} | ||
+ | ==$Y_e=0.4$== | ||
+ | {{ :ev40.png?400 |}} | ||
+ |