Efficient Algorithm for U(N) to U(3) Representation Reduction in Isospin-Adapted Nuclear Structure Calculations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61389005%3A_____%2F25%3A00619586" target="_blank" >RIV/61389005:_____/25:00619586 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/25:00383064
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-031-85703-4_16" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-031-85703-4_16</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-85703-4_16" target="_blank" >10.1007/978-3-031-85703-4_16</a>
Alternative languages
Result language
angličtina
Original language name
Efficient Algorithm for U(N) to U(3) Representation Reduction in Isospin-Adapted Nuclear Structure Calculations
Original language description
An efficient algorithm for enumerating representations of the unitary group U(3) that occur in a representation of the unitary group U(N) is introduced. The algorithm is applicable to U(N) representations associated with a system of nucleons distributed among the degenerate eigenstates of the selected three-dimensional harmonic oscillator level, where each eigenstate can be occupied by up to 4 particles with different combinations of spin and isospin quantum numbers. A C++ implementation of the proposed algorithm is provided, and its performance evaluation is reported.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
<a href="/en/project/GA22-14497S" target="_blank" >GA22-14497S: Advancing the frontiers of first-principle modeling of atomic nuclei</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Parallel Processing and Applied Mathematics
ISBN
978-3-031-85702-7
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
11
Pages from-to
233-243
Publisher name
Springer Nature
Place of publication
Berlin
Event location
Ostrava
Event date
Sep 8, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001529693400016