English
Related papers

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

200 papers

We give an explicit algorithm and source code for computing optimal weights for combining a large number N of alphas. This algorithm does not cost O(N^3) or even O(N^2) operations but is much cheaper, in fact, the number of required…

Portfolio Management · Quantitative Finance 2016-12-19 Zura Kakushadze , Willie Yu

This work presents an elegant formalism to model the evolution of the full two rigid body problem. The equations of motion, given in a Cartesian coordinate system, are expressed in terms of spherical harmonics and Wigner D-matrices. The…

Earth and Planetary Astrophysics · Physics 2017-02-08 Gwenaël Boué

We present a novel framework to decompose three-nucleon forces in a momentum space partial-wave basis. The new approach is computationally much more efficient than previous methods and opens the way to ab initio studies of few-nucleon…

Nuclear Theory · Physics 2015-04-17 K. Hebeler , H. Krebs , E. Epelbaum , J. Golak , R. Skibinski

Recently developed chiral nucleon-nucleon (NN) forces at next-to-leading order (NLO) that describe NN phase shifts up to about 100 MeV fairly well have been applied to 3N and 4N systems. Faddeev-Yakubovsky equations have been solved…

Nuclear Theory · Physics 2009-11-06 E. Epelbaum , H. Kamada , A. Nogga , H. Witala , W. Glöckle , Ulf-G. Meißner

Soft materials (e.g., enveloped viruses, liposomes, membranes and supercooled liquids) simultaneously deform or display collective behaviors, while undergoing atomic scale vibrations and collisions. While the multiple space-time character…

Soft Condensed Matter · Physics 2014-01-03 Peter Ortoleva , Abhishek Singharoy , Stephen Pankavich

We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$…

Data Structures and Algorithms · Computer Science 2017-06-22 David Durfee , Rasmus Kyng , John Peebles , Anup B. Rao , Sushant Sachdeva

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…

Statistical Mechanics · Physics 2009-11-07 Igor Omelyan , Ihor Mryglod , Reinhard Folk

We optimize the nucleon-nucleon interaction from chiral effective field theory at next-to-next- to-leading order. The resulting new chiral force NNLOopt yields \chi^2 \approx 1 per degree of freedom for laboratory energies below…

The tree method is a widely implemented algorithm for collisionless $N$-body simulations in astrophysics well suited for GPU(s). Adopting hierarchical time stepping can accelerate $N$-body simulations; however, it is infrequently…

Instrumentation and Methods for Astrophysics · Physics 2016-11-09 Yohei Miki , Masayuki Umemura

N-body codes to perform simulations of the origin and evolution of the Large Scale Structure of the Universe have improved significantly over the past decade both in terms of the resolution achieved and of reduction of the CPU time.…

Astrophysics · Physics 2009-10-31 U. Becciani , V. Antonuccio-Delogu , M. Gambera

With the widespread use of self-consistent field methods, including Hartree-Fock and Density Functional Theory, the implications of accelerating these methods are immense. To this end, we develop a tensor hypercontraction construction with…

Chemical Physics · Physics 2025-08-27 Andreas Erbs Hillers-Bendtsen , Todd J. Martínez

We present tests of comparison between our versions of the Fast Multipole Algorithm (FMA) and ``classic'' tree-code to evaluate gravitational forces in particle systems. We have optimized the Greengard's original version of FMA allowing for…

Astrophysics · Physics 2016-08-30 R. Capuzzo-Dolcetta , P. Miocchi

Optical force responses underpin nanophotonic actuator design, which requires a large number of force simulations to optimize structures. Commonly used computation methods, such as the finite-difference time-domain (FDTD) method, are…

Optics · Physics 2023-06-30 Bo Gao , Henkjan Gersen , Simon Hanna

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values of…

Quantum Physics · Physics 2014-12-17 Stacey Jeffery , Robin Kothari , Frédéric Magniez

The nuclear force acting between protons and neutrons is studied in the Monte Carlo simulations of the fundamental theory of the strong interaction, the quantum chromodynamics defined on the hypercubic space-time lattice. After a brief…

High Energy Physics - Phenomenology · Physics 2009-07-09 S. Aoki , T. Hatsuda , N. Ishii

In the simulation of biological molecules, it is customary to impose constraints on the fastest degrees of freedom to increase the time step. The evaluation of the involved constraint forces must be performed in an efficient manner, for…

Computational Physics · Physics 2019-11-01 Pablo García-Risueño

This paper describes a novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run time needed to find the maximum distance of two points in E2. It can be easily modified for the E3 case in…

Computational Geometry · Computer Science 2022-09-14 Vaclav Skala

In order to find the equilibrium geometries of molecules and solids and to perform ab initio molecular dynamics, it is necessary to calculate the forces on the nuclei. We present a correlated sampling method to efficiently calculate…

Condensed Matter · Physics 2009-10-31 Claudia Filippi , C. J. Umrigar

Linear response theory has found many applications in statistical physics. One of these is to compute minimal-work protocols that drive nonequilibrium systems between different thermodynamic states, which are useful for designing engineered…

Statistical Mechanics · Physics 2026-01-19 Samuel. H. DAmbrosia , Adrianne Zhong , Michael R. DeWeese

The {\em maximum cardinality} and {\em maximum weight matching} problems can be solved in time $\tilde{O}(m\sqrt{n})$, a bound that has resisted improvement despite decades of research. (Here $m$ and $n$ are the number of edges and…

Data Structures and Algorithms · Computer Science 2011-12-06 Ran Duan , Seth Pettie , Hsin-Hao Su
‹ Prev 1 4 5 6 7 8 10 Next ›