English
Related papers

Related papers: A Very Fast And Angular Momentum Conserving Tree C…

200 papers

Self tuning is one of the few methods for dynamically cancelling a large cosmological constant and yet giving an accelerating universe. Its drawback is that it tends to screen all sources of energy density, including matter. We develop a…

General Relativity and Quantum Cosmology · Physics 2018-08-01 Stephen Appleby , Eric V. Linder

Computer simulation with Monte Carlo is an important tool to investigate the function and equilibrium properties of many systems with biological and soft matter materials solvable in solvents. The appropriate treatment of long-range…

Computational Physics · Physics 2015-06-15 Zecheng Gan , Zhenli Xu

Riemannian submanifold optimization with momentum is computationally challenging because, to ensure that the iterates remain on the submanifold, we often need to solve difficult differential equations. Here, we simplify such difficulties…

Machine Learning · Statistics 2024-03-19 Wu Lin , Valentin Duruisseaux , Melvin Leok , Frank Nielsen , Mohammad Emtiyaz Khan , Mark Schmidt

The Lagrangian formulation of field theory does not provide any universal energy-momentum conservation law in order to analize that in gravitation theory. In Lagrangian field theory, we get different identities involving different stress…

General Relativity and Quantum Cosmology · Physics 2016-08-31 G. Sardanashvily

A novel code for the approximate computation of long-range forces between N mutually interacting bodies is presented. The code is based on a hierarchical tree of cubic cells and features mutual cell-cell interactions which are calculated…

Astrophysics · Physics 2009-11-07 Walter Dehnen

We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding…

Information Theory · Computer Science 2016-06-09 Anatoly Khina , Wael Halbawi , Babak Hassibi

We introduce the use of the Fast Multipole Method (FMM) to speed up gravitational lensing ray tracing calculations. The method allows very fast calculation of ray deflections when a large number of deflectors, $N_*$, is involved, while…

Astrophysics of Galaxies · Physics 2022-12-21 J. Jiménez Vicente , E. Mediavilla

The Barnes-Hut and Fast Multipole Methods are widely utilised methods applied in order to reduce the computational cost of evaluating long range forces in $N$-body simulations. Despite this, applying existing libraries to simple problems…

Computational Physics · Physics 2020-05-27 Ryan Alexander Pepper , Hans Fangohr

We give a systematic method for discretizing Hamiltonian partial differential equations (PDEs) with constant symplectic structure, while preserving their energy exactly. The same method, applied to PDEs with constant dissipative structure,…

Numerical Analysis · Mathematics 2015-06-04 E. Celledoni , V. Grimm , R. I. McLachlan , D. I. McLaren , D. O'Neale , B. Owren , G. R. W. Quispel

The irreducible decomposition technique is applied to the study of classical models of metric-affine gravity (MAG). The dynamics of the gravitational field is described by a 12-parameter Lagrangian encompassing a Hilbert-Einstein term,…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Yu. N. Obukhov , E. J. Vlachynsky , W. Esser , F. W. Hehl

Accurate numerical solutions of the equations of hydrodynamics play an ever more important role in many fields of astrophysics. In this work, we reinvestigate the accuracy of the moving-mesh code \textsc{Arepo} and show how its convergence…

We propose new algorithms for numerical integration of the equations of motion for classical spin systems with fixed spatial site positions. The algorithms are derived on the basis of a mid-point scheme in conjunction with the multiple time…

Statistical Mechanics · Physics 2009-10-31 I. P. Omelyan , I. M. Mryglod , R. Folk

Tree codes, introduced by Schulman, are combinatorial structures essential to coding for interactive communication. An infinite family of tree codes with both rate and distance bounded by positive constants is called asymptotically good.…

Information Theory · Computer Science 2019-09-18 Anand Kumar Narayanan , Matthew Weidner

We describe the two-dimensional TreePM method in this paper. The 2d TreePM code is an accurate and efficient technique to carry out large two-dimensional N-body simulations in cosmology. This hybrid code combines the 2d Barnes and Hut Tree…

Astrophysics · Physics 2009-11-10 Suryadeep Ray

The simulation of electrical discharges has been attracting a great deal of attention. In such simulations, the electric field computation dominates the computational time. In this paper, we propose a fast tree algorithm that helps to…

Computational Engineering, Finance, and Science · Computer Science 2018-07-04 Chijie Zhuang , Yong Zhang , Xin Zhou , Rong Zeng , Jinliang He , Lei Liu

In this letter we describe the pseudoparticle multipole method (P2M2), a new method to express multipole expansion by a distribution of pseudoparticles. We can use this distribution of particles to calculate high order terms in both the…

Astrophysics · Physics 2009-10-31 Atsushi Kawai , Junichiro Makino

We present a new numerical code designed to solve the Einstein field equations for axisymmetric spacetimes. The long term goal of this project is to construct a code that will be capable of studying many problems of interest in axisymmetry,…

General Relativity and Quantum Cosmology · Physics 2009-11-10 M. W. Choptuik , E. W. Hirschmann , S. L. Liebling , F. Pretorius

A covariant algorithm for deriving the conserved quantities for natural Hamiltonian systems is combined with the non-relativistic framework of Eisenhart, and of Duval, in which the classical trajectories arise as geodesics in a higher…

Mathematical Physics · Physics 2015-06-19 M. Cariglia , G. W. Gibbons , J. -W. van Holten , P. A. Horvathy , P. -M. Zhang

An anytime decoding algorithm for tree codes using Monte-Carlo tree search is proposed. The meaning of anytime decoding here is twofold: 1) the decoding algorithm is an anytime algorithm, whose decoding performance improves as more…

Information Theory · Computer Science 2021-05-04 Aolin Xu

A new, momentum preserving fast Poisson solver for N-body systems sharing effective O(N) computational complexity, has been recently developed by Dehnen (2000, 2002). We have implemented the proposed algorithms in a Fortran-90 code, and…

Astrophysics · Physics 2007-05-23 P. Londrillo , C. Nipoti , L. Ciotti