相关论文: Nucleon-pair approximation with matrix representat…

We consider the eigenvalue equation for the largest eigenvalue of certain kinds of non-compact linear operators given as the sum of a multiplication and a kernel operator. It is shown that, under moderate conditions, such operators can be…

Motivated by the analysis of nonnegative data objects, a novel Nested Nonnegative Cone Analysis (NNCA) approach is proposed to overcome some drawbacks of existing methods. The application of traditional PCA/SVD method to nonnegative data…

Nuclear pairing correlations are known to play an important role in various single-particle and collective aspects of nuclear structure. After the first idea by A. Bohr, B. Mottelson and D. Pines on similarity of nuclear pairing to electron…

We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…

Consider the following optimization problem: Given $n \times n$ matrices $A$ and $\Lambda$, maximize $\langle A, U\Lambda U^*\rangle$ where $U$ varies over the unitary group $\mathrm{U}(n)$. This problem seeks to approximate $A$ by a matrix…

Conclusions: (1) Calculations with an RPA correction added to the BCS pairing correction conventionally employed in Nilsson-Strutinskij calculations account well for the variation with A of the pattern of masses near N=Z. (2) The RPA…

We demonstrate that when two colliding nuclei approach each other, their quantum vibrations are damped near the touching point. We show that this damping is responsible for the fusion hindrance phenomena measured in the deep sub-barrier…

We present a method of incorporating the discrete dipole approximation (DDA) method with the point matching method to formulate the T-matrix for modeling arbitrarily shaped micro-sized objects. The \emph{T}-matrix elements are calculated…

We show that from the point of view of the generalized pairing Hamiltonian, the atomic nucleus is a system with small entanglement and can thus be described efficiently using a 1D tensor network (matrix-product state) despite the presence…

The interaction between two particles with shape or interaction anisotropy can be modeled using a pairwise potential energy function that depends on their relative position and orientation; however, this function is often challenging to…

Low rank matrix approximations appear in a number of scientific computing applications. We consider the Nystr\"{o}m method for approximating a positive semidefinite matrix $A$. In the case that $A$ is very large or its entries can only be…

We utilize the generalized contact formalism in conjunction with the Woods-Saxon mean-field description of the long-range part of the nuclear wave function to assess the relative prevalence of short-range correlation pairs within atomic…

We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^2log_2N)$ computational complexity. We replace the standard matrix-by-matrix multiplications…

Arslan showed that computing all-pairs Hamming distances is easily reducible to arithmetic 0-1 matrix multiplication (IPL 2018). We provide a reverse, linear-time reduction of arithmetic 0-1 matrix multiplication to computing all-pairs…

This paper is concerned with the low-rank approximation for large-scale nonsymmetric matrices. Inspired by the classical Nystrom method, which is a popular method to find the low-rank approximation for symmetric positive semidefinite…

Symmetric matrix decomposition is an active research area in machine learning. This paper focuses on exploiting the low-rank structure of non-negative and sparse symmetric matrices via the rectified linear unit (ReLU) activation function.…

In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using…

Matrix multiplication is a fundamental classical computing operation whose efficiency becomes a major challenge at scale, especially for machine learning applications. Quantum computing, with its inherent parallelism and exponential storage…

Computational study of molecules and materials from first principles is a cornerstone of physics, chemistry, and materials science, but limited by the cost of accurate and precise simulations. In settings involving many simulations, machine…

Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…