相关论文: Block bond-order potential as a convergent moments…
The use of machine learning (ML) algorithms in molecular simulations has become commonplace in recent years. There now exists, for instance, a multitude of ML force field algorithms that have enabled simulations approaching ab initio level…
We derive and implement an alternative formulation of the Stochastic Lanczos algorithm to be employed in connection with the Many-Body Dispersion model (MBD). Indeed, this formulation, which is only possible due to the Stochastic Lanczos'…
Network interactions between dynamical units are often subject to time delay. We develop a phase reduction method for delay-coupled oscillator networks. The method is based on rewriting the delay-differential equation as an ordinary…
We present randUBV, a randomized algorithm for matrix sketching based on the block Lanzcos bidiagonalization process. Given a matrix $\bf{A}$, it produces a low-rank approximation of the form ${\bf UBV}^T$, where $\bf{U}$ and $\bf{V}$ have…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
This paper presents a novel, more efficient proper orthogonal decomposition (POD) based reduced-order model (ROM) for compressible flows. In this POD model the governing equations, i.e., the conservation of mass, momentum, and energy…
The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are…
We present theoretical study of ordering phenomena in binary $C_{1-x}B_{x}$, $C_{1-x}N_{x}$ and ternary $B_{x}C_{1-x-y}N_{y}$ alloys forming two-dimensional, graphene-like systems. For calculating energy of big systems (20 000 atoms in the…
In this work we generalize the concept of modular spread complexity to the cases where the reduced density matrix is non-Hermitian. This notion of complexity and associated Lanczos coefficients contain richer information than the…
Nonsmooth composite optimization with orthogonality constraints has a wide range of applications in statistical learning and data science. However, this problem is challenging due to its nonsmooth objective and computationally expensive…
We compute the phase diagram of the one-dimensional Bose-Hubbard model with a quasi-periodic potential by means of the density-matrix renormalization group technique. This model describes the physics of cold atoms loaded in an optical…
We propose a model order reduction approach to speed up the computation of seismograms, i.e. the solution of the seismic wave equation evaluated at a receiver location, for different model parameters. Our approach achieves a reduction of…
The hyperbolic tangent function is usually used as a reliable approximation of the equilibrium density distributions of a system with phase transitions. However, analyzing the accuracies of the numerical derivatives, we find that its…
Molecular building blocks interacting at the nanoscale organize spontaneously into stable mono- layers that display intriguing long-range ordering motifs on the surface of atomic substrates. The patterning process, if appropriately…
The recently proposed high-order TENO scheme [Fu et al., Journal of Computational Physics, 305, pp.333-359] has shown great potential in predicting complex fluids owing to the novel weighting strategy, which ensures the high-order accuracy,…
In recent years, large-scale numerical simulations played an essential role in estimating the effects of explosion events in urban environments, for the purpose of ensuring the security and safety of cities. Such simulations are…
We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…
The so-called block-term decomposition (BTD) tensor model, especially in its rank-$(L_r,L_r,1)$ version, has been recently receiving increasing attention due to its enhanced ability of representing systems and signals that are composed of…
In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by…
Motivated by the recent progress in realizing and controlling extended Bose-Hubbard systems using excitonic or atomic devices, the present Letter theoretically investigates the case of a two-band Bose-Hubbard chain with nearest-neighbor…