相关论文: Nucleon-pair approximation with matrix representat…
It is well known that a direct Lagrangian description of radiation damping is still missing. In this paper a specific approach of this problem was used, which is the standard way to treat the radiation damping problem. A $N=2$…
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problem. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basic matrix and a nonnegative…
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of…
The high-momentum antisymmetrized molecular dynamics (HMAMD) is a new promising framework with significant analytical simplicity and efficiency inherited from its antisymmetrized molecular dynamics in describing the high momentum…
We propose the arbitrary precision approximate (APA) bilinear algorithm of length 46 for multiplication of 4 x 4 and 4 x 4 matrices. The algorithm has polynomial order 3 and 352 nonzero coefficients from total 2208.
A review of methods for finding general expressions for matrix elements (non-diagonal with respect to configurations included) of any one- and two-particle operator for an arbitrary number of shells in an atomic configuration is given.…
Recently the nonlocal coherent-potential approximation (NLCPA) has been introduced by Jarrell and Krishnamurthy for describing the electronic structure of substitutionally disordered systems. The NLCPA provides systematic corrections to the…
We consider the application of approximate Bayesian Computation (ABC) in the context of medical imaging data. We consider the parameter estimation of compartmental models in PET imaging analysis, and provide a simple ABC algorithm for its…
We show that, within the Quasiparticle Random Phase Approximation (QRPA) and the renormalized QRPA (RQRPA) based on the Bonn CD nucleon-nucleon interaction, the competition between the pairing and the neutron-proton particle-particle and…
We introduce a new method, based on alternating optimization, for compact representation of spin Hamiltonians and solution of linear systems of algebraic equations in the tensor train format. We demonstrate the method's utility by…
The translational invariant formulation of the coupled-cluster method is presented here at the complete SUB(2) level for a system of nucleons treated as bosons. The correlation amplitudes are solution of a non-linear coupled system of…
We propose the use of two point Pade approximants to find expressions valid uniformly in coupling constant for theories with both weak and strong coupling expansions. In particular, one can use these approximants in models with a…
An array of planar Penning traps, holding single electrons, can realize an artificial molecule suitable for NMR-like quantum information processing. The effective spin-spin coupling is accomplished by applying a magnetic field gradient,…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
Numerous applications in data mining and machine learning require recovering a matrix of minimal rank. Robust principal component analysis (RPCA) is a general framework for handling this kind of problems. Nuclear norm based convex surrogate…
The theory of nuclear excitations involving nucleon resonances is revisited and significantly extended to asymmetric nuclear matter and higher P- and S-wave $N^*$ resonances. Excited states of are described as superpositions of…
For the antisymmetric tensors the paper examines a low-rank approximation which is represented via only three vectors. We describe a suitable low-rank format and propose an alternating least squares structure-preserving algorithm for…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
The particular symmetry of the random-phase-approximation (RPA) matrix has been utilized in the past to reduce the RPA eigenvalue problem into a symmetric-matrix problem of half the dimension. The condition of positive definiteness of at…