Investigation of the Stability Problem for the Critical Cases of the Newtonian Many-Body Problem

Author(s):  
E. A. Grebenicov ◽  
D. Kozak-Skoworodkin ◽  
M. Jakubiak
1961 ◽  
Vol 25 (4) ◽  
pp. 653-666 ◽  
Author(s):  
Katuro Sawada ◽  
Nobuyuki Fukuda

Author(s):  
Peter Ring ◽  
Peter Schuck
Keyword(s):  

Author(s):  
Joseph F. Boudreau ◽  
Eric S. Swanson

Specialized techniques for solving the classical many-body problem are explored in the context of simple gases, more complicated gases, and gravitating systems. The chapter starts with a brief review of some important concepts from statistical mechanics and then introduces the classic Verlet method for obtaining the dynamics of many simple particles. The practical problems of setting the system temperature and measuring observables are discussed. The issues associated with simulating systems of complex objects form the next topic. One approach is to implement constrained dynamics, which can be done elegantly with iterative methods. Gravitational systems are introduced next with stress on techniques that are applicable to systems of different scales and to problems with long range forces. A description of the recursive Barnes-Hut algorithm and particle-mesh methods that speed up force calculations close out the chapter.


Author(s):  
Sauro Succi

Chapter 32 expounded the basic theory of quantum LB for the case of relativistic and non-relativistic wavefunctions, namely single-particle quantum mechanics. This chapter goes on to cover extensions of the quantum LB formalism to the overly challenging arena of quantum many-body problems and quantum field theory, along with an appraisal of prospective quantum computing implementations. Solving the single particle Schrodinger, or Dirac, equation in three dimensions is a computationally demanding task. This task, however, pales in front of the ordeal of solving the Schrodinger equation for the quantum many-body problem, namely a collection of many quantum particles, typically nuclei and electrons in a given atom or molecule.


2021 ◽  
Vol 103 (21) ◽  
Author(s):  
Asaf A. Diringer ◽  
Tobias Gulden
Keyword(s):  

2021 ◽  
Vol 3 (2) ◽  
pp. 253-261
Author(s):  
Angel Ricardo Plastino ◽  
Gustavo Luis Ferri ◽  
Angelo Plastino

We employ two different Lipkin-like, exactly solvable models so as to display features of the competition between different fermion–fermion quantum interactions (at finite temperatures). One of our two interactions mimics the pairing interaction responsible for superconductivity. The other interaction is a monopole one that resembles the so-called quadrupole one, much used in nuclear physics as a residual interaction. The pairing versus monopole effects here observed afford for some interesting insights into the intricacies of the quantum many body problem, in particular with regards to so-called quantum phase transitions (strictly, level crossings).


In the first part of this paper opportunity has been taken to make some adjustments in certain general formulae of previous papers, the necessity for which appeared in discussions with other workers on this subject. The general results thus amended are then applied to a general discussion of the stability problem including the effect of the trailing wake which was deliberately excluded in the previous paper. The general conclusion is that to a first approximation the wake, as usually assumed, has little or no effect on the reality of the roots of the period equation, but that it may introduce instability of the oscillations, if the centre of gravity of the element is not sufficiently far forward. During the discussion contact is made with certain partial results recently obtained by von Karman and Sears, which are shown to be particular cases of the general formulae. An Appendix is also added containing certain results on the motion of a vortex behind a moving cylinder, which were obtained to justify certain of the assumptions underlying the trail theory.


1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.


Sign in / Sign up

Export Citation Format

Share Document