相关论文: A Hierarchical O(N) Force Calculation Algorithm
We have developed a parallel Particle-Particle, Particle-Mesh (P^3M) simulation code for the T3E well suited to studying the time evolution of systems of particles interacting via gravity and gas forces in cosmological contexts. The…
Multi-task learning (MTL) has emerged as a pivotal paradigm in machine learning by leveraging shared structures across multiple related tasks. Despite its empirical success, the development of likelihood-based efficiently solvable…
The present paper attempts to address a discussion on mathematical grounds of a model to associate the generalized version of the CLT and the $N$-body problem related to the calculation of the force on a single star or particle due to the…
We present efficient algorithms for computing the $N$-point correlation functions (NPCFs) of random fields in arbitrary $D$-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences, and provide a…
The recently developed effective interaction method for the hyperspherical harmonic formalism is extended to noncentral forces. Binding energies and radii of three- and four-body nuclei are calculated with AV6 and AV14 NN potentials.…
We present here a new algorithm for the fast computation of N-point correlation functions in large astronomical data sets. The algorithm is based on kdtrees which are decorated with cached sufficient statistics thus allowing for orders of…
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…
I describe here the performances of a parallel treecode with individual particle timesteps. The code is based on the Barnes-Hut algorithm and runs cosmological N-body simulations on parallel machines with a distributed memory architecture…
There are many methods used to compute the classical gravitational field in astrophysical simulation codes. With the exception of the typically impractical method of direct computation, none ensure conservation of angular momentum to…
The current paper presents a new quantum algorithm for finding multicollisions, often denoted by $\ell$-collisions, where an $\ell$-collision for a function is a set of $\ell$ distinct inputs that are mapped by the function to the same…
Special high-accuracy direct force summation N-body algorithms and their relevance for the simulation of the dynamical evolution of star clusters and other gravitating N-body systems in astrophysics are presented, explained and compared…
One of the most fundamental problems in Computer Science is the Knapsack problem. Given a set of n items with different weights and values, it asks to pick the most valuable subset whose total weight is below a capacity threshold T. Despite…
Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…
We introduce a new and well defined power counting for the effective field theory describing nucleon-nucleon interactions. Because of the large NN scattering lengths it differs from other applications of chiral perturbation theory and is…
Computing the configuration of any one-dimensional cellular automaton at generation $n$ can be accelerated by constructing and running a composite rule with a radius proportional to $\log n$. The new automaton is the original one, but with…
A method is given to obtain closed form formulas for the energy and forces for an aggregate of charges interacting via a logarithmic interaction under periodic boundary conditions. The work done here is a generalization of Glasser's results…
We give an O(sqrt n log n)-query quantum algorithm for evaluating size-n AND-OR formulas. Its running time is poly-logarithmically greater after efficient preprocessing. Unlike previous approaches, the algorithm is based on a quantum walk…
Projecting fields between different meshes commonly arises in computational physics. This operation requires a supermesh construction and its computational cost is proportional to the number of cells of the supermesh $n$. Given any two…
We compute nuclear force in a holographic model of QCD on the basis of a D4-D8 brane configuration in type IIA string theory. Repulsive core of nucleons is quite important in nuclear physics, but its origin has not been well-understood in…