2025-02-21T09:10:14-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs2.nuclear-journal.com%3Aarticle-1072%22&qt=morelikethis&rows=5
2025-02-21T09:10:14-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs2.nuclear-journal.com%3Aarticle-1072%22&qt=morelikethis&rows=5
2025-02-21T09:10:14-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-21T09:10:14-05:00 DEBUG: Deserialized SOLR response
Прискорення по зовнішніх ітераціях в багатогрупових завданнях на K[eff]
A new cyclic iterative method with variable parameters is proposed for accelerating the outer iterations in a proposed used to calculate K[eff] in multigroup problems. The method is based on the use of special extremal polynomials that are distinct from Chebyshev polynomials and take into account th...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
State Scientific and Technical Center for Nuclear and Radiation Safety
2007
|
Online Access: | https://nuclear-journal.com/index.php/journal/article/view/1072 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A new cyclic iterative method with variable parameters is proposed for accelerating the outer iterations in a proposed used to calculate K[eff] in multigroup problems. The method is based on the use of special extremal polynomials that are distinct from Chebyshev polynomials and take into account the specific nature of the problem. To accelerate the convergence with respect to Kfefff the use of three Orthogonal functionals is proposed. Their values simultaneously determine the three maximal eigenvalues. The proposed method was
Incorporated in the software for neutron-physics calculations for iVWER reactors. To calculate Kfeff] for WIVER-type reactors, we have incorporated our method in the multigroup software, namely, two-dimensional programs like PERMAK-A , three-dimensional
programs like PERMAK 3-D , and the TVS-M program . Previously, the iterations in these programs had been accelerated by the Lyusternik method. Our calculations and a comparison of about 20 typical versions of the programs have shown the reduction in the Execution time by a factor ranging from three to seven. |
---|