Efficient algorithm for representations of U(3) in U(N)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61389005%3A_____%2F19%3A00509871" target="_blank" >RIV/61389005:_____/19:00509871 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/19:00330951
Result on the web
<a href="https://doi.org/10.1016/j.cpc.2019.05.018" target="_blank" >https://doi.org/10.1016/j.cpc.2019.05.018</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cpc.2019.05.018" target="_blank" >10.1016/j.cpc.2019.05.018</a>

Result language
angličtina
Original language name
Efficient algorithm for representations of U(3) in U(N)
Original language description
An efficient algorithm for enumerating representations of 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 identical fermions (protons, neutrons, electrons, etc.) distributed among the N = (eta+1)(eta+2)/2 degenerate eigenstates of the eta th level of the three-dimensional harmonic oscillator. A C++ implementation of the algorithm is provided and its performance is evaluated. The implementation can employ OpenMP threading for use in parallel applications.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)