2011
DOI: 10.1103/physrevc.84.014312
|View full text |Cite
|
Sign up to set email alerts
|

Application of the gradient method to Hartree-Fock-Bogoliubov theory

Abstract: A computer code is presented for solving the equations of Hartree-Fock-Bogoliubov (HFB) theory by the gradient method, motivated by the need for efficient and robust codes to calculate the configurations required by extensions of HFB such as the generator coordinate method. The code is organized with a separation between the parts that are specific to the details of the Hamiltonian and the parts that are generic to the gradient method. This permits total flexibility in choosing the symmetries to be imposed on … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
160
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 107 publications
(163 citation statements)
references
References 23 publications
3
160
0
Order By: Relevance
“…The evaluation of the nuclear DFT is numerically demanding, particularly if one considers large fermionic systems in three dimensions and large deformations, without any symmetry constraints. Over the years many iterative approaches for solving the HFB equations have been proposed, including successive diagonalizations of the HFB or HF+BCS matrices, imaginary time evolu- * js1421@uw.edu † bulgac@uw.edu ‡ kenneth.roche@pnl.gov § gabrielw@if.pw.edu.pl tion [12,13], and gradient methods [14,15], which typically need significant memory requirements and operations of complexity O(N 3 ), where N is the dimension of the HFB matrix. For a review of modern diagonalization software, see Ref.…”
Section: Introductionmentioning
confidence: 99%
“…The evaluation of the nuclear DFT is numerically demanding, particularly if one considers large fermionic systems in three dimensions and large deformations, without any symmetry constraints. Over the years many iterative approaches for solving the HFB equations have been proposed, including successive diagonalizations of the HFB or HF+BCS matrices, imaginary time evolu- * js1421@uw.edu † bulgac@uw.edu ‡ kenneth.roche@pnl.gov § gabrielw@if.pw.edu.pl tion [12,13], and gradient methods [14,15], which typically need significant memory requirements and operations of complexity O(N 3 ), where N is the dimension of the HFB matrix. For a review of modern diagonalization software, see Ref.…”
Section: Introductionmentioning
confidence: 99%
“…The nonlinear HFB equation is solved using the gradient method [80] and taking into account approximately secondorder curvature effects [69,81]. The HFB quasiparticle creation and annihilation operators are expanded in a harmonic oscillator (HO) basis and special attention is paid to the convergence of the results with the basis size (see Appendix A for further details).…”
Section: Theorymentioning
confidence: 99%
“…The iterative scheme described in Ref. [17] utilises a preconditioning of quasiparticle wave functions in a gradient-based scheme to solve the HFB equations in that basis. In a representation like ours, the cost per iteration of preconditioning the states is much larger than that of preconditioning the potentials as it requires a much larger number of applications of derivative operators.…”
Section: Comments On Some Alternative Approachesmentioning
confidence: 99%
“…The matrix elements of Gaussian forces then take a separable form which allows for very reasonable precision at moderate computational cost. Such representation in general favours iteration algorithms that evolve directly the Thouless matrix representing the HFB state [15,16,17] instead of the strategy we will discuss below. For effective Hamiltonians that cannot be easily mapped on Gaussians, however, the advantages of using a HO basis are less evident.…”
Section: Introductionmentioning
confidence: 99%