Related papers: Efficient calculation for the quasiparticle random…
The matrix equations of the random-phase approximation (RPA) are derived for the point-coupling Lagrangian of the relativistic mean-field (RMF) model. Fully consistent RMF plus (quasiparticle) RPA illustrative calculations of the isoscalar…
Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the…
The Quasiparticle Random Phase Approximation equations are solved taking into account the Pauli Principle at the expectation value level, and allowing changes in the mean field occupation numbers to minimize the energy while having the…
This paper presents a method for approximating a class of complex transfer function matrices corresponding to physically realizable complex linear quantum systems. The class of linear quantum systems under consideration includes…
The quasistatic approximation (QSA) is an efficient method of simulating laser- and beam-driven plasma wakefield acceleration, but it becomes imprecise if some plasma particles make long longitudinal excursions in a strongly nonlinear wave,…
This paper introduces quantum computing methods for Monte Carlo simulations in power systems which are expected to be exponentially faster than their classical computing counterparts. Monte Carlo simulations is a fundamental method, widely…
In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…
Quadrupole excitations of neutron-rich nuclei are analyzed by using the linear response method in the Quasiparticle Random Phase Approximation (QRPA). The QRPA response is derived starting from the time-dependent Hartree-Fock-Bogoliubov…
The approximate computation of all gravitational forces between $N$ interacting particles via the fast multipole method (FMM) can be made as accurate as direct summation, but requires less than $\mathcal{O}(N)$ operations. FMM groups…
The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based…
The cylindrical Taylor Interpolation through FFT (TI-FFT) algorithm for computation of the near-field and far-field in the quasi-cylindrical geometry has been introduced. The modal expansion coefficient of the vector potentials ${\bf F}$…
Recently, a new framework to compute the photoionization rate in streamer discharges accurately and efficiently using the integral form and the fast multipole method (FMM) was presented. This paper further improves the efficiency of this…
A switched-capacitor matrix multiplier is presented for approximate computing and machine learning applications. The multiply-and-accumulate operations perform discrete-time charge-domain signal processing using passive switches and 300 aF…
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in…
Self Consistent Quasiparticle Random Phase Approximation (SCQRPA) is considered in application to the Fermi transitions within the O(5) model. It is demonstrated that SCQRPA improves on renormalized QRPA (RQRPA), a method that has recently…
Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$. In the case of large…
In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…
Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…