SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-273999"
 

Search: onr:"swepub:oai:DiVA.org:kth-273999" > PairDiag :

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

PairDiag : An exact diagonalization program for solving general pairing Hamiltonians

Liu, Xiaoyu (author)
KTH,Kärnfysik
Qi, Chong, 1983- (author)
KTH,Kärnfysik
 (creator_code:org_t)
Elsevier B.V. 2020
2020
English.
In: Computer Physics Communications. - : Elsevier B.V.. - 0010-4655 .- 1879-2944.
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • We present a program for solving exactly the general pairing Hamiltonian based on diagonalization. The program generates the seniority-zero shell-model-like basis vectors via the ‘01’ inversion algorithm. The Hamiltonian matrix is constructed in this seniority-zero space. The program evaluates all non-zero elements of the Hamiltonian matrix “on the fly” using the scattering operator and a search algorithm. The matrix is diagonalized by using the iterative Lanczos algorithm. The OpenMP parallel program thus developed, PairDiag, can efficiently calculate the ground-state eigenvalue and eigenvector of the general pairing Hamiltonian for both the even-mass and the odd-mass system. The program is packaged in a Fortran module, which makes it easy to use the program to replace the BCS approximation in standard self-consistent mean field calculations. For systems with dimension around 108, the calculation can be done within hours on standard desktop computers. Program summary: Program Title: PairDiag. Program Files doi: http://dx.doi.org/10.17632/dzzspfszsh.1 Licensing provisions: CC by NC 3.0. Programming language: Fortran 95. Nature of problem: The numerically exact solution of general pairing Hamiltonian can be solved by diagonalization in configuration spaces of fixed seniority. Solution method: The program constructs the seniority-zero space by the ‘01’ inversion algorithm, and diagonalizes the general pairing Hamiltonian by the Lanczos plus QR algorithm. Restrictions: The total number of orbits involved must be less than 63, and the dimension that can be calculated is restricted by the local RAM condition. 

Subject headings

NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)

Keyword

Diagonalization
General pairing Hamiltonian
Lanczos algorithm
Application programming interfaces (API)
Eigenvalues and eigenfunctions
FORTRAN (programming language)
Ground state
Iterative methods
Personal computers
Configuration space
Exact diagonalization
Hamiltonian matrix
Inversion algorithm
Scattering operators
Search Algorithms
Self-consistent mean field
Hamiltonians

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Liu, Xiaoyu
Qi, Chong, 1983-
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
and Computational Ma ...
Articles in the publication
Computer Physics ...
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view