English
Related papers

Related papers: A Hierarchical O(N) Force Calculation Algorithm

200 papers

We present exact results for the classical version of the Out-of-Time-Order Commutator (OTOC) for a family of power-law models consisting of $N$ particles in one dimension and confined by an external harmonic potential. These particles are…

Statistical Mechanics · Physics 2022-06-29 Bhanu Kiran S. , David A. Huse , Manas Kulkarni

We generalize a recently developed method for accelerated Monte Carlo calculation of path integrals to the physically relevant case of generic many-body systems. This is done by developing an analytic procedure for constructing a hierarchy…

Statistical Mechanics · Physics 2011-08-08 Aleksandar Bogojevic , Ivana Vidanovic , Antun Balaz , Aleksandar Belic

We describe the TreePM method for carrying out large N-Body simulations to study formation and evolution of the large scale structure in the Universe. This method is a combination of Barnes and Hut tree code and Particle-Mesh code. It…

Astrophysics · Physics 2009-10-31 J. S. Bagla

In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In the conventional algorithms, new evidence in absorbed in time…

Artificial Intelligence · Computer Science 2014-08-08 Arthur L. Delcher , Adam J. Grove , Simon Kasif , Judea Pearl

Nonlinear contraction theory is a comparatively recent dynamic control system design tool based on an exact differential analysis of convergence, in essence converting a nonlinear stability problem into a linear time-varying stability…

Pattern Formation and Solitons · Physics 2007-05-23 Winfried Lohmiller , Jean-Jacques E. Slotine

In this paper, we have developed a fully-dynamic algorithm for maintaining cardinality of maximum-matching in a tree using the construction of top-trees. The time complexities are as follows: 1. Initialization Time: $O(n(log(n)))$ to build…

Data Structures and Algorithms · Computer Science 2009-01-20 Manoj Gupta , Ankit Sharma

The computational cost required to calculate nuclear correlation functions grows factorially in the number of quarks, making the study of large nuclei inaccessible to ab initio study using lattice QCD at the present time. However, the…

High Energy Physics - Lattice · Physics 2022-01-13 Nabil Humphrey , William Detmold , Ross D. Young , James M. Zanotti

The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their…

We consider a one-dimensional system of particles with strong zero-range interactions. This system can be mapped onto a spin chain of the Heisenberg type with exchange coefficients that depend on the external trap. In this paper, we present…

Quantum Gases · Physics 2016-10-19 N. J. S. Loft , L. B. Kristensen , A. E. Thomsen , A. G. Volosniev , N. T. Zinner

Living cells respond to mechanical changes in the matrix surrounding them by applying contractile forces that are in turn transmitted to distant cells. We calculate the mechanical work that each cell performs in order to deform the matrix,…

Soft Condensed Matter · Physics 2021-08-17 Chaviva Sirote , Yair Shokef

We derive and implement a new way of solving coupled cluster equations with lower computational scaling. Our method is based on decomposition of both amplitudes and two electron integrals, using a combination of tensor hypercontraction and…

Chemical Physics · Physics 2020-05-14 Roman Schutski , Jinmo Zhao , Thomas M. Henderson , Gustavo E. Scuseria

A well-established method to deal with highly correlated systems is based on the expansion of the Green's function in terms of spectral moments. In the context of the Composite Operator Method one approximation is proposed: a set of n…

Strongly Correlated Electrons · Physics 2007-05-23 F. Mancini

A combination of hierarchical tree-like data structures and data access patterns from fast multipole methods and hierarchical low-rank approximation of linear operators from H-matrix methods appears to form an algorithmic path forward for…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-06-10 Rio Yokota , George Turkiyyah , David Keyes

In a Keplerian system, a large number of bodies orbit a central mass. Accretion disks, protoplanetary disks, asteroid belts, and planetary rings are examples. Simulations of these systems require algorithms that are computationally…

Earth and Planetary Astrophysics · Physics 2023-01-18 P. M. Visser

The nni-distance is a well-known distance measure for phylogenetic trees. We construct an efficient parallel approximation algorithm for the nni-distance in the CRCW-PRAM model running in O(log n) time on O(n) processors. Given two…

Data Structures and Algorithms · Computer Science 2012-05-16 Mikael Gast , Mathias Hauptmann

We develop, implement and test a set of algorithms for estimating N-point correlation functions from pixelized sky maps. These algorithms are slow, in the sense that they do not break the O(N_pix^N) barrier, and yet, they are fast enough…

Astrophysics · Physics 2009-11-10 H. K. Eriksen , P. B. Lilje , A. J. Banday , K. M. Gorski

We compute the scaling dimensions of a family of fixed-charge operators at the infrared fixed point of the $O(N)$ model featuring cubic interactions in $d=6-\epsilon$ for arbitrary $N$ to leading and subleading order in the charge but to…

High Energy Physics - Theory · Physics 2021-10-13 Oleg Antipin , Jahmall Bersini , Francesco Sannino , Zhi-Wei Wang , Chen Zhang

We estimate four-nucleon force effects between different 4He wave functions by calculating the expectation values of four-nucleon potentials which were recently derived within the framework of chiral effective field theory. We find that the…

Nuclear Theory · Physics 2007-05-23 D. Rozpedzik , J. Golak , R. Skibinski , H. Witala , W. Gloeckle , E. Epelbaum , A. Nogga , H. Kamada

We present the first near optimal approximation schemes for the maximum weighted (uncapacitated or capacitated) $b$--matching problems for non-bipartite graphs that run in time (near) linear in the number of edges. For any…

Data Structures and Algorithms · Computer Science 2018-06-19 Kook Jin Ahn , Sudipto Guha

Despite the many recent practical and theoretical breakthroughs in computational game theory, equilibrium finding in extensive-form team games remains a significant challenge. While NP-hard in the worst case, there are provably efficient…

Computer Science and Game Theory · Computer Science 2022-01-19 Brian Hu Zhang , Tuomas Sandholm