相关论文: "Divide and Conquer" Semiclassical Molecular Dynam…
Divide-and-conquer strategies for Monte Carlo algorithms are an increasingly popular approach to making Bayesian inference scalable to large data sets. In its simplest form, the data are partitioned across multiple computing cores and a…
We develop a novel, general and computationally efficient framework, called Divide and Conquer Dynamic Programming (DCDP), for localizing change points in time series data with high-dimensional features. DCDP deploys a class of greedy…
Symbolic regression aims to find a function that best explains the relationship between independent variables and the objective value based on a given set of sample data. Genetic programming (GP) is usually considered as an appropriate…
Dimensionally split advection schemes are attractive for atmospheric modelling due to their efficiency and accuracy in each spatial dimension. Accurate long time-steps can be achieved without significant cost using the flux-form…
A new approach for integration of motion in many-body systems of interacting polyatomic molecules is proposed. It is based on splitting time propagation of pseudo-variables in a modified phase space, while the real translational and…
We study numerical methods for dissipative particle dynamics (DPD), which is a system of stochastic differential equations and a popular stochastic momentum-conserving thermostat for simulating complex hydrodynamic behavior at mesoscales.…
In this paper, two accelerated divide-and-conquer algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost $O(N^2r)$ {flops} in the worst case, where $N$ is the dimension of the matrix and $r$ is a modest number…
In this paper, we develop new high-order numerical methods for hyperbolic systems of nonlinear partial differential equations (PDEs) with uncertainties. The new approach is realized in the semi-discrete finite-volume framework and is based…
To analyse a very large data set containing lengthy variables, we adopt a sequential estimation idea and propose a parallel divide-and-conquer method. We conduct several conventional sequential estimation procedures separately, and properly…
Iterative methods that operate with the full Hamiltonian matrix in the untrimmed Hilbert space of a finite system continue to be important tools for the study of one- and two-dimensional quantum spin models, in particular in the presence of…
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets…
We present an algorithm to solve very large one-dimensional disordered and interacting few-particle systems. Our approach exploits the localized nature of the eigenfunctions in real space to achieve a linear scaling with the total system…
We apply the semi-discrete method, c.f. \emph{N. Halidias and I.S. Stamatiou (2016), On the numerical solution of some non-linear stochastic differential equations using the semi-discrete method, Computational Methods in Applied…
A semicalssical method based on surface-hopping techniques is developed to model the dynamics of radiative association with electronic transitions in arbitrary polyatomic systems. It can be proven that our method is an extension of the…
This work provides a new multinomial resampling procedure for particle filter resampling, focused on the case where the number of samples required is less than or equal to the size of the underlying discrete distribution. This setting is…
The kernel support vector machine (SVM) is one of the most widely used classification methods; however, the amount of computation required becomes the bottleneck when facing millions of samples. In this paper, we propose and analyze a novel…
The key requirement for harnessing the quantum properties of light is the capability to detect and count individual photons. Of particular interest are photon-number-resolving detectors, which allow one to determine whether a state of light…
The evolution of local defects such as dislocations and cracks often determines the performance of engineering materials. For a proper description and understanding of these phenomena, one needs to descend to a very small scale, at which…
We propose a divide-and-conquer algorithm to find recursively the Scattering matrix of general tight-binding structures. The Scattering matrix allows a direct calculation of transport properties in mesoscopic systems by using the Landauer…
Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are solved in optimal time within $\Theta(n\log{n})$ in the…