Related papers: Nucleon-pair approximation with matrix representat…
We optimize the matrix representation of the nucleon-pair approximation (NPA) of the nuclear shell model. The NPA is a widely adopted truncation approach of the nuclear shell model and proves to be effective in describing low-lying states…
The nucleon-pair approximation (NPA) can be a compact alternative to full configuration-interaction (FCI) diagonalization in nuclear shell-model spaces, but selecting good pairs is a long-standing problem. While seniority-based pairs work…
We propose a pair-condensate variational approach (PCV) to determine a set of the most important collective pairs in the description of low-lying states in atomic nuclei. Having available the precise details on these key collective pairs --…
In this paper we model low-lying states of atomic nuclei in the nucleon-pair approximation of the shell model, using three approaches to select collective nucleon pairs: the generalized seniority scheme, the conjugate gradient method, and…
The iterative quasi-particle-random-phase approximation (QRPA) method we previously developed to accurately calculate properties of individual nuclear states is extended so that it can be applied for nuclei with odd numbers of neutrons and…
The nucleon pair shell model (NPSM) is casted into the so-called M-scheme for the cases with isospin symmetry and without isospin symmetry. The odd system and even system are treated on the same foot. The uncoupled commutators for…
The nucleon-nucleon (NN) t-matrix is calculated directly as function of two vector momenta for different realistic NN potentials. To facilitate this a formalism is developed for solving the two-nucleon Lippmann-Schwinger equation in…
Quasiparticle random-phase approximation (QRPA) is applied to two nuclei, and overlap of the QRPA excited states based on the different nuclei is calculated. The aim is to calculate the overlap of intermediate nuclear states of the…
The overview of the Exact Pairing technique based on the quasispin symmetry is presented. Extensions of this method are discussed in relation to mean field, quadrupole collectivity, electromagnetic transitions, and many-body level density.…
Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance. Exploiting this observation, we propose representation matching, a generic probabilistic protocol for reducing the…
We formulate a quasi-particle random phase approximation (QRPA) in the coordinate space representation. This model is a natural extension of the RPA model of Shlomo and Bertsch to open-shell nuclei in order to take into account pairing…
Coupled cluster theory provides hierarchical many-particle models and is presently considered as the ultimate benchmark in quantum chemistry. Despite is practical significance, a rigorous mathematical analysis of its properties is still in…
Prior to recombination photons, electrons, and atomic nuclei rapidly scattered and behaved, almost, like a single tightly-coupled photon-baryon plasma. We investigate here the accuracy of the tight-coupling approximation commonly used to…
Starting from the matrix elements of the nucleon-nucleon interaction in momentum space we present a method to derive an operator representation with a minimal set of operators that is required to provide an optimal description of the…
We review self-consistent spectral methods for nuclear matter calculations. The in-medium T-matrix approach is conserving and thermodynamically consistent. It gives both the global and the single-particle properties the system. The T-matrix…
First, an abstract scheme of constructing biorthogonal rational systems related to some interpolation problems is proposed. We also present a modification of the famous step-by-step process of solving the Nevanlinna-Pick problems for…
The coexistence of neutron-neutron (n-n), proton-proton (p-p), and neutron-proton (n-p) pairings is investigated by adopting an effective density-dependent contact pairing potential. These three types of pairings can coexist only if the n-p…
We consider the problem of matrix approximation and denoising induced by the Kronecker product decomposition. Specifically, we propose to approximate a given matrix by the sum of a few Kronecker products of matrices, which we refer to as…
Fast approximations to matrix multiplication have the potential to dramatically reduce the cost of neural network inference. Recent work on approximate matrix multiplication proposed to replace costly multiplications with table-lookups by…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…