Implementing O(N N-Body Algorithms Efficiently in Data-Parallel Languages
Directory of Open Access Journals (Sweden)
Yu Hu
1996-01-01
Full Text Available The optimization techniques for hierarchical O(N N-body algorithms described here focus on managing the data distribution and the data references, both between the memories of different nodes and within the memory hierarchy of each node. We show how the techniques can be expressed in data-parallel languages, such as High Performance Fortran (HPF and Connection Machine Fortran (CMF. The effectiveness of our techniques is demonstrated on an implementation of Anderson's hierarchical O(N N-body method for the Connection Machine system CM-5/5E. Of the total execution time, communication accounts for about 10–20% of the total time, with the average efficiency for arithmetic operations being about 40% and the total efficiency (including communication being about 35%. For the CM-5E, a performance in excess of 60 Mflop/s per node (peak 160 Mflop/s per node has been measured.
A PARALLEL MONTE CARLO CODE FOR SIMULATING COLLISIONAL N-BODY SYSTEMS
Energy Technology Data Exchange (ETDEWEB)
Pattabiraman, Bharath; Umbreit, Stefan; Liao, Wei-keng; Choudhary, Alok; Kalogera, Vassiliki; Memik, Gokhan; Rasio, Frederic A., E-mail: bharath@u.northwestern.edu [Center for Interdisciplinary Exploration and Research in Astrophysics, Northwestern University, Evanston, IL (United States)
2013-02-15
We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N {approx} 10{sup 7} particles. Our code is based on the Henon Monte Carlo method for solving the Fokker-Planck equation, and makes assumptions of spherical symmetry and dynamical equilibrium. The principal algorithmic developments involve optimizing data structures and the introduction of a parallel random number generation scheme as well as a parallel sorting algorithm required to find nearest neighbors for interactions and to compute the gravitational potential. The new algorithms we introduce along with our choice of decomposition scheme minimize communication costs and ensure optimal distribution of data and workload among the processing units. Our implementation uses the Message Passing Interface library for communication, which makes it portable to many different supercomputing architectures. We validate the code by calculating the evolution of clusters with initial Plummer distribution functions up to core collapse with the number of stars, N, spanning three orders of magnitude from 10{sup 5} to 10{sup 7}. We find that our results are in good agreement with self-similar core-collapse solutions, and the core-collapse times generally agree with expectations from the literature. Also, we observe good total energy conservation, within {approx}< 0.04% throughout all simulations. We analyze the performance of the code, and demonstrate near-linear scaling of the runtime with the number of processors up to 64 processors for N = 10{sup 5}, 128 for N = 10{sup 6} and 256 for N = 10{sup 7}. The runtime reaches saturation with the addition of processors beyond these limits, which is a characteristic of the parallel sorting algorithm. The resulting maximum speedups we achieve are approximately 60 Multiplication-Sign , 100 Multiplication-Sign , and 220 Multiplication-Sign , respectively.
A PARALLEL MONTE CARLO CODE FOR SIMULATING COLLISIONAL N-BODY SYSTEMS
International Nuclear Information System (INIS)
Pattabiraman, Bharath; Umbreit, Stefan; Liao, Wei-keng; Choudhary, Alok; Kalogera, Vassiliki; Memik, Gokhan; Rasio, Frederic A.
2013-01-01
We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N ∼ 10 7 particles. Our code is based on the Hénon Monte Carlo method for solving the Fokker-Planck equation, and makes assumptions of spherical symmetry and dynamical equilibrium. The principal algorithmic developments involve optimizing data structures and the introduction of a parallel random number generation scheme as well as a parallel sorting algorithm required to find nearest neighbors for interactions and to compute the gravitational potential. The new algorithms we introduce along with our choice of decomposition scheme minimize communication costs and ensure optimal distribution of data and workload among the processing units. Our implementation uses the Message Passing Interface library for communication, which makes it portable to many different supercomputing architectures. We validate the code by calculating the evolution of clusters with initial Plummer distribution functions up to core collapse with the number of stars, N, spanning three orders of magnitude from 10 5 to 10 7 . We find that our results are in good agreement with self-similar core-collapse solutions, and the core-collapse times generally agree with expectations from the literature. Also, we observe good total energy conservation, within ∼ 5 , 128 for N = 10 6 and 256 for N = 10 7 . The runtime reaches saturation with the addition of processors beyond these limits, which is a characteristic of the parallel sorting algorithm. The resulting maximum speedups we achieve are approximately 60×, 100×, and 220×, respectively.
GRAVIDY, a GPU modular, parallel direct-summation N-body integrator: dynamics with softening
Maureira-Fredes, Cristián; Amaro-Seoane, Pau
2018-01-01
A wide variety of outstanding problems in astrophysics involve the motion of a large number of particles under the force of gravity. These include the global evolution of globular clusters, tidal disruptions of stars by a massive black hole, the formation of protoplanets and sources of gravitational radiation. The direct-summation of N gravitational forces is a complex problem with no analytical solution and can only be tackled with approximations and numerical methods. To this end, the Hermite scheme is a widely used integration method. With different numerical techniques and special-purpose hardware, it can be used to speed up the calculations. But these methods tend to be computationally slow and cumbersome to work with. We present a new graphics processing unit (GPU), direct-summation N-body integrator written from scratch and based on this scheme, which includes relativistic corrections for sources of gravitational radiation. GRAVIDY has high modularity, allowing users to readily introduce new physics, it exploits available computational resources and will be maintained by regular updates. GRAVIDY can be used in parallel on multiple CPUs and GPUs, with a considerable speed-up benefit. The single-GPU version is between one and two orders of magnitude faster than the single-CPU version. A test run using four GPUs in parallel shows a speed-up factor of about 3 as compared to the single-GPU version. The conception and design of this first release is aimed at users with access to traditional parallel CPU clusters or computational nodes with one or a few GPU cards.
International Nuclear Information System (INIS)
Marzouk, Youssef M.; Ghoniem, Ahmed F.
2005-01-01
A number of complex physical problems can be approached through N-body simulation, from fluid flow at high Reynolds number to gravitational astrophysics and molecular dynamics. In all these applications, direct summation is prohibitively expensive for large N and thus hierarchical methods are employed for fast summation. This work introduces new algorithms, based on k-means clustering, for partitioning parallel hierarchical N-body interactions. We demonstrate that the number of particle-cluster interactions and the order at which they are performed are directly affected by partition geometry. Weighted k-means partitions minimize the sum of clusters' second moments and create well-localized domains, and thus reduce the computational cost of N-body approximations by enabling the use of lower-order approximations and fewer cells. We also introduce compatible techniques for dynamic load balancing, including adaptive scaling of cluster volumes and adaptive redistribution of cluster centroids. We demonstrate the performance of these algorithms by constructing a parallel treecode for vortex particle simulations, based on the serial variable-order Cartesian code developed by Lindsay and Krasny [Journal of Computational Physics 172 (2) (2001) 879-907]. The method is applied to vortex simulations of a transverse jet. Results show outstanding parallel efficiencies even at high concurrencies, with velocity evaluation errors maintained at or below their serial values; on a realistic distribution of 1.2 million vortex particles, we observe a parallel efficiency of 98% on 1024 processors. Excellent load balance is achieved even in the face of several obstacles, such as an irregular, time-evolving particle distribution containing a range of length scales and the continual introduction of new vortex particles throughout the domain. Moreover, results suggest that k-means yields a more efficient partition of the domain than a global oct-tree
The shape of the invisible halo: N-body simulations on parallel supercomputers
Energy Technology Data Exchange (ETDEWEB)
Warren, M.S.; Zurek, W.H. (Los Alamos National Lab., NM (USA)); Quinn, P.J. (Australian National Univ., Canberra (Australia). Mount Stromlo and Siding Spring Observatories); Salmon, J.K. (California Inst. of Tech., Pasadena, CA (USA))
1990-01-01
We study the shapes of halos and the relationship to their angular momentum content by means of N-body (N {approximately} 10{sup 6}) simulations. Results indicate that in relaxed halos with no apparent substructure: (i) the shape and orientation of the isodensity contours tends to persist throughout the virialised portion of the halo; (ii) most ({approx}70%) of the halos are prolate; (iii) the approximate direction of the angular momentum vector tends to persist throughout the halo; (iv) for spherical shells centered on the core of the halo the magnitude of the specific angular momentum is approximately proportional to their radius; (v) the shortest axis of the ellipsoid which approximates the shape of the halo tends to align with the rotation axis of the halo. This tendency is strongest in the fastest rotating halos. 13 refs., 4 figs.
International Nuclear Information System (INIS)
De Nicola, Sergio; Fedele, Renato; Man'ko, Margarita A; Man'ko, Vladimir I
2007-01-01
The tomographic-probability description of quantum states is reviewed. The symplectic tomography of quantum states with continuous variables is studied. The symplectic entropy of the states with continuous variables is discussed and its relation to Shannon entropy and information is elucidated. The known entropic uncertainty relations of the probability distribution in position and momentum of a particle are extended and new uncertainty relations for symplectic entropy are obtained. The partial case of symplectic entropy, which is optical entropy of quantum states, is considered. The entropy associated to optical tomogram is shown to satisfy the new entropic uncertainty relation. The example of Gaussian states of harmonic oscillator is studied and the entropic uncertainty relations for optical tomograms of the Gaussian state are shown to minimize the uncertainty relation
Associated symplectic and co-symplectic structures
International Nuclear Information System (INIS)
Frescura, F.A.M.; Lubczonok, G.
1991-01-01
In a recent article, the authors introduced a new geometric structure which they proposed to call co-symplectic geometry. This structure is based on a symmetric bilinear form of signature zero and leads to a geometry that is, in many respects, analogous to the symplectic geometry. Its usefulness lies principally in the fact that it provides scope for the geometrization of a number of familiar structures in physics which are not so easily amenable by the methods of symplectic geometry. These include the angular momentum operators of quantum theory, the Dirac operators in relativistic quantum field theory. It is anticipated that, in conjunction with the more familiar symplectic geometry, the co-symplectic geometry will go some way to providing the tools necessary for a full geometrization of physics. In this paper, a co-symplectic structure on the cotangent bundle T * X of an arbitrary manifold X is defined, and the notion of associated symplectic and co-symplectic structures is introduced. By way of example, the two-dimensional case is considered in some detail. The general case is investigated, and some implications of these results for polarizations in geometric quantization are considered
Classical Mechanics and Symplectic Integration
DEFF Research Database (Denmark)
Nordkvist, Nikolaj; Hjorth, Poul G.
2005-01-01
Content: Classical mechanics: Calculus of variations, Lagrange’s equations, Symmetries and Noether’s theorem, Hamilton’s equations, cannonical transformations, integrable systems, pertubation theory. Symplectic integration: Numerical integrators, symplectic integrators, main theorem on symplectic...
Lectures on Symplectic Geometry
Silva, Ana Cannas
2001-01-01
The goal of these notes is to provide a fast introduction to symplectic geometry for graduate students with some knowledge of differential geometry, de Rham theory and classical Lie groups. This text addresses symplectomorphisms, local forms, contact manifolds, compatible almost complex structures, Kaehler manifolds, hamiltonian mechanics, moment maps, symplectic reduction and symplectic toric manifolds. It contains guided problems, called homework, designed to complement the exposition or extend the reader's understanding. There are by now excellent references on symplectic geometry, a subset of which is in the bibliography of this book. However, the most efficient introduction to a subject is often a short elementary treatment, and these notes attempt to serve that purpose. This text provides a taste of areas of current research and will prepare the reader to explore recent papers and extensive books on symplectic geometry where the pace is much faster. For this reprint numerous corrections and cl...
Complex and symplectic geometry
Medori, Costantino; Tomassini, Adriano
2017-01-01
This book arises from the INdAM Meeting "Complex and Symplectic Geometry", which was held in Cortona in June 2016. Several leading specialists, including young researchers, in the field of complex and symplectic geometry, present the state of the art of their research on topics such as the cohomology of complex manifolds; analytic techniques in Kähler and non-Kähler geometry; almost-complex and symplectic structures; special structures on complex manifolds; and deformations of complex objects. The work is intended for researchers in these areas.
Collective symplectic integrators
International Nuclear Information System (INIS)
McLachlan, Robert I; Modin, Klas; Verdier, Olivier
2014-01-01
We construct symplectic integrators for Lie–Poisson systems. The integrators are standard symplectic (partitioned) Runge–Kutta methods. Their phase space is a symplectic vector space equipped with a Hamiltonian action with momentum map J whose range is the target Lie–Poisson manifold, and their Hamiltonian is collective, that is, it is the target Hamiltonian pulled back by J. The method yields, for example, a symplectic midpoint rule expressed in 4 variables for arbitrary Hamiltonians on so(3) ∗ . The method specializes in the case that a sufficiently large symmetry group acts on the fibres of J, and generalizes to the case that the vector space carries a bifoliation. Examples involving many classical groups are presented. (paper)
Symplectic S5 action on symplectic homotopy K3 surfaces
Indian Academy of Sciences (India)
HONGXIA LI
Let X be a symplectic homotopy K3 surface and G = S5 act on X symplectically. In this paper, we give a weak classification of the G action on X by discussing the fixed-point set structure. Besides, we analyse the exoticness of smooth structures of X under the action of G. Keywords. K3 surfaces; symplectic actions; exotic ...
Symplectic geometry and Fourier analysis
Wallach, Nolan R
2018-01-01
Suitable for graduate students in mathematics, this monograph covers differential and symplectic geometry, homogeneous symplectic manifolds, Fourier analysis, metaplectic representation, quantization, Kirillov theory. Includes Appendix on Quantum Mechanics by Robert Hermann. 1977 edition.
Symplectic methods in circular accelerators
International Nuclear Information System (INIS)
Forest, E.
1994-01-01
By now symplectic integration has been applied to many problems in classical mechanics. It is my conviction that the field of particle simulation in circular rings is ideally suited for the application of symplectic integration. In this paper, I present a short description symplectic tools in circular storage rings
Contact and symplectic topology
Colin, Vincent; Stipsicz, András
2014-01-01
Symplectic and contact geometry naturally emerged from the mathematical description of classical physics. The discovery of new rigidity phenomena and properties satisfied by these geometric structures launched a new research field worldwide. The intense activity of many European research groups in this field is reflected by the ESF Research Networking Programme "Contact And Symplectic Topology" (CAST). The lectures of the Summer School in Nantes (June 2011) and of the CAST Summer School in Budapest (July 2012) provide a nice panorama of many aspects of the present status of contact and symplectic topology. The notes of the minicourses offer a gentle introduction to topics which have developed in an amazing speed in the recent past. These topics include 3-dimensional and higher dimensional contact topology, Fukaya categories, asymptotically holomorphic methods in contact topology, bordered Floer homology, embedded contact homology, and flexibility results for Stein manifolds.
Energy Technology Data Exchange (ETDEWEB)
Chuang, Wu-yen; Kachru, Shamit; /Stanford U., ITP /SLAC; Tomasiello, Alessandro; /Stanford U., ITP
2005-10-28
We construct a class of symplectic non-Kaehler and complex non-Kaehler string theory vacua, extending and providing evidence for an earlier suggestion by Polchinski and Strominger. The class admits a mirror pairing by construction. Comparing hints from a variety of sources, including ten-dimensional supergravity and KK reduction on SU(3)-structure manifolds, suggests a picture in which string theory extends Reid's fantasy to connect classes of both complex non-Kaehler and symplectic non-Kaehler manifolds.
Energy Technology Data Exchange (ETDEWEB)
Voit, Kay-Michael
2008-06-16
In the first part we considered the quantum phase space in terms of noncommutative differential geometry. Following relevant literature, a short introduction to vector fields and differential forms on the differential vector space M{sub N}(C) was given. Special emphasis has been laid on the construction of a canonical symplectic form analogous to the one known from classical mechanics. The canonical choice of this form has been shown to be just the (scaled) commutator of two matrices. Using the Schwinger basis, the symplectic form derived in the first sections has been further examined by calculating concrete expressions for products of general matrices and their commutators which are, as we remember, just the symplectic form. Subsequently, a discrete analog to the continuous theory has been developed, in which the lattice of the quantum phase space forms the base space, and the Heisenberg group including the Schwinger elements is identified with the fiber space. In the continuum limit it could be shown that the discrete theory seamlessly passed into the commonly known continuous theory of connection forms on fiber bundles. The connection form and its exterior covariant derivation, the curvature form, have been calculated. It has been found that the curvature form can even be pulled back to the symplectic form by the section defined by the Schwinger elements. (orig.)
The GENGA code: gravitational encounters in N-body simulations with GPU acceleration
International Nuclear Information System (INIS)
Grimm, Simon L.; Stadel, Joachim G.
2014-01-01
We describe an open source GPU implementation of a hybrid symplectic N-body integrator, GENGA (Gravitational ENcounters with Gpu Acceleration), designed to integrate planet and planetesimal dynamics in the late stage of planet formation and stability analyses of planetary systems. GENGA uses a hybrid symplectic integrator to handle close encounters with very good energy conservation, which is essential in long-term planetary system integration. We extended the second-order hybrid integration scheme to higher orders. The GENGA code supports three simulation modes: integration of up to 2048 massive bodies, integration with up to a million test particles, or parallel integration of a large number of individual planetary systems. We compare the results of GENGA to Mercury and pkdgrav2 in terms of energy conservation and performance and find that the energy conservation of GENGA is comparable to Mercury and around two orders of magnitude better than pkdgrav2. GENGA runs up to 30 times faster than Mercury and up to 8 times faster than pkdgrav2. GENGA is written in CUDA C and runs on all NVIDIA GPUs with a computing capability of at least 2.0.
The GENGA code: gravitational encounters in N-body simulations with GPU acceleration
Energy Technology Data Exchange (ETDEWEB)
Grimm, Simon L.; Stadel, Joachim G., E-mail: sigrimm@physik.uzh.ch [Institute for Computational Science, University of Zürich, Winterthurerstrasse 190, CH-8057 Zürich (Switzerland)
2014-11-20
We describe an open source GPU implementation of a hybrid symplectic N-body integrator, GENGA (Gravitational ENcounters with Gpu Acceleration), designed to integrate planet and planetesimal dynamics in the late stage of planet formation and stability analyses of planetary systems. GENGA uses a hybrid symplectic integrator to handle close encounters with very good energy conservation, which is essential in long-term planetary system integration. We extended the second-order hybrid integration scheme to higher orders. The GENGA code supports three simulation modes: integration of up to 2048 massive bodies, integration with up to a million test particles, or parallel integration of a large number of individual planetary systems. We compare the results of GENGA to Mercury and pkdgrav2 in terms of energy conservation and performance and find that the energy conservation of GENGA is comparable to Mercury and around two orders of magnitude better than pkdgrav2. GENGA runs up to 30 times faster than Mercury and up to 8 times faster than pkdgrav2. GENGA is written in CUDA C and runs on all NVIDIA GPUs with a computing capability of at least 2.0.
Mason, A M
2018-01-01
In this paper the authors apply to the zeros of families of L-functions with orthogonal or symplectic symmetry the method that Conrey and Snaith (Correlations of eigenvalues and Riemann zeros, 2008) used to calculate the n-correlation of the zeros of the Riemann zeta function. This method uses the Ratios Conjectures (Conrey, Farmer, and Zimbauer, 2008) for averages of ratios of zeta or L-functions. Katz and Sarnak (Zeroes of zeta functions and symmetry, 1999) conjecture that the zero statistics of families of L-functions have an underlying symmetry relating to one of the classical compact groups U(N), O(N) and USp(2N). Here the authors complete the work already done with U(N) (Conrey and Snaith, Correlations of eigenvalues and Riemann zeros, 2008) to show how new methods for calculating the n-level densities of eigenangles of random orthogonal or symplectic matrices can be used to create explicit conjectures for the n-level densities of zeros of L-functions with orthogonal or symplectic symmetry, including al...
Function theory on symplectic manifolds
Polterovich, Leonid
2014-01-01
This is a book on symplectic topology, a rapidly developing field of mathematics which originated as a geometric tool for problems of classical mechanics. Since the 1980s, powerful methods such as Gromov's pseudo-holomorphic curves and Morse-Floer theory on loop spaces gave rise to the discovery of unexpected symplectic phenomena. The present book focuses on function spaces associated with a symplectic manifold. A number of recent advances show that these spaces exhibit intriguing properties and structures, giving rise to an alternative intuition and new tools in symplectic topology. The book provides an essentially self-contained introduction into these developments along with applications to symplectic topology, algebra and geometry of symplectomorphism groups, Hamiltonian dynamics and quantum mechanics. It will appeal to researchers and students from the graduate level onwards. I like the spirit of this book. It formulates concepts clearly and explains the relationship between them. The subject matter is i...
Symplectic multi-particle tracking on GPUs
Liu, Zhicong; Qiang, Ji
2018-05-01
A symplectic multi-particle tracking model is implemented on the Graphic Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) language. The symplectic tracking model can preserve phase space structure and reduce non-physical effects in long term simulation, which is important for beam property evaluation in particle accelerators. Though this model is computationally expensive, it is very suitable for parallelization and can be accelerated significantly by using GPUs. In this paper, we optimized the implementation of the symplectic tracking model on both single GPU and multiple GPUs. Using a single GPU processor, the code achieves a factor of 2-10 speedup for a range of problem sizes compared with the time on a single state-of-the-art Central Processing Unit (CPU) node with similar power consumption and semiconductor technology. It also shows good scalability on a multi-GPU cluster at Oak Ridge Leadership Computing Facility. In an application to beam dynamics simulation, the GPU implementation helps save more than a factor of two total computing time in comparison to the CPU implementation.
HNBody: A Simulation Package for Hierarchical N-Body Systems
Rauch, Kevin P.
2018-04-01
HNBody (http://www.hnbody.org/) is an extensible software package forintegrating the dynamics of N-body systems. Although general purpose, itincorporates several features and algorithms particularly well-suited tosystems containing a hierarchy (wide dynamic range) of masses. HNBodyversion 1 focused heavily on symplectic integration of nearly-Kepleriansystems. Here I describe the capabilities of the redesigned and expandedpackage version 2, which includes: symplectic integrators up to eighth order(both leap frog and Wisdom-Holman type methods), with symplectic corrector andclose encounter support; variable-order, variable-timestep Bulirsch-Stoer andStörmer integrators; post-Newtonian and multipole physics options; advancedround-off control for improved long-term stability; multi-threading and SIMDvectorization enhancements; seamless availability of extended precisionarithmetic for all calculations; extremely flexible configuration andoutput. Tests of the physical correctness of the algorithms are presentedusing JPL Horizons ephemerides (https://ssd.jpl.nasa.gov/?horizons) andpreviously published results for reference. The features and performanceof HNBody are also compared to several other freely available N-body codes,including MERCURY (Chambers), SWIFT (Levison & Duncan) and WHFAST (Rein &Tamayo).
Supersymmetric symplectic quantum mechanics
de Menezes, Miralvo B.; Fernandes, M. C. B.; Martins, Maria das Graças R.; Santana, A. E.; Vianna, J. D. M.
2018-02-01
Symplectic Quantum Mechanics SQM considers a non-commutative algebra of functions on a phase space Γ and an associated Hilbert space HΓ to construct a unitary representation for the Galilei group. From this unitary representation the Schrödinger equation is rewritten in phase space variables and the Wigner function can be derived without the use of the Liouville-von Neumann equation. In this article we extend the methods of supersymmetric quantum mechanics SUSYQM to SQM. With the purpose of applications in quantum systems, the factorization method of the quantum mechanical formalism is then set within supersymmetric SQM. A hierarchy of simpler hamiltonians is generated leading to new computation tools for solving the eigenvalue problem in SQM. We illustrate the results by computing the states and spectra of the problem of a charged particle in a homogeneous magnetic field as well as the corresponding Wigner function.
Visualizing astrophysical N-body systems
International Nuclear Information System (INIS)
Dubinski, John
2008-01-01
I begin with a brief history of N-body simulation and visualization and then go on to describe various methods for creating images and animations of modern simulations in cosmology and galactic dynamics. These techniques are incorporated into a specialized particle visualization software library called MYRIAD that is designed to render images within large parallel N-body simulations as they run. I present several case studies that explore the application of these methods to animations in star clusters, interacting galaxies and cosmological structure formation.
On orbifold criteria for symplectic toric quotients
DEFF Research Database (Denmark)
Farsi, Carla; Herbig, Hans-Christian; Seaton, Christopher
2013-01-01
We introduce the notion of regular symplectomorphism and graded regular symplectomorphism between singular phase spaces. Our main concern is to exhibit examples of unitary torus representations whose symplectic quotients cannot be graded regularly symplectomorphic to the quotient of a symplectic...
Vorticity and symplecticity in multi-symplectic, Lagrangian gas dynamics
Webb, G. M.; Anco, S. C.
2016-02-01
The Lagrangian, multi-dimensional, ideal, compressible gas dynamic equations are written in a multi-symplectic form, in which the Lagrangian fluid labels, m i (the Lagrangian mass coordinates) and time t are the independent variables, and in which the Eulerian position of the fluid element {x}={x}({m},t) and the entropy S=S({m},t) are the dependent variables. Constraints in the variational principle are incorporated by means of Lagrange multipliers. The constraints are: the entropy advection equation S t = 0, the Lagrangian map equation {{x}}t={u} where {u} is the fluid velocity, and the mass continuity equation which has the form J=τ where J={det}({x}{ij}) is the Jacobian of the Lagrangian map in which {x}{ij}=\\partial {x}i/\\partial {m}j and τ =1/ρ is the specific volume of the gas. The internal energy per unit volume of the gas \\varepsilon =\\varepsilon (ρ ,S) corresponds to a non-barotropic gas. The Lagrangian is used to define multi-momenta, and to develop de Donder-Weyl Hamiltonian equations. The de Donder-Weyl equations are cast in a multi-symplectic form. The pullback conservation laws and the symplecticity conservation laws are obtained. One class of symplecticity conservation laws give rise to vorticity and potential vorticity type conservation laws, and another class of symplecticity laws are related to derivatives of the Lagrangian energy conservation law with respect to the Lagrangian mass coordinates m i . We show that the vorticity-symplecticity laws can be derived by a Lie dragging method, and also by using Noether’s second theorem and a fluid relabelling symmetry which is a divergence symmetry of the action. We obtain the Cartan-Poincaré form describing the equations and we discuss a set of differential forms representing the equation system.
Formal Symplectic Groupoid of a Deformation Quantization
Karabegov, Alexander V.
2005-08-01
We give a self-contained algebraic description of a formal symplectic groupoid over a Poisson manifold M. To each natural star product on M we then associate a canonical formal symplectic groupoid over M. Finally, we construct a unique formal symplectic groupoid ‘with separation of variables’ over an arbitrary Kähler-Poisson manifold.
Elementary symplectic topology and mechanics
Cardin, Franco
2015-01-01
This is a short tract on the essentials of differential and symplectic geometry together with a basic introduction to several applications of this rich framework: analytical mechanics, the calculus of variations, conjugate points & Morse index, and other physical topics. A central feature is the systematic utilization of Lagrangian submanifolds and their Maslov-Hörmander generating functions. Following this line of thought, first introduced by Wlodemierz Tulczyjew, geometric solutions of Hamilton-Jacobi equations, Hamiltonian vector fields and canonical transformations are described by suitable Lagrangian submanifolds belonging to distinct well-defined symplectic structures. This unified point of view has been particularly fruitful in symplectic topology, which is the modern Hamiltonian environment for the calculus of variations, yielding sharp sufficient existence conditions. This line of investigation was initiated by Claude Viterbo in 1992; here, some primary consequences of this theory are exposed in...
Symplecticity in Beam Dynamics: An Introduction
Energy Technology Data Exchange (ETDEWEB)
Rees, John R
2003-06-10
A particle in a particle accelerator can often be considered a Hamiltonian system, and when that is the case, its motion obeys the constraints of the Symplectic Condition. This tutorial monograph derives the condition from the requirement that a canonical transformation must yield a new Hamiltonian system from an old one. It then explains some of the consequences of symplecticity and discusses examples of its applications, touching on symplectic matrices, phase space and Liouville's Theorem, Lagrange and Poisson brackets, Lie algebra, Lie operators and Lie transformations, symplectic maps and symplectic integrators.
Collective coordinates on symplectic manifolds
International Nuclear Information System (INIS)
Razumov, A.V.; Taranov, A.Yu.
1981-01-01
For an arbitrary Lie group of canonical transformations on a symplectic manifold collective coordinates are introduced. They describe a motion of the dynamical system as a whole under the group transformations. Some properties of Lie group of canonical transformations are considered [ru
Symplectic and trigonometrically fitted symplectic methods of second and third order
International Nuclear Information System (INIS)
Monovasilis, Th.; Simos, T.E.
2006-01-01
The numerical integration of Hamiltonian systems by symplectic and trigonometrically symplectic method is considered in this Letter. We construct new symplectic and trigonometrically symplectic methods of second and third order. We apply our new methods as well as other existing methods to the numerical integration of the harmonic oscillator, the 2D harmonic oscillator with an integer frequency ratio and an orbit problem studied by Stiefel and Bettis
Reduction of symplectic principal R-bundles
International Nuclear Information System (INIS)
Lacirasella, Ignazio; Marrero, Juan Carlos; Padrón, Edith
2012-01-01
We describe a reduction process for symplectic principal R-bundles in the presence of a momentum map. These types of structures play an important role in the geometric formulation of non-autonomous Hamiltonian systems. We apply this procedure to the standard symplectic principal R-bundle associated with a fibration π:M→R. Moreover, we show a reduction process for non-autonomous Hamiltonian systems on symplectic principal R-bundles. We apply these reduction processes to several examples. (paper)
Symplectic Geometric Algorithms for Hamiltonian Systems
Feng, Kang
2010-01-01
"Symplectic Geometry Algorithms for Hamiltonian Systems" will be useful not only for numerical analysts, but also for those in theoretical physics, computational chemistry, celestial mechanics, etc. The book generalizes and develops the generating function and Hamilton-Jacobi equation theory from the perspective of the symplectic geometry and symplectic algebra. It will be a useful resource for engineers and scientists in the fields of quantum theory, astrophysics, atomic and molecular dynamics, climate prediction, oil exploration, etc. Therefore a systematic research and development
The Maslov index in symplectic Banach spaces
DEFF Research Database (Denmark)
Booss-Bavnbek, Bernhelm; Zhu, Chaofeng
. Using such decompositions the authors define the Maslov index of the curve by symplectic reduction to the classical finite-dimensional case. The authors prove the transitivity of repeated symplectic reductions and obtain the invariance of the Maslov index under symplectic reduction while recovering all...... for varying well-posed boundary conditions on manifolds with boundary and obtain the splitting formula of the spectral flow on partitioned manifolds....
Symplectic integration for complex wigglers
International Nuclear Information System (INIS)
Forest, E.; Ohmi, K.
1992-01-01
Using the example of the helical wiggler proposed for the KEK photon factory, we show how to integrate the equation of motion through the wiggler. The integration is performed in cartesian coordinates. For the usual expanded Hamiltonian (without square root), we derive a first order symplectic integrator for the purpose of tracking through a wiggler in a ring. We also show how to include classical radiation for the computation of the damping decrement
Symplectic maps for accelerator lattices
International Nuclear Information System (INIS)
Warnock, R.L.; Ruth, R.; Gabella, W.
1988-05-01
We describe a method for numerical construction of a symplectic map for particle propagation in a general accelerator lattice. The generating function of the map is obtained by integrating the Hamilton-Jacobi equation as an initial-value problem on a finite time interval. Given the generating function, the map is put in explicit form by means of a Fourier inversion technique. We give an example which suggests that the method has promise. 9 refs., 9 figs
The Maslov index in symplectic Banach spaces
Booss-Bavnbek, Bernhelm
2018-01-01
The authors consider a curve of Fredholm pairs of Lagrangian subspaces in a fixed Banach space with continuously varying weak symplectic structures. Assuming vanishing index, they obtain intrinsically a continuously varying splitting of the total Banach space into pairs of symplectic subspaces. Using such decompositions the authors define the Maslov index of the curve by symplectic reduction to the classical finite-dimensional case. The authors prove the transitivity of repeated symplectic reductions and obtain the invariance of the Maslov index under symplectic reduction while recovering all the standard properties of the Maslov index. As an application, the authors consider curves of elliptic operators which have varying principal symbol, varying maximal domain and are not necessarily of Dirac type. For this class of operator curves, the authors derive a desuspension spectral flow formula for varying well-posed boundary conditions on manifolds with boundary and obtain the splitting formula of the spectral f...
Singularity theory and equivariant symplectic maps
Bridges, Thomas J
1993-01-01
The monograph is a study of the local bifurcations of multiparameter symplectic maps of arbitrary dimension in the neighborhood of a fixed point.The problem is reduced to a study of critical points of an equivariant gradient bifurcation problem, using the correspondence between orbits ofa symplectic map and critical points of an action functional. New results onsingularity theory for equivariant gradient bifurcation problems are obtained and then used to classify singularities of bifurcating period-q points. Of particular interest is that a general framework for analyzing group-theoretic aspects and singularities of symplectic maps (particularly period-q points) is presented. Topics include: bifurcations when the symplectic map has spatial symmetry and a theory for the collision of multipliers near rational points with and without spatial symmetry. The monograph also includes 11 self-contained appendices each with a basic result on symplectic maps. The monograph will appeal to researchers and graduate student...
Multi-symplectic Birkhoffian structure for PDEs with dissipation terms
International Nuclear Information System (INIS)
Su Hongling; Qin Mengzhao; Wang Yushun; Scherer, Rudolf
2010-01-01
A generalization of the multi-symplectic form for Hamiltonian systems to self-adjoint systems with dissipation terms is studied. These systems can be expressed as multi-symplectic Birkhoffian equations, which leads to a natural definition of Birkhoffian multi-symplectic structure. The concept of Birkhoffian multi-symplectic integrators for Birkhoffian PDEs is investigated. The Birkhoffian multi-symplectic structure is constructed by the continuous variational principle, and the Birkhoffian multi-symplectic integrator by the discrete variational principle. As an example, two Birkhoffian multi-symplectic integrators for the equation describing a linear damped string are given.
On local invariants of singular symplectic forms
Domitrz, Wojciech
2017-04-01
We find a complete set of local invariants of singular symplectic forms with the structurally stable Martinet hypersurface on a 2 n-dimensional manifold. In the C-analytic category this set consists of the Martinet hypersurface Σ2, the restriction of the singular symplectic form ω to TΣ2 and the kernel of ω n - 1 at the point p ∈Σ2. In the R-analytic and smooth categories this set contains one more invariant: the canonical orientation of Σ2. We find the conditions to determine the kernel of ω n - 1 at p by the other invariants. In dimension 4 we find sufficient conditions to determine the equivalence class of a singular symplectic form-germ with the structurally smooth Martinet hypersurface by the Martinet hypersurface and the restriction of the singular symplectic form to it. We also study the singular symplectic forms with singular Martinet hypersurfaces. We prove that the equivalence class of such singular symplectic form-germ is determined by the Martinet hypersurface, the canonical orientation of its regular part and the restriction of the singular symplectic form to its regular part if the Martinet hypersurface is a quasi-homogeneous hypersurface with an isolated singularity.
Equilibrium Solutions of the Logarithmic Hamiltonian Leapfrog for the N-body Problem
Minesaki, Yukitaka
2018-04-01
We prove that a second-order logarithmic Hamiltonian leapfrog for the classical general N-body problem (CGNBP) designed by Mikkola and Tanikawa and some higher-order logarithmic Hamiltonian methods based on symmetric multicompositions of the logarithmic algorithm exactly reproduce the orbits of elliptic relative equilibrium solutions in the original CGNBP. These methods are explicit symplectic methods. Before this proof, only some implicit discrete-time CGNBPs proposed by Minesaki had been analytically shown to trace the orbits of elliptic relative equilibrium solutions. The proof is therefore the first existence proof for explicit symplectic methods. Such logarithmic Hamiltonian methods with a variable time step can also precisely retain periodic orbits in the classical general three-body problem, which generic numerical methods with a constant time step cannot do.
Categorical Cell Decomposition of Quantized Symplectic Algebraic Varieties
Bellamy, Gwyn; Dodd, Christopher; McGerty, Kevin; Nevins, Thomas
2013-01-01
We prove a new symplectic analogue of Kashiwara’s equivalence from D–module\\ud theory. As a consequence, we establish a structure theory for module categories over\\ud deformation-quantizations that mirrors, at a higher categorical level, the BiałynickiBirula\\ud stratification of a variety with an action of the multiplicative group Gm . The\\ud resulting categorical cell decomposition provides an algebrogeometric parallel to the\\ud structure of Fukaya categories of Weinstein manifolds. From it,...
Generalized reciprocity principle for discrete symplectic systems
Directory of Open Access Journals (Sweden)
Julia Elyseeva
2015-12-01
Full Text Available This paper studies transformations for conjoined bases of symplectic difference systems $Y_{i+1}=\\mathcal S_{i}Y_{i}$ with the symplectic coefficient matrices $\\mathcal S_i.$ For an arbitrary symplectic transformation matrix $P_{i}$ we formulate most general sufficient conditions for $\\mathcal S_{i},\\, P_{i}$ which guarantee that $P_{i}$ preserves oscillatory properties of conjoined bases $Y_{i}.$ We present examples which show that our new results extend the applicability of the discrete transformation theory.
Multiparametric quantum symplectic phase space
International Nuclear Information System (INIS)
Parashar, P.; Soni, S.K.
1992-07-01
We formulate a consistent multiparametric differential calculus on the quadratic coordinate algebra of the quantum vector space and use this as a tool to obtain a deformation of the associated symplectic phase space involving n(n-1)/2+1 deformation parameters. A consistent calculus on the relation subspace is also constructed. This is achieved with the help of a restricted ansatz and solving the consistency conditions to directly arrive at the main commutation structures without any reference to the R-matrix. However, the non-standard R-matrices for GL r,qij (n) and Sp r,qij (2n) can be easily read off from the commutation relations involving coordinates and derivatives. (author). 9 refs
Symplectic Attitude Estimation for Small Satellites
National Research Council Canada - National Science Library
Valpiani, James M; Palmer, Phillip L
2006-01-01
.... Symplectic numerical methods are applied to the Extended Kalman Filter (EKF) algorithm to give the SKF, which outperforms the standard EKF in the presence of nonlinearity and low measurement noise in the 1-D case...
Note on Symplectic SVD-Like Decomposition
Directory of Open Access Journals (Sweden)
AGOUJIL Said
2016-02-01
Full Text Available The aim of this study was to introduce a constructive method to compute a symplectic singular value decomposition (SVD-like decomposition of a 2n-by-m rectangular real matrix A, based on symplectic refectors.This approach used a canonical Schur form of skew-symmetric matrix and it allowed us to compute eigenvalues for the structured matrices as Hamiltonian matrix JAA^T.
Symplectic topology of integrable Hamiltonian systems
International Nuclear Information System (INIS)
Nguyen Tien Zung.
1993-08-01
We study the topology of integrable Hamiltonian systems, giving the main attention to the affine structure of their orbit spaces. In particular, we develop some aspects of Fomenko's theory about topological classification of integrable non-degenerate systems, and consider some relations between such systems and ''pure'' contact and symplectic geometry. We give a notion of integrable surgery and use it to obtain some interesting symplectic structures. (author). Refs, 10 figs
Strongly stable real infinitesimally symplectic mappings
Cushman, R.; Kelley, A.
We prove that a mapA εsp(σ,R), the set of infinitesimally symplectic maps, is strongly stable if and only if its centralizerC(A) insp(σ,R) contains only semisimple elements. Using the theorem that everyB insp(σ,R) close toA is conjugate by a real symplectic map to an element ofC(A), we give a new
Fan, Hong-Yi; Chen, Jun-Hua
2002-08-01
We find that the coherent state projection operator representation of symplectic transformation constitutes a loyal group representation of symplectic group. The result of successively applying squeezing operators on number state can be easily derived. The project supported by National Natural Science Foundation of China under Grant No. 10575057 and the President Foundation of the Chinese Academy of Sciences
International Nuclear Information System (INIS)
Maltsev, A Ya
2005-01-01
We consider the special type of field-theoretical symplectic structures called weakly nonlocal. The structures of this type are, in particular, very common for integrable systems such as KdV or NLS. We introduce here the special class of weakly nonlocal symplectic structures which we call weakly nonlocal symplectic structures of hydrodynamic type. We investigate then the connection of such structures with the Whitham averaging method and propose the procedure of 'averaging' the weakly nonlocal symplectic structures. The averaging procedure gives the weakly nonlocal symplectic structure of hydrodynamic type for the corresponding Whitham system. The procedure also gives 'action variables' corresponding to the wave numbers of m-phase solutions of the initial system which give the additional conservation laws for the Whitham system
Symplectic Maps from Cluster Algebras
Directory of Open Access Journals (Sweden)
Allan P. Fordy
2011-09-01
Full Text Available We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation operations, as well as a set of associated cluster mutations that are applied to a set of affine coordinates (the cluster variables. Fordy and Marsh recently provided a complete classification of all such quivers that have a certain periodicity property under sequences of mutations. This periodicity implies that a suitable sequence of cluster mutations is precisely equivalent to iteration of a nonlinear recurrence relation. Here we explain briefly how to introduce a symplectic structure in this setting, which is preserved by a corresponding birational map (possibly on a space of lower dimension. We give examples of both integrable and non-integrable maps that arise from this construction. We use algebraic entropy as an approach to classifying integrable cases. The degrees of the iterates satisfy a tropical version of the map.
An algorithm for symplectic implicit Taylor-map tracking
International Nuclear Information System (INIS)
Yan, Y.; Channell, P.; Syphers, M.
1992-10-01
An algorithm has been developed for converting an ''order-by-order symplectic'' Taylor map that is truncated to an arbitrary order (thus not exactly symplectic) into a Courant-Snyder matrix and a symplectic implicit Taylor map for symplectic tracking. This algorithm is implemented using differential algebras, and it is numerically stable and fast. Thus, lifetime charged-particle tracking for large hadron colliders, such as the Superconducting Super Collider, is now made possible
Multi-symplectic integrators: numerical schemes for Hamiltonian PDEs that conserve symplecticity
Bridges, Thomas J.; Reich, Sebastian
2001-06-01
The symplectic numerical integration of finite-dimensional Hamiltonian systems is a well established subject and has led to a deeper understanding of existing methods as well as to the development of new very efficient and accurate schemes, e.g., for rigid body, constrained, and molecular dynamics. The numerical integration of infinite-dimensional Hamiltonian systems or Hamiltonian PDEs is much less explored. In this Letter, we suggest a new theoretical framework for generalizing symplectic numerical integrators for ODEs to Hamiltonian PDEs in R2: time plus one space dimension. The central idea is that symplecticity for Hamiltonian PDEs is directional: the symplectic structure of the PDE is decomposed into distinct components representing space and time independently. In this setting PDE integrators can be constructed by concatenating uni-directional ODE symplectic integrators. This suggests a natural definition of multi-symplectic integrator as a discretization that conserves a discrete version of the conservation of symplecticity for Hamiltonian PDEs. We show that this approach leads to a general framework for geometric numerical schemes for Hamiltonian PDEs, which have remarkable energy and momentum conservation properties. Generalizations, including development of higher-order methods, application to the Euler equations in fluid mechanics, application to perturbed systems, and extension to more than one space dimension are also discussed.
Relative symplectic caps, 4-genus and fibered knots
Indian Academy of Sciences (India)
We prove relative versions of the symplectic capping theorem and sufficiency of Giroux's criterion for Stein fillability and use these to study the 4-genus of knots. More precisely, suppose we have a symplectic 4-manifold with convex boundary and a symplectic surface in such that is a transverse knot in .
Translating solitons to symplectic and Lagrangian mean curvature flows
International Nuclear Information System (INIS)
Han Xiaoli; Li Jiayu
2007-05-01
In this paper, we construct finite blow-up examples for symplectic mean curvature flows and we study symplectic translating solitons. We prove that there is no translating solitons with vertical bar α vertical bar ≤ α 0 to the symplectic mean curvature flow or to the almost calibrated Lagrangian mean curvature flow for some α 0 . (author)
Infinitesimal Deformations of a Formal Symplectic Groupoid
Karabegov, Alexander
2011-09-01
Given a formal symplectic groupoid G over a Poisson manifold ( M, π 0), we define a new object, an infinitesimal deformation of G, which can be thought of as a formal symplectic groupoid over the manifold M equipped with an infinitesimal deformation {π_0 + \\varepsilon π_1} of the Poisson bivector field π 0. To any pair of natural star products {(ast,tildeast)} having the same formal symplectic groupoid G we relate an infinitesimal deformation of G. We call it the deformation groupoid of the pair {(ast,tildeast)} . To each star product with separation of variables {ast} on a Kähler-Poisson manifold M we relate another star product with separation of variables {hatast} on M. We build an algorithm for calculating the principal symbols of the components of the logarithm of the formal Berezin transform of a star product with separation of variables {ast} . This algorithm is based upon the deformation groupoid of the pair {(ast,hatast)}.
Characterization and solvability of quasipolynomial symplectic mappings
Energy Technology Data Exchange (ETDEWEB)
Hernandez-Bermejo, Benito [ESCET (Edificio Departamental II), Universidad Rey Juan Carlos, Calle Tulipan S/N, 28933-Mostoles-Madrid (Spain); Brenig, Leon [Service de Physique Theorique et Mathematique, Universite Libre de Bruxelles, Campus Plaine, CP 231, Boulevard du Triomphe, B-1050 Brussels (Belgium)
2004-02-13
Quasipolynomial (or QP) mappings constitute a wide generalization of the well-known Lotka-Volterra mappings, of importance in different fields such as population dynamics, physics, chemistry or economy. In addition, QP mappings are a natural discrete-time analogue of the continuous QP systems, which have been extensively used in different pure and applied domains. After presenting the basic definitions and properties of QP mappings in a previous paper, the purpose of this work is to focus on their characterization by considering the existence of symplectic QP mappings. In what follows such QP symplectic maps are completely characterized. Moreover, use of the QP formalism can be made in order to demonstrate that all QP symplectic mappings have an analytical solution that is explicitly and generally constructed. Examples are given.
Characterization and solvability of quasipolynomial symplectic mappings
International Nuclear Information System (INIS)
Hernandez-Bermejo, Benito; Brenig, Leon
2004-01-01
Quasipolynomial (or QP) mappings constitute a wide generalization of the well-known Lotka-Volterra mappings, of importance in different fields such as population dynamics, physics, chemistry or economy. In addition, QP mappings are a natural discrete-time analogue of the continuous QP systems, which have been extensively used in different pure and applied domains. After presenting the basic definitions and properties of QP mappings in a previous paper, the purpose of this work is to focus on their characterization by considering the existence of symplectic QP mappings. In what follows such QP symplectic maps are completely characterized. Moreover, use of the QP formalism can be made in order to demonstrate that all QP symplectic mappings have an analytical solution that is explicitly and generally constructed. Examples are given
Characterization and solvability of quasipolynomial symplectic mappings
Hernández-Bermejo, Benito; Brenig, Léon
2004-02-01
Quasipolynomial (or QP) mappings constitute a wide generalization of the well-known Lotka-Volterra mappings, of importance in different fields such as population dynamics, physics, chemistry or economy. In addition, QP mappings are a natural discrete-time analogue of the continuous QP systems, which have been extensively used in different pure and applied domains. After presenting the basic definitions and properties of QP mappings in a previous paper [1], the purpose of this work is to focus on their characterization by considering the existence of symplectic QP mappings. In what follows such QP symplectic maps are completely characterized. Moreover, use of the QP formalism can be made in order to demonstrate that all QP symplectic mappings have an analytical solution that is explicitly and generally constructed. Examples are given.
Energy Technology Data Exchange (ETDEWEB)
Cui, Jianbo, E-mail: jianbocui@lsec.cc.ac.cn [Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, 100190 (China); Hong, Jialin, E-mail: hjl@lsec.cc.ac.cn [Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, 100190 (China); Liu, Zhihui, E-mail: liuzhihui@lsec.cc.ac.cn [Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, 100190 (China); Zhou, Weien, E-mail: weienzhou@nudt.edu.cn [College of Science, National University of Defense Technology, Changsha 410073 (China)
2017-08-01
We indicate that the nonlinear Schrödinger equation with white noise dispersion possesses stochastic symplectic and multi-symplectic structures. Based on these structures, we propose the stochastic symplectic and multi-symplectic methods, which preserve the continuous and discrete charge conservation laws, respectively. Moreover, we show that the proposed methods are convergent with temporal order one in probability. Numerical experiments are presented to verify our theoretical results.
International Nuclear Information System (INIS)
Cui, Jianbo; Hong, Jialin; Liu, Zhihui; Zhou, Weien
2017-01-01
We indicate that the nonlinear Schrödinger equation with white noise dispersion possesses stochastic symplectic and multi-symplectic structures. Based on these structures, we propose the stochastic symplectic and multi-symplectic methods, which preserve the continuous and discrete charge conservation laws, respectively. Moreover, we show that the proposed methods are convergent with temporal order one in probability. Numerical experiments are presented to verify our theoretical results.
Infinitesimal deformations of a formal symplectic groupoid
Karabegov, Alexander
2010-01-01
Given a formal symplectic groupoid $G$ over a Poisson manifold $(M, \\pi_0)$, we define a new object, an infinitesimal deformation of $G$, which can be thought of as a formal symplectic groupoid over the manifold $M$ equipped with an infinitesimal deformation $\\pi_0 + \\epsilon \\pi_1$ of the Poisson bivector field $\\pi_0$. The source and target mappings of a deformation of $G$ are deformations of the source and target mappings of $G$. To any pair of natural star products $(\\ast, \\tilde\\ast)$ ha...
DEFF Research Database (Denmark)
Nest, Ryszard; Tsygan, Boris
2001-01-01
Recently Kontsevich solved the classification problem for deformation quantizations of all Poisson structures on a manifold. In this paper we study those Poisson structures for which the explicit methods of Fedosov can be applied, namely the Poisson structures coming from symplectic Lie algebroids......, as well as holomorphic symplectic structures. For deformations of these structures we prove the classification theorems and a general a general index theorem....
Wigner functions on non-standard symplectic vector spaces
Dias, Nuno Costa; Prata, João Nuno
2018-01-01
We consider the Weyl quantization on a flat non-standard symplectic vector space. We focus mainly on the properties of the Wigner functions defined therein. In particular we show that the sets of Wigner functions on distinct symplectic spaces are different but have non-empty intersections. This extends previous results to arbitrary dimension and arbitrary (constant) symplectic structure. As a by-product we introduce and prove several concepts and results on non-standard symplectic spaces which generalize those on the standard symplectic space, namely, the symplectic spectrum, Williamson's theorem, and Narcowich-Wigner spectra. We also show how Wigner functions on non-standard symplectic spaces behave under the action of an arbitrary linear coordinate transformation.
Spherical complexes attached to symplectic lattices
van der Kallen, W.L.J.; Looijenga, E.J.N.
2011-01-01
To the integral symplectic group Sp(2g, Z) we associate two posets of which we prove that they have the Cohen-Macaulay property. As an application we show that the locus of marked decomposable principally polarized abelian varieties in the Siegel space of genus g has the homotopy type of a bouquet
Invariant metric for nonlinear symplectic maps
Indian Academy of Sciences (India)
In this paper, we construct an invariant metric in the space of homogeneous polynomials of a given degree (≥ 3). The homogeneous polynomials specify a nonlinear symplectic map which in turn represents a Hamiltonian system. By minimizing the norm constructed out of this metric as a function of system parameters, we ...
Symplectic integrators with adaptive time steps
Richardson, A. S.; Finn, J. M.
2012-01-01
In recent decades, there have been many attempts to construct symplectic integrators with variable time steps, with rather disappointing results. In this paper, we identify the causes for this lack of performance, and find that they fall into two categories. In the first, the time step is considered a function of time alone, Δ = Δ(t). In this case, backward error analysis shows that while the algorithms remain symplectic, parametric instabilities may arise because of resonance between oscillations of Δ(t) and the orbital motion. In the second category the time step is a function of phase space variables Δ = Δ(q, p). In this case, the system of equations to be solved is analyzed by introducing a new time variable τ with dt = Δ(q, p) dτ. The transformed equations are no longer in Hamiltonian form, and thus do not benefit from integration methods which would be symplectic for Hamiltonian systems. We analyze two methods for integrating the transformed equations which do, however, preserve the structure of the original equations. The first is an extended phase space method, which has been successfully used in previous studies of adaptive time step symplectic integrators. The second, novel, method is based on a non-canonical mixed-variable generating function. Numerical trials for both of these methods show good results, without parametric instabilities or spurious growth or damping. It is then shown how to adapt the time step to an error estimate found by backward error analysis, in order to optimize the time-stepping scheme. Numerical results are obtained using this formulation and compared with other time-stepping schemes for the extended phase space symplectic method.
International Nuclear Information System (INIS)
Zhang, Ruili; Tang, Yifa; Zhu, Beibei; Liu, Jian; Xiao, Jianyuan; Qin, Hong
2014-01-01
The gyrocenter dynamics of charged particles in time-independent magnetic fields is a non-canonical Hamiltonian system. The canonical description of the gyrocenter has both theoretical and practical importance. We provide a general procedure of the gyrocenter canonicalization, which is expressed by the series of a small variable ϵ depending only on the parallel velocity u and can be expressed in a recursive manner. We prove that the truncation of the series to any given order generates a set of exact canonical coordinates for a system, whose Lagrangian approximates to that of the original gyrocenter system in the same order. If flux surfaces exist for the magnetic field, the series stops simply at the second order and an exact canonical form of the gyrocenter system is obtained. With the canonicalization schemes, the canonical symplectic simulation of gyrocenter dynamics is realized for the first time. The canonical symplectic algorithm has the advantage of good conservation properties and long-term numerical accuracy, while avoiding numerical instability. It is worth mentioning that explicitly expressing the canonical Hamiltonian in new coordinates is usually difficult and impractical. We give an iteration procedure that is easy to implement in the original coordinates associated with the coordinate transformation. This is crucial for modern large-scale simulation studies in plasma physics. The dynamics of gyrocenters in the dipole magnetic field and in the toroidal geometry are simulated using the canonical symplectic algorithm by comparison with the higher-order non symplectic Runge-Kutta scheme. The overwhelming superiorities of the symplectic method for the gyrocenter system are evidently exhibited
Birkhoffian Symplectic Scheme for a Quantum System
International Nuclear Information System (INIS)
Su Hongling
2010-01-01
In this paper, a classical system of ordinary differential equations is built to describe a kind of n-dimensional quantum systems. The absorption spectrum and the density of the states for the system are defined from the points of quantum view and classical view. From the Birkhoffian form of the equations, a Birkhoffian symplectic scheme is derived for solving n-dimensional equations by using the generating function method. Besides the Birkhoffian structure-preserving, the new scheme is proven to preserve the discrete local energy conservation law of the system with zero vector f. Some numerical experiments for a 3-dimensional example show that the new scheme can simulate the general Birkhoffian system better than the implicit midpoint scheme, which is well known to be symplectic scheme for Hamiltonian system. (general)
Symplectic models for general insertion devices
International Nuclear Information System (INIS)
Wu, Y.; Forest, E.; Robin, D. S.; Nishimura, H.; Wolski, A.; Litvinenko, V. N.
2001-01-01
A variety of insertion devices (IDs), wigglers and undulators, linearly or elliptically polarized,are widely used as high brightness radiation sources at the modern light source rings. Long and high-field wigglers have also been proposed as the main source of radiation damping at next generation damping rings. As a result, it becomes increasingly important to understand the impact of IDs on the charged particle dynamics in the storage ring. In this paper, we report our recent development of a general explicit symplectic model for IDs with the paraxial ray approximation. High-order explicit symplectic integrators are developed to study real-world insertion devices with a number of wiggler harmonics and arbitrary polarizations
Symplectic discretization for spectral element solution of Maxwell's equations
International Nuclear Information System (INIS)
Zhao Yanmin; Dai Guidong; Tang Yifa; Liu Qinghuo
2009-01-01
Applying the spectral element method (SEM) based on the Gauss-Lobatto-Legendre (GLL) polynomial to discretize Maxwell's equations, we obtain a Poisson system or a Poisson system with at most a perturbation. For the system, we prove that any symplectic partitioned Runge-Kutta (PRK) method preserves the Poisson structure and its implied symplectic structure. Numerical examples show the high accuracy of SEM and the benefit of conserving energy due to the use of symplectic methods.
Quantum symplectic geometry. 1. The matrix Hamiltonian formalism
International Nuclear Information System (INIS)
Djemai, A.E.F.
1994-07-01
The main purpose of this work is to describe the quantum analogue of the usual classical symplectic geometry and then to formulate the quantum mechanics as a (quantum) non-commutative symplectic geometry. In this first part, we define the quantum symplectic structure in the context of the matrix differential geometry by using the discrete Weyl-Schwinger realization of the Heisenberg group. We also discuss the continuous limit and give an expression of the quantum structure constants. (author). 42 refs
Stochastic deformation of a thermodynamic symplectic structure
Kazinski, P. O.
2008-01-01
A stochastic deformation of a thermodynamic symplectic structure is studied. The stochastic deformation procedure is analogous to the deformation of an algebra of observables like deformation quantization, but for an imaginary deformation parameter (the Planck constant). Gauge symmetries of thermodynamics and corresponding stochastic mechanics, which describes fluctuations of a thermodynamic system, are revealed and gauge fields are introduced. A physical interpretation to the gauge transform...
Eliashberg, Yakov; Maeda, Yoshiaki; Symplectic, Poisson, and Noncommutative geometry
2014-01-01
Symplectic geometry originated in physics, but it has flourished as an independent subject in mathematics, together with its offspring, symplectic topology. Symplectic methods have even been applied back to mathematical physics. Noncommutative geometry has developed an alternative mathematical quantization scheme based on a geometric approach to operator algebras. Deformation quantization, a blend of symplectic methods and noncommutative geometry, approaches quantum mechanics from a more algebraic viewpoint, as it addresses quantization as a deformation of Poisson structures. This volume contains seven chapters based on lectures given by invited speakers at two May 2010 workshops held at the Mathematical Sciences Research Institute: Symplectic and Poisson Geometry in Interaction with Analysis, Algebra and Topology (honoring Alan Weinstein, one of the key figures in the field) and Symplectic Geometry, Noncommutative Geometry and Physics. The chapters include presentations of previously unpublished results and ...
Smooth Maps of a Foliated Manifold in a Symplectic Manifold
Indian Academy of Sciences (India)
Let be a smooth manifold with a regular foliation F and a 2-form which induces closed forms on the leaves of F in the leaf topology. A smooth map f : ( M , F ) ⟶ ( N , ) in a symplectic manifold ( N , ) is called a foliated symplectic immersion if restricts to an immersion on each leaf of the foliation and further, the ...
The difficulty of symplectic analysis with second class systems
International Nuclear Information System (INIS)
Shirzad, A.; Mojiri, M.
2005-01-01
Using the basic concepts of the chain by chain method we show that the symplectic analysis, which was claimed to be equivalent to the usual Dirac method, fails when second class constraints are present. We propose a modification in symplectic analysis that solves the problem
The Maslov index in weak symplectic functional analysis
DEFF Research Database (Denmark)
Booss-Bavnbek, Bernhelm; Zhu, Chaofeng
2013-01-01
We recall the Chernoff-Marsden definition of weak symplectic structure and give a rigorous treatment of the functional analysis and geometry of weak symplectic Banach spaces. We define the Maslov index of a continuous path of Fredholm pairs of Lagrangian subspaces in continuously varying Banach...
Conformal transformation and symplectic structure of self-dual fields
International Nuclear Information System (INIS)
Yang Kongqing; Luo Yan
1996-01-01
Considered two dimensional self-dual fields, the symplectic structure on the space of solutions is given. It is shown that this structure is Poincare invariant. The Lagrangian of two dimensional self-dual field is invariant under infinite one component conformal group, then this symplectic structure is also invariant under this conformal group. The conserved currents in geometrical formalism are also obtained
An adaptive N-body algorithm of optimal order
International Nuclear Information System (INIS)
Pruett, C. David.; Rudmin, Joseph W.; Lacy, Justin M.
2003-01-01
Picard iteration is normally considered a theoretical tool whose primary utility is to establish the existence and uniqueness of solutions to first-order systems of ordinary differential equations (ODEs). However, in 1996, Parker and Sochacki [Neural, Parallel, Sci. Comput. 4 (1996)] published a practical numerical method for a certain class of ODEs, based upon modified Picard iteration, that generates the Maclaurin series of the solution to arbitrarily high order. The applicable class of ODEs consists of first-order, autonomous systems whose right-hand side functions (generators) are projectively polynomial; that is, they can be written as polynomials in the unknowns. The class is wider than might be expected. The method is ideally suited to the classical N-body problem, which is projectively polynomial. Here, we recast the N-body problem in polynomial form and develop a Picard-based algorithm for its solution. The algorithm is highly accurate, parameter-free, and simultaneously adaptive in time and order. Test cases for both benign and chaotic N-body systems reveal that optimal order is dynamic. That is, in addition to dependency upon N and the desired accuracy, optimal order depends upon the configuration of the bodies at any instant
Lorentz covariant canonical symplectic algorithms for dynamics of charged particles
Wang, Yulei; Liu, Jian; Qin, Hong
2016-12-01
In this paper, the Lorentz covariance of algorithms is introduced. Under Lorentz transformation, both the form and performance of a Lorentz covariant algorithm are invariant. To acquire the advantages of symplectic algorithms and Lorentz covariance, a general procedure for constructing Lorentz covariant canonical symplectic algorithms (LCCSAs) is provided, based on which an explicit LCCSA for dynamics of relativistic charged particles is built. LCCSA possesses Lorentz invariance as well as long-term numerical accuracy and stability, due to the preservation of a discrete symplectic structure and the Lorentz symmetry of the system. For situations with time-dependent electromagnetic fields, which are difficult to handle in traditional construction procedures of symplectic algorithms, LCCSA provides a perfect explicit canonical symplectic solution by implementing the discretization in 4-spacetime. We also show that LCCSA has built-in energy-based adaptive time steps, which can optimize the computation performance when the Lorentz factor varies.
A symplectic framework for field theories
International Nuclear Information System (INIS)
Kijowski, J.; Tulczyjew, W.M.
1979-01-01
These notes are concerned with the formulation of a new conceptual framework for classical field theories. Although the formulation is based on fairly advanced concepts of symplectic geometry these notes cannot be viewed as a reformulation of known structures in more rigorous and elegant torns. Our intention is rather to communicate to theoretical physicists a set of new physical ideas. We have chosen for this purpose the language of local coordinates which is more elementary and more widely known than the abstract language of modern differntial geometry. Our emphasis is directed more to physical intentions than to mathematical vigour. We start with a symplectic analysis of staties. Both discrete and continuous systems are considered on a largely intuitive level. The notion of reciprocity and potentiality of the theory is discussed. Chapter II is a presentation of particle dynamics together with more rigorous definitions of the geometric structure. Lagrangian-Submanifolds and their generating function 3 are defined and the time evolution of particle states is studied. Chapter II form the main part of these notes. Here we describe the construction of canonical momenta and discuss the field dynamics in finite domains of space-time. We also establish the relation between our symplectic framework and the geometric formulation of the calculus of variations of multiple integrals. In the following chapter we give a few examples of field theories selected to illustrate various features of the new approach. A new formulation of the theory of gravity consists of using the affine connection in space-time as the field configuration. In the past section we present an analysis of hydrodynamics within our framework which reveals a formal analogy with electrodynamics. The discovery of potentials for hydrodynamics and the subsequent formulation of a variational principle provides an excellent example for the fruitfulness of the new approach to field theory. A short review of
Higher-order force gradient symplectic algorithms
Chin, Siu A.; Kidwell, Donald W.
2000-12-01
We show that a recently discovered fourth order symplectic algorithm, which requires one evaluation of force gradient in addition to three evaluations of the force, when iterated to higher order, yielded algorithms that are far superior to similarly iterated higher order algorithms based on the standard Forest-Ruth algorithm. We gauge the accuracy of each algorithm by comparing the step-size independent error functions associated with energy conservation and the rotation of the Laplace-Runge-Lenz vector when solving a highly eccentric Kepler problem. For orders 6, 8, 10, and 12, the new algorithms are approximately a factor of 103, 104, 104, and 105 better.
On Non-Abelian Symplectic Cutting
DEFF Research Database (Denmark)
Martens, Johan; Thaddeus, Michael
2012-01-01
We discuss symplectic cutting for Hamiltonian actions of non-Abelian compact groups. By using a degeneration based on the Vinberg monoid we give, in good cases, a global quotient description of a surgery construction introduced by Woodward and Meinrenken, and show it can be interpreted in algebro......-geometric terms. A key ingredient is the `universal cut' of the cotangent bundle of the group itself, which is identified with a moduli space of framed bundles on chains of projective lines recently introduced by the authors....
ZENO: N-body and SPH Simulation Codes
Barnes, Joshua E.
2011-02-01
The ZENO software package integrates N-body and SPH simulation codes with a large array of programs to generate initial conditions and analyze numerical simulations. Written in C, the ZENO system is portable between Mac, Linux, and Unix platforms. It is in active use at the Institute for Astronomy (IfA), at NRAO, and possibly elsewhere. Zeno programs can perform a wide range of simulation and analysis tasks. While many of these programs were first created for specific projects, they embody algorithms of general applicability and embrace a modular design strategy, so existing code is easily applied to new tasks. Major elements of the system include: Structured data file utilities facilitate basic operations on binary data, including import/export of ZENO data to other systems.Snapshot generation routines create particle distributions with various properties. Systems with user-specified density profiles can be realized in collisionless or gaseous form; multiple spherical and disk components may be set up in mutual equilibrium.Snapshot manipulation routines permit the user to sift, sort, and combine particle arrays, translate and rotate particle configurations, and assign new values to data fields associated with each particle.Simulation codes include both pure N-body and combined N-body/SPH programs: Pure N-body codes are available in both uniprocessor and parallel versions.SPH codes offer a wide range of options for gas physics, including isothermal, adiabatic, and radiating models. Snapshot analysis programs calculate temporal averages, evaluate particle statistics, measure shapes and density profiles, compute kinematic properties, and identify and track objects in particle distributions.Visualization programs generate interactive displays and produce still images and videos of particle distributions; the user may specify arbitrary color schemes and viewing transformations.
Cosmological N -body simulations including radiation perturbations
DEFF Research Database (Denmark)
Brandbyge, Jacob; Rampf, Cornelius; Tram, Thomas
2017-01-01
CosmologicalN-body simulations are the standard tools to study the emergence of the observed large-scale structure of the Universe. Such simulations usually solve for the gravitational dynamics of matter within the Newtonian approximation, thus discarding general relativistic effects such as the ......CosmologicalN-body simulations are the standard tools to study the emergence of the observed large-scale structure of the Universe. Such simulations usually solve for the gravitational dynamics of matter within the Newtonian approximation, thus discarding general relativistic effects...
Symplectic invariants, entropic measures and correlations of Gaussian states
Energy Technology Data Exchange (ETDEWEB)
Serafini, Alessio; Illuminati, Fabrizio; Siena, Silvio De [Dipartimento di Fisica ' E R Caianiello' , Universita di Salerno, INFM UdR Salerno, INFN Sezione di Napoli, Gruppo Collegato di Salerno, Via S Allende, 84081 Baronissi, SA (Italy)
2004-01-28
We present a derivation of the Von Neumann entropy and mutual information of arbitrary two-mode Gaussian states, based on the explicit determination of the symplectic eigenvalues of a generic covariance matrix. The key role of the symplectic invariants in such a determination is pointed out. We show that the Von Neumann entropy depends on two symplectic invariants, while the purity (or the linear entropy) is determined by only one invariant, so that the two quantities provide two different hierarchies of mixed Gaussian states. A comparison between mutual information and entanglement of formation for symmetric states is considered, taking note of the crucial role of the symplectic eigenvalues in qualifying and quantifying the correlations present in a generic state. (letter to the editor)
Symplectic invariants, entropic measures and correlations of Gaussian states
International Nuclear Information System (INIS)
Serafini, Alessio; Illuminati, Fabrizio; Siena, Silvio De
2004-01-01
We present a derivation of the Von Neumann entropy and mutual information of arbitrary two-mode Gaussian states, based on the explicit determination of the symplectic eigenvalues of a generic covariance matrix. The key role of the symplectic invariants in such a determination is pointed out. We show that the Von Neumann entropy depends on two symplectic invariants, while the purity (or the linear entropy) is determined by only one invariant, so that the two quantities provide two different hierarchies of mixed Gaussian states. A comparison between mutual information and entanglement of formation for symmetric states is considered, taking note of the crucial role of the symplectic eigenvalues in qualifying and quantifying the correlations present in a generic state. (letter to the editor)
The GL(1 vertical stroke 1)-symplectic fermion correspondence
International Nuclear Information System (INIS)
Creutzig, Thomas; Roenne, Peter B.
2008-12-01
In this note we prove a correspondence between the Wess-Zumino-Novikov-Witten model of the Lie supergroup GL(1 vertical stroke 1) and a free model consisting of two scalars and a pair of symplectic fermions. This model was discussed earlier by LeClair. Vertex operators for the symplectic fermions include twist fields, and correlation functions of GL(1 vertical stroke 1) agree with the known results for the scalars and symplectic fermions. We perform a detailed study of boundary states for symplectic fermions and apply them to branes in GL(1 vertical stroke 1). This allows us to compute new amplitudes of strings stretching between branes of different types and confirming Cardy's condition. (orig.)
The GL(1 vertical stroke 1)-symplectic fermion correspondence
Energy Technology Data Exchange (ETDEWEB)
Creutzig, Thomas; Roenne, Peter B.
2008-12-15
In this note we prove a correspondence between the Wess-Zumino-Novikov-Witten model of the Lie supergroup GL(1 vertical stroke 1) and a free model consisting of two scalars and a pair of symplectic fermions. This model was discussed earlier by LeClair. Vertex operators for the symplectic fermions include twist fields, and correlation functions of GL(1 vertical stroke 1) agree with the known results for the scalars and symplectic fermions. We perform a detailed study of boundary states for symplectic fermions and apply them to branes in GL(1 vertical stroke 1). This allows us to compute new amplitudes of strings stretching between branes of different types and confirming Cardy's condition. (orig.)
Transversity results and computations in symplectic field theory
International Nuclear Information System (INIS)
Fabert, Oliver
2008-01-01
Although the definition of symplectic field theory suggests that one has to count holomorphic curves in cylindrical manifolds R x V equipped with a cylindrical almost complex structure J, it is already well-known from Gromov-Witten theory that, due to the presence of multiply-covered curves, we in general cannot achieve transversality for all moduli spaces even for generic choices of J. In this thesis we treat the transversality problem of symplectic field theory in two important cases. In the first part of this thesis we are concerned with the rational symplectic field theory of Hamiltonian mapping tori, which is also called the Floer case. For this observe that in the general geometric setup for symplectic field theory, the contact manifolds can be replaced by mapping tori M φ of symplectic manifolds (M,ω M ) with symplectomorphisms φ. While the cylindrical contact homology of M φ is given by the Floer homologies of powers of φ, the other algebraic invariants of symplectic field theory for M φ provide natural generalizations of symplectic Floer homology. For symplectically aspherical M and Hamiltonian φ we study the moduli spaces of rational curves and prove a transversality result, which does not need the polyfold theory by Hofer, Wysocki and Zehnder and allows us to compute the full contact homology of M φ ≅ S 1 x M. The second part of this thesis is devoted to the branched covers of trivial cylinders over closed Reeb orbits, which are the trivial examples of punctured holomorphic curves studied in rational symplectic field theory. Since all moduli spaces of trivial curves with virtual dimension one cannot be regular, we use obstruction bundles in order to find compact perturbations making the Cauchy-Riemann operator transversal to the zero section and show that the algebraic count of elements in the resulting regular moduli spaces is zero. Once the analytical foundations of symplectic field theory are established, our result implies that the
Transversity results and computations in symplectic field theory
Energy Technology Data Exchange (ETDEWEB)
Fabert, Oliver
2008-02-21
Although the definition of symplectic field theory suggests that one has to count holomorphic curves in cylindrical manifolds R x V equipped with a cylindrical almost complex structure J, it is already well-known from Gromov-Witten theory that, due to the presence of multiply-covered curves, we in general cannot achieve transversality for all moduli spaces even for generic choices of J. In this thesis we treat the transversality problem of symplectic field theory in two important cases. In the first part of this thesis we are concerned with the rational symplectic field theory of Hamiltonian mapping tori, which is also called the Floer case. For this observe that in the general geometric setup for symplectic field theory, the contact manifolds can be replaced by mapping tori M{sub {phi}} of symplectic manifolds (M,{omega}{sub M}) with symplectomorphisms {phi}. While the cylindrical contact homology of M{sub {phi}} is given by the Floer homologies of powers of {phi}, the other algebraic invariants of symplectic field theory for M{sub {phi}} provide natural generalizations of symplectic Floer homology. For symplectically aspherical M and Hamiltonian {phi} we study the moduli spaces of rational curves and prove a transversality result, which does not need the polyfold theory by Hofer, Wysocki and Zehnder and allows us to compute the full contact homology of M{sub {phi}} {approx_equal} S{sup 1} x M. The second part of this thesis is devoted to the branched covers of trivial cylinders over closed Reeb orbits, which are the trivial examples of punctured holomorphic curves studied in rational symplectic field theory. Since all moduli spaces of trivial curves with virtual dimension one cannot be regular, we use obstruction bundles in order to find compact perturbations making the Cauchy-Riemann operator transversal to the zero section and show that the algebraic count of elements in the resulting regular moduli spaces is zero. Once the analytical foundations of symplectic
Fedosov’s formal symplectic groupoids and contravariant connections
Karabegov, Alexander V.
2006-10-01
Using Fedosov's approach we give a geometric construction of a formal symplectic groupoid over any Poisson manifold endowed with a torsion-free Poisson contravariant connection. In the case of Kähler-Poisson manifolds this construction provides, in particular, the formal symplectic groupoids with separation of variables. We show that the dual of a semisimple Lie algebra does not admit torsion-free Poisson contravariant connections.
Smooth maps of a foliated manifold in a symplectic manifold
Indian Academy of Sciences (India)
Abstract. Let M be a smooth manifold with a regular foliation F and a 2-form ω which induces closed forms on the leaves of F in the leaf topology. A smooth map f : (M, F) −→ (N,σ) in a symplectic manifold (N,σ) is called a foliated symplectic immersion if f restricts to an immersion on each leaf of the foliation and further, the.
Symmetries of the Space of Linear Symplectic Connections
Fox, Daniel J. F.
2017-01-01
There is constructed a family of Lie algebras that act in a Hamiltonian way on the symplectic affine space of linear symplectic connections on a symplectic manifold. The associated equivariant moment map is a formal sum of the Cahen-Gutt moment map, the Ricci tensor, and a translational term. The critical points of a functional constructed from it interpolate between the equations for preferred symplectic connections and the equations for critical symplectic connections. The commutative algebra of formal sums of symmetric tensors on a symplectic manifold carries a pair of compatible Poisson structures, one induced from the canonical Poisson bracket on the space of functions on the cotangent bundle polynomial in the fibers, and the other induced from the algebraic fiberwise Schouten bracket on the symmetric algebra of each fiber of the cotangent bundle. These structures are shown to be compatible, and the required Lie algebras are constructed as central extensions of their! linear combinations restricted to formal sums of symmetric tensors whose first order term is a multiple of the differential of its zeroth order term.
A modified symplectic PRK scheme for seismic wave modeling
Liu, Shaolin; Yang, Dinghui; Ma, Jian
2017-02-01
A new scheme for the temporal discretization of the seismic wave equation is constructed based on symplectic geometric theory and a modified strategy. The ordinary differential equation in terms of time, which is obtained after spatial discretization via the spectral-element method, is transformed into a Hamiltonian system. A symplectic partitioned Runge-Kutta (PRK) scheme is used to solve the Hamiltonian system. A term related to the multiplication of the spatial discretization operator with the seismic wave velocity vector is added into the symplectic PRK scheme to create a modified symplectic PRK scheme. The symplectic coefficients of the new scheme are determined via Taylor series expansion. The positive coefficients of the scheme indicate that its long-term computational capability is more powerful than that of conventional symplectic schemes. An exhaustive theoretical analysis reveals that the new scheme is highly stable and has low numerical dispersion. The results of three numerical experiments demonstrate the high efficiency of this method for seismic wave modeling.
An adaptive N-body algorithm of optimal order
Pruett, C D; Lacy, J M
2003-01-01
Picard iteration is normally considered a theoretical tool whose primary utility is to establish the existence and uniqueness of solutions to first-order systems of ordinary differential equations (ODEs). However, in 1996, Parker and Sochacki [Neural, Parallel, Sci. Comput. 4 (1996)] published a practical numerical method for a certain class of ODEs, based upon modified Picard iteration, that generates the Maclaurin series of the solution to arbitrarily high order. The applicable class of ODEs consists of first-order, autonomous systems whose right-hand side functions (generators) are projectively polynomial; that is, they can be written as polynomials in the unknowns. The class is wider than might be expected. The method is ideally suited to the classical N-body problem, which is projectively polynomial. Here, we recast the N-body problem in polynomial form and develop a Picard-based algorithm for its solution. The algorithm is highly accurate, parameter-free, and simultaneously adaptive in time and order. T...
Poisson traces, D-modules, and symplectic resolutions.
Etingof, Pavel; Schedler, Travis
2018-01-01
We survey the theory of Poisson traces (or zeroth Poisson homology) developed by the authors in a series of recent papers. The goal is to understand this subtle invariant of (singular) Poisson varieties, conditions for it to be finite-dimensional, its relationship to the geometry and topology of symplectic resolutions, and its applications to quantizations. The main technique is the study of a canonical D-module on the variety. In the case the variety has finitely many symplectic leaves (such as for symplectic singularities and Hamiltonian reductions of symplectic vector spaces by reductive groups), the D-module is holonomic, and hence, the space of Poisson traces is finite-dimensional. As an application, there are finitely many irreducible finite-dimensional representations of every quantization of the variety. Conjecturally, the D-module is the pushforward of the canonical D-module under every symplectic resolution of singularities, which implies that the space of Poisson traces is dual to the top cohomology of the resolution. We explain many examples where the conjecture is proved, such as symmetric powers of du Val singularities and symplectic surfaces and Slodowy slices in the nilpotent cone of a semisimple Lie algebra. We compute the D-module in the case of surfaces with isolated singularities and show it is not always semisimple. We also explain generalizations to arbitrary Lie algebras of vector fields, connections to the Bernstein-Sato polynomial, relations to two-variable special polynomials such as Kostka polynomials and Tutte polynomials, and a conjectural relationship with deformations of symplectic resolutions. In the appendix we give a brief recollection of the theory of D-modules on singular varieties that we require.
Poisson traces, D-modules, and symplectic resolutions
Etingof, Pavel; Schedler, Travis
2018-03-01
We survey the theory of Poisson traces (or zeroth Poisson homology) developed by the authors in a series of recent papers. The goal is to understand this subtle invariant of (singular) Poisson varieties, conditions for it to be finite-dimensional, its relationship to the geometry and topology of symplectic resolutions, and its applications to quantizations. The main technique is the study of a canonical D-module on the variety. In the case the variety has finitely many symplectic leaves (such as for symplectic singularities and Hamiltonian reductions of symplectic vector spaces by reductive groups), the D-module is holonomic, and hence, the space of Poisson traces is finite-dimensional. As an application, there are finitely many irreducible finite-dimensional representations of every quantization of the variety. Conjecturally, the D-module is the pushforward of the canonical D-module under every symplectic resolution of singularities, which implies that the space of Poisson traces is dual to the top cohomology of the resolution. We explain many examples where the conjecture is proved, such as symmetric powers of du Val singularities and symplectic surfaces and Slodowy slices in the nilpotent cone of a semisimple Lie algebra. We compute the D-module in the case of surfaces with isolated singularities and show it is not always semisimple. We also explain generalizations to arbitrary Lie algebras of vector fields, connections to the Bernstein-Sato polynomial, relations to two-variable special polynomials such as Kostka polynomials and Tutte polynomials, and a conjectural relationship with deformations of symplectic resolutions. In the appendix we give a brief recollection of the theory of D-modules on singular varieties that we require.
A symplectic coherent beam-beam model
International Nuclear Information System (INIS)
Furman, M.A.
1989-05-01
We consider a simple one-dimensional model to study the effects of the beam-beam force on the coherent dynamics of colliding beams. The key ingredient is a linearized beam-beam kick. We study only the quadrupole modes, with the dynamical variables being the 2nd-order moments of the canonical variables q, p. Our model is self-consistent in the sense that no higher order moments are generated by the linearized beam-beam kicks, and that the only source of violation of symplecticity is the radiation. We discuss the round beam case only, in which vertical and horizontal quantities are assumed to be equal (though they may be different in the two beams). Depending on the values of the tune and beam intensity, we observe steady states in which otherwise identical bunches have sizes that are equal, or unequal, or periodic, or behave chaotically from turn to turn. Possible implications of luminosity saturation with increasing beam intensity are discussed. Finally, we present some preliminary applications to an asymmetric collider. 8 refs., 8 figs
A symplectic integration method for elastic filaments
Ladd, Tony; Misra, Gaurav
2009-03-01
Elastic rods are a ubiquitous coarse-grained model of semi-flexible biopolymers such as DNA, actin, and microtubules. The Worm-Like Chain (WLC) is the standard numerical model for semi-flexible polymers, but it is only a linearized approximation to the dynamics of an elastic rod, valid for small deflections; typically the torsional motion is neglected as well. In the standard finite-difference and finite-element formulations of an elastic rod, the continuum equations of motion are discretized in space and time, but it is then difficult to ensure that the Hamiltonian structure of the exact equations is preserved. Here we discretize the Hamiltonian itself, expressed as a line integral over the contour of the filament. This discrete representation of the continuum filament can then be integrated by one of the explicit symplectic integrators frequently used in molecular dynamics. The model systematically approximates the continuum partial differential equations, but has the same level of computational complexity as molecular dynamics and is constraint free. Numerical tests show that the algorithm is much more stable than a finite-difference formulation and can be used for high aspect ratio filaments, such as actin. We present numerical results for the deterministic and stochastic motion of single filaments.
Free and constrained symplectic integrators for numerical general relativity
International Nuclear Information System (INIS)
Richter, Ronny; Lubich, Christian
2008-01-01
We consider symplectic time integrators in numerical general relativity and discuss both free and constrained evolution schemes. For free evolution of ADM-like equations we propose the use of the Stoermer-Verlet method, a standard symplectic integrator which here is explicit in the computationally expensive curvature terms. For the constrained evolution we give a formulation of the evolution equations that enforces the momentum constraints in a holonomically constrained Hamiltonian system and turns the Hamilton constraint function from a weak to a strong invariant of the system. This formulation permits the use of the constraint-preserving symplectic RATTLE integrator, a constrained version of the Stoermer-Verlet method. The behavior of the methods is illustrated on two effectively (1+1)-dimensional versions of Einstein's equations, which allow us to investigate a perturbed Minkowski problem and the Schwarzschild spacetime. We compare symplectic and non-symplectic integrators for free evolution, showing very different numerical behavior for nearly-conserved quantities in the perturbed Minkowski problem. Further we compare free and constrained evolution, demonstrating in our examples that enforcing the momentum constraints can turn an unstable free evolution into a stable constrained evolution. This is demonstrated in the stabilization of a perturbed Minkowski problem with Dirac gauge, and in the suppression of the propagation of boundary instabilities into the interior of the domain in Schwarzschild spacetime
Multi-symplectic Preissmann methods for generalized Zakharov-Kuznetsov equation
International Nuclear Information System (INIS)
Wang Junjie; Yang Kuande; Wang Liantang
2012-01-01
Generalized Zakharov-Kuznetsov equation, a typical nonlinear wave equation, was studied based on the multi-symplectic theory in Hamilton space. The multi-symplectic formulations of generalized Zakharov-Kuznetsov equation with several conservation laws are presented. The multi-symplectic Preissmann method is used to discretize the formulations. The numerical experiment is given, and the results verify the efficiency of the multi-symplectic scheme. (authors)
Canonical and symplectic analysis for three dimensional gravity without dynamics
Energy Technology Data Exchange (ETDEWEB)
Escalante, Alberto, E-mail: aescalan@ifuap.buap.mx [Instituto de Física, Benemérita Universidad Autónoma de Puebla, Apartado Postal J-48 72570, Puebla, Pue. (Mexico); Osmart Ochoa-Gutiérrez, H. [Facultad de Ciencias Físico Matemáticas, Benemérita Universidad Autónoma de Puebla, Apartado postal 1152, 72001 Puebla, Pue. (Mexico)
2017-03-15
In this paper a detailed Hamiltonian analysis of three-dimensional gravity without dynamics proposed by V. Hussain is performed. We report the complete structure of the constraints and the Dirac brackets are explicitly computed. In addition, the Faddeev–Jackiw symplectic approach is developed; we report the complete set of Faddeev–Jackiw constraints and the generalized brackets, then we show that the Dirac and the generalized Faddeev–Jackiw brackets coincide to each other. Finally, the similarities and advantages between Faddeev–Jackiw and Dirac’s formalism are briefly discussed. - Highlights: • We report the symplectic analysis for three dimensional gravity without dynamics. • We report the Faddeev–Jackiw constraints. • A pure Dirac’s analysis is performed. • The complete structure of Dirac’s constraints is reported. • We show that symplectic and Dirac’s brackets coincide to each other.
Explicit high-order non-canonical symplectic particle-in-cell algorithms for Vlasov-Maxwell systems
International Nuclear Information System (INIS)
Xiao, Jianyuan; Liu, Jian; He, Yang; Zhang, Ruili; Qin, Hong; Sun, Yajuan
2015-01-01
Explicit high-order non-canonical symplectic particle-in-cell algorithms for classical particle-field systems governed by the Vlasov-Maxwell equations are developed. The algorithms conserve a discrete non-canonical symplectic structure derived from the Lagrangian of the particle-field system, which is naturally discrete in particles. The electromagnetic field is spatially discretized using the method of discrete exterior calculus with high-order interpolating differential forms for a cubic grid. The resulting time-domain Lagrangian assumes a non-canonical symplectic structure. It is also gauge invariant and conserves charge. The system is then solved using a structure-preserving splitting method discovered by He et al. [preprint http://arxiv.org/abs/arXiv:1505.06076 (2015)], which produces five exactly soluble sub-systems, and high-order structure-preserving algorithms follow by combinations. The explicit, high-order, and conservative nature of the algorithms is especially suitable for long-term simulations of particle-field systems with extremely large number of degrees of freedom on massively parallel supercomputers. The algorithms have been tested and verified by the two physics problems, i.e., the nonlinear Landau damping and the electron Bernstein wave
Explicit high-order non-canonical symplectic particle-in-cell algorithms for Vlasov-Maxwell systems
Energy Technology Data Exchange (ETDEWEB)
Xiao, Jianyuan [School of Nuclear Science and Technology and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China; Key Laboratory of Geospace Environment, CAS, Hefei, Anhui 230026, China; Qin, Hong [School of Nuclear Science and Technology and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China; Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543, USA; Liu, Jian [School of Nuclear Science and Technology and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China; Key Laboratory of Geospace Environment, CAS, Hefei, Anhui 230026, China; He, Yang [School of Nuclear Science and Technology and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China; Key Laboratory of Geospace Environment, CAS, Hefei, Anhui 230026, China; Zhang, Ruili [School of Nuclear Science and Technology and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China; Key Laboratory of Geospace Environment, CAS, Hefei, Anhui 230026, China; Sun, Yajuan [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190, China
2015-11-01
Explicit high-order non-canonical symplectic particle-in-cell algorithms for classical particle-field systems governed by the Vlasov-Maxwell equations are developed. The algorithms conserve a discrete non-canonical symplectic structure derived from the Lagrangian of the particle-field system, which is naturally discrete in particles. The electromagnetic field is spatially discretized using the method of discrete exterior calculus with high-order interpolating differential forms for a cubic grid. The resulting time-domain Lagrangian assumes a non-canonical symplectic structure. It is also gauge invariant and conserves charge. The system is then solved using a structure-preserving splitting method discovered by He et al. [preprint arXiv: 1505.06076 (2015)], which produces five exactly soluble sub-systems, and high-order structure-preserving algorithms follow by combinations. The explicit, high-order, and conservative nature of the algorithms is especially suitable for long-term simulations of particle-field systems with extremely large number of degrees of freedom on massively parallel supercomputers. The algorithms have been tested and verified by the two physics problems, i.e., the nonlinear Landau damping and the electron Bernstein wave. (C) 2015 AIP Publishing LLC.
Explicit K-symplectic algorithms for charged particle dynamics
International Nuclear Information System (INIS)
He, Yang; Zhou, Zhaoqi; Sun, Yajuan; Liu, Jian; Qin, Hong
2017-01-01
We study the Lorentz force equation of charged particle dynamics by considering its K-symplectic structure. As the Hamiltonian of the system can be decomposed as four parts, we are able to construct the numerical methods that preserve the K-symplectic structure based on Hamiltonian splitting technique. The newly derived numerical methods are explicit, and are shown in numerical experiments to be stable over long-term simulation. The error convergency as well as the long term energy conservation of the numerical solutions is also analyzed by means of the Darboux transformation.
Proton spin tracking with symplectic integration of orbit motion
Energy Technology Data Exchange (ETDEWEB)
Luo, Y. [Brookhaven National Lab. (BNL), Upton, NY (United States); Dutheil, Y. [Brookhaven National Lab. (BNL), Upton, NY (United States); Huang, H. [Brookhaven National Lab. (BNL), Upton, NY (United States); Meot, F. [Brookhaven National Lab. (BNL), Upton, NY (United States); Ranjbar, V. [Brookhaven National Lab. (BNL), Upton, NY (United States)
2015-05-03
Symplectic integration had been adopted for orbital motion tracking in code SimTrack. SimTrack has been extensively used for dynamic aperture calculation with beam-beam interaction for the Relativistic Heavy Ion Collider (RHIC). Recently proton spin tracking has been implemented on top of symplectic orbital motion in this code. In this article, we will explain the implementation of spin motion based on Thomas-BMT equation, and the benchmarking with other spin tracking codes currently used for RHIC. Examples to calculate spin closed orbit and spin tunes are presented too.
Explicit K-symplectic algorithms for charged particle dynamics
Energy Technology Data Exchange (ETDEWEB)
He, Yang [School of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083 (China); Zhou, Zhaoqi [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190 (China); Sun, Yajuan, E-mail: sunyj@lsec.cc.ac.cn [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190 (China); University of Chinese Academy of Sciences, Beijing 100049 (China); Liu, Jian [Department of Modern Physics and School of Nuclear Science and Technology, University of Science and Technology of China, Hefei, Anhui 230026 (China); Key Laboratory of Geospace Environment, CAS, Hefei, Anhui 230026 (China); Qin, Hong [Department of Modern Physics and School of Nuclear Science and Technology, University of Science and Technology of China, Hefei, Anhui 230026 (China); Plasma Physics Laboratory, Princeton University, Princeton, NJ 08543 (United States)
2017-02-12
We study the Lorentz force equation of charged particle dynamics by considering its K-symplectic structure. As the Hamiltonian of the system can be decomposed as four parts, we are able to construct the numerical methods that preserve the K-symplectic structure based on Hamiltonian splitting technique. The newly derived numerical methods are explicit, and are shown in numerical experiments to be stable over long-term simulation. The error convergency as well as the long term energy conservation of the numerical solutions is also analyzed by means of the Darboux transformation.
Rotation number of integrable symplectic mappings of the plane
Energy Technology Data Exchange (ETDEWEB)
Zolkin, Timofey [Fermilab; Nagaitsev, Sergei [Fermilab; Danilov, Viatcheslav [Oak Ridge
2017-04-11
Symplectic mappings are discrete-time analogs of Hamiltonian systems. They appear in many areas of physics, including, for example, accelerators, plasma, and fluids. Integrable mappings, a subclass of symplectic mappings, are equivalent to a Twist map, with a rotation number, constant along the phase trajectory. In this letter, we propose a succinct expression to determine the rotation number and present two examples. Similar to the period of the bounded motion in Hamiltonian systems, the rotation number is the most fundamental property of integrable maps and it provides a way to analyze the phase-space dynamics.
Major shell centroids in the symplectic collective model
International Nuclear Information System (INIS)
Draayer, J.P.; Rosensteel, G.; Tulane Univ., New Orleans, LA
1983-01-01
Analytic expressions are given for the major shell centroids of the collective potential V(#betta#, #betta#) and the shape observable #betta# 2 in the Sp(3,R) symplectic model. The tools of statistical spectroscopy are shown to be useful, firstly, in translating a requirement that the underlying shell structure be preserved into constraints on the parameters of the collective potential and, secondly, in giving a reasonable estimate for a truncation of the infinite dimensional symplectic model space from experimental B(E2) transition strengths. Results based on the centroid information are shown to compare favorably with results from exact calculations in the case of 20 Ne. (orig.)
Composite particles and symplectic (Semi-) groups
International Nuclear Information System (INIS)
Kramer, P.
1978-01-01
Nuclear composits particle dynamics is intimately related to the fermion character of nucleons. This property is implemented via the permutational structure of nuclear states, leading to the concept of exchange and to the quantum number of the orbital partition. We review Weyl operators and representations of linear canonical transformations in Bargmann Hilbert space. In section 4 we use canonical transformations to describe the general n-body dynamics. In section 5 we derive the composite particle dynamics and discuss an algorithm to obtain the interaction of composite particles whose constituents are assumed to be in harmonic oscillator states. As a first example we treat in section 6 composite particles with unexcited internal oscillator states. In section 7 we deal with composite particles of internal oscillator shell configurations. (orig.) [de
Symplectic and Hamiltonian structures of nonlinear evolution equations
International Nuclear Information System (INIS)
Dorfman, I.Y.
1993-01-01
A Hamiltonian structure on a finite-dimensional manifold can be introduced either by endowing it with a (pre)symplectic structure, or by describing the Poisson bracket with the help of a tensor with two upper indices named the Poisson structure. Under the assumption of nondegeneracy, the Poisson structure is nothing else than the inverse of the symplectic structure. Also in the degenerate case the distinction between the two approaches is almost insignificant, because both presymplectic and Poisson structures split into symplectic structures on leaves of appropriately chosen foliations. Hamiltonian structures that arise in the theory of evolution equations demonstrate something new in this respect: trying to operate in local terms, one is induced to develop both approaches independently. Hamiltonian operators, being the infinite-dimensional counterparts of Poisson structures, were the first to become the subject of investigations. A considerable period of time passed before the papers initiated research in the theory of symplectic operators, being the counterparts of presymplectic structures. In what follows, we focus on the main achievements in this field
Symplectic dynamics of the nuclear mean-field
International Nuclear Information System (INIS)
Grigorescu, Marius
1996-01-01
Collective and microscopic pictures of the nuclear dynamics are related in the frame of time-dependent variational principle on symplectic trial manifolds. For symmetry braking systems such manifolds are constructed by cranking, and applied to study the nuclear isovector collective excitations. (author)
A survey of open problems in symplectic integration
Energy Technology Data Exchange (ETDEWEB)
McLachlan, R.I. [Univ. of Colorado, Boulder, CO (United States); Scovel, C. [Los Alamos National Lab., NM (United States)
1993-10-15
In the past few years there has been a substantial amount of research on symplectic integration. The subject is only part of a program concerned with numerically preserving a system`s inherent geometrical structures. Volume preservation, reversibility, local conservation laws for elliptic equations, and systems with integral invariants are but a few examples of such invariant structures. In many cases one requires a numerical method to stay in the smallest possible appropriate group of phase space maps. It is not the authors` opinion that symplecticity, for example, automatically makes a numerical method superior to all others, but it is their opinion that it should be taken seriously and that a conscious, informed decision be made in that regard. The authors present here a survey of open problems in symplectic integration, including other problems from the larger program. This is not intended as a review of symplectic integration and is naturally derived from the authors` own research interests. At present, this survey is incomplete, but the authors hope the help of the colleagues to be able to include in the proceedings of this conference a more comprehensive survey. Many of the problems mentioned here call for numerical experimentation, some for application of suggested but untested methods, some for new methods, and some for theorems, Some envisage large research programs.
A Note on Symplectic, Multisymplectic Scheme in Finite Element Method
Institute of Scientific and Technical Information of China (English)
GUO Han-Ying; JI Xiao-Mei; LI Yu-Qi; WU Ke
2001-01-01
We find that with uniform mesh, the numerical schemes derived from finite element method can keep a preserved symplectic structure in one-dimensional case and a preserved multisymplectic structure in two-dimensional case respectively. These results are in fact the intrinsic reason why the numerical experiments show that such finite element algorithms are accurate in practice.``
Relative symplectic caps, 4-genus and fibered knots
Indian Academy of Sciences (India)
convex boundary embeds in a closed symplectic 4-manifold. ... We shall apply Theorem 1.2 in particular to study the 4-genus of a link in S3 by proving ...... [13] Honda Ko, Factoring nonrotative T 2×I layers, Erratum: On the classification of tight.
Local symplectic operators and structures related to them
International Nuclear Information System (INIS)
Dorfman, I.Y.; Mokhov, O.I.
1991-01-01
Matrices with entries being differential operators, that endow the phase space of an evolution system with a (pre)symplectic structure are considered. Special types of such structures are explicitly described. Links with integrability, geometry of loop spaces, and Baecklund transformations are traces
Deformations of coisotropic submanifolds in locally conformal symplectic manifolds
Czech Academy of Sciences Publication Activity Database
Le, Hong-Van; Oh, Y.-G.
2016-01-01
Roč. 20, č. 3 (2016), s. 553-596 ISSN 1093-6106 Institutional support: RVO:67985840 Keywords : locally conformal symplectic manifold * coisotropic submanifold * b-twisted differential * bulk deformation Subject RIV: BA - General Mathematics Impact factor: 0.895, year: 2016 http://intlpress.com/site/pub/pages/journals/items/ajm/content/vols/0020/0003/a007/index.html
Deformations of Lagrangian subvarieties of holomorphic symplectic manifolds
Lehn, Christian
2011-01-01
We generalize Voisin's theorem on deformations of pairs of a symplectic manifold and a Lagrangian submanifold to the case of Lagrangian normal crossing subvarieties. Partial results are obtained for arbitrary Lagrangian subvarieties. We apply our results to the study of singular fibers of Lagrangian fibrations.
GANDALF - Graphical Astrophysics code for N-body Dynamics And Lagrangian Fluids
Hubber, D. A.; Rosotti, G. P.; Booth, R. A.
2018-01-01
GANDALF is a new hydrodynamics and N-body dynamics code designed for investigating planet formation, star formation and star cluster problems. GANDALF is written in C++, parallelized with both OPENMP and MPI and contains a PYTHON library for analysis and visualization. The code has been written with a fully object-oriented approach to easily allow user-defined implementations of physics modules or other algorithms. The code currently contains implementations of smoothed particle hydrodynamics, meshless finite-volume and collisional N-body schemes, but can easily be adapted to include additional particle schemes. We present in this paper the details of its implementation, results from the test suite, serial and parallel performance results and discuss the planned future development. The code is freely available as an open source project on the code-hosting website github at https://github.com/gandalfcode/gandalf and is available under the GPLv2 license.
Application of symplectic integrator to numerical fluid analysis
International Nuclear Information System (INIS)
Tanaka, Nobuatsu
2000-01-01
This paper focuses on application of the symplectic integrator to numerical fluid analysis. For the purpose, we introduce Hamiltonian particle dynamics to simulate fluid behavior. The method is based on both the Hamiltonian formulation of a system and the particle methods, and is therefore called Hamiltonian Particle Dynamics (HPD). In this paper, an example of HPD applications, namely the behavior of incompressible inviscid fluid, is solved. In order to improve accuracy of HPD with respect to space, CIVA, which is a highly accurate interpolation method, is combined, but the combined method is subject to problems in that the invariants of the system are not conserved in a long-time computation. For solving the problems, symplectic time integrators are introduced and the effectiveness is confirmed by numerical analyses. (author)
Period mappings with applications to symplectic complex spaces
Kirschner, Tim
2015-01-01
Extending Griffiths’ classical theory of period mappings for compact Kähler manifolds, this book develops and applies a theory of period mappings of “Hodge-de Rham type” for families of open complex manifolds. The text consists of three parts. The first part develops the theory. The second part investigates the degeneration behavior of the relative Frölicher spectral sequence associated to a submersive morphism of complex manifolds. The third part applies the preceding material to the study of irreducible symplectic complex spaces. The latter notion generalizes the idea of an irreducible symplectic manifold, dubbed an irreducible hyperkähler manifold in differential geometry, to possibly singular spaces. The three parts of the work are of independent interest, but intertwine nicely.
Noncommutativity and Duality through the Symplectic Embedding Formalism
Directory of Open Access Journals (Sweden)
Everton M.C. Abreu
2010-07-01
Full Text Available This work is devoted to review the gauge embedding of either commutative and noncommutative (NC theories using the symplectic formalism framework. To sum up the main features of the method, during the process of embedding, the infinitesimal gauge generators of the gauge embedded theory are easily and directly chosen. Among other advantages, this enables a greater control over the final Lagrangian and brings some light on the so-called ''arbitrariness problem''. This alternative embedding formalism also presents a way to obtain a set of dynamically dual equivalent embedded Lagrangian densities which is obtained after a finite number of steps in the iterative symplectic process, oppositely to the result proposed using the BFFT formalism. On the other hand, we will see precisely that the symplectic embedding formalism can be seen as an alternative and an efficient procedure to the standard introduction of the Moyal product in order to produce in a natural way a NC theory. In order to construct a pedagogical explanation of the method to the nonspecialist we exemplify the formalism showing that the massive NC U(1 theory is embedded in a gauge theory using this alternative systematic path based on the symplectic framework. Further, as other applications of the method, we describe exactly how to obtain a Lagrangian description for the NC version of some systems reproducing well known theories. Naming some of them, we use the procedure in the Proca model, the irrotational fluid model and the noncommutative self-dual model in order to obtain dual equivalent actions for these theories. To illustrate the process of noncommutativity introduction we use the chiral oscillator and the nondegenerate mechanics.
Hydrodynamic Covariant Symplectic Structure from Bilinear Hamiltonian Functions
Directory of Open Access Journals (Sweden)
Capozziello S.
2005-07-01
Full Text Available Starting from generic bilinear Hamiltonians, constructed by covariant vector, bivector or tensor fields, it is possible to derive a general symplectic structure which leads to holonomic and anholonomic formulations of Hamilton equations of motion directly related to a hydrodynamic picture. This feature is gauge free and it seems a deep link common to all interactions, electromagnetism and gravity included. This scheme could lead toward a full canonical quantization.
Asymptotic freedom and the symplectic and G2 groups
International Nuclear Information System (INIS)
Chaichian, M; Kolmakov, Yu. N.; Nelipa, N. F.
1978-01-01
It is shown that the symplectic Sp(4), Sp(6) and the exceptional G 2 gauge field theories with complete Spontaneous symmetry breaking through the Higgs mechanism are not asymptotically free. This, together with earlier results for other groups, hints at the existence of a general theorem according to which it would no longer be possible for asymptotic freedom to coexist with the absence of infrared divergences. (author)
Symplectic tomography of nonclassical states of trapped ion
International Nuclear Information System (INIS)
Man'ko, O.
1996-03-01
The marginal distribution for two types of nonclassical states of trapped ion - for squeezed and correlated states and for squeezed even and odd coherent states (squeezed Schroedinger cat states) is studied. The obtained marginal distribution for the two types of states is shown to satisfy classical dynamical equation equivalent to standard quantum evolution equation for density matrix (wave function) derived in symplectic tomography scheme. (author). 20 refs
Symplectic invariants of some families of Lagrangian T3-fibrations
International Nuclear Information System (INIS)
Castano Bernard, R.
2003-12-01
We construct families of Lagrangian 3-torus fibrations resembling the topology of some of the singularities in Topological Mirror Symmetry. We perform a detailed analysis of the affine structure on the base of these fibrations near their discriminant loci. This permits us to classify the aforementioned families up to fibre preserving symplectomorphism. The kind of degenerations we investigate give rise to a large number of symplectic invariants. (author)
Gauge properties of the guiding center variational symplectic integrator
International Nuclear Information System (INIS)
Squire, J.; Tang, W. M.; Qin, H.
2012-01-01
Variational symplectic algorithms have recently been developed for carrying out long-time simulation of charged particles in magnetic fields [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008); H. Qin, X. Guan, and W. Tang, Phys. Plasmas (2009); J. Li, H. Qin, Z. Pu, L. Xie, and S. Fu, Phys. Plasmas 18, 052902 (2011)]. As a direct consequence of their derivation from a discrete variational principle, these algorithms have very good long-time energy conservation, as well as exactly preserving discrete momenta. We present stability results for these algorithms, focusing on understanding how explicit variational integrators can be designed for this type of system. It is found that for explicit algorithms, an instability arises because the discrete symplectic structure does not become the continuous structure in the t→0 limit. We examine how a generalized gauge transformation can be used to put the Lagrangian in the “antisymmetric discretization gauge,” in which the discrete symplectic structure has the correct form, thus eliminating the numerical instability. Finally, it is noted that the variational guiding center algorithms are not electromagnetically gauge invariant. By designing a model discrete Lagrangian, we show that the algorithms are approximately gauge invariant as long as A and φ are relatively smooth. A gauge invariant discrete Lagrangian is very important in a variational particle-in-cell algorithm where it ensures current continuity and preservation of Gauss’s law [J. Squire, H. Qin, and W. Tang (to be published)].
Global symplectic structure-preserving integrators for spinning compact binaries
Zhong, Shuang-Ying; Wu, Xin; Liu, San-Qiu; Deng, Xin-Fa
2010-12-01
This paper deals mainly with the application of the second-order symplectic implicit midpoint rule and its symmetric compositions to a post-Newtonian Hamiltonian formulation with canonical spin variables in relativistic compact binaries. The midpoint rule, as a basic algorithm, is directly used to integrate the completely canonical Hamiltonian system. On the other hand, there are symmetric composite methods based on a splitting of the Hamiltonian into two parts: the Newtonian part associated with a Kepler motion, and a perturbation part involving the orbital post-Newtonian and spin contributions, where the Kepler flow has an analytic solution and the perturbation can be calculated by the midpoint rule. An example is the second-order mixed leapfrog symplectic integrator with one stage integration of the perturbation flow and two semistage computations of the Kepler flow at every integration step. Also, higher-order composite methods such as the Forest-Ruth fourth-order symplectic integrator and its optimized algorithm are applicable. Various numerical tests including simulations of chaotic orbits show that the mixed leapfrog integrator is always superior to the midpoint rule in energy accuracy, while both of them are almost equivalent in computational efficiency. Particularly, the optimized fourth-order algorithm compared with the mixed leapfrog scheme provides good precision and needs no expensive additional computational time. As a result, it is worth performing a more detailed and careful examination of the dynamical structure of chaos and order in the parameter windows and phase space of the binary system.
Symmetric integrable-polynomial factorization for symplectic one-turn-map tracking
International Nuclear Information System (INIS)
Shi, Jicong
1993-01-01
It was found that any homogeneous polynomial can be written as a sum of integrable polynomials of the same degree which Lie transformations can be evaluated exactly. By utilizing symplectic integrators, an integrable-polynomial factorization is developed to convert a symplectic map in the form of Dragt-Finn factorization into a product of Lie transformations associated with integrable polynomials. A small number of factorization bases of integrable polynomials enable one to use high order symplectic integrators so that the high-order spurious terms can be greatly suppressed. A symplectic map can thus be evaluated with desired accuracy
Directory of Open Access Journals (Sweden)
Cheng-Hsiung Yang
2013-01-01
Full Text Available A new symplectic chaos synchronization of chaotic systems with uncertain chaotic parameters is studied. The traditional chaos synchronizations are special cases of the symplectic chaos synchronization. A sufficient condition is given for the asymptotical stability of the null solution of error dynamics and a parameter difference. The symplectic chaos synchronization with uncertain chaotic parameters may be applied to the design of secure communication systems. Finally, numerical results are studied for symplectic chaos synchronized from two identical Lorenz-Stenflo systems in three different cases.
Minimal coupling schemes in N-body reaction theory
International Nuclear Information System (INIS)
Picklesimer, A.; Tandy, P.C.; Thaler, R.M.
1982-01-01
A new derivation of the N-body equations of Bencze, Redish, and Sloan is obtained through the use of Watson-type multiple scattering techniques. The derivation establishes an intimate connection between these partition-labeled N-body equations and the particle-labeled Rosenberg equations. This result yields new insight into the implicit role of channel coupling in, and the minimal dimensionality of, the partition-labeled equations
Bianchi type A hyper-symplectic and hyper-Kaehler metrics in 4D
International Nuclear Information System (INIS)
De Andrés, L C; Fernández, M; Ivanov, S; Santisteban, J A; Ugarte, L; Vassilev, D
2012-01-01
We present a simple explicit construction of hyper-Kaehler and hyper-symplectic (also known as neutral hyper-Kaehler or hyper-para-Kaehler) metrics in 4D using the Bianchi type groups of class A. The construction underlies a correspondence between hyper-Kaehler and hyper-symplectic structures of dimension 4. (paper)
Bianchi type A hyper-symplectic and hyper-K\\"ahler metrics in 4D
de Andrés, Luis C.; Fernández, Marisa; Ivanov, Stefan; Santisteban, José A.; Ugarte, Luis; Vassilev, Dimiter
2011-01-01
We present a simple explicit construction of hyper-Kaehler and hyper-symplectic (also known as neutral hyper-Kaehler or hyper-parakaehler) metrics in 4D using the Bianchi type groups of class A. The construction underlies a correspondence between hyper-Kaehler and hyper-symplectic structures in dimension four.
A Family of Trigonometrically-fitted Partitioned Runge-Kutta Symplectic Methods
International Nuclear Information System (INIS)
Monovasilis, Th.; Kalogiratou, Z.; Simos, T. E.
2007-01-01
We are presenting a family of trigonometrically fitted partitioned Runge-Kutta symplectic methods of fourth order with six stages. The solution of the one dimensional time independent Schroedinger equation is considered by trigonometrically fitted symplectic integrators. The Schroedinger equation is first transformed into a Hamiltonian canonical equation. Numerical results are obtained for the one-dimensional harmonic oscillator and the exponential potential
Examples of integrable and non-integrable systems on singular symplectic manifolds
Delshams, Amadeu; Kiesenhofer, Anna; Miranda, Eva
2017-05-01
We present a collection of examples borrowed from celestial mechanics and projective dynamics. In these examples symplectic structures with singularities arise naturally from regularization transformations, Appell's transformation or classical changes like McGehee coordinates, which end up blowing up the symplectic structure or lowering its rank at certain points. The resulting geometrical structures that model these examples are no longer symplectic but symplectic with singularities which are mainly of two types: bm-symplectic and m-folded symplectic structures. These examples comprise the three body problem as non-integrable exponent and some integrable reincarnations such as the two fixed-center problem. Given that the geometrical and dynamical properties of bm-symplectic manifolds and folded symplectic manifolds are well-understood [10-12,9,15,13,14,24,20,22,25,28], we envisage that this new point of view in this collection of examples can shed some light on classical long-standing problems concerning the study of dynamical properties of these systems seen from the Poisson viewpoint.
A new multi-symplectic scheme for the generalized Kadomtsev-Petviashvili equation
Li, Haochen; Sun, Jianqiang
2012-09-01
We propose a new scheme for the generalized Kadomtsev-Petviashvili (KP) equation. The multi-symplectic conservation property of the new scheme is proved. Back error analysis shows that the new multi-symplectic scheme has second order accuracy in space and time. Numerical application on studying the KPI equation and the KPII equation are presented in detail.
Precise iteration formulae of the Maslov-type index theory for symplectic paths
International Nuclear Information System (INIS)
Yiming Long
1998-10-01
In this paper, using homotopy components of symplectic matrices, and basic properties of the Maslov-type index theory, we establish precise iteration formulae of the Maslov-type index theory for any path in the symplectic group starting from the identity. (author)
N-MODY: A Code for Collisionless N-body Simulations in Modified Newtonian Dynamics
Londrillo, Pasquale; Nipoti, Carlo
2011-02-01
N-MODY is a parallel particle-mesh code for collisionless N-body simulations in modified Newtonian dynamics (MOND). N-MODY is based on a numerical potential solver in spherical coordinates that solves the non-linear MOND field equation, and is ideally suited to simulate isolated stellar systems. N-MODY can be used also to compute the MOND potential of arbitrary static density distributions. A few applications of N-MODY indicate that some astrophysically relevant dynamical processes are profoundly different in MOND and in Newtonian gravity with dark matter.
Symplectic manifolds, coadjoint orbits, and Mean Field Theory
International Nuclear Information System (INIS)
Rosensteel, G.
1986-01-01
Mean field theory is given a geometrical interpretation as a Hamiltonian dynamical system. The Hartree-Fock phase space is the Grassmann manifold, a symplectic submanifold of the projective space of the full many-fermion Hilbert space. The integral curves of the Hartree-Fock vector field are the time-dependent Hartree-Fock solutions, while the critical points of the energy function are the time-independent states. The mean field theory is generalized beyond determinants to coadjoint orbit spaces of the unitary group; the Grassmann variety is the minimal coadjoint orbit
The endoscopic classification of representations orthogonal and symplectic groups
Arthur, James
2013-01-01
Within the Langlands program, endoscopy is a fundamental process for relating automorphic representations of one group with those of another. In this book, Arthur establishes an endoscopic classification of automorphic representations of orthogonal and symplectic groups G. The representations are shown to occur in families (known as global L-packets and A-packets), which are parametrized by certain self-dual automorphic representations of an associated general linear group GL(N). The central result is a simple and explicit formula for the multiplicity in the automorphic discrete spectrum of G
Introduction to orthogonal, symplectic and unitary representations of finite groups
Riehm, Carl R
2011-01-01
Orthogonal, symplectic and unitary representations of finite groups lie at the crossroads of two more traditional subjects of mathematics-linear representations of finite groups, and the theory of quadratic, skew symmetric and Hermitian forms-and thus inherit some of the characteristics of both. This book is written as an introduction to the subject and not as an encyclopaedic reference text. The principal goal is an exposition of the known results on the equivalence theory, and related matters such as the Witt and Witt-Grothendieck groups, over the "classical" fields-algebraically closed, rea
Differential and symplectic topology of knots and curves
Tabachnikov, S
1999-01-01
This book presents a collection of papers on two related topics: topology of knots and knot-like objects (such as curves on surfaces) and topology of Legendrian knots and links in 3-dimensional contact manifolds. Featured is the work of international experts in knot theory (""quantum"" knot invariants, knot invariants of finite type), in symplectic and contact topology, and in singularity theory. The interplay of diverse methods from these fields makes this volume unique in the study of Legendrian knots and knot-like objects such as wave fronts. A particularly enticing feature of the volume is
Method to render second order beam optics programs symplectic
International Nuclear Information System (INIS)
Douglas, D.; Servranckx, R.V.
1984-10-01
We present evidence that second order matrix-based beam optics programs violate the symplectic condition. A simple method to avoid this difficulty, based on a generating function approach to evaluating transfer maps, is described. A simple example illustrating the non-symplectricity of second order matrix methods, and the effectiveness of our solution to the problem, is provided. We conclude that it is in fact possible to bring second order matrix optics methods to a canonical form. The procedure for doing so has been implemented in the program DIMAT, and could be implemented in programs such as TRANSPORT and TURTLE, making them useful in multiturn applications. 15 refs
A Symplectic Beam-Beam Interaction with Energy Change
International Nuclear Information System (INIS)
Moshammer, Herbert
2003-01-01
The performance of many colliding storage rings is limited by the beam-beam interaction. A particle feels a nonlinear force produced by the encountering bunch at the collision. This beam-beam force acts mainly in the transverse directions so that the longitudinal effects have scarcely been studied, except for the cases of a collision with a crossing angle. Recently, however, high luminosity machines are being considered where the beams are focused extensively at the interaction point (IP) so that the beam sizes can vary significantly within the bunch length. Krishnagopal and Siemann have shown that they should not neglect the bunch length effect in this case. The transverse kick depends on the longitudinal position as well as on the transverse position. If they include this effect, however, from the action-reaction principle, they should expect, at the same time, an energy change which depends on the transverse coordinates. Such an effect is reasonably understood from the fact that the beam-beam force is partly due to the electric field, which can change the energy. The action-reaction principle comes from the symplecticity of the reaction: the electromagnetic influence on a particle is described by a Hamiltonian. The symplecticity is one of the most fundamental requirements when studying the beam dynamics. A nonsymplectic approximation can easily lead to unphysical results. In this paper, they propose a simple, approximately but symplectic mapping for the beam-beam interaction which includes the energy change as well as the bunch-length effect. In the next section, they propose the mapping in a Hamiltonian form, which directly assures its symplecticity. Then in section 3, they study the nature of the mapping by interpreting its consequences. The mapping itself is quite general and can be applied to any distribution function. They show in Section 4 how it appears when the distribution function is a Gaussian in transverse directions. The mapping is applied to the
Efficient nonparametric n -body force fields from machine learning
Glielmo, Aldo; Zeni, Claudio; De Vita, Alessandro
2018-05-01
We provide a definition and explicit expressions for n -body Gaussian process (GP) kernels, which can learn any interatomic interaction occurring in a physical system, up to n -body contributions, for any value of n . The series is complete, as it can be shown that the "universal approximator" squared exponential kernel can be written as a sum of n -body kernels. These recipes enable the choice of optimally efficient force models for each target system, as confirmed by extensive testing on various materials. We furthermore describe how the n -body kernels can be "mapped" on equivalent representations that provide database-size-independent predictions and are thus crucially more efficient. We explicitly carry out this mapping procedure for the first nontrivial (three-body) kernel of the series, and we show that this reproduces the GP-predicted forces with meV /Å accuracy while being orders of magnitude faster. These results pave the way to using novel force models (here named "M-FFs") that are computationally as fast as their corresponding standard parametrized n -body force fields, while retaining the nonparametric character, the ease of training and validation, and the accuracy of the best recently proposed machine-learning potentials.
Numerical solutions of the N-body problem
International Nuclear Information System (INIS)
Marciniak, A.
1985-01-01
Devoted to the study of numerical methods for solving the general N-body problem and related problems, this volume starts with an overview of the conventional numerical methods for solving the initial value problem. The major part of the book contains original work and features a presentation of special numerical methods conserving the constants of motion in the general N-body problem and methods conserving the Jacobi constant in the problem of motion of N bodies in a rotating frame, as well as an analysis of the applications of both (conventional and special) kinds of methods for solving these problems. For all the methods considered, the author presents algorithms which are easily programmable in any computer language. Moreover, the author compares various methods and presents adequate numerical results. The appendix contains PL/I procedures for all the special methods conserving the constants of motion. 91 refs.; 35 figs.; 41 tabs
An hp symplectic pseudospectral method for nonlinear optimal control
Peng, Haijun; Wang, Xinwei; Li, Mingwu; Chen, Biaosong
2017-01-01
An adaptive symplectic pseudospectral method based on the dual variational principle is proposed and is successfully applied to solving nonlinear optimal control problems in this paper. The proposed method satisfies the first order necessary conditions of continuous optimal control problems, also the symplectic property of the original continuous Hamiltonian system is preserved. The original optimal control problem is transferred into a set of nonlinear equations which can be solved easily by Newton-Raphson iterations, and the Jacobian matrix is found to be sparse and symmetric. The proposed method, on one hand, exhibits exponent convergence rates when the number of collocation points are increasing with the fixed number of sub-intervals; on the other hand, exhibits linear convergence rates when the number of sub-intervals is increasing with the fixed number of collocation points. Furthermore, combining with the hp method based on the residual error of dynamic constraints, the proposed method can achieve given precisions in a few iterations. Five examples highlight the high precision and high computational efficiency of the proposed method.
QCD gauge symmetries through Faddeev-Jackiw symplectic method
International Nuclear Information System (INIS)
Abreu, E.M.C.; Mendes, A.C.R.; Neves, C.; Oliveira, W.; Silva, R.C.N.
2013-01-01
Full text: The FJ method is an approach that is geometrically motivated. It is based on the symplectic structure of the phase space. The first-order characteristic allows to obtain the Hamiltonian equations of motion from a variational principle. Its geometric structure of the Hamiltonian phase-space will be carried out directly from the equations of motion via the inverse of the so-called symplectic two-form, if the inverse exists. Few years after its publication, the FJ formalism was extended and through the years it has been applied to different systems. Gauge invariance is one of the most well established concepts in theoretical physics and it is one of the main ingredients in Standard Model theory. However, we can ask if it could have an alternative origin connected to another theory or principle. With this motivation in mind we will show in this paper that gauge invariance could be considered an emergent concept having its origin in the algebraic formalism of a well known method that deals with constrained systems, namely, the Faddeev-Jackiw (FJ) technique. Of course the gauge invariance idea is older than FJ's, but the results obtained here will show that the connection between both will prove that SU(3) and SU(3) X SU(2) X U(1) gauge groups, which are fundamental to important theories like QCD and Standard Model, can be obtained through FJ formalism. (author)
Explicit symplectic algorithms based on generating functions for charged particle dynamics
Zhang, Ruili; Qin, Hong; Tang, Yifa; Liu, Jian; He, Yang; Xiao, Jianyuan
2016-07-01
Dynamics of a charged particle in the canonical coordinates is a Hamiltonian system, and the well-known symplectic algorithm has been regarded as the de facto method for numerical integration of Hamiltonian systems due to its long-term accuracy and fidelity. For long-term simulations with high efficiency, explicit symplectic algorithms are desirable. However, it is generally believed that explicit symplectic algorithms are only available for sum-separable Hamiltonians, and this restriction limits the application of explicit symplectic algorithms to charged particle dynamics. To overcome this difficulty, we combine the familiar sum-split method and a generating function method to construct second- and third-order explicit symplectic algorithms for dynamics of charged particle. The generating function method is designed to generate explicit symplectic algorithms for product-separable Hamiltonian with form of H (x ,p ) =pif (x ) or H (x ,p ) =xig (p ) . Applied to the simulations of charged particle dynamics, the explicit symplectic algorithms based on generating functions demonstrate superiorities in conservation and efficiency.
N-body scattering solution in coordinate space
International Nuclear Information System (INIS)
Cheng-Guang, B.
1986-01-01
The Schroedinger equation has been transformed into a set of coupled partial differential equations having hyper-variables as arguments and a procedure for embedding the boundary conditions into the N-body scattering solution by using a set of homogeneous linear algebraic equations is proposed
Cosmological N-body simulations with generic hot dark matter
DEFF Research Database (Denmark)
Brandbyge, Jacob; Hannestad, Steen
2017-01-01
We have calculated the non-linear effects of generic fermionic and bosonic hot dark matter components in cosmological N-body simulations. For sub-eV masses, the non-linear power spectrum suppression caused by thermal free-streaming resembles the one seen for massive neutrinos, whereas for masses...
Symplectic and semiclassical aspects of the Schläfli identity
Hedeman, Austin; Kur, Eugene; Littlejohn, Robert G.; Haggard, Hal M.
2015-03-01
The Schläfli identity, which is important in Regge calculus and loop quantum gravity, is examined from a symplectic and semiclassical standpoint in the special case of flat, three-dimensional space. In this case a proof is given, based on symplectic geometry. A series of symplectic and Lagrangian manifolds related to the Schläfli identity, including several versions of a Lagrangian manifold of tetrahedra, are discussed. Semiclassical interpretations of the various steps are provided. Possible generalizations to three-dimensional spaces of constant (nonzero) curvature, involving Poisson-Lie groups and q-deformed spin networks, are discussed.
New results for time reversed symplectic dynamic systems and quadratic functionals
Directory of Open Access Journals (Sweden)
Roman Simon Hilscher
2012-05-01
Full Text Available In this paper, we examine time scale symplectic (or Hamiltonian systems and the associated quadratic functionals which contain a forward shift in the time variable. Such systems and functionals have a close connection to Jacobi systems for calculus of variations and optimal control problems on time scales. Our results, among which we consider the Reid roundabout theorem, generalize the corresponding classical theory for time reversed discrete symplectic systems, as well as they complete the recently developed theory of time scale symplectic systems.
A symplectic Poisson solver based on Fast Fourier Transformation. The first trial
International Nuclear Information System (INIS)
Vorobiev, L.G.; Hirata, Kohji.
1995-11-01
A symplectic Poisson solver calculates numerically a potential and fields due to a 2D distribution of particles in a way that the symplecticity and smoothness are assured automatically. Such a code, based on Fast Fourier Transformation combined with Bicubic Interpolation, is developed for the use in multi-turn particle simulation in circular accelerators. Beside that, it may have a number of applications, where computations of space charge forces should obey a symplecticity criterion. Detailed computational schemes of all algorithms will be outlined to facilitate practical programming. (author)
Existence and equivalence of twisted products on a symplectic manifold
International Nuclear Information System (INIS)
Lichnerowicz, A.
1979-01-01
The twisted products play an important role in Quantum Mechanics. A distinction is introduced between Vey *sub(γ) products and strong Vey *sub(γ) products and it is proved that each *sub(γ) product is equivalent to a Vey *sub(γ) product. If b 3 (W) = 0, the symplectic manifold (W,F) admits strong Vey *sub(Gn) products. If b 2 (W) = 0, all *sub(γ) products are equivalent as well as the Vey Lie algebras. In the general case the formal Lie algebras are characterized which are generated by a *sub(γ) product and it proved that the existance of a *sub(γ)-product is equivalent to the existance of a formal Lie algebra infinitesimally equivalent to a Vey Lie algebra at the first order. (Auth.)
Symplectic maps and chromatic optics in particle accelerators
Energy Technology Data Exchange (ETDEWEB)
Cai, Yunhai
2015-10-11
We have applied the nonlinear map method to comprehensively characterize the chromatic optics in particle accelerators. Our approach is built on the foundation of symplectic transfer maps of magnetic elements. The chromatic lattice parameters can be transported from one element to another by the maps. We introduce a Jacobian operator that provides an intrinsic linkage between the maps and the matrix with parameter dependence. The link allows us to directly apply the formulation of the linear optics to compute the chromatic lattice parameters. As an illustration, we analyze an alternating-gradient cell with nonlinear sextupoles, octupoles, and decapoles and derive analytically their settings for the local chromatic compensation. As a result, the cell becomes nearly perfect up to the third-order of the momentum deviation.
Notes on qubit phase space and discrete symplectic structures
International Nuclear Information System (INIS)
Livine, Etera R
2010-01-01
We start from Wootter's construction of discrete phase spaces and Wigner functions for qubits and more generally for finite-dimensional Hilbert spaces. We look at this framework from a non-commutative space perspective and we focus on the Moyal product and the differential calculus on these discrete phase spaces. In particular, the qubit phase space provides the simplest example of a four-point non-commutative phase space. We give an explicit expression of the Moyal bracket as a differential operator. We then compare the quantum dynamics encoded by the Moyal bracket to the classical dynamics: we show that the classical Poisson bracket does not satisfy the Jacobi identity thus leaving the Moyal bracket as the only consistent symplectic structure. We finally generalize our analysis to Hilbert spaces of prime dimensions d and their associated d x d phase spaces.
Chern-Simons theories of symplectic super-diffeomorphisms
International Nuclear Information System (INIS)
Sezgin, E.; Sokatchev, E.
1989-04-01
We discuss the symplectic diffeomorphisms of a class of supermanifolds and the structure of the underlying infinite dimensional superalgebras. We construct a Chern-Simons (CS) gauge theory in 2+1 dimensions for these algebras. There exists a finite dimensional supersymmetric truncation which is the (2 n -1)-dimensional Hamiltonian superalgebra H-tilde(n). With a central charge added, it is a superalgebra, C(n), associated with a Clifford algebra. We find an embedding of d=3, N=2 anti-de Sitter superalgebra OSp(2|2)+OSp(2|2) in C(4), and construct a CS action for its infinite dimensional extension. We also discuss the construction of a CS action for the infinite dimensional extension of the d=3, N=2 superconformal algebra OSp(2,4). (author). 18 refs
An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems
Karlsson, Peer Jesper; Larsson, Stig; Sandberg, Mattias; Szepessy, Anders; Tempone, Raul
2015-01-01
This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns Symplectic Euler solutions of the Hamiltonian system
Normal forms for Poisson maps and symplectic groupoids around Poisson transversals.
Frejlich, Pedro; Mărcuț, Ioan
2018-01-01
Poisson transversals are submanifolds in a Poisson manifold which intersect all symplectic leaves transversally and symplectically. In this communication, we prove a normal form theorem for Poisson maps around Poisson transversals. A Poisson map pulls a Poisson transversal back to a Poisson transversal, and our first main result states that simultaneous normal forms exist around such transversals, for which the Poisson map becomes transversally linear, and intertwines the normal form data of the transversals. Our second result concerns symplectic integrations. We prove that a neighborhood of a Poisson transversal is integrable exactly when the Poisson transversal itself is integrable, and in that case we prove a normal form theorem for the symplectic groupoid around its restriction to the Poisson transversal, which puts all structure maps in normal form. We conclude by illustrating our results with examples arising from Lie algebras.
Two new solutions to the third-order symplectic integration method
International Nuclear Information System (INIS)
Iwatsu, Reima
2009-01-01
Two new solutions are obtained for the symplecticity conditions of explicit third-order partitioned Runge-Kutta time integration method. One of them has larger stability limit and better dispersion property than the Ruth's method.
Variational and symplectic integrators for satellite relative orbit propagation including drag
Palacios, Leonel; Gurfil, Pini
2018-04-01
Orbit propagation algorithms for satellite relative motion relying on Runge-Kutta integrators are non-symplectic—a situation that leads to incorrect global behavior and degraded accuracy. Thus, attempts have been made to apply symplectic methods to integrate satellite relative motion. However, so far all these symplectic propagation schemes have not taken into account the effect of atmospheric drag. In this paper, drag-generalized symplectic and variational algorithms for satellite relative orbit propagation are developed in different reference frames, and numerical simulations with and without the effect of atmospheric drag are presented. It is also shown that high-order versions of the newly-developed variational and symplectic propagators are more accurate and are significantly faster than Runge-Kutta-based integrators, even in the presence of atmospheric drag.
Exact symplectic structures and a classical model for the Dirac electron
International Nuclear Information System (INIS)
Rawnsley, J.
1992-01-01
We show how the classical model for the Dirac electron of Barut and coworkers can be obtained as a Hamiltonian theory by constructing an exact symplectic form on the total space of the spin bundle over spacetime. (orig.)
Eikonal representation of N-body Coulomb scattering amplitudes
International Nuclear Information System (INIS)
Fried, H.M.; Kang, K.; McKellar, B.H.J.
1983-01-01
A new technique for the construction of N-body Coulomb scattering amplitudes is proposed, suggested by the simplest case of N = 2: Calculate the scattering amplitude in eikonal approximation, discard the infinite phase factors which appear upon taking the limit of a Coulomb potential, and treat the remainder as an amplitude whose absolute value squared produces the exact, Coulomb differential cross section. The method easily generalizes to the N-body Coulomb problem for elastic scattering, and for inelastic rearrangement scattering of Coulomb bound states. We give explicit results for N = 3 and 4; in the N = 3 case we extract amplitudes for the processes (12)+3->1+2+3 (breakup), (12)+3->1+(23) (rearrangement), and (12)+3→(12)'+3 (inelastic scattering) as residues at the appropriate poles in the free-free amplitude. The method produces scattering amplitudes f/sub N/ given in terms of explicit quadratures over (N-2) 2 distinct integrands
On the Inverse Mapping of the Formal Symplectic Groupoid of a Deformation Quantization
Karabegov, Alexander V.
2004-10-01
To each natural star product on a Poisson manifold $M$ we associate an antisymplectic involutive automorphism of the formal neighborhood of the zero section of the cotangent bundle of $M$. If $M$ is symplectic, this mapping is shown to be the inverse mapping of the formal symplectic groupoid of the star product. The construction of the inverse mapping involves modular automorphisms of the star product.
Symplectic matrix, gauge invariance and Dirac brackets for super-QED
Energy Technology Data Exchange (ETDEWEB)
Alves, D.T. [Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil); Cheb-Terrab, E.S. [British Columbia Univ., Vancouver, BC (Canada). Dept. of Mathematics
1999-08-01
The calculation of Dirac brackets (DB) using a symplectic matrix approach but in a Hamiltonian framework is discussed, and the calculation of the DB for the supersymmetric extension of QED (super-QED) is shown. The relation between the zero-mode of the pre-symplectic matrix and the gauge transformations admitted by the model is verified. A general description to construct Lagrangians linear in the velocities is also presented. (author)
Application of Symplectic Algebraic Dynamics Algorithm to Circular Restricted Three-Body Problem
International Nuclear Information System (INIS)
Wei-Tao, Lu; Hua, Zhang; Shun-Jin, Wang
2008-01-01
Symplectic algebraic dynamics algorithm (SADA) for ordinary differential equations is applied to solve numerically the circular restricted three-body problem (CR3BP) in dynamical astronomy for both stable motion and chaotic motion. The result is compared with those of Runge–Kutta algorithm and symplectic algorithm under the fourth order, which shows that SADA has higher accuracy than the others in the long-term calculations of the CR3BP. (general)
Lu, Wei-Tao; Zhang, Hua; Wang, Shun-Jin
2008-07-01
Symplectic algebraic dynamics algorithm (SADA) for ordinary differential equations is applied to solve numerically the circular restricted three-body problem (CR3BP) in dynamical astronomy for both stable motion and chaotic motion. The result is compared with those of Runge-Kutta algorithm and symplectic algorithm under the fourth order, which shows that SADA has higher accuracy than the others in the long-term calculations of the CR3BP.
Accelerator-feasible N-body nonlinear integrable system
Directory of Open Access Journals (Sweden)
V. Danilov
2014-12-01
Full Text Available Nonlinear N-body integrable Hamiltonian systems, where N is an arbitrary number, have attracted the attention of mathematical physicists for the last several decades, following the discovery of some number of these systems. This paper presents a new integrable system, which can be realized in facilities such as particle accelerators. This feature makes it more attractive than many of the previous such systems with singular or unphysical forces.
Internal or shape coordinates in the n-body problem
International Nuclear Information System (INIS)
Littlejohn, R.G.; Reinsch, M.
1995-01-01
The construction of global shape coordinates for the n-body problem is considered. Special attention is given to the three- and four-body problems. Quantities, including candidates for coordinates, are organized according to their transformation properties under so-called democracy transformations (orthogonal transformations of Jacobi vectors). Important submanifolds of shape space are identified and their topology studied, including the manifolds upon which shapes are coplanar or collinear, and the manifolds upon which the moment of inertia tensor is degenerate
An N-body Integrator for Planetary Rings
Hahn, Joseph M.
2011-04-01
A planetary ring that is disturbed by a satellite's resonant perturbation can respond in an organized way. When the resonance lies in the ring's interior, the ring responds via an m-armed spiral wave, while a ring whose edge is confined by the resonance exhibits an m-lobed scalloping along the ring-edge. The amplitude of these disturbances are sensitive to ring surface density and viscosity, so modelling these phenomena can provide estimates of the ring's properties. However a brute force attempt to simulate a ring's full azimuthal extent with an N-body code will likely fail because of the large number of particles needed to resolve the ring's behavior. Another impediment is the gravitational stirring that occurs among the simulated particles, which can wash out the ring's organized response. However it is possible to adapt an N-body integrator so that it can simulate a ring's collective response to resonant perturbations. The code developed here uses a few thousand massless particles to trace streamlines within the ring. Particles are close in a radial sense to these streamlines, which allows streamlines to be treated as straight wires of constant linear density. Consequently, gravity due to these streamline is a simple function of the particle's radial distance to all streamlines. And because particles are responding to smooth gravitating streamlines, rather than discrete particles, this method eliminates the stirring that ordinarily occurs in brute force N-body calculations. Note also that ring surface density is now a simple function of streamline separations, so effects due to ring pressure and viscosity are easily accounted for, too. A poster will describe this N-body method in greater detail. Simulations of spiral density waves and scalloped ring-edges are executed in typically ten minutes on a desktop PC, and results for Saturn's A and B rings will be presented at conference time.
An Advanced N -body Model for Interacting Multiple Stellar Systems
Energy Technology Data Exchange (ETDEWEB)
Brož, Miroslav [Astronomical Institute of the Charles University, Faculty of Mathematics and Physics, V Holešovičkách 2, CZ-18000 Praha 8 (Czech Republic)
2017-06-01
We construct an advanced model for interacting multiple stellar systems in which we compute all trajectories with a numerical N -body integrator, namely the Bulirsch–Stoer from the SWIFT package. We can then derive various observables: astrometric positions, radial velocities, minima timings (TTVs), eclipse durations, interferometric visibilities, closure phases, synthetic spectra, spectral energy distribution, and even complete light curves. We use a modified version of the Wilson–Devinney code for the latter, in which the instantaneous true phase and inclination of the eclipsing binary are governed by the N -body integration. If all of these types of observations are at one’s disposal, a joint χ {sup 2} metric and an optimization algorithm (a simplex or simulated annealing) allow one to search for a global minimum and construct very robust models of stellar systems. At the same time, our N -body model is free from artifacts that may arise if mutual gravitational interactions among all components are not self-consistently accounted for. Finally, we present a number of examples showing dynamical effects that can be studied with our code and we discuss how systematic errors may affect the results (and how to prevent this from happening).
Quantum N-body problem with a minimal length
International Nuclear Information System (INIS)
Buisseret, Fabien
2010-01-01
The quantum N-body problem is studied in the context of nonrelativistic quantum mechanics with a one-dimensional deformed Heisenberg algebra of the form [x,p]=i(1+βp 2 ), leading to the existence of a minimal observable length √(β). For a generic pairwise interaction potential, analytical formulas are obtained that allow estimation of the ground-state energy of the N-body system by finding the ground-state energy of a corresponding two-body problem. It is first shown that in the harmonic oscillator case, the β-dependent term grows faster with increasing N than the β-independent term. Then, it is argued that such a behavior should also be observed with generic potentials and for D-dimensional systems. Consequently, quantum N-body bound states might be interesting places to look at nontrivial manifestations of a minimal length, since the more particles that are present, the more the system deviates from standard quantum-mechanical predictions.
Relativistic initial conditions for N-body simulations
Energy Technology Data Exchange (ETDEWEB)
Fidler, Christian [Catholic University of Louvain—Center for Cosmology, Particle Physics and Phenomenology (CP3) 2, Chemin du Cyclotron, B-1348 Louvain-la-Neuve (Belgium); Tram, Thomas; Crittenden, Robert; Koyama, Kazuya; Wands, David [Institute of Cosmology and Gravitation, University of Portsmouth, Portsmouth PO1 3FX (United Kingdom); Rampf, Cornelius, E-mail: christian.fidler@uclouvain.be, E-mail: thomas.tram@port.ac.uk, E-mail: rampf@thphys.uni-heidelberg.de, E-mail: robert.crittenden@port.ac.uk, E-mail: kazuya.koyama@port.ac.uk, E-mail: david.wands@port.ac.uk [Institut für Theoretische Physik, Universität Heidelberg, Philosophenweg 16, D–69120 Heidelberg (Germany)
2017-06-01
Initial conditions for (Newtonian) cosmological N-body simulations are usually set by re-scaling the present-day power spectrum obtained from linear (relativistic) Boltzmann codes to the desired initial redshift of the simulation. This back-scaling method can account for the effect of inhomogeneous residual thermal radiation at early times, which is absent in the Newtonian simulations. We analyse this procedure from a fully relativistic perspective, employing the recently-proposed Newtonian motion gauge framework. We find that N-body simulations for ΛCDM cosmology starting from back-scaled initial conditions can be self-consistently embedded in a relativistic space-time with first-order metric potentials calculated using a linear Boltzmann code. This space-time coincides with a simple ''N-body gauge'' for z < 50 for all observable modes. Care must be taken, however, when simulating non-standard cosmologies. As an example, we analyse the back-scaling method in a cosmology with decaying dark matter, and show that metric perturbations become large at early times in the back-scaling approach, indicating a breakdown of the perturbative description. We suggest a suitable ''forwards approach' for such cases.
Variational symplectic algorithm for guiding center dynamics and its application in tokamak geometry
International Nuclear Information System (INIS)
Qin Hong; Guan Xiaoyin; Tang, William M.
2009-01-01
A variational symplectic integrator for the guiding center motion of charged particles in general magnetic fields is developed to enable accurate long-time simulation studies of magnetized plasmas. Instead of discretizing the differential equations of the guiding center motion, the action of the guiding center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The variational symplectic integrator conserves exactly a discrete Lagrangian symplectic structure and globally bounds the numerical error in energy by a small number for all simulation time steps. Compared with standard integrators, such as the fourth order Runge-Kutta method, the variational symplectic integrator has superior numerical properties over long integration time. For example, in a two-dimensional tokamak geometry, the variational symplectic integrator is able to guarantee the accuracy for both the trapped and transit particle orbits for arbitrarily long simulation time. This is important for modern large-scale simulation studies of fusion plasmas where it is critical to use algorithms with long-term accuracy and fidelity. The variational symplectic integrator is expected to have a wide range of applications.
Sampling general N-body interactions with auxiliary fields
Körber, C.; Berkowitz, E.; Luu, T.
2017-09-01
We present a general auxiliary field transformation which generates effective interactions containing all possible N-body contact terms. The strength of the induced terms can analytically be described in terms of general coefficients associated with the transformation and thus are controllable. This transformation provides a novel way for sampling 3- and 4-body (and higher) contact interactions non-perturbatively in lattice quantum Monte Carlo simulations. As a proof of principle, we show that our method reproduces the exact solution for a two-site quantum mechanical problem.
Cosmological N -body simulations with generic hot dark matter
Energy Technology Data Exchange (ETDEWEB)
Brandbyge, Jacob; Hannestad, Steen, E-mail: jacobb@phys.au.dk, E-mail: sth@phys.au.dk [Department of Physics and Astronomy, University of Aarhus, Ny Munkegade 120, DK–8000 Aarhus C (Denmark)
2017-10-01
We have calculated the non-linear effects of generic fermionic and bosonic hot dark matter components in cosmological N -body simulations. For sub-eV masses, the non-linear power spectrum suppression caused by thermal free-streaming resembles the one seen for massive neutrinos, whereas for masses larger than 1 eV, the non-linear relative suppression of power is smaller than in linear theory. We furthermore find that in the non-linear regime, one can map fermionic to bosonic models by performing a simple transformation.
Relativistic N-body simulations with massive neutrinos
Adamek, Julian; Durrer, Ruth; Kunz, Martin
2017-11-01
Some of the dark matter in the Universe is made up of massive neutrinos. Their impact on the formation of large scale structure can be used to determine their absolute mass scale from cosmology, but to this end accurate numerical simulations have to be developed. Due to their relativistic nature, neutrinos pose additional challenges when one tries to include them in N-body simulations that are traditionally based on Newtonian physics. Here we present the first numerical study of massive neutrinos that uses a fully relativistic approach. Our N-body code, gevolution, is based on a weak-field formulation of general relativity that naturally provides a self-consistent framework for relativistic particle species. This allows us to model neutrinos from first principles, without invoking any ad-hoc recipes. Our simulation suite comprises some of the largest neutrino simulations performed to date. We study the effect of massive neutrinos on the nonlinear power spectra and the halo mass function, focusing on the interesting mass range between 0.06 eV and 0.3 eV and including a case for an inverted mass hierarchy.
Highly accurate symplectic element based on two variational principles
Qing, Guanghui; Tian, Jia
2018-02-01
For the stability requirement of numerical resultants, the mathematical theory of classical mixed methods are relatively complex. However, generalized mixed methods are automatically stable, and their building process is simple and straightforward. In this paper, based on the seminal idea of the generalized mixed methods, a simple, stable, and highly accurate 8-node noncompatible symplectic element (NCSE8) was developed by the combination of the modified Hellinger-Reissner mixed variational principle and the minimum energy principle. To ensure the accuracy of in-plane stress results, a simultaneous equation approach was also suggested. Numerical experimentation shows that the accuracy of stress results of NCSE8 are nearly the same as that of displacement methods, and they are in good agreement with the exact solutions when the mesh is relatively fine. NCSE8 has advantages of the clearing concept, easy calculation by a finite element computer program, higher accuracy and wide applicability for various linear elasticity compressible and nearly incompressible material problems. It is possible that NCSE8 becomes even more advantageous for the fracture problems due to its better accuracy of stresses.
The complex Laguerre symplectic ensemble of non-Hermitian matrices
International Nuclear Information System (INIS)
Akemann, G.
2005-01-01
We solve the complex extension of the chiral Gaussian symplectic ensemble, defined as a Gaussian two-matrix model of chiral non-Hermitian quaternion real matrices. This leads to the appearance of Laguerre polynomials in the complex plane and we prove their orthogonality. Alternatively, a complex eigenvalue representation of this ensemble is given for general weight functions. All k-point correlation functions of complex eigenvalues are given in terms of the corresponding skew orthogonal polynomials in the complex plane for finite-N, where N is the matrix size or number of eigenvalues, respectively. We also allow for an arbitrary number of complex conjugate pairs of characteristic polynomials in the weight function, corresponding to massive quark flavours in applications to field theory. Explicit expressions are given in the large-N limit at both weak and strong non-Hermiticity for the weight of the Gaussian two-matrix model. This model can be mapped to the complex Dirac operator spectrum with non-vanishing chemical potential. It belongs to the symmetry class of either the adjoint representation or two colours in the fundamental representation using staggered lattice fermions
Submaximal Riemann-Roch expected curves and symplectic packing.
Directory of Open Access Journals (Sweden)
Wioletta Syzdek
2007-06-01
Full Text Available We study Riemann-Roch expected curves on $mathbb{P}^1 imes mathbb{P}^1$ in the context of the Nagata-Biran conjecture. This conjecture predicts that for sufficiently large number of points multiple points Seshadri constants of an ample line bundle on algebraic surface are maximal. Biran gives an effective lower bound $N_0$. We construct examples verifying to the effect that the assertions of the Nagata-Biran conjecture can not hold for small number of points. We discuss cases where our construction fails. We observe also that there exists a strong relation between Riemann-Roch expected curves on $mathbb{P}^1 imes mathbb{P}^1$ and the symplectic packing problem. Biran relates the packing problem to the existence of solutions of certain Diophantine equations. We construct such solutions for any ample line bundle on $mathbb{P}^1 imes mathbb{P}^1$ and a relatively smallnumber of points. The solutions geometrically correspond to Riemann-Roch expected curves. Finally we discuss in how far the Biran number $N_0$ is optimal in the case of mathbb{P}^1 imes mathbb{P}^1. In fact we conjecture that it can be replaced by a lower number and we provide evidence justifying this conjecture.
AN N-BODY INTEGRATOR FOR GRAVITATING PLANETARY RINGS, AND THE OUTER EDGE OF SATURN'S B RING
International Nuclear Information System (INIS)
Hahn, Joseph M.; Spitale, Joseph N.
2013-01-01
A new symplectic N-body integrator is introduced, one designed to calculate the global 360° evolution of a self-gravitating planetary ring that is in orbit about an oblate planet. This freely available code is called epi i nt, and it is distinct from other such codes in its use of streamlines to calculate the effects of ring self-gravity. The great advantage of this approach is that the perturbing forces arise from smooth wires of ring matter rather than discreet particles, so there is very little gravitational scattering and so only a modest number of particles are needed to simulate, say, the scalloped edge of a resonantly confined ring or the propagation of spiral density waves. The code is applied to the outer edge of Saturn's B ring, and a comparison of Cassini measurements of the ring's forced response to simulations of Mimas's resonant perturbations reveals that the B ring's surface density at its outer edge is σ 0 = 195 ± 60 g cm –2 , which, if the same everywhere across the ring, would mean that the B ring's mass is about 90% of Mimas's mass. Cassini observations show that the B ring-edge has several free normal modes, which are long-lived disturbances of the ring-edge that are not driven by any known satellite resonances. Although the mechanism that excites or sustains these normal modes is unknown, we can plant such a disturbance at a simulated ring's edge and find that these modes persist without any damping for more than ∼10 5 orbits or ∼100 yr despite the simulated ring's viscosity ν s = 100 cm 2 s –1 . These simulations also indicate that impulsive disturbances at a ring can excite long-lived normal modes, which suggests that an impact in the recent past by perhaps a cloud of cometary debris might have excited these disturbances, which are quite common to many of Saturn's sharp-edged rings
Seismic wavefield modeling based on time-domain symplectic and Fourier finite-difference method
Fang, Gang; Ba, Jing; Liu, Xin-xin; Zhu, Kun; Liu, Guo-Chang
2017-06-01
Seismic wavefield modeling is important for improving seismic data processing and interpretation. Calculations of wavefield propagation are sometimes not stable when forward modeling of seismic wave uses large time steps for long times. Based on the Hamiltonian expression of the acoustic wave equation, we propose a structure-preserving method for seismic wavefield modeling by applying the symplectic finite-difference method on time grids and the Fourier finite-difference method on space grids to solve the acoustic wave equation. The proposed method is called the symplectic Fourier finite-difference (symplectic FFD) method, and offers high computational accuracy and improves the computational stability. Using acoustic approximation, we extend the method to anisotropic media. We discuss the calculations in the symplectic FFD method for seismic wavefield modeling of isotropic and anisotropic media, and use the BP salt model and BP TTI model to test the proposed method. The numerical examples suggest that the proposed method can be used in seismic modeling of strongly variable velocities, offering high computational accuracy and low numerical dispersion. The symplectic FFD method overcomes the residual qSV wave of seismic modeling in anisotropic media and maintains the stability of the wavefield propagation for large time steps.
EXPLICIT SYMPLECTIC-LIKE INTEGRATORS WITH MIDPOINT PERMUTATIONS FOR SPINNING COMPACT BINARIES
Energy Technology Data Exchange (ETDEWEB)
Luo, Junjie; Wu, Xin; Huang, Guoqing [Department of Physics and Institute of Astronomy, Nanchang University, Nanchang 330031 (China); Liu, Fuyao, E-mail: xwu@ncu.edu.cn [School of Fundamental Studies, Shanghai University of Engineering Science, Shanghai 201620 (China)
2017-01-01
We refine the recently developed fourth-order extended phase space explicit symplectic-like methods for inseparable Hamiltonians using Yoshida’s triple product combined with a midpoint permuted map. The midpoint between the original variables and their corresponding extended variables at every integration step is readjusted as the initial values of the original variables and their corresponding extended ones at the next step integration. The triple-product construction is apparently superior to the composition of two triple products in computational efficiency. Above all, the new midpoint permutations are more effective in restraining the equality of the original variables and their corresponding extended ones at each integration step than the existing sequent permutations of momenta and coordinates. As a result, our new construction shares the benefit of implicit symplectic integrators in the conservation of the second post-Newtonian Hamiltonian of spinning compact binaries. Especially for the chaotic case, it can work well, but the existing sequent permuted algorithm cannot. When dissipative effects from the gravitational radiation reaction are included, the new symplectic-like method has a secular drift in the energy error of the dissipative system for the orbits that are regular in the absence of radiation, as an implicit symplectic integrator does. In spite of this, it is superior to the same-order implicit symplectic integrator in accuracy and efficiency. The new method is particularly useful in discussing the long-term evolution of inseparable Hamiltonian problems.
On the n-body problem on surfaces of revolution
Stoica, Cristina
2018-05-01
We explore the n-body problem, n ≥ 3, on a surface of revolution with a general interaction depending on the pairwise geodesic distance. Using the geometric methods of classical mechanics we determine a large set of properties. In particular, we show that Saari's conjecture fails on surfaces of revolution admitting a geodesic circle. We define homographic motions and, using the discrete symmetries, prove that when the masses are equal, they form an invariant manifold. On this manifold the dynamics are reducible to a one-degree of freedom system. We also find that for attractive interactions, regular n-gon shaped relative equilibria with trajectories located on geodesic circles typically experience a pitchfork bifurcation. Some applications are included.
An analytic n-body potential for bcc Iron
Energy Technology Data Exchange (ETDEWEB)
Pontikis, V. [Commissariat a l' Energie Atomique, DRECAM/LSI, CE de Saclay, Building 524, Room 40B, 91191 Gif-sur-Yvette Cedex (France)]. E-mail: Vassilis.Pontikis@cea.fr; Russier, V. [Centre d' Etudes de Chimie Metallurgique, CNRS UPR2801, 94407 Vitry-sur-Seine (France); Wallenius, J. [Royal Institute of Technology, Department of Nuclear and Reactor Physics, Stockholm (Sweden)
2007-02-15
We have developed an analytic n-body phenomenological potential for bcc iron made of two electron-density functionals representing repulsion via the Thomas-Fermi free-electron gas kinetic energy term and attraction via a square root functional similar to the second moment approximation of the tight-binding scheme. Electron-density is given by radial, hydrogen-like orbitals with effective charges taken as adjustable parameters fitted on experimental and ab-initio data. Although the set of adjustable parameters is small, prediction of static and dynamical properties of iron is in excellent agreement with the experiments. Advantages and shortcomings of this model are discussed with reference to published works.
An analytic n-body potential for bcc Iron
International Nuclear Information System (INIS)
Pontikis, V.; Russier, V.; Wallenius, J.
2007-01-01
We have developed an analytic n-body phenomenological potential for bcc iron made of two electron-density functionals representing repulsion via the Thomas-Fermi free-electron gas kinetic energy term and attraction via a square root functional similar to the second moment approximation of the tight-binding scheme. Electron-density is given by radial, hydrogen-like orbitals with effective charges taken as adjustable parameters fitted on experimental and ab-initio data. Although the set of adjustable parameters is small, prediction of static and dynamical properties of iron is in excellent agreement with the experiments. Advantages and shortcomings of this model are discussed with reference to published works
N-Body simulations of tidal encounters between stellar systems
International Nuclear Information System (INIS)
Rao, P.D.; Ramamani, N.; Alladin, S.M.
1985-10-01
N-Body simulations have been performed to study the tidal effects of a primary stellar system on a secondary stellar system of density close to the Roche density. Two hyperbolic, one parabolic and one elliptic encounters have been simulated. The changes in energy, angular momentum, mass distribution, and shape of the secondary system have been determined in each case. The inner region containing about 40% of the mass was found to be practically unchanged and the mass exterior to the tidal radius was found to escape. The intermediate region showed tidal distension. The thickness of this region decreased as we went from hyperbolic encounters to the elliptic encounter keeping the distance of closest approach constant. The numerical results for the fractional change in energy have been compared with the predictions of the available analytic formulae and the usefulness and limitations of the formulae have been discussed. (author)
Integral bounds for N-body total cross sections
International Nuclear Information System (INIS)
Osborn, T.A.; Bolle, D.
1979-01-01
We study the behavior of the total cross sections in the three- and N-body scattering problem. Working within the framework of the time-dependent two-Hilbert space scattering theory, we give a simple derivation of integral bounds for the total cross section for all processes initiated by the collision of two clusters. By combining the optical theorem with a trace identity derived by Jauch, Sinha, and Misra, we find, roughly speaking, that if the local pairwise interaction falls off faster than r -3 , then sigma/sub tot/(E) must decrease faster than E/sup -1/2/ at high energy. This conclusion is unchanged if one introduces a class of well-behaved three-body interactions
Explicit solution to the N-body Calogero problem
Energy Technology Data Exchange (ETDEWEB)
Brink, L [Inst. of Theoretical Physics, CTH, Goeteborg (Sweden); Hansson, T H [Inst. of Theoretical Physics, Univ. Stockholm (Sweden); Vasiliev, M A [Dept. of Theoretical Physics, P.N. Lebedev Physical Inst., Moscow (Russia)
1992-07-23
We solve the N-body Calogero problem, i.e., N particles in one dimension subject to a two-body interaction of the form 1/2 {Sigma}{sub i,j} ((x{sub i}-x{sub j}){sup 2}+g/(x{sub i}-x{sub j}){sup 2}), by constructing annihilation and creation operators of the form a{sub i}{sup -+}=(1/{radical}2)(x{sub i}{+-}ip{sub i}) where p{sub i} is a modified momentum operator obeying Heisenberg-type commutation relations with x{sub i}, involving explicitly permutation operators. On the other hand, D{sub j}=ip{sub j} can be interpreted as a covariant derivative corresponding to a flat connection. The relation to fractional statistics in 1+1 dimensions and anyons in a strong magnetic field is briefly discussed. (orig.).
N-body simulations for coupled scalar-field cosmology
International Nuclear Information System (INIS)
Li Baojiu; Barrow, John D.
2011-01-01
We describe in detail the general methodology and numerical implementation of consistent N-body simulations for coupled-scalar-field models, including background cosmology and the generation of initial conditions (with the different couplings to different matter species taken into account). We perform fully consistent simulations for a class of coupled-scalar-field models with an inverse power-law potential and negative coupling constant, for which the chameleon mechanism does not work. We find that in such cosmological models the scalar-field potential plays a negligible role except in the background expansion, and the fifth force that is produced is proportional to gravity in magnitude, justifying the use of a rescaled gravitational constant G in some earlier N-body simulation works for similar models. We then study the effects of the scalar coupling on the nonlinear matter power spectra and compare with linear perturbation calculations to see the agreement and places where the nonlinear treatment deviates from the linear approximation. We also propose an algorithm to identify gravitationally virialized matter halos, trying to take account of the fact that the virialization itself is also modified by the scalar-field coupling. We use the algorithm to measure the mass function and study the properties of dark-matter halos. We find that the net effect of the scalar coupling helps produce more heavy halos in our simulation boxes and suppresses the inner (but not the outer) density profile of halos compared with the ΛCDM prediction, while the suppression weakens as the coupling between the scalar field and dark-matter particles increases in strength.
Distribution-independent hierarchicald N-body methods
International Nuclear Information System (INIS)
Aluru, S.
1994-01-01
The N-body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. The problem has applications in several domains including astrophysics, molecular dynamics, fluid dynamics, radiosity methods in computer graphics and numerical complex analysis. Research efforts have focused on reducing the O(N 2 ) time per iteration required by the naive algorithm of computing each pairwise interaction. Widely respected among these are the Barnes-Hut and Greengard methods. Greengard claims his algorithm reduces the complexity to O(N) time per iteration. Throughout this thesis, we concentrate on rigorous, distribution-independent, worst-case analysis of the N-body methods. We show that Greengard's algorithm is not O(N), as claimed. Both Barnes-Hut and Greengard's methods depend on the same data structure, which we show is distribution-dependent. For the distribution that results in the smallest running time, we show that Greengard's algorithm is Ω(N log 2 N) in two dimensions and Ω(N log 4 N) in three dimensions. We have designed a hierarchical data structure whose size depends entirely upon the number of particles and is independent of the distribution of the particles. We show that both Greengard's and Barnes-Hut algorithms can be used in conjunction with this data structure to reduce their complexity. Apart from reducing the complexity of the Barnes-Hut algorithm, the data structure also permits more accurate error estimation. We present two- and three-dimensional algorithms for creating the data structure. The multipole method designed using this data structure has a complexity of O(N log N) in two dimensions and O(N log 2 N) in three dimensions
Directory of Open Access Journals (Sweden)
You-Wei Zhang
Full Text Available A general symplectic method for the random response analysis of infinitely periodic structures subjected to stationary/non-stationary random excitations is developed using symplectic mathematics in conjunction with variable separation and the pseudo-excitation method (PEM. Starting from the equation of motion for a single loaded substructure, symplectic analysis is firstly used to eliminate the dependent degrees of the freedom through condensation. A Fourier expansion of the condensed equation of motion is then applied to separate the variables of time and wave number, thus enabling the necessary recurrence scheme to be developed. The random response is finally determined by implementing PEM. The proposed method is justified by comparison with results available in the literature and is then applied to a more complicated time-dependent coupled system.
Symplectic geometry of field theories and covariant quantization of superstrings and superparticles
International Nuclear Information System (INIS)
Crnkovic, C.
1987-01-01
A detailed development of the symplectic geometry formalism for a general Lagrangian field theory is presented. Special attention is paid to the theories with constraints and/or gauge degrees of freedom. Special cases of Yang-Mills theory, general relativity and Witten's string field theory are studied and the generators of (super-) Poincare transformations are derived using their respective symplectic forms. The formalism extends naturally to theories formulated in the superspace. The second part of the thesis deals with issues in covariant quantization. By studying the symplectic geometry of the Green-Schwarz covariant superstring action, we elucidate some aspects of its covariant quantization. We derive the on-shell gauge-fixed action and the equations of motion for all the fields. Finally, turning to Siegel's version of the superparticle action, we perform its BRST quantization
Full-turn symplectic map from a generator in a Fourier-spline basis
International Nuclear Information System (INIS)
Berg, J.S.; Warnock, R.L.; Ruth, R.D.; Forest, E.
1993-04-01
Given an arbitrary symplectic tracking code, one can construct a full-turn symplectic map that approximates the result of the code to high accuracy. The map is defined implicitly by a mixed-variable generating function. The implicit definition is no great drawback in practice, thanks to an efficient use of Newton's method to solve for the explicit map at each iteration. The generator is represented by a Fourier series in angle variables, with coefficients given as B-spline functions of action variables. It is constructed by using results of single-turn tracking from many initial conditions. The method has been appliedto a realistic model of the SSC in three degrees of freedom. Orbits can be mapped symplectically for 10 7 turns on an IBM RS6000 model 320 workstation, in a run of about one day
Rodríguez-Tzompantzi, Omar
2018-05-01
The Faddeev-Jackiw symplectic formalism for constrained systems is applied to analyze the dynamical content of a model describing two massive relativistic particles with interaction, which can also be interpreted as a bigravity model in one dimension. We systematically investigate the nature of the physical constraints, for which we also determine the zero-modes structure of the corresponding symplectic matrix. After identifying the whole set of constraints, we find out the transformation laws for all the set of dynamical variables corresponding to gauge symmetries, encoded in the remaining zero modes. In addition, we use an appropriate gauge-fixing procedure, the conformal gauge, to compute the quantization brackets (Faddeev-Jackiw brackets) and also obtain the number of physical degree of freedom. Finally, we argue that this symplectic approach can be helpful for assessing physical constraints and understanding the gauge structure of theories of interacting spin-2 fields.
International Nuclear Information System (INIS)
Liao Cui-Cui; Cui Jin-Chao; Liang Jiu-Zhen; Ding Xiao-Hua
2016-01-01
In this paper, we propose a variational integrator for nonlinear Schrödinger equations with variable coefficients. It is shown that our variational integrator is naturally multi-symplectic. The discrete multi-symplectic structure of the integrator is presented by a multi-symplectic form formula that can be derived from the discrete Lagrangian boundary function. As two examples of nonlinear Schrödinger equations with variable coefficients, cubic nonlinear Schrödinger equations and Gross–Pitaevskii equations are extensively studied by the proposed integrator. Our numerical simulations demonstrate that the integrator is capable of preserving the mass, momentum, and energy conservation during time evolutions. Convergence tests are presented to verify that our integrator has second-order accuracy both in time and space. (paper)
Sixth- and eighth-order Hermite integrator for N-body simulations
Nitadori, Keigo; Makino, Junichiro
2008-10-01
We present sixth- and eighth-order Hermite integrators for astrophysical N-body simulations, which use the derivatives of accelerations up to second-order ( snap) and third-order ( crackle). These schemes do not require previous values for the corrector, and require only one previous value to construct the predictor. Thus, they are fairly easy to implement. The additional cost of the calculation of the higher-order derivatives is not very high. Even for the eighth-order scheme, the number of floating-point operations for force calculation is only about two times larger than that for traditional fourth-order Hermite scheme. The sixth-order scheme is better than the traditional fourth-order scheme for most cases. When the required accuracy is very high, the eighth-order one is the best. These high-order schemes have several practical advantages. For example, they allow a larger number of particles to be integrated in parallel than the fourth-order scheme does, resulting in higher execution efficiency in both general-purpose parallel computers and GRAPE systems.
Institute of Scientific and Technical Information of China (English)
WANG ShunJin; ZHANG Hua
2007-01-01
Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
Institute of Scientific and Technical Information of China (English)
2007-01-01
Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
International Nuclear Information System (INIS)
Gray, S.K.; Noid, D.W.; Sumpter, B.G.
1994-01-01
We test the suitability of a variety of explicit symplectic integrators for molecular dynamics calculations on Hamiltonian systems. These integrators are extremely simple algorithms with low memory requirements, and appear to be well suited for large scale simulations. We first apply all the methods to a simple test case using the ideas of Berendsen and van Gunsteren. We then use the integrators to generate long time trajectories of a 1000 unit polyethylene chain. Calculations are also performed with two popular but nonsymplectic integrators. The most efficient integrators of the set investigated are deduced. We also discuss certain variations on the basic symplectic integration technique
International Nuclear Information System (INIS)
Chang, P.; Lee, S.Y.; Yan, Y.T.
2006-01-01
A differential algebraic integration algorithm is developed for symplectic mapping through a three-dimensional (3-D) magnetic field. The self-consistent reference orbit in phase space is obtained by making a canonical transformation to eliminate the linear part of the Hamiltonian. Transfer maps from the entrance to the exit of any 3-D magnetic field are then obtained through slice-by-slice symplectic integration. The particle phase-space coordinates are advanced by using the integrable polynomial procedure. This algorithm is a powerful tool to attain nonlinear maps for insertion devices in synchrotron light source or complicated magnetic field in the interaction region in high energy colliders
Chen, Qiang; Qin, Hong; Liu, Jian; Xiao, Jianyuan; Zhang, Ruili; He, Yang; Wang, Yulei
2017-11-01
An infinite dimensional canonical symplectic structure and structure-preserving geometric algorithms are developed for the photon-matter interactions described by the Schrödinger-Maxwell equations. The algorithms preserve the symplectic structure of the system and the unitary nature of the wavefunctions, and bound the energy error of the simulation for all time-steps. This new numerical capability enables us to carry out first-principle based simulation study of important photon-matter interactions, such as the high harmonic generation and stabilization of ionization, with long-term accuracy and fidelity.
International Nuclear Information System (INIS)
Chang, P
2004-01-01
A differential algebraic integration algorithm is developed for symplectic mapping through a three-dimensional (3-D) magnetic field. The self-consistent reference orbit in phase space is obtained by making a canonical transformation to eliminate the linear part of the Hamiltonian. Transfer maps from the entrance to the exit of any 3-D magnetic field are then obtained through slice-by-slice symplectic integration. The particle phase-space coordinates are advanced by using the integrable polynomial procedure. This algorithm is a powerful tool to attain nonlinear maps for insertion devices in synchrotron light source or complicated magnetic field in the interaction region in high energy colliders
Geometrical themes inspired by the n-body problem
Herrera, Haydeé; Herrera, Rafael
2018-01-01
Presenting a selection of recent developments in geometrical problems inspired by the N-body problem, these lecture notes offer a variety of approaches to study them, ranging from variational to dynamical, while developing new insights, making geometrical and topological detours, and providing historical references. A. Guillot’s notes aim to describe differential equations in the complex domain, motivated by the evolution of N particles moving on the plane subject to the influence of a magnetic field. Guillot studies such differential equations using different geometric structures on complex curves (in the sense of W. Thurston) in order to find isochronicity conditions. R. Montgomery’s notes deal with a version of the planar Newtonian three-body equation. Namely, he investigates the problem of whether every free homotopy class is realized by a periodic geodesic. The solution involves geometry, dynamical systems, and the McGehee blow-up. A novelty of the approach is the use of energy-balance in order t...
Near transferable phenomenological n-body potentials for noble metals.
Pontikis, Vassilis; Baldinozzi, Gianguido; Luneville, Laurence; Simeone, David
2017-09-06
We present a semi-empirical model of cohesion in noble metals with suitable parameters reproducing a selected set of experimental properties of perfect and defective lattices in noble metals. It consists of two short-range, n-body terms accounting respectively for attractive and repulsive interactions, the former deriving from the second moment approximation of the tight-binding scheme and the latter from the gas approximation of the kinetic energy of electrons. The stability of the face centred cubic versus the hexagonal compact stacking is obtained via a long-range, pairwise function of customary use with ionic pseudo-potentials. Lattice dynamics, molecular statics, molecular dynamics and nudged elastic band calculations show that, unlike previous potentials, this cohesion model reproduces and predicts quite accurately thermodynamic properties in noble metals. In particular, computed surface energies, largely underestimated by existing empirical cohesion models, compare favourably with measured values, whereas predicted unstable stacking-fault energy profiles fit almost perfectly ab initio evaluations from the literature. All together the results suggest that this semi-empirical model is nearly transferable.
FORMING CIRCUMBINARY PLANETS: N-BODY SIMULATIONS OF KEPLER-34
International Nuclear Information System (INIS)
Lines, S.; Leinhardt, Z. M.; Paardekooper, S.; Baruteau, C.; Thebault, P.
2014-01-01
Observations of circumbinary planets orbiting very close to the central stars have shown that planet formation may occur in a very hostile environment, where the gravitational pull from the binary should be very strong on the primordial protoplanetary disk. Elevated impact velocities and orbit crossings from eccentricity oscillations are the primary contributors to high energy, potentially destructive collisions that inhibit the growth of aspiring planets. In this work, we conduct high-resolution, inter-particle gravity enabled N-body simulations to investigate the feasibility of planetesimal growth in the Kepler-34 system. We improve upon previous work by including planetesimal disk self-gravity and an extensive collision model to accurately handle inter-planetesimal interactions. We find that super-catastrophic erosion events are the dominant mechanism up to and including the orbital radius of Kepler-34(AB)b, making in situ growth unlikely. It is more plausible that Kepler-34(AB)b migrated from a region beyond 1.5 AU. Based on the conclusions that we have made for Kepler-34, it seems likely that all of the currently known circumbinary planets have also migrated significantly from their formation location with the possible exception of Kepler-47(AB)c
FORMING CIRCUMBINARY PLANETS: N-BODY SIMULATIONS OF KEPLER-34
Energy Technology Data Exchange (ETDEWEB)
Lines, S.; Leinhardt, Z. M. [School of Physics, University of Bristol, H. H. Wills Physics Laboratory, Tyndall Avenue, Bristol BS8 1TL (United Kingdom); Paardekooper, S.; Baruteau, C. [DAMTP, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA (United Kingdom); Thebault, P., E-mail: stefan.lines@bristol.ac.uk [LESIA-Observatoire de Paris, UPMC Univ. Paris 06, Univ. Paris-Diderot, F-92195 Meudon Cedex (France)
2014-02-10
Observations of circumbinary planets orbiting very close to the central stars have shown that planet formation may occur in a very hostile environment, where the gravitational pull from the binary should be very strong on the primordial protoplanetary disk. Elevated impact velocities and orbit crossings from eccentricity oscillations are the primary contributors to high energy, potentially destructive collisions that inhibit the growth of aspiring planets. In this work, we conduct high-resolution, inter-particle gravity enabled N-body simulations to investigate the feasibility of planetesimal growth in the Kepler-34 system. We improve upon previous work by including planetesimal disk self-gravity and an extensive collision model to accurately handle inter-planetesimal interactions. We find that super-catastrophic erosion events are the dominant mechanism up to and including the orbital radius of Kepler-34(AB)b, making in situ growth unlikely. It is more plausible that Kepler-34(AB)b migrated from a region beyond 1.5 AU. Based on the conclusions that we have made for Kepler-34, it seems likely that all of the currently known circumbinary planets have also migrated significantly from their formation location with the possible exception of Kepler-47(AB)c.
Forming Circumbinary Planets: N-body Simulations of Kepler-34
Lines, S.; Leinhardt, Z. M.; Paardekooper, S.; Baruteau, C.; Thebault, P.
2014-02-01
Observations of circumbinary planets orbiting very close to the central stars have shown that planet formation may occur in a very hostile environment, where the gravitational pull from the binary should be very strong on the primordial protoplanetary disk. Elevated impact velocities and orbit crossings from eccentricity oscillations are the primary contributors to high energy, potentially destructive collisions that inhibit the growth of aspiring planets. In this work, we conduct high-resolution, inter-particle gravity enabled N-body simulations to investigate the feasibility of planetesimal growth in the Kepler-34 system. We improve upon previous work by including planetesimal disk self-gravity and an extensive collision model to accurately handle inter-planetesimal interactions. We find that super-catastrophic erosion events are the dominant mechanism up to and including the orbital radius of Kepler-34(AB)b, making in situ growth unlikely. It is more plausible that Kepler-34(AB)b migrated from a region beyond 1.5 AU. Based on the conclusions that we have made for Kepler-34, it seems likely that all of the currently known circumbinary planets have also migrated significantly from their formation location with the possible exception of Kepler-47(AB)c.
High Resolution N-Body Simulations of Terrestrial Planet Growth
Clark Wallace, Spencer; Quinn, Thomas R.
2018-04-01
We investigate planetesimal accretion with a direct N-body simulation of an annulus at 1 AU around a 1 M_sun star. The planetesimal ring, which initially contains N = 106 bodies is evolved through the runaway growth stage into the phase of oligarchic growth. We find that the mass distribution of planetesimals develops a bump around 1022 g shortly after the oligarchs form. This feature is absent in previous lower resolution studies. We find that this bump marks a boundary between growth modes. Below the bump mass, planetesimals are packed tightly enough together to populate first order mean motion resonances with the oligarchs. These resonances act to heat the tightly packed, low mass planetesimals, inhibiting their growth. We examine the eccentricity evolution of a dynamically hot planetary embryo embedded in an annulus of planetesimals and find that dynamical friction acts more strongly on the embryo when the planetesimals are finely resolved. This effect disappears when the annulus is made narrow enough to exclude most of the mean motion resonances. Additionally, we find that the 1022 g bump is significantly less prominent when we follow planetesimal growth with a skinny annulus.This feature, which is reminiscent of the power law break seen in the size distribution of asteroid belt objects may be an important clue for constraining the initial size of planetesimals in planet formation models.
Evaluation of clustering statistics with N-body simulations
International Nuclear Information System (INIS)
Quinn, T.R.
1986-01-01
Two series of N-body simulations are used to determine the effectiveness of various clustering statistics in revealing initial conditions from evolved models. All the simulations contained 16384 particles and were integrated with the PPPM code. One series is a family of models with power at only one wavelength. The family contains five models with the wavelength of the power separated by factors of √2. The second series is a family of all equal power combinations of two wavelengths taken from the first series. The clustering statistics examined are the two point correlation function, the multiplicity function, the nearest neighbor distribution, the void probability distribution, the distribution of counts in cells, and the peculiar velocity distribution. It is found that the covariance function, the nearest neighbor distribution, and the void probability distribution are relatively insensitive to the initial conditions. The distribution of counts in cells show a little more sensitivity, but the multiplicity function is the best of the statistics considered for revealing the initial conditions
Exact smooth classification of Hamiltonian vector fields on symplectic 2-manifolds
International Nuclear Information System (INIS)
Krouglikov, B.S.
1994-10-01
Complete exact classification of Hamiltonian systems with one degree of freedom and Morse Hamiltonian is carried out. As it is a main part of trajectory classification of integrable Hamiltonian systems with two degrees of freedom, the corresponding generalization is considered. The dual problem of classification of symplectic form together with Morse foliation is carried out as well. (author). 10 refs, 16 figs
Directory of Open Access Journals (Sweden)
You Gao
2011-01-01
Full Text Available A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.
Symplectic homoclinic tangles of the ideal separatrix of the DIII-D from type I ELMs
Punjabi, Alkesh; Ali, Halima
2012-10-01
The ideal separatrix of the divertor tokamaks is a degenerate manifold where both the stable and unstable manifolds coincide. Non-axisymmetric magnetic perturbations remove the degeneracy; and split the separatrix manifold. This creates an extremely complex topological structure, called homoclinic tangles. The unstable manifold intersects the stable manifold and creates alternating inner and outer lobes at successive homoclinic points. The Hamiltonian system must preserve the symplectic topological invariance, and this controls the size and radial extent of the lobes. Very recently, lobes near the X-point have been experimentally observed in MAST [A. Kirk et al, PRL 108, 255003 (2012)]. We have used the DIII-D map [A. Punjabi, NF 49, 115020 (2009)] to calculate symplectic homoclinic tangles of the ideal separatrix of the DIII-D from the type I ELMs represented by the peeling-ballooning modes (m,n)=(30,10)+(40,10). The DIII-D map is symplectic, accurate, and is in natural canonical coordinates which are invertible to physical coordinates [A. Punjabi and H. Ali, POP 15, 122502 (2008)]. To our knowledge, we are the first to symplectically calculate these tangles in physical space. Homoclinic tangles of separatrix can cause radial displacement of mobile passing electrons and create sheared radial electric fields and currents, resulting in radial flows, drifts, differential spinning, and reduction in turbulence, and other effects. This work is supported by the grants DE-FG02-01ER54624 and DE-FG02-04ER54793.
International Nuclear Information System (INIS)
Struckmeier, Juergen
2005-01-01
We will present a consistent description of Hamiltonian dynamics on the 'symplectic extended phase space' that is analogous to that of a time-independent Hamiltonian system on the conventional symplectic phase space. The extended Hamiltonian H 1 and the pertaining extended symplectic structure that establish the proper canonical extension of a conventional Hamiltonian H will be derived from a generalized formulation of Hamilton's variational principle. The extended canonical transformation theory then naturally permits transformations that also map the time scales of the original and destination system, while preserving the extended Hamiltonian H 1 , and hence the form of the canonical equations derived from H 1 . The Lorentz transformation, as well as time scaling transformations in celestial mechanics, will be shown to represent particular canonical transformations in the symplectic extended phase space. Furthermore, the generalized canonical transformation approach allows us to directly map explicitly time-dependent Hamiltonians into time-independent ones. An 'extended' generating function that defines transformations of this kind will be presented for the time-dependent damped harmonic oscillator and for a general class of explicitly time-dependent potentials. In the appendix, we will re-establish the proper form of the extended Hamiltonian H 1 by means of a Legendre transformation of the extended Lagrangian L 1
Principal and nonprincipal solutions of symplectic dynamic systems on time scales
Directory of Open Access Journals (Sweden)
Ondrej Dosly
2000-01-01
Full Text Available We establish the concept of the principal and nonprincipal solution for the so-called symplectic dynamic systems on time scales. We also present a brief survey of the history of these concept for differential and difference equations.
Classification of the linear canonical transformation and its associated real symplectic matrix
Bastiaans, M.J.; Alieva, T.
2007-01-01
Based on the eigenvalues of the real symplectic ABCD-matrix that characterizes the linear canonical integral transformation, a classification of this transformation and the associated ABCD-system is proposed and some nuclei (i.e. elementary members) in each class are described. In the
The Monge-Ampère equation: Hamiltonian and symplectic structures, recursions, and hierarchies
Kersten, P.H.M.; Krasil'shchik, I.; Verbovetsky, A.V.
2004-01-01
Using methods of geometry and cohomology developed recently, we study the Monge-Ampère equation, arising as the first nontrivial equation in the associativity equations, or WDVV equations. We describe Hamiltonian and symplectic structures as well as recursion operators for this equation in its
An optimized formulation for Deprit-type Lie transformations of Taylor maps for symplectic systems
International Nuclear Information System (INIS)
Shi, Jicong
1993-01-01
An optimized iterative formulation is presented for directly transforming a Taylor map of a symplectic system into a Deprit-type Lie transformation, which is a composition of a linear transfer matrix and a single Lie transformation, to an arbitrary order
International Nuclear Information System (INIS)
Warnock, R.L.; Ellison, J.A.; Univ. of New Mexico, Albuquerque, NM
1997-08-01
Data from orbits of a symplectic integrator can be interpolated so as to construct an approximation to the generating function of a Poincare map. The time required to compute an orbit of the symplectic map induced by the generator can be much less than the time to follow the same orbit by symplectic integration. The construction has been carried out previously for full-turn maps of large particle accelerators, and a big saving in time (for instance a factor of 60) has been demonstrated. A shortcoming of the work to date arose from the use of canonical polar coordinates, which precluded map construction in small regions of phase space near coordinate singularities. This paper shows that Cartesian coordinates can also be used, thus avoiding singularities. The generator is represented in a basis of tensor product B-splines. Under weak conditions the spline expansion converges uniformly as the mesh is refined, approaching the exact generator of the Poincare map as defined by the symplectic integrator, in some parallelepiped of phase space centered at the origin
Numerical techniques for large cosmological N-body simulations
International Nuclear Information System (INIS)
Efstathiou, G.; Davis, M.; Frenk, C.S.; White, S.D.M.
1985-01-01
We describe and compare techniques for carrying out large N-body simulations of the gravitational evolution of clustering in the fundamental cube of an infinite periodic universe. In particular, we consider both particle mesh (PM) codes and P 3 M codes in which a higher resolution force is obtained by direct summation of contributions from neighboring particles. We discuss the mesh-induced anisotropies in the forces calculated by these schemes, and the extent to which they can model the desired 1/r 2 particle-particle interaction. We also consider how transformation of the time variable can improve the efficiency with which the equations of motion are integrated. We present tests of the accuracy with which the resulting schemes conserve energy and are able to follow individual particle trajectories. We have implemented an algorithm which allows initial conditions to be set up to model any desired spectrum of linear growing mode density fluctuations. A number of tests demonstrate the power of this algorithm and delineate the conditions under which it is effective. We carry out several test simulations using a variety of techniques in order to show how the results are affected by dynamic range limitations in the force calculations, by boundary effects, by residual artificialities in the initial conditions, and by the number of particles employed. For most purposes cosmological simulations are limited by the resolution of their force calculation rather than by the number of particles they can employ. For this reason, while PM codes are quite adequate to study the evolution of structure on large scale, P 3 M methods are to be preferred, in spite of their greater cost and complexity, whenever the evolution of small-scale structure is important
Zhang, Ruili; Wang, Yulei; He, Yang; Xiao, Jianyuan; Liu, Jian; Qin, Hong; Tang, Yifa
2018-02-01
Relativistic dynamics of a charged particle in time-dependent electromagnetic fields has theoretical significance and a wide range of applications. The numerical simulation of relativistic dynamics is often multi-scale and requires accurate long-term numerical simulations. Therefore, explicit symplectic algorithms are much more preferable than non-symplectic methods and implicit symplectic algorithms. In this paper, we employ the proper time and express the Hamiltonian as the sum of exactly solvable terms and product-separable terms in space-time coordinates. Then, we give the explicit symplectic algorithms based on the generating functions of orders 2 and 3 for relativistic dynamics of a charged particle. The methodology is not new, which has been applied to non-relativistic dynamics of charged particles, but the algorithm for relativistic dynamics has much significance in practical simulations, such as the secular simulation of runaway electrons in tokamaks.
Orthogonal and symplectic Yangians and Yang–Baxter R-operators
International Nuclear Information System (INIS)
Isaev, A.P.; Karakhanyan, D.; Kirschner, R.
2016-01-01
Yang–Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with the orthogonal or symplectic fundamental R matrix, are considered in the interesting cases, where their expansion in inverse powers of the spectral parameter is truncated. Unlike the case of special linear algebra symmetry the truncation results in additional conditions on the Lie algebra generators of which the L operators is built and which can be fulfilled in distinguished representations only. Further, generalized L operators, obeying the modified RLL relation with the fundamental R matrix replaced by the spinorial or metaplectic one, are considered in the particular case of linear dependence on the spectral parameter. It is shown how by fusion with respect to the spinorial or metaplectic representation these first order spinorial L operators reproduce the ordinary L operators with second order truncation.
Orthogonal and symplectic Yangians and Yang–Baxter R-operators
Energy Technology Data Exchange (ETDEWEB)
Isaev, A.P., E-mail: isaevap@theor.jinr.ru [Bogoliubov Lab., Joint Institute of Nuclear Research, Dubna (Russian Federation); Karakhanyan, D., E-mail: karakhan@yerphi.am [Yerevan Physics Institute, 2 Alikhanyan br., 0036 Yerevan (Armenia); Kirschner, R., E-mail: Roland.Kirschner@itp.uni-leipzig.de [Institut für Theoretische Physik, Universität Leipzig, PF 100 920, D-04009 Leipzig (Germany)
2016-03-15
Yang–Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with the orthogonal or symplectic fundamental R matrix, are considered in the interesting cases, where their expansion in inverse powers of the spectral parameter is truncated. Unlike the case of special linear algebra symmetry the truncation results in additional conditions on the Lie algebra generators of which the L operators is built and which can be fulfilled in distinguished representations only. Further, generalized L operators, obeying the modified RLL relation with the fundamental R matrix replaced by the spinorial or metaplectic one, are considered in the particular case of linear dependence on the spectral parameter. It is shown how by fusion with respect to the spinorial or metaplectic representation these first order spinorial L operators reproduce the ordinary L operators with second order truncation.
On the Faddeev-Jackiw symplectic framework for topologically massive gravity
Energy Technology Data Exchange (ETDEWEB)
Escalante, Alberto [Benemerita Universidad Autonoma de Puebla, Instituto de Fisica, Puebla (Mexico); Rodriguez-Tzompantzi, Omar [Benemerita Universidad Autonoma de Puebla, Facultad de Ciencias Fisico Matematicas, Puebla (Mexico)
2016-10-15
The dynamical structure of topologically massive gravity in the context of the Faddeev-Jackiw symplectic approach is studied. It is shown that this method allows us to avoid some ambiguities arising in the study of the gauge structure via the Dirac formalism. In particular, the complete set of constraints and the generators of the gauge symmetry of the theory are obtained straightforwardly via the zero modes of the symplectic matrix. In order to obtain the generalized Faddeev-Jackiw brackets and calculate the local physical degrees of freedom of this model, an appropriate gauge-fixing procedure is introduced. Finally, the similarities and relative advantages between the Faddeev-Jackiw method and Dirac's formalism are briefly discussed. (orig.)
Wavelet approach to accelerator problems. 3: Melnikov functions and symplectic topology
International Nuclear Information System (INIS)
Fedorova, A.; Zeitlin, M.; Parsa, Z.
1997-05-01
This is the third part of a series of talks in which the authors present applications of methods of wavelet analysis to polynomial approximations for a number of accelerator physics problems. They consider the generalization of the variational wavelet approach to nonlinear polynomial problems to the case of Hamiltonian systems for which they need to preserve underlying symplectic or Poissonian or quasicomplex structures in any type of calculations. They use the approach for the problem of explicit calculations of Arnold-Weinstein curves via Floer variational approach from symplectic topology. The loop solutions are parameterized by the solutions of reduced algebraical problem--matrix Quadratic Mirror Filters equations. Also they consider wavelet approach to the calculations of Melnikov functions in the theory of homoclinic chaos in perturbed Hamiltonian systems
Symplectic Tracking of Multi-Isotopic Heavy-Ion Beams in SixTrack
Hermes, Pascal; De Maria, Riccardo
2016-01-01
The software SixTrack provides symplectic proton tracking over a large number of turns. The code is used for the tracking of beam halo particles and the simulation of their interaction with the collimators to study the efficiency of the LHC collimation system. Tracking simulations for heavy-ion beams require taking into account the mass to charge ratio of each particle because heavy ions can be subject to fragmentation at their passage through the collimators. In this paper we present the derivation of a Hamiltonian for multi-isotopic heavy-ion beams and symplectic tracking maps derived from it. The resulting tracking maps were implemented in the tracking software SixTrack. With this modification, SixTrack can be used to natively track heavy-ion beams of multiple isotopes through a magnetic accelerator lattice.
Application of the symplectic finite-difference time-domain scheme to electromagnetic simulation
International Nuclear Information System (INIS)
Sha, Wei; Huang, Zhixiang; Wu, Xianliang; Chen, Mingsheng
2007-01-01
An explicit fourth-order finite-difference time-domain (FDTD) scheme using the symplectic integrator is applied to electromagnetic simulation. A feasible numerical implementation of the symplectic FDTD (SFDTD) scheme is specified. In particular, new strategies for the air-dielectric interface treatment and the near-to-far-field (NFF) transformation are presented. By using the SFDTD scheme, both the radiation and the scattering of three-dimensional objects are computed. Furthermore, the energy-conserving characteristic hold for the SFDTD scheme is verified under long-term simulation. Numerical results suggest that the SFDTD scheme is more efficient than the traditional FDTD method and other high-order methods, and can save computational resources
An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems
Karlsson, Peer Jesper
2015-01-07
This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns Symplectic Euler solutions of the Hamiltonian system connected with the optimal control problem. The error representation has a leading order term consisting of an error density that is computable from Symplectic Euler solutions. Under an assumption of the pathwise convergence of the approximate dual function as the maximum time step goes to zero, we prove that the remainder is of higher order than the leading error density part in the error representation. With the error representation, it is possible to perform adaptive time stepping. We apply an adaptive algorithm originally developed for ordinary differential equations.
An Error Estimate for Symplectic Euler Approximation of Optimal Control Problems
Karlsson, Jesper; Larsson, Stig; Sandberg, Mattias; Szepessy, Anders; Tempone, Raul
2015-01-01
This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns symplectic Euler solutions of the Hamiltonian system connected with the optimal control problem. The error representation has a leading-order term consisting of an error density that is computable from symplectic Euler solutions. Under an assumption of the pathwise convergence of the approximate dual function as the maximum time step goes to zero, we prove that the remainder is of higher order than the leading-error density part in the error representation. With the error representation, it is possible to perform adaptive time stepping. We apply an adaptive algorithm originally developed for ordinary differential equations. The performance is illustrated by numerical tests.
Multi-symplectic Runge-Kutta methods for nonlinear Dirac equations
International Nuclear Information System (INIS)
Hong Jialin; Li Chun
2006-01-01
In this paper, we consider the multi-symplectic Runge-Kutta (MSRK) methods applied to the nonlinear Dirac equation in relativistic quantum physics, based on a discovery of the multi-symplecticity of the equation. In particular, the conservation of energy, momentum and charge under MSRK discretizations is investigated by means of numerical experiments and numerical comparisons with non-MSRK methods. Numerical experiments presented reveal that MSRK methods applied to the nonlinear Dirac equation preserve exactly conservation laws of charge and momentum, and conserve the energy conservation in the corresponding numerical accuracy to the method utilized. It is verified numerically that MSRK methods are stable and convergent with respect to the conservation laws of energy, momentum and charge, and MSRK methods preserve not only the inner geometric structure of the equation, but also some crucial conservative properties in quantum physics. A remarkable advantage of MSRK methods applied to the nonlinear Dirac equation is the precise preservation of charge conservation law
Symplectic geometry on moduli spaces of holomorphic bundles over complex surfaces
Khesin, Boris; Rosly, Alexei
2000-01-01
We give a comparative description of the Poisson structures on the moduli spaces of flat connections on real surfaces and holomorphic Poisson structures on the moduli spaces of holomorphic bundles on complex surfaces. The symplectic leaves of the latter are classified by restrictions of the bundles to certain divisors. This can be regarded as fixing a "complex analogue of the holonomy" of a connection along a "complex analogue of the boundary" in analogy with the real case.
Path integral quantization of the Symplectic Leaves of the SU(2)*Poisson-Lie Group
International Nuclear Information System (INIS)
Morariu, B.
1997-01-01
The Feynman path integral is used to quantize the symplectic leaves of the Poisson-Lie group SU(2)*. In this way we obtain the unitary representations of Uq(su(2)). This is achieved by finding explicit Darboux coordinates and then using a phase space path integral. I discuss the *-structure of SU(2)* and give a detailed description of its leaves using various parameterizations and also compare the results with the path integral quantization of spin
Construction and uniqueness of the C*-Weyl algebra over a general pre-symplectic space
International Nuclear Information System (INIS)
Binz, Ernst; Honegger, Reinhard; Rieckers, Alfred
2004-01-01
A systematic approach to the C*-Weyl algebra W(E,σ) over a possibly degenerate pre-symplectic form σ on a real vector space E of possibly infinite dimension is elaborated in an almost self-contained manner. The construction is based on the theory of Kolmogorov decompositions for σ-positive-definite functions on involutive semigroups and their associated projective unitary group representations. The σ-positive-definite functions provide also the C*-norm of W(E,σ), the latter being shown to be *-isomorphic to the twisted group C*-algebra of the discrete vector group E. The connections to related constructions are indicated. The treatment of the fundamental symmetries is outlined for arbitrary pre-symplectic σ. The construction method is especially applied to the trivial symplectic form σ=0, leading to the commutative Weyl algebra over E, which is shown to be isomorphic to the C*-algebra of the almost periodic continuous function on the topological dual E τ ' of E with respect to an arbitrary locally convex Hausdorff topology τ on E. It is demonstrated that the almost periodic compactification aE τ ' of E τ ' is independent of the chosen locally convex τ on E, and that aE τ ' is continuously group isomorphic to the character group E of E. Applications of the results to the procedures of strict and continuous deformation quantizations are mentioned in the outlook
Two modified symplectic partitioned Runge-Kutta methods for solving the elastic wave equation
Su, Bo; Tuo, Xianguo; Xu, Ling
2017-08-01
Based on a modified strategy, two modified symplectic partitioned Runge-Kutta (PRK) methods are proposed for the temporal discretization of the elastic wave equation. The two symplectic schemes are similar in form but are different in nature. After the spatial discretization of the elastic wave equation, the ordinary Hamiltonian formulation for the elastic wave equation is presented. The PRK scheme is then applied for time integration. An additional term associated with spatial discretization is inserted into the different stages of the PRK scheme. Theoretical analyses are conducted to evaluate the numerical dispersion and stability of the two novel PRK methods. A finite difference method is used to approximate the spatial derivatives since the two schemes are independent of the spatial discretization technique used. The numerical solutions computed by the two new schemes are compared with those computed by a conventional symplectic PRK. The numerical results, which verify the new method, are superior to those generated by traditional conventional methods in seismic wave modeling.
Symplectic tracking using point magnets in the presence of a longitudinal magnetic field
International Nuclear Information System (INIS)
Parzen, G.
1993-09-01
In the absence of a longitudinal magnetic field, symplectic tracking can be achieved by replacing the magnets by a series of point magnets and drift spaces. To treat the case when a longitudinal magnetic field is also present, this procedure is modified in this paper by replacing the drift space by a solenoidal drift, which is defined as the motion of a particle in a uniform longitudinal magnetic field. A symplectic integrator can be obtained by subdividing each magnet into pieces and replacing each magnet piece by point magnets, with only transverse fields, and solenoidal drift spaces. The reference orbit used here is made up of arcs of circles and straight lines which join smoothly with each other. For this choice of reference orbit, the required results are obtained to track particles, which are the transfer functions, and the transfer time for the different elements. It is shown that these results provide a symplectic integrator, and they are exact in the sense that as the number of magnet pieces is increased, the particle motion will converge to the particle motion of the exact equations of motion
Crockett, Thomas W.
1995-01-01
This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.
1982-01-01
Parallel Computations focuses on parallel computation, with emphasis on algorithms used in a variety of numerical and physical applications and for many different types of parallel computers. Topics covered range from vectorization of fast Fourier transforms (FFTs) and of the incomplete Cholesky conjugate gradient (ICCG) algorithm on the Cray-1 to calculation of table lookups and piecewise functions. Single tridiagonal linear systems and vectorized computation of reactive flow are also discussed.Comprised of 13 chapters, this volume begins by classifying parallel computers and describing techn
Exploiting Symmetry on Parallel Architectures.
Stiller, Lewis Benjamin
1995-01-01
This thesis describes techniques for the design of parallel programs that solve well-structured problems with inherent symmetry. Part I demonstrates the reduction of such problems to generalized matrix multiplication by a group-equivariant matrix. Fast techniques for this multiplication are described, including factorization, orbit decomposition, and Fourier transforms over finite groups. Our algorithms entail interaction between two symmetry groups: one arising at the software level from the problem's symmetry and the other arising at the hardware level from the processors' communication network. Part II illustrates the applicability of our symmetry -exploitation techniques by presenting a series of case studies of the design and implementation of parallel programs. First, a parallel program that solves chess endgames by factorization of an associated dihedral group-equivariant matrix is described. This code runs faster than previous serial programs, and discovered it a number of results. Second, parallel algorithms for Fourier transforms for finite groups are developed, and preliminary parallel implementations for group transforms of dihedral and of symmetric groups are described. Applications in learning, vision, pattern recognition, and statistics are proposed. Third, parallel implementations solving several computational science problems are described, including the direct n-body problem, convolutions arising from molecular biology, and some communication primitives such as broadcast and reduce. Some of our implementations ran orders of magnitude faster than previous techniques, and were used in the investigation of various physical phenomena.
Effects of the Size of Cosmological N-body Simulations on Physical ...
Indian Academy of Sciences (India)
Apart from N-body simulations, an analytical prescription given by Press & ...... Little, B., Weinberg, D. H., Park, C. 1991, MNRAS, 253, 295. Ma, C.-P. ... Padmanabhan, T. 1993, Structure Formation in the Universe, Cambridge University Press.
Effects of the initial conditions on cosmological $N$-body simulations
L'Huillier, Benjamin; Park, Changbom; Kim, Juhan
2014-01-01
Cosmology is entering an era of percent level precision due to current large observational surveys. This precision in observation is now demanding more accuracy from numerical methods and cosmological simulations. In this paper, we study the accuracy of $N$-body numerical simulations and their dependence on changes in the initial conditions and in the simulation algorithms. For this purpose, we use a series of cosmological $N$-body simulations with varying initial conditions. We test the infl...
The Quantum N-Body Problem and the Auxiliary Field Method
International Nuclear Information System (INIS)
Semay, C.; Buisseret, F.; Silvestre-Brac, B.
2011-01-01
Approximate analytical energy formulas for N-body semirelativistic Hamiltonians with one- and two-body interactions are obtained within the framework of the auxiliary field method. We first review the method in the case of nonrelativistic two-body problems. A general procedure is then given for N-body systems and applied to the case of baryons in the large-N c limit. (author)
International Nuclear Information System (INIS)
Le Van Hop.
1989-12-01
The combinatorics computation is used to describe the Casimir operators of the symplectic Lie Algebra. This result is applied for determining the Center of the enveloping Algebra of the semidirect Product of the Heisenberg Lie Algebra and the symplectic Lie Algebra. (author). 10 refs
Casanova, Henri; Robert, Yves
2008-01-01
""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi
PHoToNs–A parallel heterogeneous and threads oriented code for cosmological N-body simulation
Wang, Qiao; Cao, Zong-Yan; Gao, Liang; Chi, Xue-Bin; Meng, Chen; Wang, Jie; Wang, Long
2018-06-01
We introduce a new code for cosmological simulations, PHoToNs, which incorporates features for performing massive cosmological simulations on heterogeneous high performance computer (HPC) systems and threads oriented programming. PHoToNs adopts a hybrid scheme to compute gravitational force, with the conventional Particle-Mesh (PM) algorithm to compute the long-range force, the Tree algorithm to compute the short range force and the direct summation Particle-Particle (PP) algorithm to compute gravity from very close particles. A self-similar space filling a Peano-Hilbert curve is used to decompose the computing domain. Threads programming is advantageously used to more flexibly manage the domain communication, PM calculation and synchronization, as well as Dual Tree Traversal on the CPU+MIC platform. PHoToNs scales well and efficiency of the PP kernel achieves 68.6% of peak performance on MIC and 74.4% on CPU platforms. We also test the accuracy of the code against the much used Gadget-2 in the community and found excellent agreement.
International Nuclear Information System (INIS)
Bogolubov, N.N. Jr.; Prykarpatsky, A.K.; Taneri, U.; Prykarpatsky, Y.A.
2009-01-01
Based on analysis of reduced geometric structures on fibered manifolds, invariant under action of a certain symmetry group, we construct the symplectic structures associated with connection forms on suitable principal fiber bundles. The application to the non-standard Hamiltonian analysis of the Maxwell and Yang-Mills type dynamical systems is presented. A symplectic reduction theory of the classical Maxwell electromagnetic field equations is formulated, the important Lorentz condition, ensuring the existence of electromagnetic waves, is naturally included into the Hamiltonian picture, thereby solving the well known Dirac, Fock and Podolsky problem. The symplectically reduced Poissonian structures and the related classical minimal interaction principle, concerning the Yang-Mills type equations, are considered. (author)
Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes
Harrington, James William
Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present
International Nuclear Information System (INIS)
Wang, Zhong-Min; Liu, Yan-Zhuang
2016-01-01
Highlights: • We investigate the transverse vibration of FGM pipe conveying fluid. • The FGM pipe conveying fluid can be classified into two cases. • The variations between the frequency and the power law exponent are obtained. • “Case 1” is relatively more reasonable than “case 2”. - Abstract: Problems related to the transverse vibration of pipe conveying fluid made of functionally graded material (FGM) are addressed. Based on inside and outside surface material compositions of the pipe, FGM pipe conveying fluid can be classified into two cases. It is hypothesized that the physical parameters of the material along the direction of the pipe wall thickness change in the simple power law. A differential equation of motion expressed in non-dimensional quantities is derived by using Hamilton's principle for systems of changing mass. Using the assuming modal method, the pipe deflection function is expanded into a series, in which each term is expressed to admissible function multiplied by generalized coordinate. Then, the differential equation of motion is discretized into the two order differential equations expressed in the generalized coordinates. Based on symplectic elastic theory and the introduction of dual system and dual variable, Hamilton's dual equations are derived, and the original problem is reduced to eigenvalue and eigenvector problem in the symplectic space. Finally, a symplectic method is employed to analyze the vibration and stability of FGM pipe conveying fluid. For a clamped–clamped FGM pipe conveying fluid in “case 1” and “case 2”, the dimensionless critical flow velocity for first-mode divergence and the critical coupled-mode flutter flow velocity are obtained, and the variations between the real part and imaginary part of dimensionless complex frequency and fluid velocity, mass ratio and the power law exponent (or graded index, volume fraction) for FGM pipe conveying fluid are analyzed.
Energy Technology Data Exchange (ETDEWEB)
Wang, Zhong-Min, E-mail: wangzhongm@xaut.edu.cn; Liu, Yan-Zhuang
2016-03-15
Highlights: • We investigate the transverse vibration of FGM pipe conveying fluid. • The FGM pipe conveying fluid can be classified into two cases. • The variations between the frequency and the power law exponent are obtained. • “Case 1” is relatively more reasonable than “case 2”. - Abstract: Problems related to the transverse vibration of pipe conveying fluid made of functionally graded material (FGM) are addressed. Based on inside and outside surface material compositions of the pipe, FGM pipe conveying fluid can be classified into two cases. It is hypothesized that the physical parameters of the material along the direction of the pipe wall thickness change in the simple power law. A differential equation of motion expressed in non-dimensional quantities is derived by using Hamilton's principle for systems of changing mass. Using the assuming modal method, the pipe deflection function is expanded into a series, in which each term is expressed to admissible function multiplied by generalized coordinate. Then, the differential equation of motion is discretized into the two order differential equations expressed in the generalized coordinates. Based on symplectic elastic theory and the introduction of dual system and dual variable, Hamilton's dual equations are derived, and the original problem is reduced to eigenvalue and eigenvector problem in the symplectic space. Finally, a symplectic method is employed to analyze the vibration and stability of FGM pipe conveying fluid. For a clamped–clamped FGM pipe conveying fluid in “case 1” and “case 2”, the dimensionless critical flow velocity for first-mode divergence and the critical coupled-mode flutter flow velocity are obtained, and the variations between the real part and imaginary part of dimensionless complex frequency and fluid velocity, mass ratio and the power law exponent (or graded index, volume fraction) for FGM pipe conveying fluid are analyzed.
Symplectic Integrators to Stochastic Hamiltonian Dynamical Systems Derived from Composition Methods
Directory of Open Access Journals (Sweden)
Tetsuya Misawa
2010-01-01
Full Text Available “Symplectic” schemes for stochastic Hamiltonian dynamical systems are formulated through “composition methods (or operator splitting methods” proposed by Misawa (2001. In the proposed methods, a symplectic map, which is given by the solution of a stochastic Hamiltonian system, is approximated by composition of the stochastic flows derived from simpler Hamiltonian vector fields. The global error orders of the numerical schemes derived from the stochastic composition methods are provided. To examine the superiority of the new schemes, some illustrative numerical simulations on the basis of the proposed schemes are carried out for a stochastic harmonic oscillator system.
From Stein to Weinstein and back symplectic geometry of affine complex manifolds
Cieliebak, Kai
2013-01-01
A beautiful and comprehensive introduction to this important field. -Dusa McDuff, Barnard College, Columbia University This excellent book gives a detailed, clear, and wonderfully written treatment of the interplay between the world of Stein manifolds and the more topological and flexible world of Weinstein manifolds. Devoted to this subject with a long history, the book serves as a superb introduction to this area and also contains the authors' new results. -Tomasz Mrowka, MIT This book is devoted to the interplay between complex and symplectic geometry in affine complex manifolds. Affine co
Symplectic Group Representation of the Two-Mode Squeezing Operator in the Coherent State Basis
Fan, Hong-Yi; Chen, Jun-Hua
2003-11-01
We find that the coherent state projection operator representation of the two-mode squeezing operator constitutes a loyal group representation of symplectic group, which is a remarkable property of the coherent state. As a consequence, the resultant effect of successively applying two-mode squeezing operators are equivalent to a single squeezing in the two-mode Fock space. Generalization of this property to the 2n-mode case is also discussed. The project supported by National Natural Science Foundation of China under Grant No. 10575057
The symplectic algorithm for use in a model of laser field
International Nuclear Information System (INIS)
Liu Xiaoyan; Liu Xueshen; Ding Peizhu; Zhou Zhongyuan
2002-01-01
Using the asymptotic boundary condition the time-dependent Schroedinger equations with initial conditions in the infinite space can be transformed into the problem with initial and boundary conditions, and it can further be discrected into the inhomogeneous canonic equations. The symplectic algorithms to solve the inhomogeneous canonic equations have been developed and adopted to compute the high-order harmonics of one-dimensional Hydrogen in the laser field. We noticed that there is saturation intensity for generating high-order harmonics, which are agree with previous results, and there is a relationship between harmonics and bound state probabilities
Construction of nonlinear symplectic six-dimensional thin-lens maps by exponentiation
Heinemann, K; Schmidt, F
1995-01-01
The aim of this paper is to construct six-dimensional symplectic thin-lens transport maps for the tracking program SIXTRACK, continuing an earlier report by using another method which consistes in applying Lie series and exponentiation as described by W. Groebner and for canonical systems by A.J. Dragt. We firstly use an approximate Hamiltonian obtained by a series expansion of the square root. Furthermore, nonlinear crossing terms due to the curvature in bending magnets are neglected. An improved Hamiltonian, excluding solenoids, is introduced in Appendix A by using the unexpanded square root mentioned above, but neglecting again nonlinear crossing terms...
Fast symplectic mapping and quasi-invariants for the Large Hadron Collider
International Nuclear Information System (INIS)
Warnock, R.L.; Berg, J.S.; Forest, E.
1995-05-01
Beginning with a tracking code for the LHC, we construct the canonical generator of the full-turn map in polar coordinates. For very fast mapping we adopt a model in which the momentum is modulated sinusoidally with a period of 130 turns (very close to the synchrotron period). We achieve symplectic mapping of 10 7 turns in 3.6 hours on a workstation. Quasi-invariant tori are constructed on the Poincare section corresponding to multiples of the synchrotron period. The possible use of quasi-invariants in derivin, long-term bounds on the motion is discussed
A Survey of Symplectic and Collocation Integration Methods for Orbit Propagation
Jones, Brandon A.; Anderson, Rodney L.
2012-01-01
Demands on numerical integration algorithms for astrodynamics applications continue to increase. Common methods, like explicit Runge-Kutta, meet the orbit propagation needs of most scenarios, but more specialized scenarios require new techniques to meet both computational efficiency and accuracy needs. This paper provides an extensive survey on the application of symplectic and collocation methods to astrodynamics. Both of these methods benefit from relatively recent theoretical developments, which improve their applicability to artificial satellite orbit propagation. This paper also details their implementation, with several tests demonstrating their advantages and disadvantages.
Symplectic no-core shell-model approach to intermediate-mass nuclei
Tobin, G. K.; Ferriss, M. C.; Launey, K. D.; Dytrych, T.; Draayer, J. P.; Dreyfuss, A. C.; Bahri, C.
2014-03-01
We present a microscopic description of nuclei in the intermediate-mass region, including the proximity to the proton drip line, based on a no-core shell model with a schematic many-nucleon long-range interaction with no parameter adjustments. The outcome confirms the essential role played by the symplectic symmetry to inform the interaction and the winnowing of shell-model spaces. We show that it is imperative that model spaces be expanded well beyond the current limits up through 15 major shells to accommodate particle excitations, which appear critical to highly deformed spatial structures and the convergence of associated observables.
Quantization of a symplectic manifold associated to a manifold with projective structure
International Nuclear Information System (INIS)
Biswas, Indranil
2009-01-01
Let X be a complex manifold equipped with a projective structure P. There is a holomorphic principal C*-bundle L P ' over X associated with P. We show that the holomorphic cotangent bundle of the total space of L P ' equipped with the Liouville symplectic form has a canonical deformation quantization. This generalizes the construction in the work of and Ben-Zvi and Biswas [''A quantization on Riemann surfaces with projective structure,'' Lett. Math. Phys. 54, 73 (2000)] done under the assumption that dim C X=1.
Structure formation by a fifth force: N-body versus linear simulations
Li, Baojiu; Zhao, Hongsheng
2009-08-01
We lay out the frameworks to numerically study the structure formation in both linear and nonlinear regimes in general dark-matter-coupled scalar field models, and give an explicit example where the scalar field serves as a dynamical dark energy. Adopting parameters of the scalar field which yield a realistic cosmic microwave background (CMB) spectrum, we generate the initial conditions for our N-body simulations, which follow the spatial distributions of the dark matter and the scalar field by solving their equations of motion using the multilevel adaptive grid technique. We show that the spatial configuration of the scalar field tracks well the voids and clusters of dark matter. Indeed, the propagation of scalar degree of freedom effectively acts as a fifth force on dark matter particles, whose range and magnitude are determined by the two model parameters (μ,γ), local dark matter density as well as the background value for the scalar field. The model behaves like the ΛCDM paradigm on scales relevant to the CMB spectrum, which are well beyond the probe of the local fifth force and thus not significantly affected by the matter-scalar coupling. On scales comparable or shorter than the range of the local fifth force, the fifth force is perfectly parallel to gravity and their strengths have a fixed ratio 2γ2 determined by the matter-scalar coupling, provided that the chameleon effect is weak; if on the other hand there is a strong chameleon effect (i.e., the scalar field almost resides at its effective potential minimum everywhere in the space), the fifth force indeed has suppressed effects in high density regions and shows no obvious correlation with gravity, which means that the dark-matter-scalar-field coupling is not simply equivalent to a rescaling of the gravitational constant or the mass of the dark matter particles. We show these spatial distributions and (lack of) correlations at typical redshifts (z=0,1,5.5) in our multigrid million-particle simulations
Structure formation by a fifth force: N-body versus linear simulations
International Nuclear Information System (INIS)
Li Baojiu; Zhao Hongsheng
2009-01-01
We lay out the frameworks to numerically study the structure formation in both linear and nonlinear regimes in general dark-matter-coupled scalar field models, and give an explicit example where the scalar field serves as a dynamical dark energy. Adopting parameters of the scalar field which yield a realistic cosmic microwave background (CMB) spectrum, we generate the initial conditions for our N-body simulations, which follow the spatial distributions of the dark matter and the scalar field by solving their equations of motion using the multilevel adaptive grid technique. We show that the spatial configuration of the scalar field tracks well the voids and clusters of dark matter. Indeed, the propagation of scalar degree of freedom effectively acts as a fifth force on dark matter particles, whose range and magnitude are determined by the two model parameters (μ,γ), local dark matter density as well as the background value for the scalar field. The model behaves like the ΛCDM paradigm on scales relevant to the CMB spectrum, which are well beyond the probe of the local fifth force and thus not significantly affected by the matter-scalar coupling. On scales comparable or shorter than the range of the local fifth force, the fifth force is perfectly parallel to gravity and their strengths have a fixed ratio 2γ 2 determined by the matter-scalar coupling, provided that the chameleon effect is weak; if on the other hand there is a strong chameleon effect (i.e., the scalar field almost resides at its effective potential minimum everywhere in the space), the fifth force indeed has suppressed effects in high density regions and shows no obvious correlation with gravity, which means that the dark-matter-scalar-field coupling is not simply equivalent to a rescaling of the gravitational constant or the mass of the dark matter particles. We show these spatial distributions and (lack of) correlations at typical redshifts (z=0,1,5.5) in our multigrid million
Particle Number Dependence of the N-body Simulations of Moon Formation
Sasaki, Takanori; Hosono, Natsuki
2018-04-01
The formation of the Moon from the circumterrestrial disk has been investigated by using N-body simulations with the number N of particles limited from 104 to 105. We develop an N-body simulation code on multiple Pezy-SC processors and deploy Framework for Developing Particle Simulators to deal with large number of particles. We execute several high- and extra-high-resolution N-body simulations of lunar accretion from a circumterrestrial disk of debris generated by a giant impact on Earth. The number of particles is up to 107, in which 1 particle corresponds to a 10 km sized satellitesimal. We find that the spiral structures inside the Roche limit radius differ between low-resolution simulations (N ≤ 105) and high-resolution simulations (N ≥ 106). According to this difference, angular momentum fluxes, which determine the accretion timescale of the Moon also depend on the numerical resolution.
Halo Models of Large Scale Structure and Reliability of Cosmological N-Body Simulations
Directory of Open Access Journals (Sweden)
José Gaite
2013-05-01
Full Text Available Halo models of the large scale structure of the Universe are critically examined, focusing on the definition of halos as smooth distributions of cold dark matter. This definition is essentially based on the results of cosmological N-body simulations. By a careful analysis of the standard assumptions of halo models and N-body simulations and by taking into account previous studies of self-similarity of the cosmic web structure, we conclude that N-body cosmological simulations are not fully reliable in the range of scales where halos appear. Therefore, to have a consistent definition of halos is necessary either to define them as entities of arbitrary size with a grainy rather than smooth structure or to define their size in terms of small-scale baryonic physics.
Relativistic n-body wave equations in scalar quantum field theory
International Nuclear Information System (INIS)
Emami-Razavi, Mohsen
2006-01-01
The variational method in a reformulated Hamiltonian formalism of Quantum Field Theory (QFT) is used to derive relativistic n-body wave equations for scalar particles (bosons) interacting via a massive or massless mediating scalar field (the scalar Yukawa model). Simple Fock-space variational trial states are used to derive relativistic n-body wave equations. The equations are shown to have the Schroedinger non-relativistic limits, with Coulombic interparticle potentials in the case of a massless mediating field and Yukawa interparticle potentials in the case of a massive mediating field. Some examples of approximate ground state solutions of the n-body relativistic equations are obtained for various strengths of coupling, for both massive and massless mediating fields
Orthogonal and symplectic Yangians and Yang–Baxter R-operators
Directory of Open Access Journals (Sweden)
A.P. Isaev
2016-03-01
Full Text Available Yang–Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with the orthogonal or symplectic fundamental R matrix, are considered in the interesting cases, where their expansion in inverse powers of the spectral parameter is truncated. Unlike the case of special linear algebra symmetry the truncation results in additional conditions on the Lie algebra generators of which the L operators is built and which can be fulfilled in distinguished representations only. Further, generalized L operators, obeying the modified RLL relation with the fundamental R matrix replaced by the spinorial or metaplectic one, are considered in the particular case of linear dependence on the spectral parameter. It is shown how by fusion with respect to the spinorial or metaplectic representation these first order spinorial L operators reproduce the ordinary L operators with second order truncation.
Variational symplectic algorithm for guiding center dynamics in the inner magnetosphere
International Nuclear Information System (INIS)
Li Jinxing; Pu Zuyin; Xie Lun; Fu Suiyan; Qin Hong
2011-01-01
Charged particle dynamics in magnetosphere has temporal and spatial multiscale; therefore, numerical accuracy over a long integration time is required. A variational symplectic integrator (VSI) [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008) and H. Qin, X. Guan, and W. M. Tang, Phys. Plasmas 16, 042510 (2009)] for the guiding-center motion of charged particles in general magnetic field is applied to study the dynamics of charged particles in magnetosphere. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The VSI conserves exactly a discrete Lagrangian symplectic structure and has better numerical properties over a long integration time, compared with standard integrators, such as the standard and adaptive fourth order Runge-Kutta (RK4) methods. Applying the VSI method to guiding-center dynamics in the inner magnetosphere, we can accurately calculate the particles'orbits for an arbitrary long simulating time with good conservation property. When a time-independent convection and corotation electric field is considered, the VSI method can give the accurate single particle orbit, while the RK4 method gives an incorrect orbit due to its intrinsic error accumulation over a long integrating time.
Associated quantum vector bundles and symplectic structure on a quantum space
International Nuclear Information System (INIS)
Coquereaux, R.; Garcia, A.O.; Trinchero, R.
2000-01-01
We define a quantum generalization of the algebra of functions over an associated vector bundle of a principal bundle. Here the role of a quantum principal bundle is played by a Hopf-Galois extension. Smash products of an algebra times a Hopf algebra H are particular instances of these extensions, and in these cases we are able to define a differential calculus over their associated vector bundles without requiring the use of a (bicovariant) differential structure over H. Moreover, if H is coquasitriangular, it coacts naturally on the associated bundle, and the differential structure is covariant. We apply this construction to the case of the finite quotient of the SL q (2) function Hopf algebra at a root of unity (q 3 = 1) as the structure group, and a reduced 2-dimensional quantum plane as both the 'base manifold' and fibre, getting an algebra which generalizes the notion of classical phase space for this quantum space. We also build explicitly a differential complex for this phase space algebra, and find that levels 0 and 2 support a (co)representation of the quantum symplectic group. On this phase space we define vector fields, and with the help of the Sp q structure we introduce a symplectic form relating 1-forms to vector fields. This leads naturally to the introduction of Poisson brackets, a necessary step to do 'classical' mechanics on a quantum space, the quantum plane. (author)
International Nuclear Information System (INIS)
Marrero, Juan Carlos; Padrón, Edith; Rodríguez-Olmos, Miguel
2012-01-01
This paper addresses the problem of developing an extension of the Marsden–Weinstein reduction process to symplectic-like Lie algebroids, and in particular to the case of the canonical cover of a fiberwise linear Poisson structure, whose reduction process is the analog to cotangent bundle reduction in the context of Lie algebroids. Dedicated to the memory of Jerrold E Marsden (paper)
International Nuclear Information System (INIS)
Qin Hong; Guan Xiaoyin
2008-01-01
A variational symplectic integrator for the guiding-center motion of charged particles in general magnetic fields is developed for long-time simulation studies of magnetized plasmas. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The variational symplectic integrator conserves exactly a discrete Lagrangian symplectic structure, and has better numerical properties over long integration time, compared with standard integrators, such as the standard and variable time-step fourth order Runge-Kutta methods
International Nuclear Information System (INIS)
Qin, H.; Guan, X.
2008-01-01
A variational symplectic integrator for the guiding-center motion of charged particles in general magnetic fields is developed for long-time simulation studies of magnetized plasmas. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The variational symplectic integrator conserves exactly a discrete Lagrangian symplectic structure, and has better numerical properties over long integration time, compared with standard integrators, such as the standard and variable time-step fourth order Runge-Kutta methods.
Punjabi, Alkesh; Ali, Halima
2008-12-01
A new approach to integration of magnetic field lines in divertor tokamaks is proposed. In this approach, an analytic equilibrium generating function (EGF) is constructed in natural canonical coordinates (ψ,θ) from experimental data from a Grad-Shafranov equilibrium solver for a tokamak. ψ is the toroidal magnetic flux and θ is the poloidal angle. Natural canonical coordinates (ψ,θ,φ) can be transformed to physical position (R,Z,φ) using a canonical transformation. (R,Z,φ) are cylindrical coordinates. Another canonical transformation is used to construct a symplectic map for integration of magnetic field lines. Trajectories of field lines calculated from this symplectic map in natural canonical coordinates can be transformed to trajectories in real physical space. Unlike in magnetic coordinates [O. Kerwin, A. Punjabi, and H. Ali, Phys. Plasmas 15, 072504 (2008)], the symplectic map in natural canonical coordinates can integrate trajectories across the separatrix surface, and at the same time, give trajectories in physical space. Unlike symplectic maps in physical coordinates (x,y) or (R,Z), the continuous analog of a symplectic map in natural canonical coordinates does not distort trajectories in toroidal planes intervening the discrete map. This approach is applied to the DIII-D tokamak [J. L. Luxon and L. E. Davis, Fusion Technol. 8, 441 (1985)]. The EGF for the DIII-D gives quite an accurate representation of equilibrium magnetic surfaces close to the separatrix surface. This new approach is applied to demonstrate the sensitivity of stochastic broadening using a set of perturbations that generically approximate the size of the field errors and statistical topological noise expected in a poloidally diverted tokamak. Plans for future application of this approach are discussed.
International Nuclear Information System (INIS)
Punjabi, Alkesh; Ali, Halima
2008-01-01
A new approach to integration of magnetic field lines in divertor tokamaks is proposed. In this approach, an analytic equilibrium generating function (EGF) is constructed in natural canonical coordinates (ψ,θ) from experimental data from a Grad-Shafranov equilibrium solver for a tokamak. ψ is the toroidal magnetic flux and θ is the poloidal angle. Natural canonical coordinates (ψ,θ,φ) can be transformed to physical position (R,Z,φ) using a canonical transformation. (R,Z,φ) are cylindrical coordinates. Another canonical transformation is used to construct a symplectic map for integration of magnetic field lines. Trajectories of field lines calculated from this symplectic map in natural canonical coordinates can be transformed to trajectories in real physical space. Unlike in magnetic coordinates [O. Kerwin, A. Punjabi, and H. Ali, Phys. Plasmas 15, 072504 (2008)], the symplectic map in natural canonical coordinates can integrate trajectories across the separatrix surface, and at the same time, give trajectories in physical space. Unlike symplectic maps in physical coordinates (x,y) or (R,Z), the continuous analog of a symplectic map in natural canonical coordinates does not distort trajectories in toroidal planes intervening the discrete map. This approach is applied to the DIII-D tokamak [J. L. Luxon and L. E. Davis, Fusion Technol. 8, 441 (1985)]. The EGF for the DIII-D gives quite an accurate representation of equilibrium magnetic surfaces close to the separatrix surface. This new approach is applied to demonstrate the sensitivity of stochastic broadening using a set of perturbations that generically approximate the size of the field errors and statistical topological noise expected in a poloidally diverted tokamak. Plans for future application of this approach are discussed.
Absence of positive eigenvalues for hard-core N-body systems
DEFF Research Database (Denmark)
Ito, K.; Skibsted, Erik
We show absence of positive eigenvalues for generalized 2-body hard-core Schrödinger operators under the condition of bounded strictly convex obstacles. A scheme for showing absence of positive eigenvalues for generalized N-body hard-core Schrödinger operators, N≥ 2, is presented. This scheme inv...
On the discrete spectrum of the N-body quantum mechanical Hamiltonian. Pt. 2
International Nuclear Information System (INIS)
Iorio, R.J. Jr.
1981-01-01
Using the Weinberg-van Winter equations we prove finiteness of the discrete spectrum of the N-body quantum mechanical Hamiltonian with pair potentials satisfying vertical stroke V(x) vertical stroke 2 ) - sup(rho), rho > 1 increase the threshold of the continuous spectrum is negative and determined exclusively by eigenvalues of two-cluster Hamiltonians. (orig.)
Application of quasiexactly solvable potential method to the N-body ...
Indian Academy of Sciences (India)
physics pp. 985–996. Application of quasiexactly solvable potential method to the N-body ... Application of QES method to N-particle quantum model interacting via an ... Now, if we choose the centre of mass R as the origin of the coordinates,.
Graphs and an exactly solvable N-body problem in one dimension
Energy Technology Data Exchange (ETDEWEB)
Barucchi, G [Turin Univ. (Italy). Ist. di Fisica Matematica
1980-08-21
The one-dimensional N-body classical problem with inversely quadratic pair potential is considered. A method of explicit construction, by means of graphs, of the constants of the motion is given. It is then shown how to obtain, by means of a computer, the position variables of the particles as numerical functions of time.
The effect of early radiation in N-body simulations of cosmic structure formation
DEFF Research Database (Denmark)
Adamek, Julian; Brandbyge, Jacob; Fidler, Christian
2017-01-01
Newtonian N-body simulations have been employed successfully over the past decades for the simulation of the cosmological large-scale structure. Such simulations usually ignore radiation perturbations (photons and massless neutrinos) and the impact of general relativity (GR) beyond the background...
Algebraic internal wave solitons and the integrable Calogero--Moser--Sutherland N-body problem
International Nuclear Information System (INIS)
Chen, H.H.; Lee, Y.C.; Pereira, N.R.
1979-01-01
The Benjamin--Ono equation that describes nonlinear internal waves in a stratified fluid is solved by a pole expansion method. The dynamics of poles which characterize solitons is shown to be identical to the well-known integrable N-body problem of Calogero, Moser, and Sutherland
International Nuclear Information System (INIS)
Jejcic, A.; Maillard, J.; Maurel, G.; Silva, J.; Wolff-Bacha, F.
1997-01-01
The work in the field of parallel processing has developed as research activities using several numerical Monte Carlo simulations related to basic or applied current problems of nuclear and particle physics. For the applications utilizing the GEANT code development or improvement works were done on parts simulating low energy physical phenomena like radiation, transport and interaction. The problem of actinide burning by means of accelerators was approached using a simulation with the GEANT code. A program of neutron tracking in the range of low energies up to the thermal region has been developed. It is coupled to the GEANT code and permits in a single pass the simulation of a hybrid reactor core receiving a proton burst. Other works in this field refers to simulations for nuclear medicine applications like, for instance, development of biological probes, evaluation and characterization of the gamma cameras (collimators, crystal thickness) as well as the method for dosimetric calculations. Particularly, these calculations are suited for a geometrical parallelization approach especially adapted to parallel machines of the TN310 type. Other works mentioned in the same field refer to simulation of the electron channelling in crystals and simulation of the beam-beam interaction effect in colliders. The GEANT code was also used to simulate the operation of germanium detectors designed for natural and artificial radioactivity monitoring of environment
Parallel Computing Strategies for Irregular Algorithms
Biswas, Rupak; Oliker, Leonid; Shan, Hongzhang; Biegel, Bryan (Technical Monitor)
2002-01-01
Parallel computing promises several orders of magnitude increase in our ability to solve realistic computationally-intensive problems, but relies on their efficient mapping and execution on large-scale multiprocessor architectures. Unfortunately, many important applications are irregular and dynamic in nature, making their effective parallel implementation a daunting task. Moreover, with the proliferation of parallel architectures and programming paradigms, the typical scientist is faced with a plethora of questions that must be answered in order to obtain an acceptable parallel implementation of the solution algorithm. In this paper, we consider three representative irregular applications: unstructured remeshing, sparse matrix computations, and N-body problems, and parallelize them using various popular programming paradigms on a wide spectrum of computer platforms ranging from state-of-the-art supercomputers to PC clusters. We present the underlying problems, the solution algorithms, and the parallel implementation strategies. Smart load-balancing, partitioning, and ordering techniques are used to enhance parallel performance. Overall results demonstrate the complexity of efficiently parallelizing irregular algorithms.
Olsson, O.
2018-01-01
We present a novel heuristic derived from a probabilistic cost model for approximate N-body simulations. We show that this new heuristic can be used to guide tree construction towards higher quality trees with improved performance over current N-body codes. This represents an important step beyond the current practice of using spatial partitioning for N-body simulations, and enables adoption of a range of state-of-the-art algorithms developed for computer graphics applications to yield further improvements in N-body simulation performance. We outline directions for further developments and review the most promising such algorithms.
Symplectic finite element scheme: application to a driven problem with a regular singularity
Energy Technology Data Exchange (ETDEWEB)
Pletzer, A. [Ecole Polytechnique Federale, Lausanne (Switzerland). Centre de Recherche en Physique des Plasma (CRPP)
1996-02-01
A new finite element (FE) scheme, based on the decomposition of a second order differential equation into a set of first order symplectic (Hamiltonian) equations, is presented and tested on one-dimensional, driven Sturm-Liouville problem. Error analysis shows improved cubic convergence in the energy norm for piecewise linear `tent` elements, as compared to quadratic convergence for the standard and hybrid FE methods. The convergence deteriorates in the presence of a regular singular point, but can be recovered by appropriate mesh node packing. Optimal mesh packing exponents are derived to ensure cubic (respectively quadratic) convergence with minimal numerical error. A further suppression of the numerical error by a factor proportional to the square of the leading exponent of the singular solution, is achieved for a model problem based on determining the nonideal magnetohydrodynamic stability of a fusion plasma. (author) 7 figs., 14 refs.
Symplectic finite element scheme: application to a driven problem with a regular singularity
International Nuclear Information System (INIS)
Pletzer, A.
1996-02-01
A new finite element (FE) scheme, based on the decomposition of a second order differential equation into a set of first order symplectic (Hamiltonian) equations, is presented and tested on one-dimensional, driven Sturm-Liouville problem. Error analysis shows improved cubic convergence in the energy norm for piecewise linear 'tent' elements, as compared to quadratic convergence for the standard and hybrid FE methods. The convergence deteriorates in the presence of a regular singular point, but can be recovered by appropriate mesh node packing. Optimal mesh packing exponents are derived to ensure cubic (respectively quadratic) convergence with minimal numerical error. A further suppression of the numerical error by a factor proportional to the square of the leading exponent of the singular solution, is achieved for a model problem based on determining the nonideal magnetohydrodynamic stability of a fusion plasma. (author) 7 figs., 14 refs
Explicit higher order symplectic integrator for s-dependent magnetic field
International Nuclear Information System (INIS)
Wu, Y.; Forest, E.; Robin, D.S.
2001-01-01
We derive second and higher order explicit symplectic integrators for the charged particle motion in an s-dependent magnetic field with the paraxial approximation. The Hamiltonian of such a system takes the form of H (summation) k (p k - a k (rvec q), s) 2 + V((rvec q), s). This work solves a long-standing problem for modeling s-dependent magnetic elements. Important applications of this work include the studies of the charged particle dynamics in a storage ring with strong field wigglers, arbitrarily polarized insertion devices,and super-conducting magnets with strong fringe fields. Consequently, this work will have a significant impact on the optimal use of the above magnetic devices in the light source rings as well as in next generation linear collider damping rings
Construction of symplectic full-turn maps by application of an arbitrary tracking code
International Nuclear Information System (INIS)
Warnock, R.L.
1989-03-01
A map to describe propagation of particles through any section of a nonlinear lattice may be represented as a Taylor expansion about the origin in phase space. Although the technique to compute the Taylor coefficients has been improved recently, the expansion may fail to provide adequate accuracy in regions where nonlinear effects are substantial. A representation of the map in angle-action coordinates, with the angle dependence given by a Fourier series, and the action dependence by polynomials in I/sup 1/2/, may be more successful. Maps of this form are easily constructed by taking Fourier transforms of results from an arbitrary symplectic tracking code. Examples are given of one-turn and two turn maps for the SLC North Damping Ring in a strongly nonlinear region. Results for accuracy and speed of evaluation of the maps are quite encouraging. It seems feasible to make accurate maps for the SSC by this method. 9 refs., 1 tab
Ivkin, N.; Liu, Z.; Yang, L. F.; Kumar, S. S.; Lemson, G.; Neyrinck, M.; Szalay, A. S.; Braverman, V.; Budavari, T.
2018-04-01
Cosmological N-body simulations play a vital role in studying models for the evolution of the Universe. To compare to observations and make a scientific inference, statistic analysis on large simulation datasets, e.g., finding halos, obtaining multi-point correlation functions, is crucial. However, traditional in-memory methods for these tasks do not scale to the datasets that are forbiddingly large in modern simulations. Our prior paper (Liu et al., 2015) proposes memory-efficient streaming algorithms that can find the largest halos in a simulation with up to 109 particles on a small server or desktop. However, this approach fails when directly scaling to larger datasets. This paper presents a robust streaming tool that leverages state-of-the-art techniques on GPU boosting, sampling, and parallel I/O, to significantly improve performance and scalability. Our rigorous analysis of the sketch parameters improves the previous results from finding the centers of the 103 largest halos (Liu et al., 2015) to ∼ 104 - 105, and reveals the trade-offs between memory, running time and number of halos. Our experiments show that our tool can scale to datasets with up to ∼ 1012 particles while using less than an hour of running time on a single GPU Nvidia GTX 1080.
Okumura, Hisashi; Itoh, Satoru G; Okamoto, Yuko
2007-02-28
The authors propose explicit symplectic integrators of molecular dynamics (MD) algorithms for rigid-body molecules in the canonical and isobaric-isothermal ensembles. They also present a symplectic algorithm in the constant normal pressure and lateral surface area ensemble and that combined with the Parrinello-Rahman algorithm. Employing the symplectic integrators for MD algorithms, there is a conserved quantity which is close to Hamiltonian. Therefore, they can perform a MD simulation more stably than by conventional nonsymplectic algorithms. They applied this algorithm to a TIP3P pure water system at 300 K and compared the time evolution of the Hamiltonian with those by the nonsymplectic algorithms. They found that the Hamiltonian was conserved well by the symplectic algorithm even for a time step of 4 fs. This time step is longer than typical values of 0.5-2 fs which are used by the conventional nonsymplectic algorithms.
McCallum, Ethan
2011-01-01
It's tough to argue with R as a high-quality, cross-platform, open source statistical software product-unless you're in the business of crunching Big Data. This concise book introduces you to several strategies for using R to analyze large datasets. You'll learn the basics of Snow, Multicore, Parallel, and some Hadoop-related tools, including how to find them, how to use them, when they work well, and when they don't. With these packages, you can overcome R's single-threaded nature by spreading work across multiple CPUs, or offloading work to multiple machines to address R's memory barrier.
Studying Tidal Effects In Planetary Systems With Posidonius. A N-Body Simulator Written In Rust.
Blanco-Cuaresma, Sergi; Bolmont, Emeline
2017-10-01
Planetary systems with several planets in compact orbital configurations such as TRAPPIST-1 are surely affected by tidal effects. Its study provides us with important insight about its evolution. We developed a second generation of a N-body code based on the tidal model used in Mercury-T, re-implementing and improving its functionalities using Rust as programming language (including a Python interface for easy use) and the WHFAST integrator. The new open source code ensures memory safety, reproducibility of numerical N-body experiments, it improves the spin integration compared to Mercury-T and allows to take into account a new prescription for the dissipation of tidal inertial waves in the convective envelope of stars. Posidonius is also suitable for binary system simulations with evolving stars.
Explicit treatment of N-body correlations within a density-matrix formalism
International Nuclear Information System (INIS)
Shun-Jin, W.; Cassing, W.
1985-01-01
The nuclear many-body problem is reformulated in the density-matrix approach such that n-body correlations are separated out from the reduced density matrix rho/sub n/. A set of equations for the time evolution of the n-body correlations c/sub n/ is derived which allows for physically transparent truncations with respect to the order of correlations. In the stationary limit (c/sub n/ = 0) a restriction to two-body correlations yields a generalized Bethe-Goldstone equation a restriction to body correlations yields generalized Faddeev equations in the density-matrix formulation. Furthermore it can be shown that any truncation of the set of equations (c/sub n/ = 0, n>m) is compatible with conservation laws, a quality which in general is not fulfilled if higher order correlations are treated perturbatively
A combined N-body and hydrodynamic code for modeling disk galaxies
International Nuclear Information System (INIS)
Schroeder, M.C.
1989-01-01
A combined N-body and hydrodynamic computer code for the modeling of two dimensional galaxies is described. The N-body portion of the code is used to calculate the motion of the particle component of a galaxy, while the hydrodynamics portion of the code is used to follow the motion and evolution of the fluid component. A complete description of the numerical methods used for each portion of the code is given. Additionally, the proof tests of the separate and combined portions of the code are presented and discussed. Finally, a discussion of the topics researched with the code and results obtained is presented. These include: the measurement of stellar relaxation times in disk galaxy simulations; the effects of two-armed spiral perturbations on stable axisymmetric disks; the effects of the inclusion of an instellar medium (ISM) on the stability of disk galaxies; and the effect of the inclusion of stellar evolution on disk galaxy simulations
On the evolution of galaxy clustering and cosmological N-body simulations
International Nuclear Information System (INIS)
Fall, S.M.
1978-01-01
Some aspects of the problem of simulating the evolution of galaxy clustering by N-body computer experiments are discussed. The results of four 1000-body experiments are presented and interpreted on the basis of simple scaling arguments for the gravitational condensation of bound aggregates. They indicate that the internal dynamics of condensed aggregates are negligible in determining the form of the pair-correlation function xi. On small scales the form of xi is determined by discreteness effects in the initial N-body distribution and is not sensitive to this distribution. The experiments discussed here test the simple scaling arguments effectively for only one value of the cosmological density parameter (Ω = 1) and one form of the initial fluctuation spectrum (n = 0). (author)
Highly eccentric hip-hop solutions of the 2 N-body problem
Barrabés, Esther; Cors, Josep M.; Pinyol, Conxita; Soler, Jaume
2010-02-01
We show the existence of families of hip-hop solutions in the equal-mass 2 N-body problem which are close to highly eccentric planar elliptic homographic motions of 2 N bodies plus small perpendicular non-harmonic oscillations. By introducing a parameter ɛ, the homographic motion and the small amplitude oscillations can be uncoupled into a purely Keplerian homographic motion of fixed period and a vertical oscillation described by a Hill type equation. Small changes in the eccentricity induce large variations in the period of the perpendicular oscillation and give rise, via a Bolzano argument, to resonant periodic solutions of the uncoupled system in a rotating frame. For small ɛ≠0, the topological transversality persists and Brouwer’s fixed point theorem shows the existence of this kind of solutions in the full system.
Speeding up N-body Calculations on Machines without Hardware Square Root
Directory of Open Access Journals (Sweden)
Alan H. Karp
1992-01-01
Full Text Available The most time consuming part of an N-body simulation is computing the components of the accelerations of the particles. On most machines the slowest part of computing the acceleration is in evaluating r-3/2, which is especially true on machines that do the square root in software. This note shows how to cut the time for this part of the calculation by a factor of 3 or more using standard Fortran.
Fast Generation of Ensembles of Cosmological N-Body Simulations via Mode-Resampling
Energy Technology Data Exchange (ETDEWEB)
Schneider, M D; Cole, S; Frenk, C S; Szapudi, I
2011-02-14
We present an algorithm for quickly generating multiple realizations of N-body simulations to be used, for example, for cosmological parameter estimation from surveys of large-scale structure. Our algorithm uses a new method to resample the large-scale (Gaussian-distributed) Fourier modes in a periodic N-body simulation box in a manner that properly accounts for the nonlinear mode-coupling between large and small scales. We find that our method for adding new large-scale mode realizations recovers the nonlinear power spectrum to sub-percent accuracy on scales larger than about half the Nyquist frequency of the simulation box. Using 20 N-body simulations, we obtain a power spectrum covariance matrix estimate that matches the estimator from Takahashi et al. (from 5000 simulations) with < 20% errors in all matrix elements. Comparing the rates of convergence, we determine that our algorithm requires {approx}8 times fewer simulations to achieve a given error tolerance in estimates of the power spectrum covariance matrix. The degree of success of our algorithm indicates that we understand the main physical processes that give rise to the correlations in the matter power spectrum. Namely, the large-scale Fourier modes modulate both the degree of structure growth through the variation in the effective local matter density and also the spatial frequency of small-scale perturbations through large-scale displacements. We expect our algorithm to be useful for noise modeling when constraining cosmological parameters from weak lensing (cosmic shear) and galaxy surveys, rescaling summary statistics of N-body simulations for new cosmological parameter values, and any applications where the influence of Fourier modes larger than the simulation size must be accounted for.
The Matter Bispectrum in N-body Simulations with non-Gaussian Initial Conditions
Sefusatti, Emiliano; Crocce, Martin; Desjacques, Vincent
2010-01-01
We present measurements of the dark matter bispectrum in N-body simulations with non-Gaussian initial conditions of the local kind for a large variety of triangular configurations and compare them with predictions from Eulerian perturbation theory up to one-loop corrections. We find that the effects of primordial non-Gaussianity at large scales, when compared to perturbation theory, are well described by the initial component of the matter bispectrum, linearly extrapolated at the redshift of ...
Non-instantaneous gas recycling and chemical evolution in N-body disk galaxies
Czech Academy of Sciences Publication Activity Database
Jungwiert, Bruno; Carraro, G.; Dalla Vecchia, C.
2004-01-01
Roč. 289, 3-4 (2004), s. 441-444 ISSN 0004-640X. [From observations to self-consistent modelling of the ISM in galaxies. Porto, 03.09.2002-05.09.2002] R&D Projects: GA ČR GP202/01/D075 Institutional research plan: CEZ:AV0Z1003909 Keywords : N-body simulations * galaxy evolution * gas recycling Subject RIV: BN - Astronomy, Celestial Mechanics, Astrophysics Impact factor: 0.597, year: 2004
Hip-hop solutions of the 2N-body problem
Barrabés, Esther; Cors, Josep Maria; Pinyol, Conxita; Soler, Jaume
2006-05-01
Hip-hop solutions of the 2N-body problem with equal masses are shown to exist using an analytic continuation argument. These solutions are close to planar regular 2N-gon relative equilibria with small vertical oscillations. For fixed N, an infinity of these solutions are three-dimensional choreographies, with all the bodies moving along the same closed curve in the inertial frame.
Peuten, M.; Zocchi, A.; Gieles, M.; Hénault-Brunet, V.
2017-09-01
Lowered isothermal models, such as the multimass Michie-King models, have been successful in describing observational data of globular clusters. In this study, we assess whether such models are able to describe the phase space properties of evolutionary N-body models. We compare the multimass models as implemented in limepy (Gieles & Zocchi) to N-body models of star clusters with different retention fractions for the black holes and neutron stars evolving in a tidal field. We find that multimass models successfully reproduce the density and velocity dispersion profiles of the different mass components in all evolutionary phases and for different remnants retention. We further use these results to study the evolution of global model parameters. We find that over the lifetime of clusters, radial anisotropy gradually evolves from the low- to the high-mass components and we identify features in the properties of observable stars that are indicative of the presence of stellar-mass black holes. We find that the model velocity scale depends on mass as m-δ, with δ ≃ 0.5 for almost all models, but the dependence of central velocity dispersion on m can be shallower, depending on the dark remnant content, and agrees well with that of the N-body models. The reported model parameters, and correlations amongst them, can be used as theoretical priors when fitting these types of mass models to observational data.
The quantum n-body problem in dimension d ⩾ n – 1: ground state
Miller, Willard, Jr.; Turbiner, Alexander V.; Escobar-Ruiz, M. A.
2018-05-01
We employ generalized Euler coordinates for the n body system in dimensional space, which consists of the centre-of-mass vector, relative (mutual) mass-independent distances r ij and angles as remaining coordinates. We prove that the kinetic energy of the quantum n-body problem for can be written as the sum of three terms: (i) kinetic energy of centre-of-mass, (ii) the second order differential operator which depends on relative distances alone and (iii) the differential operator which annihilates any angle-independent function. The operator has a large reflection symmetry group and in variables is an algebraic operator, which can be written in terms of generators of the hidden algebra . Thus, makes sense of the Hamiltonian of a quantum Euler–Arnold top in a constant magnetic field. It is conjectured that for any n, the similarity-transformed is the Laplace–Beltrami operator plus (effective) potential; thus, it describes a -dimensional quantum particle in curved space. This was verified for . After de-quantization the similarity-transformed becomes the Hamiltonian of the classical top with variable tensor of inertia in an external potential. This approach allows a reduction of the dn-dimensional spectral problem to a -dimensional spectral problem if the eigenfunctions depend only on relative distances. We prove that the ground state function of the n body problem depends on relative distances alone.
A NEW HYBRID N-BODY-COAGULATION CODE FOR THE FORMATION OF GAS GIANT PLANETS
International Nuclear Information System (INIS)
Bromley, Benjamin C.; Kenyon, Scott J.
2011-01-01
We describe an updated version of our hybrid N-body-coagulation code for planet formation. In addition to the features of our 2006-2008 code, our treatment now includes algorithms for the one-dimensional evolution of the viscous disk, the accretion of small particles in planetary atmospheres, gas accretion onto massive cores, and the response of N-bodies to the gravitational potential of the gaseous disk and the swarm of planetesimals. To validate the N-body portion of the algorithm, we use a battery of tests in planetary dynamics. As a first application of the complete code, we consider the evolution of Pluto-mass planetesimals in a swarm of 0.1-1 cm pebbles. In a typical evolution time of 1-3 Myr, our calculations transform 0.01-0.1 M sun disks of gas and dust into planetary systems containing super-Earths, Saturns, and Jupiters. Low-mass planets form more often than massive planets; disks with smaller α form more massive planets than disks with larger α. For Jupiter-mass planets, masses of solid cores are 10-100 M + .
Belleman, R.G.; Bédorf, J.; Portegies Zwart, S.F.
2008-01-01
We present the results of gravitational direct N-body simulations using the graphics processing unit (GPU) on a commercial NVIDIA GeForce 8800GTX designed for gaming computers. The force evaluation of the N-body problem is implemented in "Compute Unified Device Architecture" (CUDA) using the GPU to
Directory of Open Access Journals (Sweden)
James G. Worner
2017-05-01
Full Text Available James Worner is an Australian-based writer and scholar currently pursuing a PhD at the University of Technology Sydney. His research seeks to expose masculinities lost in the shadow of Australia’s Anzac hegemony while exploring new opportunities for contemporary historiography. He is the recipient of the Doctoral Scholarship in Historical Consciousness at the university’s Australian Centre of Public History and will be hosted by the University of Bologna during 2017 on a doctoral research writing scholarship. ‘Parallel Lines’ is one of a collection of stories, The Shapes of Us, exploring liminal spaces of modern life: class, gender, sexuality, race, religion and education. It looks at lives, like lines, that do not meet but which travel in proximity, simultaneously attracted and repelled. James’ short stories have been published in various journals and anthologies.
International Nuclear Information System (INIS)
Arkad'ev, V.A.; Pogrebkov, A.K.; Polivanov, M.K.
1988-01-01
The concept of tangent vector is made more precise to meet the specific nature of the Sturm-Liouville problem, and on this basis a Poisson bracket that is modified compared with the Gardner form by special boundary terms is derived from the Zakharov-Faddeev symplectic form. This bracket is nondegenerate, and in it the variables of the discrete and continuous spectra are separated
The quantum N-body problem in the mean-field and semiclassical regime.
Golse, François
2018-04-28
The present work discusses the mean-field limit for the quantum N -body problem in the semiclassical regime. More precisely, we establish a convergence rate for the mean-field limit which is uniform as the ratio of Planck constant to the action of the typical single particle tends to zero. This convergence rate is formulated in terms of a quantum analogue of the quadratic Monge-Kantorovich or Wasserstein distance. This paper is an account of some recent collaboration with C. Mouhot, T. Paul and M. Pulvirenti.This article is part of the themed issue 'Hilbert's sixth problem'. © 2018 The Author(s).
Factorization properties and spurious solutions in N-body scattering theories
International Nuclear Information System (INIS)
Vanzani, V.
1979-01-01
The origin of spurious solutions in N-body scattering equations is discussed. It is shown that spurious solutions are expected because of specific factorization properties of the homogeneous equations. The equations proposed by Rosenberg, by Mitra, Gillespie, Sugar and Panchapakesan, by Takahashi and Mishima, by Alessandrini, by Sasakawa, by Sloan, Bencze and Redish, by Weinberg and van Winter and by Avishai are considered. It is explicitly shown that spurious multipliers arise from repeated employment of resolvent equations or, equiValently, from generalized iteration procedure
S-matrix formulation of thermodynamics with N-body scatterings
Energy Technology Data Exchange (ETDEWEB)
Lo, Pok Man [University of Wroclaw, Institute of Theoretical Physics, Wroclaw (Poland); Extreme Matter Institute EMMI, GSI, Darmstadt (Germany)
2017-08-15
We apply a phase space expansion scheme to incorporate the N-body scattering processes in the S-matrix formulation of statistical mechanics. A generalized phase shift function suitable for studying the thermal contribution of N → N processes is motivated and examined in various models. Using the expansion scheme, we revisit how the hadron resonance gas model emerges from the S-matrix framework, and consider an example of structureless scattering in which the phase shift function can be exactly worked out. Finally we analyze the influence of dynamics on the phase shift function in a simple example of 3- and 4-body scattering. (orig.)
Dynamical Studies of N-Body Gravity and Tidal Dissipation in the TRAPPIST-1 Star System
Nayak, Michael; Kuettel, Donald H.; Stebler, Shane T.; Udrea, Bogdan
2018-01-01
To date, we have discovered a total of 2,729 planetary systems that contain more than 3,639 known exoplanets [1]. A majority of these are defined as compact systems, containing multiple exoplanets within 0.25 AU of the central star. It has been shown that tightly packed exoplanets avoid colliding due to long-term resonance-induced orbit stability [2]. However, due to extreme proximity, these planets experience intense gravitational forces from each other that are unprecedented within our own solar system, which makes the existence of exomoons doubtful. We present the results of an initial study evaluating dynamical stability of potential exomoons within such highly compact systems.This work is baselined around TRAPPIST-1, an ultra-cool dwarf star that hosts seven temperate terrestrial planets, three of which are in the habitable zone, orbiting within 0.06 AU [3]. N-body simulations place a grid of test particles varying semi-major axis, eccentricity, and inclination around the three habitable zone planets. We find that most exomoons with semi-major axes less than half the Hill sphere of their respective planet are stable over 10 kyrs, with several stable over 300 kyrs.However, in compact systems, tidal influences from other planets can compete with tidal effects from the primary planet, resulting in possible instabilities and massive amounts of tidal dissipation. We investigate these effects with a large grid search that incorporates exomoon radius, tidal quality factor and a range of planet rigidities. Results of simulations that combine n-body gravity effects with both planetary and satellite tides are presented and contrasted with n-body results. Finally, we examine long-term stability (> 1Myrs) of the stable subset of test particles from the n-body simulation with the addition of tidal dissipation, to determine if exomoons can survive around planets e, f, and g in the TRAPPIST-1 system.[1] Schneider (2017). The Extrasolar Planets Encyclopedia. http
Application of the Ewald method to cosmological N-body simulations
International Nuclear Information System (INIS)
Hernquist, L.; Suto, Yasushi; Bouchet, F.R.
1990-03-01
Fully periodic boundary conditions are incorporated into a gridless cosmological N-body code using the Ewald method. It is shown that the linear evolution of density fluctuations agrees well with analytic calculations, contrary to the case of quasi-periodic boundary conditions where the fundamental mode grows too rapidly. The implementation of fully periodic boundaries is of particular importance to relative comparisons of methods based on hierarchical tree algorithms and more traditional schemes using Fourier techniques such as PM and P 3 M codes. (author)
Tanikawa, Ataru; Yoshikawa, Kohji; Okamoto, Takashi; Nitadori, Keigo
2012-02-01
We present a high-performance N-body code for self-gravitating collisional systems accelerated with the aid of a new SIMD instruction set extension of the x86 architecture: Advanced Vector eXtensions (AVX), an enhanced version of the Streaming SIMD Extensions (SSE). With one processor core of Intel Core i7-2600 processor (8 MB cache and 3.40 GHz) based on Sandy Bridge micro-architecture, we implemented a fourth-order Hermite scheme with individual timestep scheme ( Makino and Aarseth, 1992), and achieved the performance of ˜20 giga floating point number operations per second (GFLOPS) for double-precision accuracy, which is two times and five times higher than that of the previously developed code implemented with the SSE instructions ( Nitadori et al., 2006b), and that of a code implemented without any explicit use of SIMD instructions with the same processor core, respectively. We have parallelized the code by using so-called NINJA scheme ( Nitadori et al., 2006a), and achieved ˜90 GFLOPS for a system containing more than N = 8192 particles with 8 MPI processes on four cores. We expect to achieve about 10 tera FLOPS (TFLOPS) for a self-gravitating collisional system with N ˜ 10 5 on massively parallel systems with at most 800 cores with Sandy Bridge micro-architecture. This performance will be comparable to that of Graphic Processing Unit (GPU) cluster systems, such as the one with about 200 Tesla C1070 GPUs ( Spurzem et al., 2010). This paper offers an alternative to collisional N-body simulations with GRAPEs and GPUs.
Section sigma models coupled to symplectic duality bundles on Lorentzian four-manifolds
Lazaroiu, C. I.; Shahbazi, C. S.
2018-06-01
We give the global mathematical formulation of a class of generalized four-dimensional theories of gravity coupled to scalar matter and to Abelian gauge fields. In such theories, the scalar fields are described by a section of a surjective pseudo-Riemannian submersion π over space-time, whose total space carries a Lorentzian metric making the fibers into totally-geodesic connected Riemannian submanifolds. In particular, π is a fiber bundle endowed with a complete Ehresmann connection whose transport acts through isometries between the fibers. In turn, the Abelian gauge fields are "twisted" by a flat symplectic vector bundle defined over the total space of π. This vector bundle is endowed with a vertical taming which locally encodes the gauge couplings and theta angles of the theory and gives rise to the notion of twisted self-duality, of crucial importance to construct the theory. When the Ehresmann connection of π is integrable, we show that our theories are locally equivalent to ordinary Einstein-Scalar-Maxwell theories and hence provide a global non-trivial extension of the universal bosonic sector of four-dimensional supergravity. In this case, we show using a special trivializing atlas of π that global solutions of such models can be interpreted as classical "locally-geometric" U-folds. In the non-integrable case, our theories differ locally from ordinary Einstein-Scalar-Maxwell theories and may provide a geometric description of classical U-folds which are "locally non-geometric".
An Accelerating Solution for N-Body MOND Simulation with FPGA-SoC
Directory of Open Access Journals (Sweden)
Bo Peng
2016-01-01
Full Text Available As a modified-gravity proposal to handle the dark matter problem on galactic scales, Modified Newtonian Dynamics (MOND has shown a great success. However, the N-body MOND simulation is quite challenged by its computation complexity, which appeals to acceleration of the simulation calculation. In this paper, we present a highly integrated accelerating solution for N-body MOND simulations. By using the FPGA-SoC, which integrates both FPGA and SoC (system on chip in one chip, our solution exhibits potentials for better performance, higher integration, and lower power consumption. To handle the calculation bottleneck of potential summation, on one hand, we develop a strategy to simplify the pipeline, in which the square calculation task is conducted by the DSP48E1 of Xilinx 7 series FPGAs, so as to reduce the logic resource utilization of each pipeline; on the other hand, advantages of particle-mesh scheme are taken to overcome the bottleneck on bandwidth. Our experiment results show that 2 more pipelines can be integrated in Zynq-7020 FPGA-SoC with the simplified pipeline, and the bandwidth requirement is reduced significantly. Furthermore, our accelerating solution has a full range of advantages over different processors. Compared with GPU, our work is about 10 times better in performance per watt and 50% better in performance per cost.
International Nuclear Information System (INIS)
Punjabi, Alkesh; Ali, Halima; Evans, Todd; Boozer, Allen
2008-01-01
A highly accurate calculation of the magnetic field line Hamiltonian in DIII-D [J. L. Luxon and L. E. Davis, Fusion Technol. 8, 441 (1985)] is made from piecewise analytic equilibrium fit data for shot 115467 3000 ms. The safety factor calculated from this Hamiltonian has a logarithmic singularity at an ideal separatrix. The logarithmic region inside the ideal separatrix contains 2.5% of toroidal flux inside the separatrix. The logarithmic region is symmetric about the separatrix. An area-preserving map for the field line trajectories is obtained in magnetic coordinates from the Hamiltonian equations of motion for the lines and a canonical transformation. This map is used to calculate trajectories of magnetic field lines in DIII-D. The field line Hamiltonian in DIII-D is used as the generating function for the map and to calculate stochastic broadening from field-errors and spatial noise near the separatrix. A very negligible amount (0.03%) of magnetic flux is lost from inside the separatrix due to these nonaxisymmetric fields. It is quite easy to add magnetic perturbations to generating functions and calculate trajectories for maps in magnetic coordinates. However, it is not possible to integrate across the separatrix. It is also difficult to find the physical position corresponding to magnetic coordinates. For open field lines, periodicity in the poloidal angle is assumed, which is not satisfactory. The goal of this paper is to demonstrate the efficacy of the symplectic mapping approach rather than using realistic DIII-D parameters or modeling specific experimental results
Halo mass and weak galaxy-galaxy lensing profiles in rescaled cosmological N-body simulations
Renneby, Malin; Hilbert, Stefan; Angulo, Raúl E.
2018-05-01
We investigate 3D density and weak lensing profiles of dark matter haloes predicted by a cosmology-rescaling algorithm for N-body simulations. We extend the rescaling method of Angulo & White (2010) and Angulo & Hilbert (2015) to improve its performance on intra-halo scales by using models for the concentration-mass-redshift relation based on excursion set theory. The accuracy of the method is tested with numerical simulations carried out with different cosmological parameters. We find that predictions for median density profiles are more accurate than ˜5 % for haloes with masses of 1012.0 - 1014.5h-1 M⊙ for radii 0.05 baryons, are likely required for interpreting future (dark energy task force stage IV) experiments.
The Abacus Cosmos: A Suite of Cosmological N-body Simulations
Garrison, Lehman H.; Eisenstein, Daniel J.; Ferrer, Douglas; Tinker, Jeremy L.; Pinto, Philip A.; Weinberg, David H.
2018-06-01
We present a public data release of halo catalogs from a suite of 125 cosmological N-body simulations from the ABACUS project. The simulations span 40 wCDM cosmologies centered on the Planck 2015 cosmology at two mass resolutions, 4 × 1010 h ‑1 M ⊙ and 1 × 1010 h ‑1 M ⊙, in 1.1 h ‑1 Gpc and 720 h ‑1 Mpc boxes, respectively. The boxes are phase-matched to suppress sample variance and isolate cosmology dependence. Additional volume is available via 16 boxes of fixed cosmology and varied phase; a few boxes of single-parameter excursions from Planck 2015 are also provided. Catalogs spanning z = 1.5 to 0.1 are available for friends-of-friends and ROCKSTAR halo finders and include particle subsamples. All data products are available at https://lgarrison.github.io/AbacusCosmos.
Unified connected theory of few-body reaction mechanisms in N-body scattering theory
Polyzou, W. N.; Redish, E. F.
1978-01-01
A unified treatment of different reaction mechanisms in nonrelativistic N-body scattering is presented. The theory is based on connected kernel integral equations that are expected to become compact for reasonable constraints on the potentials. The operators T/sub +-//sup ab/(A) are approximate transition operators that describe the scattering proceeding through an arbitrary reaction mechanism A. These operators are uniquely determined by a connected kernel equation and satisfy an optical theorem consistent with the choice of reaction mechanism. Connected kernel equations relating T/sub +-//sup ab/(A) to the full T/sub +-//sup ab/ allow correction of the approximate solutions for any ignored process to any order. This theory gives a unified treatment of all few-body reaction mechanisms with the same dynamic simplicity of a model calculation, but can include complicated reaction mechanisms involving overlapping configurations where it is difficult to formulate models.
Introduction to Hamiltonian dynamical systems and the N-body problem
Meyer, Kenneth R
2017-01-01
This third edition text provides expanded material on the restricted three body problem and celestial mechanics. With each chapter containing new content, readers are provided with new material on reduction, orbifolds, and the regularization of the Kepler problem, all of which are provided with applications. The previous editions grew out of graduate level courses in mathematics, engineering, and physics given at several different universities. The courses took students who had some background in differential equations and lead them through a systematic grounding in the theory of Hamiltonian mechanics from a dynamical systems point of view. This text provides a mathematical structure of celestial mechanics ideal for beginners, and will be useful to graduate students and researchers alike. Reviews of the second edition: "The primary subject here is the basic theory of Hamiltonian differential equations studied from the perspective of differential dynamical systems. The N-body problem is used as the primary exa...
Quantification of discreteness effects in cosmological N-body simulations: Initial conditions
International Nuclear Information System (INIS)
Joyce, M.; Marcos, B.
2007-01-01
The relation between the results of cosmological N-body simulations, and the continuum theoretical models they simulate, is currently not understood in a way which allows a quantification of N dependent effects. In this first of a series of papers on this issue, we consider the quantification of such effects in the initial conditions of such simulations. A general formalism developed in [A. Gabrielli, Phys. Rev. E 70, 066131 (2004).] allows us to write down an exact expression for the power spectrum of the point distributions generated by the standard algorithm for generating such initial conditions. Expanded perturbatively in the amplitude of the input (i.e. theoretical, continuum) power spectrum, we obtain at linear order the input power spectrum, plus two terms which arise from discreteness and contribute at large wave numbers. For cosmological type power spectra, one obtains as expected, the input spectrum for wave numbers k smaller than that characteristic of the discreteness. The comparison of real space correlation properties is more subtle because the discreteness corrections are not as strongly localized in real space. For cosmological type spectra the theoretical mass variance in spheres and two-point correlation function are well approximated above a finite distance. For typical initial amplitudes this distance is a few times the interparticle distance, but it diverges as this amplitude (or, equivalently, the initial redshift of the cosmological simulation) goes to zero, at fixed particle density. We discuss briefly the physical significance of these discreteness terms in the initial conditions, in particular, with respect to the definition of the continuum limit of N-body simulations
Energy Technology Data Exchange (ETDEWEB)
Skokos, Ch., E-mail: haris.skokos@uct.ac.za [Physics Department, Aristotle University of Thessaloniki, GR-54124 Thessaloniki (Greece); Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch 7701 (South Africa); Gerlach, E. [Lohrmann Observatory, Technical University Dresden, D-01062 Dresden (Germany); Bodyfelt, J.D., E-mail: J.Bodyfelt@massey.ac.nz [Centre for Theoretical Chemistry and Physics, The New Zealand Institute for Advanced Study, Massey University, Albany, Private Bag 102904, North Shore City, Auckland 0745 (New Zealand); Papamikos, G. [School of Mathematics, Statistics and Actuarial Science, University of Kent, Canterbury, CT2 7NF (United Kingdom); Eggl, S. [IMCCE, Observatoire de Paris, 77 Avenue Denfert-Rochereau, F-75014 Paris (France)
2014-05-01
While symplectic integration methods based on operator splitting are well established in many branches of science, high order methods for Hamiltonian systems that split in more than two parts have not been studied in great detail. Here, we present several high order symplectic integrators for Hamiltonian systems that can be split in exactly three integrable parts. We apply these techniques, as a practical case, for the integration of the disordered, discrete nonlinear Schrödinger equation (DDNLS) and compare their efficiencies. Three part split algorithms provide effective means to numerically study the asymptotic behavior of wave packet spreading in the DDNLS – a hotly debated subject in current scientific literature.
International Nuclear Information System (INIS)
Skokos, Ch.; Gerlach, E.; Bodyfelt, J.D.; Papamikos, G.; Eggl, S.
2014-01-01
While symplectic integration methods based on operator splitting are well established in many branches of science, high order methods for Hamiltonian systems that split in more than two parts have not been studied in great detail. Here, we present several high order symplectic integrators for Hamiltonian systems that can be split in exactly three integrable parts. We apply these techniques, as a practical case, for the integration of the disordered, discrete nonlinear Schrödinger equation (DDNLS) and compare their efficiencies. Three part split algorithms provide effective means to numerically study the asymptotic behavior of wave packet spreading in the DDNLS – a hotly debated subject in current scientific literature.
Object-Oriented Parallel Particle-in-Cell Code for Beam Dynamics Simulation in Linear Accelerators
International Nuclear Information System (INIS)
Qiang, J.; Ryne, R.D.; Habib, S.; Decky, V.
1999-01-01
In this paper, we present an object-oriented three-dimensional parallel particle-in-cell code for beam dynamics simulation in linear accelerators. A two-dimensional parallel domain decomposition approach is employed within a message passing programming paradigm along with a dynamic load balancing. Implementing object-oriented software design provides the code with better maintainability, reusability, and extensibility compared with conventional structure based code. This also helps to encapsulate the details of communications syntax. Performance tests on SGI/Cray T3E-900 and SGI Origin 2000 machines show good scalability of the object-oriented code. Some important features of this code also include employing symplectic integration with linear maps of external focusing elements and using z as the independent variable, typical in accelerators. A successful application was done to simulate beam transport through three superconducting sections in the APT linac design
Design strategies for irregularly adapting parallel applications
International Nuclear Information System (INIS)
Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Sing, Jaswinder Pal
2000-01-01
Achieving scalable performance for dynamic irregular applications is eminently challenging. Traditional message-passing approaches have been making steady progress towards this goal; however, they suffer from complex implementation requirements. The use of a global address space greatly simplifies the programming task, but can degrade the performance of dynamically adapting computations. In this work, we examine two major classes of adaptive applications, under five competing programming methodologies and four leading parallel architectures. Results indicate that it is possible to achieve message-passing performance using shared-memory programming techniques by carefully following the same high level strategies. Adaptive applications have computational work loads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performance on parallel machines. Efficient parallel implementations of such adaptive applications are therefore a challenging task. This work examines the implementation of two typical adaptive applications, Dynamic Remeshing and N-Body, across various programming paradigms and architectural platforms. We compare several critical factors of the parallel code development, including performance, programmability, scalability, algorithmic development, and portability
Parallel Programming with Intel Parallel Studio XE
Blair-Chappell , Stephen
2012-01-01
Optimize code for multi-core processors with Intel's Parallel Studio Parallel programming is rapidly becoming a "must-know" skill for developers. Yet, where to start? This teach-yourself tutorial is an ideal starting point for developers who already know Windows C and C++ and are eager to add parallelism to their code. With a focus on applying tools, techniques, and language extensions to implement parallelism, this essential resource teaches you how to write programs for multicore and leverage the power of multicore in your programs. Sharing hands-on case studies and real-world examples, the
Geometric characterization for the least Lagrangian action of n-body problems
Institute of Scientific and Technical Information of China (English)
ZHANG; Shiqing
2001-01-01
［1］Manev, G., La gravitation et l'énergie au zéro, Comptes Rendus, 924, 78: 259.［2］Diacu, F. N., Near-collision dynamics for particle systems with quasihomogeneous potentials, J. of Diff. Equ., 996, 28: 58.［3］Ambrosetti, A., Coti Zelati, V., Periodic Solutions of Singular Lagrangian Systems, Basel: Birkhuser, 993.［4］Arnold, V., Kozlov, V., Neishtadt, A., Dynamical Systems (iii): Mathematical Aspects of Classical and Celestial Mechanics, Berlin: Springer-Verlag, 988.［5］Chenciner, A., Desolneux, N., Minima de l'intégrale d'action et équilibres relatifs de n corps, C R Acad. Sci. Paris, serie I, 998, 326: 209.［6］Coti Zelati, V., The periodic solutions of n-body type problems, Ann IHP Anal nonlinéaire, 990, 7: 477.［7］Euler, L., De motu rectilineo trium corprum se mutuo attrahentium, Novi. Comm. Acad. Sci. Imp. Petropll, 767: 45.［8］Gordon, W., A minimizing property of Keplerian orbits, Amer. J. Math., 977, 99: 96.［9］Lagrange, J., Essai sur le problé me des trois corps, 772, Ouvres, 783, 3: 229.［10］Long, Y., Zhang, S. Q., Geometric characterization for variational minimization solutions of the 3-body problem, Chinese Science Bulletin, 999, 44(8): 653.［11］Long, Y., Zhang, S. Q., Geometric characterization for variational minimization solutions of the 3-body problem with fixed energy, J. of Diff. Equ., 2000, 60: 422.［12］Meyer, K., Hall, G., Introduction to Hamiltonian systems and the n-body problems, Berlin: Springer-Verlag,992.［13］Serra, E., Terracini, S., Collisionless periodic solutions to some three-body problems, Arch. Rational Mech. Anal., 992, 20: 305.［14］Siegle, C., Moser, J., Lectures on Celestial Mechanics, Berlin: Springer-Verlag, 97.［15］Wintner, A., Analytical Foundations of Celestial Mechanics, Princeton: Princeton University Press, 94.［16］Hardy, G., Littlewood, J., Pólya, G., Inequalities, 2nd ed., Cambridge: Combridge University Press, 952.
Halo statistics analysis within medium volume cosmological N-body simulation
Directory of Open Access Journals (Sweden)
Martinović N.
2015-01-01
Full Text Available In this paper we present halo statistics analysis of a ΛCDM N body cosmological simulation (from first halo formation until z = 0. We study mean major merger rate as a function of time, where for time we consider both per redshift and per Gyr dependence. For latter we find that it scales as the well known power law (1 + zn for which we obtain n = 2.4. The halo mass function and halo growth function are derived and compared both with analytical and empirical fits. We analyse halo growth through out entire simulation, making it possible to continuously monitor evolution of halo number density within given mass ranges. The halo formation redshift is studied exploring possibility for a new simple preliminary analysis during the simulation run. Visualization of the simulation is portrayed as well. At redshifts z = 0−7 halos from simulation have good statistics for further analysis especially in mass range of 1011 − 1014 M./h. [176021 ’Visible and invisible matter in nearby galaxies: theory and observations
N-body quantum scattering theory in two Hilbert spaces. VII. Real-energy limits
International Nuclear Information System (INIS)
Chandler, C.; Gibson, A.G.
1994-01-01
A study is made of the real-energy limits of approximate solutions of the Chandler--Gibson equations, as well as the real-energy limits of the approximate equations themselves. It is proved that (1) the approximate time-independent transition operator T π (z) and an auxiliary operator M π (z), when restricted to finite energy intervals, are trace class operators and have limits in trace norm for almost all values of the real energy; (2) the basic dynamical equation that determines the operator M π (z), when restricted to the space of trace class operators, has a real-energy limit in trace norm for almost all values of the real energy; (3) the real-energy limit of M π (z) is a solution of the real-energy limit equation; (4) the diagonal (on-shell) elements of the kernels of the real-energy limit of T π (z) and of all solutions of the real-energy limit equation exactly equal the on-shell transition operator, implying that the real-energy limit equation uniquely determines the physical transition amplitude; and (5) a sequence of approximate on-shell transition operators converges strongly to the exact on-shell transition operator. These mathematically rigorous results are believed to be the most general of their type for nonrelativistic N-body quantum scattering theories
A New Signal Model for Axion Cavity Searches from N -body Simulations
Energy Technology Data Exchange (ETDEWEB)
Lentz, Erik W.; Rosenberg, Leslie J. [Physics Department, University of Washington, Seattle, WA 98195-1580 (United States); Quinn, Thomas R.; Tremmel, Michael J., E-mail: lentze@phys.washington.edu, E-mail: ljrosenberg@phys.washington.edu, E-mail: trq@astro.washington.edu, E-mail: mjt29@astro.washington.edu [Astronomy Department, University of Washington, Seattle, WA 98195-1580 (United States)
2017-08-20
Signal estimates for direct axion dark matter (DM) searches have used the isothermal sphere halo model for the last several decades. While insightful, the isothermal model does not capture effects from a halo’s infall history nor the influence of baryonic matter, which has been shown to significantly influence a halo’s inner structure. The high resolution of cavity axion detectors can make use of modern cosmological structure-formation simulations, which begin from realistic initial conditions, incorporate a wide range of baryonic physics, and are capable of resolving detailed structure. This work uses a state-of-the-art cosmological N -body+Smoothed-Particle Hydrodynamics simulation to develop an improved signal model for axion cavity searches. Signal shapes from a class of galaxies encompassing the Milky Way are found to depart significantly from the isothermal sphere. A new signal model for axion detectors is proposed and projected sensitivity bounds on the Axion DM eXperiment (ADMX) data are presented.
AbdulJabbar, Mustafa Abdulmajeed
2017-05-11
Reduction of communication and efficient partitioning are key issues for achieving scalability in hierarchical N-Body algorithms like Fast Multipole Method (FMM). In the present work, we propose three independent strategies to improve partitioning and reduce communication. First, we show that the conventional wisdom of using space-filling curve partitioning may not work well for boundary integral problems, which constitute a significant portion of FMM’s application user base. We propose an alternative method that modifies orthogonal recursive bisection to relieve the cell-partition misalignment that has kept it from scaling previously. Secondly, we optimize the granularity of communication to find the optimal balance between a bulk-synchronous collective communication of the local essential tree and an RDMA per task per cell. Finally, we take the dynamic sparse data exchange proposed by Hoefler et al. [1] and extend it to a hierarchical sparse data exchange, which is demonstrated at scale to be faster than the MPI library’s MPI_Alltoallv that is commonly used.
GLOBAL HIGH-RESOLUTION N-BODY SIMULATION OF PLANET FORMATION. I. PLANETESIMAL-DRIVEN MIGRATION
Energy Technology Data Exchange (ETDEWEB)
Kominami, J. D. [Earth-Life Science Institute, Tokyo Institute of Technology, Meguro-Ku, Tokyo (Japan); Daisaka, H. [Hitotsubashi University, Kunitachi-shi, Tokyo (Japan); Makino, J. [RIKEN Advanced Institute for Computational Science, Chuo-ku, Kobe, Hyogo (Japan); Fujimoto, M., E-mail: kominami@mail.jmlab.jp, E-mail: daisaka@phys.science.hit-u.ac.jp, E-mail: makino@mail.jmlab.jp, E-mail: fujimoto.masaki@jaxa.jp [Japan Aerospace Exploration Agency, Sagamihara-shi, Kanagawa (Japan)
2016-03-01
We investigated whether outward planetesimal-driven migration (PDM) takes place or not in simulations when the self-gravity of planetesimals is included. We performed N-body simulations of planetesimal disks with a large width (0.7–4 au) that ranges over the ice line. The simulations consisted of two stages. The first-stage simulations were carried out to see the runaway growth phase using the planetesimals of initially the same mass. The runaway growth took place both at the inner edge of the disk and at the region just outside the ice line. This result was utilized for the initial setup of the second-stage simulations, in which the runaway bodies just outside the ice line were replaced by the protoplanets with about the isolation mass. In the second-stage simulations, the outward migration of the protoplanet was followed by the stopping of the migration due to the increase of the random velocity of the planetesimals. Owing to this increase of random velocities, one of the PDM criteria derived in Minton and Levison was broken. In the current simulations, the effect of the gas disk is not considered. It is likely that the gas disk plays an important role in PDM, and we plan to study its effect in future papers.
Simulations of collisions between N-body classical systems in interaction
International Nuclear Information System (INIS)
Morisseau, Francois
2006-05-01
The Classical N-body Dynamics (CNBD) is dedicated to the simulation of collisions between classical systems. The 2-body interaction used here has the properties of the Van der Waals potential and depends on just a few parameters. This work has two main goals. First, some theoretical approaches assume that the dynamical stage of the collisions plays an important role. Moreover, colliding nuclei are supposed to present a 1. order liquid-gas phase transition. Several signals have been introduced to show this transition. We have searched for two of them: the bimodality of the mass asymmetry and negative heat capacity. We have found them and we give an explanation of their presence in our calculations. Second, we have improved the interaction by adding a Coulomb like potential and by taking into account the stronger proton-neutron interaction in nuclei. Then we have figured out the relations that exist between the parameters of the 2-body interaction and the properties of the systems. These studies allow us to fit the properties of the classical systems to those of the nuclei. In this manuscript the first results of this fit are shown. (author)
N-body simulations of terrestrial planet formation under the influence of a hot Jupiter
International Nuclear Information System (INIS)
Ogihara, Masahiro; Kobayashi, Hiroshi; Inutsuka, Shu-ichiro
2014-01-01
We investigate the formation of multiple-planet systems in the presence of a hot Jupiter (HJ) using extended N-body simulations that are performed simultaneously with semianalytic calculations. Our primary aims are to describe the planet formation process starting from planetesimals using high-resolution simulations, and to examine the dependences of the architecture of planetary systems on input parameters (e.g., disk mass, disk viscosity). We observe that protoplanets that arise from oligarchic growth and undergo type I migration stop migrating when they join a chain of resonant planets outside the orbit of an HJ. The formation of a resonant chain is almost independent of our model parameters, and is thus a robust process. At the end of our simulations, several terrestrial planets remain at around 0.1 AU. The formed planets are not equal mass; the largest planet constitutes more than 50% of the total mass in the close-in region, which is also less dependent on parameters. In the previous work of this paper, we have found a new physical mechanism of induced migration of the HJ, which is called a crowding-out. If the HJ opens up a wide gap in the disk (e.g., owing to low disk viscosity), crowding-out becomes less efficient and the HJ remains. We also discuss angular momentum transfer between the planets and disk.
Using gaps in N-body tidal streams to probe missing satellites
International Nuclear Information System (INIS)
Ngan, W. H. W.; Carlberg, R. G.
2014-01-01
We use N-body simulations to model the tidal disruption of a star cluster in a Milky-Way-sized dark matter halo, which results in a narrow stream comparable to (but slightly wider than) Pal-5 or GD-1. The mean Galactic dark matter halo is modeled by a spherical Navarro-Frenk-White potential with subhalos predicted by the ΛCDM cosmological model. The distribution and mass function of the subhalos follow the results from the Aquarius simulation. We use a matched filter approach to look for 'gaps' in tidal streams at 12 length scales from 0.1 kpc to 5 kpc, which appear as characteristic dips in the linear densities along the streams. We find that, in addition to the subhalos' perturbations, the epicyclic overdensities (EOs) due to the coherent epicyclic motions of particles in a stream also produce gap-like signals near the progenitor. We measure the gap spectra—the gap formation rates as functions of gap length—due to both subhalo perturbations and EOs, which have not been accounted for together by previous studies. Finally, we project the simulated streams onto the sky to investigate issues when interpreting gap spectra in observations. In particular, we find that gap spectra from low signal-to-noise observations can be biased by the orbital phase of the stream. This indicates that the study of stream gaps will benefit greatly from high-quality data from future missions.
Optimal order and time-step criterion for Aarseth-type N-body integrators
International Nuclear Information System (INIS)
Makino, Junichiro
1991-01-01
How the selection of the time-step criterion and the order of the integrator change the efficiency of Aarseth-type N-body integrators is discussed. An alternative to Aarseth's scheme based on the direct calculation of the time derivative of the force using the Hermite interpolation is compared to Aarseth's scheme, which uses the Newton interpolation to construct the predictor and corrector. How the number of particles in the system changes the behavior of integrators is examined. The Hermite scheme allows a time step twice as large as that for the standard Aarseth scheme for the same accuracy. The calculation cost of the Hermite scheme per time step is roughly twice as much as that of the standard Aarseth scheme. The optimal order of the integrators depends on both the particle number and the accuracy required. The time-step criterion of the standard Aarseth scheme is found to be inapplicable to higher-order integrators, and a more uniformly reliable criterion is proposed. 18 refs
A complete basis for a perturbation expansion of the general N-body problem
International Nuclear Information System (INIS)
Laing, W Blake; Kelle, David W; Dunn, Martin; Watson, Deborah K
2009-01-01
We discuss a basis set developed to calculate perturbation coefficients in an expansion of the general N-body problem. This basis has two advantages. First, the basis is complete order-by-order for the perturbation series. Second, the number of independent basis tensors spanning the space for a given order does not scale with N, the number of particles, despite the generality of the problem. At first order, the number of basis tensors is 25 for all N, i.e. the problem scales as N 0 , although one would initially expect an N 6 scaling at first order. The perturbation series is expanded in inverse powers of the spatial dimension. This results in a maximally symmetric configuration at lowest order which has a point group isomorphic with the symmetric group, S N . The resulting perturbation series is order-by-order invariant under the N! operations of the S N point group which is responsible for the slower than exponential growth of the basis. In this paper, we demonstrate the completeness of the basis and perform the first test of this formalism through first order by comparing to an exactly solvable fully interacting problem of N particles with a two-body harmonic interaction potential
Studies of Planet Formation using a Hybrid N-body + Planetesimal Code
Kenyon, Scott J.; Bromley, Benjamin C.; Salamon, Michael (Technical Monitor)
2005-01-01
The goal of our proposal was to use a hybrid multi-annulus planetesimal/n-body code to examine the planetesimal theory, one of the two main theories of planet formation. We developed this code to follow the evolution of numerous 1 m to 1 km planetesimals as they collide, merge, and grow into full-fledged planets. Our goal was to apply the code to several well-posed, topical problems in planet formation and to derive observational consequences of the models. We planned to construct detailed models to address two fundamental issues: 1) icy planets - models for icy planet formation will demonstrate how the physical properties of debris disks, including the Kuiper Belt in our solar system, depend on initial conditions and input physics; and 2) terrestrial planets - calculations following the evolution of 1-10 km planetesimals into Earth-mass planets and rings of dust will provide a better understanding of how terrestrial planets form and interact with their environment. During the past year, we made progress on each issue. Papers published in 2004 are summarized. Summaries of work to be completed during the first half of 2005 and work planned for the second half of 2005 are included.
Virialization in N-body models of the expanding universe. I. Isolated pairs
International Nuclear Information System (INIS)
Evrard, A.E.; Yahil, A.; and Institute of Astronomy, University of Cambridge)
1985-01-01
The degree of virialization of isolated pairs of galaxies is investigated in the N-body simulations of Efstathiou and Eastwood for open (Ω 0 = 0.1) and critical (Ω 0 = 1.0) universes, utilizing the three-dimensional information available for both position and velocity. Roughly half of the particles in the models form isolated pairs whose dynamics is dominated by their own two-body force. Three-quarters or more of these pairs are bound, and this ensemble of bound isolated pairs is found to yield excellent mass estimates upon application of the virial theorem. Contamination from unbound pairs introduces error factors smaller than 2 in mass estimates, and these errors can be corrected by simple methods. Oribts of bound pairs are highly eccentric, but this does not lead to serious selection effects in orbital phases, since these are uniformly distributed. The relative velocity of these pairs of mass points shows a Keplerian falloff with separation, contrary to observational evidence for real galaxies. All the above results are independent of the value of Ω 0 , but may be sensitive to initial conditions and the point-mass nature of the particles
Morse, H Stephen
1994-01-01
Practical Parallel Computing provides information pertinent to the fundamental aspects of high-performance parallel processing. This book discusses the development of parallel applications on a variety of equipment.Organized into three parts encompassing 12 chapters, this book begins with an overview of the technology trends that converge to favor massively parallel hardware over traditional mainframes and vector machines. This text then gives a tutorial introduction to parallel hardware architectures. Other chapters provide worked-out examples of programs using several parallel languages. Thi
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
Clusters of galaxies compared with N-body simulations: masses and mass segregation
International Nuclear Information System (INIS)
Struble, M.F.; Bludman, S.A.
1979-01-01
With three virially stable N-body simulations of Wielen, it is shown that use of the expression for the total mass derived from averaged quantities (velocity dispersion and mean harmonic radius) yields an overestimate of the mass by as much as a factor of 2-3, and use of the heaviest mass sample gives an underestimate by a factor of 2-3. The estimate of the mass using mass weighted quantities (i.e., derived from the customary definition of kinetic and potential energies) yields a better value irrespectively of mass sample as applied to late time intervals of the models (>= three two-body relaxation times). The uncertainty is at most approximately 50%. This suggests that it is better to employ the mass weighted expression for the mass when determining cluster masses. The virial ratio, which is a ratio of the mass weighted/averaged expression for the potential energy, is found to vary between 1 and 2. It is concluded that ratios for observed clusters approximately 4-10 cannot be explained even by the imprecision of the expression for the mass using averaged quantities, and certainly implies the presence of unseen matter. Total masses via customary application of the virial theorem are calculated for 39 clusters, and total masses for 12 clusters are calculated by a variant of the usual application. The distribution of cluster masses is also presented and briefly discussed. Mass segregation in Wielen's models is studied in terms of the binding energy per unit mass of the 'heavy' sample compared with the 'light' sample. The general absence of mass segregation in relaxaed clusters and the large virial discrepancies are attributed to a population of many low-mass objects that may constitute the bulk mass of clusters of galaxies. (Auth.)
Counts-in-Cylinders in the Sloan Digital Sky Survey with Comparisons to N-Body
Energy Technology Data Exchange (ETDEWEB)
Berrier, Heather D.; Barton, Elizabeth J.; /UC, Irvine; Berrier, Joel C.; /Arkansas U.; Bullock, James S.; /UC, Irvine; Zentner, Andrew R.; /Pittsburgh U.; Wechsler, Risa H. /KIPAC, Menlo Park /SLAC
2010-12-16
Environmental statistics provide a necessary means of comparing the properties of galaxies in different environments and a vital test of models of galaxy formation within the prevailing, hierarchical cosmological model. We explore counts-in-cylinders, a common statistic defined as the number of companions of a particular galaxy found within a given projected radius and redshift interval. Galaxy distributions with the same two-point correlation functions do not necessarily have the same companion count distributions. We use this statistic to examine the environments of galaxies in the Sloan Digital Sky Survey, Data Release 4. We also make preliminary comparisons to four models for the spatial distributions of galaxies, based on N-body simulations, and data from SDSS DR4 to study the utility of the counts-in-cylinders statistic. There is a very large scatter between the number of companions a galaxy has and the mass of its parent dark matter halo and the halo occupation, limiting the utility of this statistic for certain kinds of environmental studies. We also show that prevalent, empirical models of galaxy clustering that match observed two- and three-point clustering statistics well fail to reproduce some aspects of the observed distribution of counts-in-cylinders on 1, 3 and 6-h{sup -1}Mpc scales. All models that we explore underpredict the fraction of galaxies with few or no companions in 3 and 6-h{sup -1} Mpc cylinders. Roughly 7% of galaxies in the real universe are significantly more isolated within a 6 h{sup -1} Mpc cylinder than the galaxies in any of the models we use. Simple, phenomenological models that map galaxies to dark matter halos fail to reproduce high-order clustering statistics in low-density environments.
N-body simulations of planet formation: understanding exoplanet system architectures
Coleman, Gavin; Nelson, Richard
2015-12-01
Observations have demonstrated the existence of a significant population of compact systems comprised of super-Earths and Neptune-mass planets, and a population of gas giants that appear to occur primarily in either short-period (100 days) orbits. The broad diversity of system architectures raises the question of whether or not the same formation processes operating in standard disc models can explain these planets, or if different scenarios are required instead to explain the widely differing architectures. To explore this issue, we present the results from a comprehensive suite of N-body simulations of planetary system formation that include the following physical processes: gravitational interactions and collisions between planetary embryos and planetesimals; type I and II migration; gas accretion onto planetary cores; self-consistent viscous disc evolution and disc removal through photo-evaporation. Our results indicate that the formation and survival of compact systems of super-Earths and Neptune-mass planets occur commonly in disc models where a simple prescription for the disc viscosity is assumed, but such models never lead to the formation and survival of gas giant planets due to migration into the star. Inspired in part by the ALMA observations of HL Tau, and by MHD simulations that display the formation of long-lived zonal flows, we have explored the consequences of assuming that the disc viscosity varies in both time and space. We find that the radial structuring of the disc leads to conditions in which systems of giant planets are able to form and survive. Furthermore, these giants generally occupy those regions of the mass-period diagram that are densely populated by the observed gas giants, suggesting that the planet traps generated by radial structuring of protoplanetary discs may be a necessary ingredient for forming giant planets.
Introduction to parallel programming
Brawer, Steven
1989-01-01
Introduction to Parallel Programming focuses on the techniques, processes, methodologies, and approaches involved in parallel programming. The book first offers information on Fortran, hardware and operating system models, and processes, shared memory, and simple parallel programs. Discussions focus on processes and processors, joining processes, shared memory, time-sharing with multiple processors, hardware, loops, passing arguments in function/subroutine calls, program structure, and arithmetic expressions. The text then elaborates on basic parallel programming techniques, barriers and race
Fox, Geoffrey C; Messina, Guiseppe C
2014-01-01
A clear illustration of how parallel computers can be successfully appliedto large-scale scientific computations. This book demonstrates how avariety of applications in physics, biology, mathematics and other scienceswere implemented on real parallel computers to produce new scientificresults. It investigates issues of fine-grained parallelism relevant forfuture supercomputers with particular emphasis on hypercube architecture. The authors describe how they used an experimental approach to configuredifferent massively parallel machines, design and implement basic systemsoftware, and develop
Energy Technology Data Exchange (ETDEWEB)
Heller, Marc Andre [Particle Theory and Cosmology Group, Department of Physics,Graduate School of Science, Tohoku University,Aoba-ku, Sendai 980-8578 (Japan); Ikeda, Noriaki [Department of Mathematical Sciences, Ritsumeikan University,Kusatsu, Shiga 525-8577 (Japan); Watamura, Satoshi [Particle Theory and Cosmology Group, Department of Physics,Graduate School of Science, Tohoku University,Aoba-ku, Sendai 980-8578 (Japan)
2017-02-15
We give a systematic derivation of the local expressions of the NS H-flux, geometric F- as well as non-geometric Q- and R-fluxes in terms of bivector β- and two-form B-potentials including vielbeins. They are obtained using a supergeometric method on QP-manifolds by twist of the standard Courant algebroid on the generalized tangent space without flux. Bianchi identities of the fluxes are easily deduced. We extend the discussion to the case of the double space and present a formulation of T-duality in terms of canonical transformations between graded symplectic manifolds. Thus, we find a unified description of geometric as well as non-geometric fluxes and T-duality transformations in double field theory. Finally, the construction is compared to the formerly introduced Poisson Courant algebroid, a Courant algebroid on a Poisson manifold, as a model for R-flux.
Prykarpatsky, Yarema A.; Artemovych, Orest D.; Pavlov, Maxim V.; Prykarpatski, Anatolij K.
2013-06-01
A differential-algebraic approach to studying the Lax-type integrability of the generalized Riemann-type hydrodynamic hierarchy, proposed recently by O. D. Artemovych, M. V. Pavlov, Z. Popowicz and A. K. Prykarpatski, is developed. In addition to the Lax-type representation, found before by Z. Popowicz, a closely related representation is constructed in exact form by means of a new differential-functional technique. The bi-Hamiltonian integrability and compatible Poisson structures of the generalized Riemann type hierarchy are analyzed by means of the symplectic and gradient-holonomic methods. An application of the devised differential-algebraic approach to other Riemann and Vakhnenko type hydrodynamic systems is presented.
The symplectic fermion ribbon quasi-Hopf algebra and the SL(2,Z)-action on its centre
Energy Technology Data Exchange (ETDEWEB)
Farsad, Vanda
2017-06-14
This thesis is concerned with ''N pairs of symplectic fermions'' which are examples of logarithmic conformal field theories in two dimensions. The mathematical language of two-dimensional conformal field theories (on Riemannian surfaces of genus zero) are vertex operator algebras. The representation category of the even part of the symplectic fermion vertex operator super-algebra Rep V{sub ev} is conjecturally a factorisable finite ribbon tensor category. This determines an isomorphism of projective representations between two SL(2,Z)-actions associated to V{sub ev}. The first action is obtained by modular transformations on the space of so-called pseudo-trace functions of a vertex operator algebra. For V{sub ev} this was developed by A.M.Gaberdiel and I. Runkel. For the action one uses that Rep V{sub ev} is conjecturally a factorisable finite ribbon tensor category and thus carries a projective SL(2,Z)-action on a certain Hom-space [Ly1,Ly2,KL]. To do so we calculate the SL(2,Z)-action on the representation category of a general factorisable quasi-Hopf algebras. Then we show that Rep V{sub ev} is conjecturally ribbon equivalent to Rep Q, for Q a factorisable quasi-Hopf algebra, and calculate the SL(2,Z)-action explicitly on Rep Q. The result is that the two SL(2,Z)-action indeed agree. This poses the first example of such comparison for logarithmic conformal field theories.
Distribution function approach to redshift space distortions. Part II: N-body simulations
International Nuclear Information System (INIS)
Okumura, Teppei; Seljak, Uroš; McDonald, Patrick; Desjacques, Vincent
2012-01-01
Measurement of redshift-space distortions (RSD) offers an attractive method to directly probe the cosmic growth history of density perturbations. A distribution function approach where RSD can be written as a sum over density weighted velocity moment correlators has recently been developed. In this paper we use results of N-body simulations to investigate the individual contributions and convergence of this expansion for dark matter. If the series is expanded as a function of powers of μ, cosine of the angle between the Fourier mode and line of sight, then there are a finite number of terms contributing at each order. We present these terms and investigate their contribution to the total as a function of wavevector k. For μ 2 the correlation between density and momentum dominates on large scales. Higher order corrections, which act as a Finger-of-God (FoG) term, contribute 1% at k ∼ 0.015hMpc −1 , 10% at k ∼ 0.05hMpc −1 at z = 0, while for k > 0.15hMpc −1 they dominate and make the total negative. These higher order terms are dominated by density-energy density correlations which contributes negatively to the power, while the contribution from vorticity part of momentum density auto-correlation adds to the total power, but is an order of magnitude lower. For μ 4 term the dominant term on large scales is the scalar part of momentum density auto-correlation, while higher order terms dominate for k > 0.15hMpc −1 . For μ 6 and μ 8 we find it has very little power for k −1 , shooting up by 2–3 orders of magnitude between k −1 and k −1 . We also compare the expansion to the full 2-d P ss (k,μ), as well as to the monopole, quadrupole, and hexadecapole integrals of P ss (k,μ). For these statistics an infinite number of terms contribute and we find that the expansion achieves percent level accuracy for kμ −1 at 6-th order, but breaks down on smaller scales because the series is no longer perturbative. We explore resummation of the terms into Fo
N-body simulations with a cosmic vector for dark energy
Carlesi, Edoardo; Knebe, Alexander; Yepes, Gustavo; Gottlöber, Stefan; Jiménez, Jose Beltrán.; Maroto, Antonio L.
2012-07-01
We present the results of a series of cosmological N-body simulations of a vector dark energy (VDE) model, performed using a suitably modified version of the publicly available GADGET-2 code. The set-ups of our simulations were calibrated pursuing a twofold aim: (1) to analyse the large-scale distribution of massive objects and (2) to determine the properties of halo structure in this different framework. We observe that structure formation is enhanced in VDE, since the mass function at high redshift is boosted up to a factor of 10 with respect to Λ cold dark matter (ΛCDM), possibly alleviating tensions with the observations of massive clusters at high redshifts and early reionization epoch. Significant differences can also be found for the value of the growth factor, which in VDE shows a completely different behaviour, and in the distribution of voids, which in this cosmology are on average smaller and less abundant. We further studied the structure of dark matter haloes more massive than 5 × 1013 h-1 M⊙, finding that no substantial difference emerges when comparing spin parameter, shape, triaxiality and profiles of structures evolved under different cosmological pictures. Nevertheless, minor differences can be found in the concentration-mass relation and the two-point correlation function, both showing different amplitudes and steeper slopes. Using an additional series of simulations of a ΛCDM scenario with the same ? and σ8 used in the VDE cosmology, we have been able to establish whether the modifications induced in the new cosmological picture were due to the particular nature of the dynamical dark energy or a straightforward consequence of the cosmological parameters. On large scales, the dynamical effects of the cosmic vector field can be seen in the peculiar evolution of the cluster number density function with redshift, in the shape of the mass function, in the distribution of voids and on the characteristic form of the growth index γ(z). On
Dark matter direct detection signals inferred from a cosmological N-body simulation with baryons
International Nuclear Information System (INIS)
Ling, F.-S.; Nezri, E.; Athanassoula, E.; Teyssier, R.
2010-01-01
We extract at redshift z = 0 a Milky Way sized object including gas, stars and dark matter (DM) from a recent, high-resolution cosmological N-body simulation with baryons. Its resolution is sufficient to witness the formation of a rotating disk and bulge at the center of the halo potential, therefore providing a realistic description of the birth and the evolution of galactic structures in the ΛCDM cosmology paradigm. The phase-space structure of the central galaxy reveals that, throughout a thick region, the dark halo is co-rotating on average with the stellar disk. At the Earth's location, the rotating component, sometimes called dark disk in the literature, is characterized by a minimum lag velocity v lag ≅ 75 km/s, in which case it contributes to around 25% of the total DM local density, whose value is ρ DM ≅ 0.37GeV/cm 3 . The velocity distributions also show strong deviations from pure Gaussian and Maxwellian distributions, with a sharper drop of the high velocity tail. We give a detailed study of the impact of these features on the predictions for DM signals in direct detection experiments. In particular, the question of whether the modulation signal observed by DAMA is or is not excluded by limits set by other experiments (CDMS, XENON and CRESST...) is re-analyzed and compared to the case of a standard Maxwellian halo. We consider spin-independent interactions for both the elastic and the inelastic scattering scenarios. For the first time, we calculate the allowed regions for DAMA and the exclusion limits of other null experiments directly from the velocity distributions found in the simulation. We then compare these results with the predictions of various analytical distributions. We find that the compatibility between DAMA and the other experiments is improved. In the elastic scenario, the DAMA modulation signal is slightly enhanced in the so-called channeling region, as a result of several effects that include a departure from a Maxwellian
Parallel Atomistic Simulations
Energy Technology Data Exchange (ETDEWEB)
HEFFELFINGER,GRANT S.
2000-01-18
Algorithms developed to enable the use of atomistic molecular simulation methods with parallel computers are reviewed. Methods appropriate for bonded as well as non-bonded (and charged) interactions are included. While strategies for obtaining parallel molecular simulations have been developed for the full variety of atomistic simulation methods, molecular dynamics and Monte Carlo have received the most attention. Three main types of parallel molecular dynamics simulations have been developed, the replicated data decomposition, the spatial decomposition, and the force decomposition. For Monte Carlo simulations, parallel algorithms have been developed which can be divided into two categories, those which require a modified Markov chain and those which do not. Parallel algorithms developed for other simulation methods such as Gibbs ensemble Monte Carlo, grand canonical molecular dynamics, and Monte Carlo methods for protein structure determination are also reviewed and issues such as how to measure parallel efficiency, especially in the case of parallel Monte Carlo algorithms with modified Markov chains are discussed.
International Nuclear Information System (INIS)
Schroeder, M.C.; Comins, N.F.
1986-01-01
During the past twenty years, three approaches to numerical simulations of the evolution of galaxies have been developed. The first approach, N-body programs, models the motion of clusters of stars as point particles which interact via their gravitational potentials to determine the system dynamics. Some N-body codes model molecular clouds as colliding, inelastic particles. The second approach, hydrodynamic models of galactic dynamics, simulates the activity of the interstellar medium as a compressible gas. These models presently do not include stars, the effect of gravitational fields, or allow for stellar evolution and exchange of mass or angular momentum between stars and the interstellar medium. The third approach, stochastic star formation simulations of disk galaxies, allows for the interaction between stars and interstellar gas, but does not allow the star particles to move under the influence of gravity
CERN. Geneva
2016-01-01
The traditionally used and well established parallel programming models OpenMP and MPI are both targeting lower level parallelism and are meant to be as language agnostic as possible. For a long time, those models were the only widely available portable options for developing parallel C++ applications beyond using plain threads. This has strongly limited the optimization capabilities of compilers, has inhibited extensibility and genericity, and has restricted the use of those models together with other, modern higher level abstractions introduced by the C++11 and C++14 standards. The recent revival of interest in the industry and wider community for the C++ language has also spurred a remarkable amount of standardization proposals and technical specifications being developed. Those efforts however have so far failed to build a vision on how to seamlessly integrate various types of parallelism, such as iterative parallel execution, task-based parallelism, asynchronous many-task execution flows, continuation s...
Parallelism in matrix computations
Gallopoulos, Efstratios; Sameh, Ahmed H
2016-01-01
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of pa...
International Nuclear Information System (INIS)
Kong Linghua; Hong Jialin; Liu Ruxun
2008-01-01
In this paper, we propose a family of symplectic structure-preserving numerical methods for the coupled Klein-Gordon-Schroedinger (KGS) system. The Hamiltonian formulation is constructed for the KGS. We discretize the Hamiltonian system in space first with a family of canonical difference methods which convert an infinite-dimensional Hamiltonian system into a finite-dimensional one. Next, we discretize the finite-dimensional system in time by a midpoint rule which preserves the symplectic structure of the original system. The conservation laws of the schemes are analyzed in succession, including the charge conservation law and the residual of energy conservation law, etc. We analyze the truncation errors and global errors of the numerical solutions for the schemes to end the theoretical analysis. Extensive numerical tests show the accordance between the theoretical and numerical results
Energy Technology Data Exchange (ETDEWEB)
Qin, Hong; Liu, Jian; Xiao, Jianyuan; Zhang, Ruili; He, Yang; Wang, Yulei; Sun, Yajuan; Burby, Joshua W.; Ellison, Leland; Zhou, Yao
2015-12-14
Particle-in-cell (PIC) simulation is the most important numerical tool in plasma physics. However, its long-term accuracy has not been established. To overcome this difficulty, we developed a canonical symplectic PIC method for the Vlasov-Maxwell system by discretising its canonical Poisson bracket. A fast local algorithm to solve the symplectic implicit time advance is discovered without root searching or global matrix inversion, enabling applications of the proposed method to very large-scale plasma simulations with many, e.g. 10(9), degrees of freedom. The long-term accuracy and fidelity of the algorithm enables us to numerically confirm Mouhot and Villani's theory and conjecture on nonlinear Landau damping over several orders of magnitude using the PIC method, and to calculate the nonlinear evolution of the reflectivity during the mode conversion process from extraordinary waves to Bernstein waves.
PENTACLE: Parallelized particle-particle particle-tree code for planet formation
Iwasawa, Masaki; Oshino, Shoichi; Fujii, Michiko S.; Hori, Yasunori
2017-10-01
We have newly developed a parallelized particle-particle particle-tree code for planet formation, PENTACLE, which is a parallelized hybrid N-body integrator executed on a CPU-based (super)computer. PENTACLE uses a fourth-order Hermite algorithm to calculate gravitational interactions between particles within a cut-off radius and a Barnes-Hut tree method for gravity from particles beyond. It also implements an open-source library designed for full automatic parallelization of particle simulations, FDPS (Framework for Developing Particle Simulator), to parallelize a Barnes-Hut tree algorithm for a memory-distributed supercomputer. These allow us to handle 1-10 million particles in a high-resolution N-body simulation on CPU clusters for collisional dynamics, including physical collisions in a planetesimal disc. In this paper, we show the performance and the accuracy of PENTACLE in terms of \\tilde{R}_cut and a time-step Δt. It turns out that the accuracy of a hybrid N-body simulation is controlled through Δ t / \\tilde{R}_cut and Δ t / \\tilde{R}_cut ˜ 0.1 is necessary to simulate accurately the accretion process of a planet for ≥106 yr. For all those interested in large-scale particle simulations, PENTACLE, customized for planet formation, will be freely available from https://github.com/PENTACLE-Team/PENTACLE under the MIT licence.
DEFF Research Database (Denmark)
Sitchinava, Nodar; Zeh, Norbert
2012-01-01
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of...... in the optimal OhOf(psortN + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and psortN is the parallel I/O complexity of sorting N elements using P processors....
Deshmane, Anagha; Gulani, Vikas; Griswold, Mark A; Seiberlich, Nicole
2012-07-01
Parallel imaging is a robust method for accelerating the acquisition of magnetic resonance imaging (MRI) data, and has made possible many new applications of MR imaging. Parallel imaging works by acquiring a reduced amount of k-space data with an array of receiver coils. These undersampled data can be acquired more quickly, but the undersampling leads to aliased images. One of several parallel imaging algorithms can then be used to reconstruct artifact-free images from either the aliased images (SENSE-type reconstruction) or from the undersampled data (GRAPPA-type reconstruction). The advantages of parallel imaging in a clinical setting include faster image acquisition, which can be used, for instance, to shorten breath-hold times resulting in fewer motion-corrupted examinations. In this article the basic concepts behind parallel imaging are introduced. The relationship between undersampling and aliasing is discussed and two commonly used parallel imaging methods, SENSE and GRAPPA, are explained in detail. Examples of artifacts arising from parallel imaging are shown and ways to detect and mitigate these artifacts are described. Finally, several current applications of parallel imaging are presented and recent advancements and promising research in parallel imaging are briefly reviewed. Copyright © 2012 Wiley Periodicals, Inc.
Parallel Algorithms and Patterns
Energy Technology Data Exchange (ETDEWEB)
Robey, Robert W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-16
This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.
Application Portable Parallel Library
Cole, Gary L.; Blech, Richard A.; Quealy, Angela; Townsend, Scott
1995-01-01
Application Portable Parallel Library (APPL) computer program is subroutine-based message-passing software library intended to provide consistent interface to variety of multiprocessor computers on market today. Minimizes effort needed to move application program from one computer to another. User develops application program once and then easily moves application program from parallel computer on which created to another parallel computer. ("Parallel computer" also include heterogeneous collection of networked computers). Written in C language with one FORTRAN 77 subroutine for UNIX-based computers and callable from application programs written in C language or FORTRAN 77.
Xie, Hong-Bo; Dokos, Socrates
2013-06-01
We present a hybrid symplectic geometry and central tendency measure (CTM) method for detection of determinism in noisy time series. CTM is effective for detecting determinism in short time series and has been applied in many areas of nonlinear analysis. However, its performance significantly degrades in the presence of strong noise. In order to circumvent this difficulty, we propose to use symplectic principal component analysis (SPCA), a new chaotic signal de-noising method, as the first step to recover the system dynamics. CTM is then applied to determine whether the time series arises from a stochastic process or has a deterministic component. Results from numerical experiments, ranging from six benchmark deterministic models to 1/f noise, suggest that the hybrid method can significantly improve detection of determinism in noisy time series by about 20 dB when the data are contaminated by Gaussian noise. Furthermore, we apply our algorithm to study the mechanomyographic (MMG) signals arising from contraction of human skeletal muscle. Results obtained from the hybrid symplectic principal component analysis and central tendency measure demonstrate that the skeletal muscle motor unit dynamics can indeed be deterministic, in agreement with previous studies. However, the conventional CTM method was not able to definitely detect the underlying deterministic dynamics. This result on MMG signal analysis is helpful in understanding neuromuscular control mechanisms and developing MMG-based engineering control applications.
Parallel discrete event simulation
Overeinder, B.J.; Hertzberger, L.O.; Sloot, P.M.A.; Withagen, W.J.
1991-01-01
In simulating applications for execution on specific computing systems, the simulation performance figures must be known in a short period of time. One basic approach to the problem of reducing the required simulation time is the exploitation of parallelism. However, in parallelizing the simulation
Parallel reservoir simulator computations
International Nuclear Information System (INIS)
Hemanth-Kumar, K.; Young, L.C.
1995-01-01
The adaptation of a reservoir simulator for parallel computations is described. The simulator was originally designed for vector processors. It performs approximately 99% of its calculations in vector/parallel mode and relative to scalar calculations it achieves speedups of 65 and 81 for black oil and EOS simulations, respectively on the CRAY C-90
Estimating non-circular motions in barred galaxies using numerical N-body simulations
Randriamampandry, T. H.; Combes, F.; Carignan, C.; Deg, N.
2015-12-01
The observed velocities of the gas in barred galaxies are a combination of the azimuthally averaged circular velocity and non-circular motions, primarily caused by gas streaming along the bar. These non-circular flows must be accounted for before the observed velocities can be used in mass modelling. In this work, we examine the performance of the tilted-ring method and the DISKFIT algorithm for transforming velocity maps of barred spiral galaxies into rotation curves (RCs) using simulated data. We find that the tilted-ring method, which does not account for streaming motions, under-/overestimates the circular motions when the bar is parallel/perpendicular to the projected major axis. DISKFIT, which does include streaming motions, is limited to orientations where the bar is not aligned with either the major or minor axis of the image. Therefore, we propose a method of correcting RCs based on numerical simulations of galaxies. We correct the RC derived from the tilted-ring method based on a numerical simulation of a galaxy with similar properties and projections as the observed galaxy. Using observations of NGC 3319, which has a bar aligned with the major axis, as a test case, we show that the inferred mass models from the uncorrected and corrected RCs are significantly different. These results show the importance of correcting for the non-circular motions and demonstrate that new methods of accounting for these motions are necessary as current methods fail for specific bar alignments.
Totally parallel multilevel algorithms
Frederickson, Paul O.
1988-01-01
Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.
Energy Technology Data Exchange (ETDEWEB)
1991-10-23
An account of the Caltech Concurrent Computation Program (C{sup 3}P), a five year project that focused on answering the question: Can parallel computers be used to do large-scale scientific computations '' As the title indicates, the question is answered in the affirmative, by implementing numerous scientific applications on real parallel computers and doing computations that produced new scientific results. In the process of doing so, C{sup 3}P helped design and build several new computers, designed and implemented basic system software, developed algorithms for frequently used mathematical computations on massively parallel machines, devised performance models and measured the performance of many computers, and created a high performance computing facility based exclusively on parallel computers. While the initial focus of C{sup 3}P was the hypercube architecture developed by C. Seitz, many of the methods developed and lessons learned have been applied successfully on other massively parallel architectures.
Massively parallel mathematical sieves
Energy Technology Data Exchange (ETDEWEB)
Montry, G.R.
1989-01-01
The Sieve of Eratosthenes is a well-known algorithm for finding all prime numbers in a given subset of integers. A parallel version of the Sieve is described that produces computational speedups over 800 on a hypercube with 1,024 processing elements for problems of fixed size. Computational speedups as high as 980 are achieved when the problem size per processor is fixed. The method of parallelization generalizes to other sieves and will be efficient on any ensemble architecture. We investigate two highly parallel sieves using scattered decomposition and compare their performance on a hypercube multiprocessor. A comparison of different parallelization techniques for the sieve illustrates the trade-offs necessary in the design and implementation of massively parallel algorithms for large ensemble computers.
A Hardware-Accelerated Quantum Monte Carlo framework (HAQMC) for N-body systems
Gothandaraman, Akila; Peterson, Gregory D.; Warren, G. Lee; Hinde, Robert J.; Harrison, Robert J.
2009-12-01
Interest in the study of structural and energetic properties of highly quantum clusters, such as inert gas clusters has motivated the development of a hardware-accelerated framework for Quantum Monte Carlo simulations. In the Quantum Monte Carlo method, the properties of a system of atoms, such as the ground-state energies, are averaged over a number of iterations. Our framework is aimed at accelerating the computations in each iteration of the QMC application by offloading the calculation of properties, namely energy and trial wave function, onto reconfigurable hardware. This gives a user the capability to run simulations for a large number of iterations, thereby reducing the statistical uncertainty in the properties, and for larger clusters. This framework is designed to run on the Cray XD1 high performance reconfigurable computing platform, which exploits the coarse-grained parallelism of the processor along with the fine-grained parallelism of the reconfigurable computing devices available in the form of field-programmable gate arrays. In this paper, we illustrate the functioning of the framework, which can be used to calculate the energies for a model cluster of helium atoms. In addition, we present the capabilities of the framework that allow the user to vary the chemical identities of the simulated atoms. Program summaryProgram title: Hardware Accelerated Quantum Monte Carlo (HAQMC) Catalogue identifier: AEEP_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEP_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 691 537 No. of bytes in distributed program, including test data, etc.: 5 031 226 Distribution format: tar.gz Programming language: C/C++ for the QMC application, VHDL and Xilinx 8.1 ISE/EDK tools for FPGA design and development Computer: Cray XD
Energy Technology Data Exchange (ETDEWEB)
Rosa, Reinaldo Roberto; Gomes, Vitor; Araujo, Amarisio [Instituto Nacional de Pesquisas Espaciais (INPE), Sao Jose dos Campos, SP (Brazil); Clua, Esteban [Universidade Federal Fluminense (UFF), Niteroi, RJ (Brazil)
2011-07-01
Full text: Turbulent-like behaviour is an important and recent ingredient in the investigation of large-scale structure formation in the observable universe. Recently, an established statistical method was used to demonstrate the importance of considering chaotic advection (or Lagrange turbulence) in combination with gravitational instabilities in the {Lambda}-CDM simulations performed from the Virgo Consortium (VC). However, the Hubble volumes simulated from GADGET-VC algorithm have some limitations for direct Lagrangian data analysis due to the large amount of data and no real time computation for particle kinetic velocity along the dark matter structure evolution. Hence, the Lab for Computing and Applied Mathematics at INPE, Brazil, has been working for the past two years in computational environments to achieve the so-called COsmic LAgrangian TUrbulence Simulator (COLATUS) allowing N-body simulation from a Lagrangian perspective. The COLATUS prototype, as usual packages, computes gravitational forces with a hierarchical tree algorithm in combination with a local particle kinetic velocity vector in a particle-mesh scheme for long-range gravitational forces. In the present work we show preliminary simulations for 106 particles showing Lagrangian power spectra for individual particles converging to a stable power-law of S(v) {approx} v{sup 5}. The code may be run on an arbitrary number of processors, with a restriction to powers of two. COLATUS has a potential to evaluate complex kinematics of a single particle in a simulated N-body gravitational system. However, to introduce this method as a GNU software further improvements and investigations are necessary. Then, the mapping techniques for the N-body problem incorporating radiation pressure and fluid characteristics by means of smoothed particle hydrodynamics (SPH) are discussed. Finally, we focus on the all-pairs computational kernel and its future GPU implementation using the NVIDIA CUDA programming model
International Nuclear Information System (INIS)
Rosa, Reinaldo Roberto; Gomes, Vitor; Araujo, Amarisio; Clua, Esteban
2011-01-01
Full text: Turbulent-like behaviour is an important and recent ingredient in the investigation of large-scale structure formation in the observable universe. Recently, an established statistical method was used to demonstrate the importance of considering chaotic advection (or Lagrange turbulence) in combination with gravitational instabilities in the Λ-CDM simulations performed from the Virgo Consortium (VC). However, the Hubble volumes simulated from GADGET-VC algorithm have some limitations for direct Lagrangian data analysis due to the large amount of data and no real time computation for particle kinetic velocity along the dark matter structure evolution. Hence, the Lab for Computing and Applied Mathematics at INPE, Brazil, has been working for the past two years in computational environments to achieve the so-called COsmic LAgrangian TUrbulence Simulator (COLATUS) allowing N-body simulation from a Lagrangian perspective. The COLATUS prototype, as usual packages, computes gravitational forces with a hierarchical tree algorithm in combination with a local particle kinetic velocity vector in a particle-mesh scheme for long-range gravitational forces. In the present work we show preliminary simulations for 106 particles showing Lagrangian power spectra for individual particles converging to a stable power-law of S(v) ∼ v 5 . The code may be run on an arbitrary number of processors, with a restriction to powers of two. COLATUS has a potential to evaluate complex kinematics of a single particle in a simulated N-body gravitational system. However, to introduce this method as a GNU software further improvements and investigations are necessary. Then, the mapping techniques for the N-body problem incorporating radiation pressure and fluid characteristics by means of smoothed particle hydrodynamics (SPH) are discussed. Finally, we focus on the all-pairs computational kernel and its future GPU implementation using the NVIDIA CUDA programming model. (author)
Algorithms for parallel computers
International Nuclear Information System (INIS)
Churchhouse, R.F.
1985-01-01
Until relatively recently almost all the algorithms for use on computers had been designed on the (usually unstated) assumption that they were to be run on single processor, serial machines. With the introduction of vector processors, array processors and interconnected systems of mainframes, minis and micros, however, various forms of parallelism have become available. The advantage of parallelism is that it offers increased overall processing speed but it also raises some fundamental questions, including: (i) which, if any, of the existing 'serial' algorithms can be adapted for use in the parallel mode. (ii) How close to optimal can such adapted algorithms be and, where relevant, what are the convergence criteria. (iii) How can we design new algorithms specifically for parallel systems. (iv) For multi-processor systems how can we handle the software aspects of the interprocessor communications. Aspects of these questions illustrated by examples are considered in these lectures. (orig.)
Parallelism and array processing
International Nuclear Information System (INIS)
Zacharov, V.
1983-01-01
Modern computing, as well as the historical development of computing, has been dominated by sequential monoprocessing. Yet there is the alternative of parallelism, where several processes may be in concurrent execution. This alternative is discussed in a series of lectures, in which the main developments involving parallelism are considered, both from the standpoint of computing systems and that of applications that can exploit such systems. The lectures seek to discuss parallelism in a historical context, and to identify all the main aspects of concurrency in computation right up to the present time. Included will be consideration of the important question as to what use parallelism might be in the field of data processing. (orig.)
A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum
Chou, Jack C. K.
1989-01-01
The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.
International Nuclear Information System (INIS)
Grasso, M.
2009-10-01
This document is a summary of the author's research activities whose common topic is the N-body problem. The first chapter introduces the N-body issue through models based on the mean-field theory and on the Hartree-Fock-Bogoliubov equations. The second chapter presents the understanding of exotic nuclei features within the mean-field approach. Exotic phenomena like nuclear bubble structure, pairing correlations and pairing violations, giant neutron halos, non-standard terms in the Skyrme interactions are reviewed. The chapter 3 is dedicated to some extensions of the RPA (random phase approximation). For instance the computation of the shell structure far from the stability valley requires a more accurate assessment of the energy of the individual states through the introduction of a particle-vibration coupling. Different RPA extensions are described: first the self-consistent extension enlarged beyond particle-hole configurations, then the boson-mapping-based extension in a 3-level Lipkin model and also the second random-phase approximation. The chapter 4 gathers some studies concerning ultra-cold gases of trapped atoms. These systems are the only structures that allow the study of the correlations associated to superfluidity in terms of interaction intensity, temperature or system size. The mean-field approach is adequate for these studies. The last chapter draws a perspective for the mean-field-based models, their limits are assessed and ways of improvement are proposed. (A.C.)
Energy Technology Data Exchange (ETDEWEB)
Li, Shuo; Berczik, Peter; Spurzem, Rainer [National Astronomical Observatories and Key Laboratory of Computational Astrophysics, Chinese Academy of Sciences, 20A Datun Rd., Chaoyang District, Beijing 100012 (China); Liu, F. K., E-mail: lishuo@nao.cas.cn [Department of Astronomy, School of Physics, Peking University, Yiheyuan Lu 5, Haidian Qu, Beijing 100871 (China)
2017-01-10
Supermassive black hole binaries (SMBHBs) are productions of the hierarchical galaxy formation model. There are many close connections between a central SMBH and its host galaxy because the former plays very important roles on galaxy formation and evolution. For this reason, the evolution of SMBHBs in merging galaxies is a fundamental challenge. Since there are many discussions about SMBHB evolution in a gas-rich environment, we focus on the quiescent galaxy, using tidal disruption (TD) as a diagnostic tool. Our study is based on a series of numerical, large particle number, direct N -body simulations for dry major mergers. According to the simulation results, the evolution can be divided into three phases. In phase I, the TD rate for two well separated SMBHs in a merging system is similar to that for a single SMBH in an isolated galaxy. After two SMBHs approach close enough to form a bound binary in phase II, the disruption rate can be enhanced by ∼2 orders of magnitude within a short time. This “boosted” disruption stage finishes after the SMBHB evolves to a compact binary system in phase III, corresponding to a reduction in disruption rate back to a level of a few times higher than in phase I. We also discuss how to correctly extrapolate our N -body simulation results to reality, and the implications of our results to observations.
The effect of thermal velocities on structure formation in N-body simulations of warm dark matter
Leo, Matteo; Baugh, Carlton M.; Li, Baojiu; Pascoli, Silvia
2017-11-01
We investigate the impact of thermal velocities in N-body simulations of structure formation in warm dark matter models. Adopting the commonly used approach of adding thermal velocities, randomly selected from a Fermi-Dirac distribution, to the gravitationally-induced velocities of the simulation particles, we compare the matter and velocity power spectra measured from CDM and WDM simulations, in the latter case with and without thermal velocities. This prescription for adding thermal velocities introduces numerical noise into the initial conditions, which influences structure formation. At early times, the noise affects dramatically the power spectra measured from simulations with thermal velocities, with deviations of the order of ~ Script O(10) (in the matter power spectra) and of the order of ~ Script O(102) (in the velocity power spectra) compared to those extracted from simulations without thermal velocities. At late times, these effects are less pronounced with deviations of less than a few percent. Increasing the resolution of the N-body simulation shifts these discrepancies to higher wavenumbers. We also find that spurious haloes start to appear in simulations which include thermal velocities at a mass that is ~3 times larger than in simulations without thermal velocities.
Parallel magnetic resonance imaging
International Nuclear Information System (INIS)
Larkman, David J; Nunes, Rita G
2007-01-01
Parallel imaging has been the single biggest innovation in magnetic resonance imaging in the last decade. The use of multiple receiver coils to augment the time consuming Fourier encoding has reduced acquisition times significantly. This increase in speed comes at a time when other approaches to acquisition time reduction were reaching engineering and human limits. A brief summary of spatial encoding in MRI is followed by an introduction to the problem parallel imaging is designed to solve. There are a large number of parallel reconstruction algorithms; this article reviews a cross-section, SENSE, SMASH, g-SMASH and GRAPPA, selected to demonstrate the different approaches. Theoretical (the g-factor) and practical (coil design) limits to acquisition speed are reviewed. The practical implementation of parallel imaging is also discussed, in particular coil calibration. How to recognize potential failure modes and their associated artefacts are shown. Well-established applications including angiography, cardiac imaging and applications using echo planar imaging are reviewed and we discuss what makes a good application for parallel imaging. Finally, active research areas where parallel imaging is being used to improve data quality by repairing artefacted images are also reviewed. (invited topical review)
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
Massively parallel multicanonical simulations
Gross, Jonathan; Zierenberg, Johannes; Weigel, Martin; Janke, Wolfhard
2018-03-01
Generalized-ensemble Monte Carlo simulations such as the multicanonical method and similar techniques are among the most efficient approaches for simulations of systems undergoing discontinuous phase transitions or with rugged free-energy landscapes. As Markov chain methods, they are inherently serial computationally. It was demonstrated recently, however, that a combination of independent simulations that communicate weight updates at variable intervals allows for the efficient utilization of parallel computational resources for multicanonical simulations. Implementing this approach for the many-thread architecture provided by current generations of graphics processing units (GPUs), we show how it can be efficiently employed with of the order of 104 parallel walkers and beyond, thus constituting a versatile tool for Monte Carlo simulations in the era of massively parallel computing. We provide the fully documented source code for the approach applied to the paradigmatic example of the two-dimensional Ising model as starting point and reference for practitioners in the field.
SPINning parallel systems software
International Nuclear Information System (INIS)
Matlin, O.S.; Lusk, E.; McCune, W.
2002-01-01
We describe our experiences in using Spin to verify parts of the Multi Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of processes connected by Unix network sockets. MPD is dynamic processes and connections among them are created and destroyed as MPD is initialized, runs user processes, recovers from faults, and terminates. This dynamic nature is easily expressible in the Spin/Promela framework but poses performance and scalability challenges. We present here the results of expressing some of the parallel algorithms of MPD and executing both simulation and verification runs with Spin
Parallel programming with Python
Palach, Jan
2014-01-01
A fast, easy-to-follow and clear tutorial to help you develop Parallel computing systems using Python. Along with explaining the fundamentals, the book will also introduce you to slightly advanced concepts and will help you in implementing these techniques in the real world. If you are an experienced Python programmer and are willing to utilize the available computing resources by parallelizing applications in a simple way, then this book is for you. You are required to have a basic knowledge of Python development to get the most of this book.
N-body simulations for f(R) gravity using a self-adaptive particle-mesh code
Zhao, Gong-Bo; Li, Baojiu; Koyama, Kazuya
2011-02-01
We perform high-resolution N-body simulations for f(R) gravity based on a self-adaptive particle-mesh code MLAPM. The chameleon mechanism that recovers general relativity on small scales is fully taken into account by self-consistently solving the nonlinear equation for the scalar field. We independently confirm the previous simulation results, including the matter power spectrum, halo mass function, and density profiles, obtained by Oyaizu [Phys. Rev. DPRVDAQ1550-7998 78, 123524 (2008)10.1103/PhysRevD.78.123524] and Schmidt [Phys. Rev. DPRVDAQ1550-7998 79, 083518 (2009)10.1103/PhysRevD.79.083518], and extend the resolution up to k˜20h/Mpc for the measurement of the matter power spectrum. Based on our simulation results, we discuss how the chameleon mechanism affects the clustering of dark matter and halos on full nonlinear scales.
N-body simulations for f(R) gravity using a self-adaptive particle-mesh code
International Nuclear Information System (INIS)
Zhao Gongbo; Koyama, Kazuya; Li Baojiu
2011-01-01
We perform high-resolution N-body simulations for f(R) gravity based on a self-adaptive particle-mesh code MLAPM. The chameleon mechanism that recovers general relativity on small scales is fully taken into account by self-consistently solving the nonlinear equation for the scalar field. We independently confirm the previous simulation results, including the matter power spectrum, halo mass function, and density profiles, obtained by Oyaizu et al.[Phys. Rev. D 78, 123524 (2008)] and Schmidt et al.[Phys. Rev. D 79, 083518 (2009)], and extend the resolution up to k∼20 h/Mpc for the measurement of the matter power spectrum. Based on our simulation results, we discuss how the chameleon mechanism affects the clustering of dark matter and halos on full nonlinear scales.
International Nuclear Information System (INIS)
Wang, Yang Ocean; Lin, W. P.; Yu, Yu; Kang, X.; Dutton, Aaron; Macciò, Andrea V.
2014-01-01
Observations have shown that the spatial distribution of satellite galaxies is not random, but aligned with the major axes of central galaxies. This alignment is dependent on galaxy properties, such that red satellites are more strongly aligned than blue satellites. Theoretical work conducted to interpret this phenomenon has found that it is due to the non-spherical nature of dark matter halos. However, most studies overpredict the alignment signal under the assumption that the central galaxy shape follows the shape of the host halo. It is also not clear whether the color dependence of alignment is due to an assembly bias or an evolution effect. In this paper we study these problems using a cosmological N-body simulation. Subhalos are used to trace the positions of satellite galaxies. It is found that the shapes of dark matter halos are mis-aligned at different radii. If the central galaxy shares the same shape as the inner host halo, then the alignment effect is weaker and agrees with observational data. However, it predicts almost no dependence of alignment on the color of satellite galaxies, though the late accreted subhalos show stronger alignment with the outer layer of the host halo than their early accreted counterparts. We find that this is due to the limitation of pure N-body simulations where satellite galaxies without associated subhalos ('orphan galaxies') are not resolved. These orphan (mostly red) satellites often reside in the inner region of host halos and should follow the shape of the host halo in the inner region.
Expressing Parallelism with ROOT
Energy Technology Data Exchange (ETDEWEB)
Piparo, D. [CERN; Tejedor, E. [CERN; Guiraud, E. [CERN; Ganis, G. [CERN; Mato, P. [CERN; Moneta, L. [CERN; Valls Pla, X. [CERN; Canal, P. [Fermilab
2017-11-22
The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.
Expressing Parallelism with ROOT
Piparo, D.; Tejedor, E.; Guiraud, E.; Ganis, G.; Mato, P.; Moneta, L.; Valls Pla, X.; Canal, P.
2017-10-01
The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.
Parallel Fast Legendre Transform
Alves de Inda, M.; Bisseling, R.H.; Maslen, D.K.
1998-01-01
We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were
Practical parallel programming
Bauer, Barr E
2014-01-01
This is the book that will teach programmers to write faster, more efficient code for parallel processors. The reader is introduced to a vast array of procedures and paradigms on which actual coding may be based. Examples and real-life simulations using these devices are presented in C and FORTRAN.
Parallel hierarchical radiosity rendering
Energy Technology Data Exchange (ETDEWEB)
Carter, Michael [Iowa State Univ., Ames, IA (United States)
1993-07-01
In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.
Parallel universes beguile science
2007-01-01
A staple of mind-bending science fiction, the possibility of multiple universes has long intrigued hard-nosed physicists, mathematicians and cosmologists too. We may not be able -- as least not yet -- to prove they exist, many serious scientists say, but there are plenty of reasons to think that parallel dimensions are more than figments of eggheaded imagination.
Energy Technology Data Exchange (ETDEWEB)
2017-04-04
A parallelization of the k-means++ seed selection algorithm on three distinct hardware platforms: GPU, multicore CPU, and multithreaded architecture. K-means++ was developed by David Arthur and Sergei Vassilvitskii in 2007 as an extension of the k-means data clustering technique. These algorithms allow people to cluster multidimensional data, by attempting to minimize the mean distance of data points within a cluster. K-means++ improved upon traditional k-means by using a more intelligent approach to selecting the initial seeds for the clustering process. While k-means++ has become a popular alternative to traditional k-means clustering, little work has been done to parallelize this technique. We have developed original C++ code for parallelizing the algorithm on three unique hardware architectures: GPU using NVidia's CUDA/Thrust framework, multicore CPU using OpenMP, and the Cray XMT multithreaded architecture. By parallelizing the process for these platforms, we are able to perform k-means++ clustering much more quickly than it could be done before.
International Nuclear Information System (INIS)
Gardes, D.; Volkov, P.
1981-01-01
A 5x3cm 2 (timing only) and a 15x5cm 2 (timing and position) parallel plate avalanche counters (PPAC) are considered. The theory of operation and timing resolution is given. The measurement set-up and the curves of experimental results illustrate the possibilities of the two counters [fr
Parallel hierarchical global illumination
Energy Technology Data Exchange (ETDEWEB)
Snell, Quinn O. [Iowa State Univ., Ames, IA (United States)
1997-10-08
Solving the global illumination problem is equivalent to determining the intensity of every wavelength of light in all directions at every point in a given scene. The complexity of the problem has led researchers to use approximation methods for solving the problem on serial computers. Rather than using an approximation method, such as backward ray tracing or radiosity, the authors have chosen to solve the Rendering Equation by direct simulation of light transport from the light sources. This paper presents an algorithm that solves the Rendering Equation to any desired accuracy, and can be run in parallel on distributed memory or shared memory computer systems with excellent scaling properties. It appears superior in both speed and physical correctness to recent published methods involving bidirectional ray tracing or hybrid treatments of diffuse and specular surfaces. Like progressive radiosity methods, it dynamically refines the geometry decomposition where required, but does so without the excessive storage requirements for ray histories. The algorithm, called Photon, produces a scene which converges to the global illumination solution. This amounts to a huge task for a 1997-vintage serial computer, but using the power of a parallel supercomputer significantly reduces the time required to generate a solution. Currently, Photon can be run on most parallel environments from a shared memory multiprocessor to a parallel supercomputer, as well as on clusters of heterogeneous workstations.
Wald, Ingo; Ize, Santiago
2015-07-28
Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.
Ultrascalable petaflop parallel supercomputer
Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY
2010-07-20
A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.
DEFF Research Database (Denmark)
Gregersen, Frans; Josephson, Olle; Kristoffersen, Gjert
of departure that English may be used in parallel with the various local, in this case Nordic, languages. As such, the book integrates the challenge of internationalization faced by any university with the wish to improve quality in research, education and administration based on the local language......Abstract [en] More parallel, please is the result of the work of an Inter-Nordic group of experts on language policy financed by the Nordic Council of Ministers 2014-17. The book presents all that is needed to plan, practice and revise a university language policy which takes as its point......(s). There are three layers in the text: First, you may read the extremely brief version of the in total 11 recommendations for best practice. Second, you may acquaint yourself with the extended version of the recommendations and finally, you may study the reasoning behind each of them. At the end of the text, we give...
PARALLEL MOVING MECHANICAL SYSTEMS
Directory of Open Access Journals (Sweden)
Florian Ion Tiberius Petrescu
2014-09-01
Full Text Available Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4 Moving mechanical systems parallel structures are solid, fast, and accurate. Between parallel systems it is to be noticed Stewart platforms, as the oldest systems, fast, solid and precise. The work outlines a few main elements of Stewart platforms. Begin with the geometry platform, kinematic elements of it, and presented then and a few items of dynamics. Dynamic primary element on it means the determination mechanism kinetic energy of the entire Stewart platforms. It is then in a record tail cinematic mobile by a method dot matrix of rotation. If a structural mottoelement consists of two moving elements which translates relative, drive train and especially dynamic it is more convenient to represent the mottoelement as a single moving components. We have thus seven moving parts (the six motoelements or feet to which is added mobile platform 7 and one fixed.
Xyce parallel electronic simulator.
Energy Technology Data Exchange (ETDEWEB)
Keiter, Eric R; Mei, Ting; Russo, Thomas V.; Rankin, Eric Lamont; Schiek, Richard Louis; Thornquist, Heidi K.; Fixel, Deborah A.; Coffey, Todd S; Pawlowski, Roger P; Santarelli, Keith R.
2010-05-01
This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users Guide. The focus of this document is (to the extent possible) exhaustively list device parameters, solver options, parser options, and other usage details of Xyce. This document is not intended to be a tutorial. Users who are new to circuit simulation are better served by the Xyce Users Guide.
Betchov, R
2012-01-01
Stability of Parallel Flows provides information pertinent to hydrodynamical stability. This book explores the stability problems that occur in various fields, including electronics, mechanics, oceanography, administration, economics, as well as naval and aeronautical engineering. Organized into two parts encompassing 10 chapters, this book starts with an overview of the general equations of a two-dimensional incompressible flow. This text then explores the stability of a laminar boundary layer and presents the equation of the inviscid approximation. Other chapters present the general equation
Algorithmically specialized parallel computers
Snyder, Lawrence; Gannon, Dennis B
1985-01-01
Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster
International Nuclear Information System (INIS)
Tatekawa, Takayuki
2014-01-01
We study the initial conditions for cosmological N-body simulations for precision cosmology. In general, Zel'dovich approximation has been applied for the initial conditions of N-body simulations for a long time. These initial conditions provide incorrect higher-order growth. These error caused by setting up the initial conditions by perturbation theory is called transients. We investigated the impact of transient on non-Gaussianity of density field by performing cosmological N-body simulations with initial conditions based on first-, second-, and third-order Lagrangian perturbation theory in previous paper. In this paper, we evaluates the effect of the transverse mode in the third-order Lagrangian perturbation theory for several statistical quantities such as power spectrum and non-Gaussianty. Then we clarified that the effect of the transverse mode in the third-order Lagrangian perturbation theory is quite small
International Nuclear Information System (INIS)
Liu Huigen; Zhou Jilin; Wang Su
2011-01-01
During the late stage of planet formation, when Mars-sized cores appear, interactions among planetary cores can excite their orbital eccentricities, accelerate their merging, and thus sculpt their final orbital architecture. This study contributes to the final assembling of planetary systems with N-body simulations, including the type I or II migration of planets and gas accretion of massive cores in a viscous disk. Statistics on the final distributions of planetary masses, semimajor axes, and eccentricities are derived and are comparable to those of the observed systems. Our simulations predict some new orbital signatures of planetary systems around solar mass stars: 36% of the surviving planets are giant planets (>10 M + ). Most of the massive giant planets (>30 M + ) are located at 1-10 AU. Terrestrial planets are distributed more or less evenly at J in highly eccentric orbits (e > 0.3-0.4). The average eccentricity (∼0.15) of the giant planets (>10 M + ) is greater than that (∼0.05) of the terrestrial planets ( + ). A planetary system with more planets tends to have smaller planet masses and orbital eccentricities on average.
Dissipative N-body simulations of the formation of single galaxies in a cold dark-matter cosmology
International Nuclear Information System (INIS)
Ewell, M.W. Jr.
1988-01-01
The details of an N-body code designed specifically to study the collapse of a single protogalaxy are presented. This code uses a spherical harmonic expansion to model the gravity and a sticky-particle algorithm to model the gas physics. It includes external tides and cosmologically realistic boundary conditions. The results of twelve simulations using this code are given. The initial conditions for these runs use mean-density profiles and r.m.s. quadrupoles and tides taken from the CDM power spectrum. The simulations start when the center of the perturbation first goes nonlinear, and continue until a redshift Z ∼ 1-2. The resulting rotation curves are approximately flat out to 100 kpc, but do show some structure. The circular velocity is 200 km/sec around a 3σ peak. The final systems have λ approx-equal .03. The angular momentum per unit mass of the baryons implies disk scale lengths of 1-3 kpc. The tidal forces are strong enough to profoundly influence the collapse geometry. In particular, the usual assumption, that tidal torques produce a system approximately in solid-body rotation, is shown to be seriously in error
International Nuclear Information System (INIS)
Kopeikin, Sergei; Vlasov, Igor
2004-01-01
Post-Newtonian relativistic theory of astronomical reference frames based on Einstein's general theory of relativity was adopted by General Assembly of the International Astronomical Union in 2000. This theory is extended in the present paper by taking into account all relativistic effects caused by the presumable existence of a scalar field and parametrized by two parameters, β and γ, of the parametrized post-Newtonian (PPN) formalism. We use a general class of the scalar-tensor (Brans-Dicke type) theories of gravitation to work out PPN concepts of global and local reference frames for an astronomical N-body system. The global reference frame is a standard PPN coordinate system. A local reference frame is constructed in the vicinity of a weakly self-gravitating body (a sub-system of the bodies) that is a member of the astronomical N-body system. Such local inertial frame is required for unambiguous derivation of the equations of motion of the body in the field of other members of the N-body system and for construction of adequate algorithms for data analysis of various gravitational experiments conducted in ground-based laboratories and/or on board of spacecrafts in the solar system.We assume that the bodies comprising the N-body system have weak gravitational field and move slowly. At the same time we do not impose any specific limitations on the distribution of density, velocity and the equation of state of the body's matter. Scalar-tensor equations of the gravitational field are solved by making use of the post-Newtonian approximations so that the metric tensor and the scalar field are obtained as functions of the global and local coordinates. A correspondence between the local and global coordinate frames is found by making use of asymptotic expansion matching technique. This technique allows us to find a class of the post-Newtonian coordinate transformations between the frames as well as equations of translational motion of the origin of the local frame
Energy Technology Data Exchange (ETDEWEB)
Luo, Wen, E-mail: wenluo-ok@163.com [School of Nuclear Science and Technology, University of South China, Hengyang 421001 (China); Lan, Hao-yang [School of Nuclear Science and Technology, University of South China, Hengyang 421001 (China); Xu, Yi; Balabanski, Dimiter L. [Extreme Light Infrastructure-Nuclear Physics, “Horia Hulubei” National Institute for Physics and Nuclear Engineering (IFIN-HH), 30 Reactorului, 077125 Bucharest-Magurele (Romania)
2017-03-21
A data-based Monte Carlo simulation algorithm, Geant4-GENBOD, was developed by coupling the n-body Monte-Carlo event generator to the Geant4 toolkit, aiming at accurate simulations of specific photonuclear reactions for diverse photonuclear physics studies. Good comparisons of Geant4-GENBOD calculations with reported measurements of photo-neutron production cross-sections and yields, and with reported energy spectra of the {sup 6}Li(n,α)t reaction were performed. Good agreements between the calculations and experimental data were found and the validation of the developed program was verified consequently. Furthermore, simulations for the {sup 92}Mo(γ,p) reaction of astrophysics relevance and photo-neutron production of {sup 99}Mo/{sup 99m}Tc and {sup 225}Ra/{sup 225}Ac radioisotopes were investigated, which demonstrate the applicability of this program. We conclude that the Geant4-GENBOD is a reliable tool for study of the emerging experiment programs at high-intensity γ-beam laboratories, such as the Extreme Light Infrastructure – Nuclear Physics facility and the High Intensity Gamma-Ray Source at Duke University.
Resistor Combinations for Parallel Circuits.
McTernan, James P.
1978-01-01
To help simplify both teaching and learning of parallel circuits, a high school electricity/electronics teacher presents and illustrates the use of tables of values for parallel resistive circuits in which total resistances are whole numbers. (MF)
SOFTWARE FOR DESIGNING PARALLEL APPLICATIONS
Directory of Open Access Journals (Sweden)
M. K. Bouza
2017-01-01
Full Text Available The object of research is the tools to support the development of parallel programs in C/C ++. The methods and software which automates the process of designing parallel applications are proposed.
Parallel External Memory Graph Algorithms
DEFF Research Database (Denmark)
Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari
2010-01-01
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of Â¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....
Parallel inter channel interaction mechanisms
International Nuclear Information System (INIS)
Jovic, V.; Afgan, N.; Jovic, L.
1995-01-01
Parallel channels interactions are examined. For experimental researches of nonstationary regimes flow in three parallel vertical channels results of phenomenon analysis and mechanisms of parallel channel interaction for adiabatic condition of one-phase fluid and two-phase mixture flow are shown. (author)
International Nuclear Information System (INIS)
Soltz, R; Vranas, P; Blumrich, M; Chen, D; Gara, A; Giampap, M; Heidelberger, P; Salapura, V; Sexton, J; Bhanot, G
2007-01-01
The theory of the strong nuclear force, Quantum Chromodynamics (QCD), can be numerically simulated from first principles on massively-parallel supercomputers using the method of Lattice Gauge Theory. We describe the special programming requirements of lattice QCD (LQCD) as well as the optimal supercomputer hardware architectures that it suggests. We demonstrate these methods on the BlueGene massively-parallel supercomputer and argue that LQCD and the BlueGene architecture are a natural match. This can be traced to the simple fact that LQCD is a regular lattice discretization of space into lattice sites while the BlueGene supercomputer is a discretization of space into compute nodes, and that both are constrained by requirements of locality. This simple relation is both technologically important and theoretically intriguing. The main result of this paper is the speedup of LQCD using up to 131,072 CPUs on the largest BlueGene/L supercomputer. The speedup is perfect with sustained performance of about 20% of peak. This corresponds to a maximum of 70.5 sustained TFlop/s. At these speeds LQCD and BlueGene are poised to produce the next generation of strong interaction physics theoretical results
A Parallel Butterfly Algorithm
Poulson, Jack; Demanet, Laurent; Maxwell, Nicholas; Ying, Lexing
2014-01-01
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
A Parallel Butterfly Algorithm
Poulson, Jack
2014-02-04
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
Fast parallel event reconstruction
CERN. Geneva
2010-01-01
On-line processing of large data volumes produced in modern HEP experiments requires using maximum capabilities of modern and future many-core CPU and GPU architectures.One of such powerful feature is a SIMD instruction set, which allows packing several data items in one register and to operate on all of them, thus achievingmore operations per clock cycle. Motivated by the idea of using the SIMD unit ofmodern processors, the KF based track fit has been adapted for parallelism, including memory optimization, numerical analysis, vectorization with inline operator overloading, and optimization using SDKs. The speed of the algorithm has been increased in 120000 times with 0.1 ms/track, running in parallel on 16 SPEs of a Cell Blade computer. Running on a Nehalem CPU with 8 cores it shows the processing speed of 52 ns/track using the Intel Threading Building Blocks. The same KF algorithm running on an Nvidia GTX 280 in the CUDA frameworkprovi...
International Nuclear Information System (INIS)
Massobrio, C.; Pontikis, V.; Martin, G.
1989-01-01
We present the first molecular-dynamics study of the amorphization of a crystalline alloy (NiZr 2 ) induced by chemical disorder. We used a n-body potential in conjunction with isobaric-isothermal molecular dynamics. The behavior of the pair distribution function suggests that the instability leading to the amorphous state is a first-order phase transformation
Gross, D. H. E.
1997-01-01
This review is addressed to colleagues working in different fields of physics who are interested in the concepts of microcanonical thermodynamics, its relation and contrast to ordinary, canonical or grandcanonical thermodynamics, and to get a first taste of the wide area of new applications of thermodynamical concepts like hot nuclei, hot atomic clusters and gravitating systems. Microcanonical thermodynamics describes how the volume of the N-body phase space depends on the globally conserved quantities like energy, angular momentum, mass, charge, etc. Due to these constraints the microcanonical ensemble can behave quite differently from the conventional, canonical or grandcanonical ensemble in many important physical systems. Microcanonical systems become inhomogeneous at first-order phase transitions, or with rising energy, or with external or internal long-range forces like Coulomb, centrifugal or gravitational forces. Thus, fragmentation of the system into a spatially inhomogeneous distribution of various regions of different densities and/or of different phases is a genuine characteristic of the microcanonical ensemble. In these cases which are realized by the majority of realistic systems in nature, the microcanonical approach is the natural statistical description. We investigate this most fundamental form of thermodynamics in four different nontrivial physical cases: (I) Microcanonical phase transitions of first and second order are studied within the Potts model. The total energy per particle is a nonfluctuating order parameter which controls the phase which the system is in. In contrast to the canonical form the microcanonical ensemble allows to tune the system continuously from one phase to the other through the region of coexisting phases by changing the energy smoothly. The configurations of coexisting phases carry important informations about the nature of the phase transition. This is more remarkable as the canonical ensemble is blind against these
International Nuclear Information System (INIS)
Giannantonio, Tommaso; Porciani, Cristiano
2010-01-01
We study structure formation in the presence of primordial non-Gaussianity of the local type with parameters f NL and g NL . We show that the distribution of dark-matter halos is naturally described by a multivariate bias scheme where the halo overdensity depends not only on the underlying matter density fluctuation δ but also on the Gaussian part of the primordial gravitational potential φ. This corresponds to a non-local bias scheme in terms of δ only. We derive the coefficients of the bias expansion as a function of the halo mass by applying the peak-background split to common parametrizations for the halo mass function in the non-Gaussian scenario. We then compute the halo power spectrum and halo-matter cross spectrum in the framework of Eulerian perturbation theory up to third order. Comparing our results against N-body simulations, we find that our model accurately describes the numerical data for wave numbers k≤0.1-0.3h Mpc -1 depending on redshift and halo mass. In our multivariate approach, perturbations in the halo counts trace φ on large scales, and this explains why the halo and matter power spectra show different asymptotic trends for k→0. This strongly scale-dependent bias originates from terms at leading order in our expansion. This is different from what happens using the standard univariate local bias where the scale-dependent terms come from badly behaved higher-order corrections. On the other hand, our biasing scheme reduces to the usual local bias on smaller scales, where |φ| is typically much smaller than the density perturbations. We finally discuss the halo bispectrum in the context of multivariate biasing and show that, due to its strong scale and shape dependence, it is a powerful tool for the detection of primordial non-Gaussianity from future galaxy surveys.
International Nuclear Information System (INIS)
Orban, Chris
2013-01-01
In setting up initial conditions for ensembles of cosmological N-body simulations there are, fundamentally, two choices: either maximizing the correspondence of the initial density field to the assumed fourier-space clustering or, instead, matching to real-space statistics and allowing the DC mode (i.e. overdensity) to vary from box to box as it would in the real universe. As a stringent test of both approaches, I perform ensembles of simulations using power law and a ''powerlaw times a bump'' model inspired by baryon acoustic oscillations (BAO), exploiting the self-similarity of these initial conditions to quantify the accuracy of the matter-matter two-point correlation results. The real-space method, which was originally proposed by Pen 1997 [1] and implemented by Sirko 2005 [2], performed well in producing the expected self-similar behavior and corroborated the non-linear evolution of the BAO feature observed in conventional simulations, even in the strongly-clustered regime (σ 8 ∼>1). In revisiting the real-space method championed by [2], it was also noticed that this earlier study overlooked an important integral constraint correction to the correlation function in results from the conventional approach that can be important in ΛCDM simulations with L box ∼ −1 Gpc and on scales r∼>L box /10. Rectifying this issue shows that the fourier space and real space methods are about equally accurate and efficient for modeling the evolution and growth of the correlation function, contrary to previous claims. An appendix provides a useful independent-of-epoch analytic formula for estimating the importance of the integral constraint bias on correlation function measurements in ΛCDM simulations
Comparing Results of SPH/N-body Impact Simulations Using Both Solid and Rubble-pile Target Asteroids
Durda, Daniel D.; Bottke, W. F.; Enke, B. L.; Nesvorný, D.; Asphaug, E.; Richardson, D. C.
2006-09-01
We have been investigating the properties of satellites and the morphology of size-frequency distributions (SFDs) resulting from a suite of 160 SPH/N-body simulations of impacts into 100-km diameter parent asteroids (Durda et al. 2004, Icarus 170, 243-257; Durda et al. 2006, Icarus, in press). These simulations have produced many valuable insights into the outcomes of cratering and disruptive impacts but were limited to monolithic basalt targets. As a natural consequence of collisional evolution, however, many asteroids have undergone a series of battering impacts that likely have left their interiors substantially fractured, if not completely rubblized. In light of this, we have re-mapped the matrix of simulations using rubble-pile target objects. We constructed the rubble-pile targets by filling the interior of the 100-km diameter spherical shell (the target envelope) with randomly sized solid spheres in mutual contact. We then assigned full damage (which reduces tensile and shear stresses to zero) to SPH particles in the contacts between the components; the remaining volume is void space. The internal spherical components have a power-law distribution of sizes simulating fragments of a pre-shattered parent object. First-look analysis of the rubble-pile results indicate some general similarities to the simulations with the monolithic targets (e.g., similar trends in the number of small, gravitationally bound satellite systems as a function of impact conditions) and some significant differences (e.g., size of largest remnants and smaller debris affecting size frequency distributions of resulting families). We will report details of a more thorough analysis and the implications for collisional models of the main asteroid belt. This work is supported by the National Science Foundation, grant number AST0407045.
Simulating the formation and evolution of galaxies with EvoL, the Padova N-body Tree-SPH code
International Nuclear Information System (INIS)
Merlin, E.; Chiosi, C.; Grassi, T.; Buonomo, U.; Chinellato, S.
2009-01-01
The importance of numerical simulations in astrophysics is constantly growing, because of the complexity, the multi-scaling properties and the non-linearity of many physical phenomena. In particular, cosmological and galaxy-sized simulations of structure formation have cast light on different aspects, giving answers to many questions, but raising a number of new issues to be investigated. Over the last decade, great effort has been devoted in Padova to develop a tool explicitly designed to study the problem of galaxy formation and evolution, with particular attention to the early-type ones. To this aim, many simulations have been run on CINECA supercomputers (see publications list below). The next step is the new release of EvoL, a Fortran N-body code capable to follow in great detail many different aspects of stellar, interstellar and cosmological physics. In particular, special care has been paid to the properties of stars and their interplay with the surrounding interstellar medium (ISM), as well as to the multiphase nature of the ISM, to the setting of the initial and boundary conditions, and to the correct description of gas physics via modern formulations of the classical Smoothed Particle Hydrodynamics algorithms. Moreover, a powerful tool to compare numerical predictions with observables has been developed, self-consistently closing the whole package. A library of new simulations, run with EvoL on CINECA supercomputers, is to be built in the next years, while new physics, including magnetic properties of matter and more exotic energy feedback effects, is to be added.
COUNTS-IN-CYLINDERS IN THE SLOAN DIGITAL SKY SURVEY WITH COMPARISONS TO N-BODY SIMULATIONS
International Nuclear Information System (INIS)
Berrier, Heather D.; Barton, Elizabeth J.; Bullock, James S.; Berrier, Joel C.; Zentner, Andrew R.; Wechsler, Risa H.
2011-01-01
Environmental statistics provide a necessary means of comparing the properties of galaxies in different environments, and a vital test of models of galaxy formation within the prevailing hierarchical cosmological model. We explore counts-in-cylinders, a common statistic defined as the number of companions of a particular galaxy found within a given projected radius and redshift interval. Galaxy distributions with the same two-point correlation functions do not necessarily have the same companion count distributions. We use this statistic to examine the environments of galaxies in the Sloan Digital Sky Survey Data Release 4 (SDSS DR4). We also make preliminary comparisons to four models for the spatial distributions of galaxies, based on N-body simulations and data from SDSS DR4, to study the utility of the counts-in-cylinders statistic. There is a very large scatter between the number of companions a galaxy has and the mass of its parent dark matter halo and the halo occupation, limiting the utility of this statistic for certain kinds of environmental studies. We also show that prevalent empirical models of galaxy clustering, that match observed two- and three-point clustering statistics well, fail to reproduce some aspects of the observed distribution of counts-in-cylinders on 1, 3, and 6 h -1 Mpc scales. All models that we explore underpredict the fraction of galaxies with few or no companions in 3 and 6 h -1 Mpc cylinders. Roughly 7% of galaxies in the real universe are significantly more isolated within a 6 h -1 Mpc cylinder than the galaxies in any of the models we use. Simple phenomenological models that map galaxies to dark matter halos fail to reproduce high-order clustering statistics in low-density environments.
Tello-Ortiz, F.; Velazquez, L.
2016-10-01
This work is devoted to the thermodynamics of gravitational clustering, a collective phenomenon with a great relevance in the N-body cosmological problem. We study a classical self-gravitating gas of identical non-relativistic particles defined on the sphere {{{S}}3}\\subset {{{R}}4} by considering gravitational interaction that corresponds to this geometric space. The analysis is performed within microcanonical description of an isolated Hamiltonian system by combining continuum approximation and the steepest descend method. According to numerical solution of resulting equations, the gravitational clustering can be associated with two microcanonical phase transitions. A first phase transition with a continuous character is associated with breakdown of SO(4) symmetry of this model. The second one is the gravitational collapse, whose continuous or discontinuous character crucially depends on the regularization of short-range divergence of gravitation potential. We also derive the thermodynamic limit of this model system, the astrophysical counterpart of the Gibbs-Duhem relation, the order parameters that characterize its phase transitions and the equation of state. Other interesting behavior is the existence of states with negative heat capacities, which appear when the effects of gravitation turn dominant for energies sufficiently low. Finally, we comment on the relevance of some of these results in the study of astrophysical and cosmological situations. Special interest deserves the gravitational modification of the equation of state due to the local inhomogeneities of matter distribution. Although this feature is systematically neglected in studies about universe expansion, the same one is able to mimic an effect that is attributed to the dark energy: a negative pressure.
International Nuclear Information System (INIS)
DeHart, Mark D.; Williams, Mark L.; Bowman, Stephen M.
2010-01-01
The SCALE computational architecture has remained basically the same since its inception 30 years ago, although constituent modules and capabilities have changed significantly. This SCALE concept was intended to provide a framework whereby independent codes can be linked to provide a more comprehensive capability than possible with the individual programs - allowing flexibility to address a wide variety of applications. However, the current system was designed originally for mainframe computers with a single CPU and with significantly less memory than today's personal computers. It has been recognized that the present SCALE computation system could be restructured to take advantage of modern hardware and software capabilities, while retaining many of the modular features of the present system. Preliminary work is being done to define specifications and capabilities for a more advanced computational architecture. This paper describes the state of current SCALE development activities and plans for future development. With the release of SCALE 6.1 in 2010, a new phase of evolutionary development will be available to SCALE users within the TRITON and NEWT modules. The SCALE (Standardized Computer Analyses for Licensing Evaluation) code system developed by Oak Ridge National Laboratory (ORNL) provides a comprehensive and integrated package of codes and nuclear data for a wide range of applications in criticality safety, reactor physics, shielding, isotopic depletion and decay, and sensitivity/uncertainty (S/U) analysis. Over the last three years, since the release of version 5.1 in 2006, several important new codes have been introduced within SCALE, and significant advances applied to existing codes. Many of these new features became available with the release of SCALE 6.0 in early 2009. However, beginning with SCALE 6.1, a first generation of parallel computing is being introduced. In addition to near-term improvements, a plan for longer term SCALE enhancement
International Nuclear Information System (INIS)
Kersten, P; Krasil'shchik, I; Verbovetsky, A
2004-01-01
Using methods of Kersten et al (2004 J. Geom. Phys. 50 273-302) and Krasil'shchik and Kersten (2000 Symmetries and Recursion Operators for Classical and Supersymmetric Differential Equations (Dordrecht: Kluwer)), we accomplish an extensive study of the N = 1 supersymmetric Korteweg-de Vries (KdV) equation. The results include a description of local and nonlocal Hamiltonian and symplectic structures, five hierarchies of symmetries, the corresponding hierarchies of conservation laws, recursion operators for symmetries and generating functions of conservation laws. We stress that the main point of the paper is not just the results on super-KdV equation itself, but merely exposition of the efficiency of the geometrical approach and of the computational algorithms based on it
Parallel Polarization State Generation.
She, Alan; Capasso, Federico
2016-05-17
The control of polarization, an essential property of light, is of wide scientific and technological interest. The general problem of generating arbitrary time-varying states of polarization (SOP) has always been mathematically formulated by a series of linear transformations, i.e. a product of matrices, imposing a serial architecture. Here we show a parallel architecture described by a sum of matrices. The theory is experimentally demonstrated by modulating spatially-separated polarization components of a laser using a digital micromirror device that are subsequently beam combined. This method greatly expands the parameter space for engineering devices that control polarization. Consequently, performance characteristics, such as speed, stability, and spectral range, are entirely dictated by the technologies of optical intensity modulation, including absorption, reflection, emission, and scattering. This opens up important prospects for polarization state generation (PSG) with unique performance characteristics with applications in spectroscopic ellipsometry, spectropolarimetry, communications, imaging, and security.
Parallel imaging microfluidic cytometer.
Ehrlich, Daniel J; McKenna, Brian K; Evans, James G; Belkina, Anna C; Denis, Gerald V; Sherr, David H; Cheung, Man Ching
2011-01-01
By adding an additional degree of freedom from multichannel flow, the parallel microfluidic cytometer (PMC) combines some of the best features of fluorescence-activated flow cytometry (FCM) and microscope-based high-content screening (HCS). The PMC (i) lends itself to fast processing of large numbers of samples, (ii) adds a 1D imaging capability for intracellular localization assays (HCS), (iii) has a high rare-cell sensitivity, and (iv) has an unusual capability for time-synchronized sampling. An inability to practically handle large sample numbers has restricted applications of conventional flow cytometers and microscopes in combinatorial cell assays, network biology, and drug discovery. The PMC promises to relieve a bottleneck in these previously constrained applications. The PMC may also be a powerful tool for finding rare primary cells in the clinic. The multichannel architecture of current PMC prototypes allows 384 unique samples for a cell-based screen to be read out in ∼6-10 min, about 30 times the speed of most current FCM systems. In 1D intracellular imaging, the PMC can obtain protein localization using HCS marker strategies at many times for the sample throughput of charge-coupled device (CCD)-based microscopes or CCD-based single-channel flow cytometers. The PMC also permits the signal integration time to be varied over a larger range than is practical in conventional flow cytometers. The signal-to-noise advantages are useful, for example, in counting rare positive cells in the most difficult early stages of genome-wide screening. We review the status of parallel microfluidic cytometry and discuss some of the directions the new technology may take. Copyright © 2011 Elsevier Inc. All rights reserved.
About Parallel Programming: Paradigms, Parallel Execution and Collaborative Systems
Directory of Open Access Journals (Sweden)
Loredana MOCEAN
2009-01-01
Full Text Available In the last years, there were made efforts for delineation of a stabile and unitary frame, where the problems of logical parallel processing must find solutions at least at the level of imperative languages. The results obtained by now are not at the level of the made efforts. This paper wants to be a little contribution at these efforts. We propose an overview in parallel programming, parallel execution and collaborative systems.
Parallel Framework for Cooperative Processes
Directory of Open Access Journals (Sweden)
Mitică Craus
2005-01-01
Full Text Available This paper describes the work of an object oriented framework designed to be used in the parallelization of a set of related algorithms. The idea behind the system we are describing is to have a re-usable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. Two applications are presented: an Ant Colony Optimization (ACO parallel algorithm for the Travelling Salesman Problem (TSP and an Image Processing (IP parallel algorithm for the Symmetrical Neighborhood Filter (SNF. The implementations of these applications by means of the parallel framework prove to have good performances: approximatively linear speedup and low communication cost.
International Nuclear Information System (INIS)
Asanov, G.S.
1979-01-01
It is shown the description of gravitational field in the riemannian space-time by means of the absolute parallelism structure makes it possible to formulate an integrable covariant law of energy-momentum conservation for gravitational field, by imposing on the energy-momentum tensor the condition of vanishing of the covariant divergence (in the sense of the absolute parallelism). As a result of taking into account covariant constraints for the tetrads of the absolute parallelism, the Lagrangian density turns out to be not geometrised anymore and leads to the unambiguous conservation law of the type mentioned in the N-body problem. Covariant field equations imply the existence of the special euclidean coordinates outside of static neighbourhoods of gravitationing bodies. In these coordinates determined by the tetrads of the absolute parallelism, the linear approximation is not connected with any noncovariant assumptions
Parallel Monte Carlo reactor neutronics
International Nuclear Information System (INIS)
Blomquist, R.N.; Brown, F.B.
1994-01-01
The issues affecting implementation of parallel algorithms for large-scale engineering Monte Carlo neutron transport simulations are discussed. For nuclear reactor calculations, these include load balancing, recoding effort, reproducibility, domain decomposition techniques, I/O minimization, and strategies for different parallel architectures. Two codes were parallelized and tested for performance. The architectures employed include SIMD, MIMD-distributed memory, and workstation network with uneven interactive load. Speedups linear with the number of nodes were achieved
DEFF Research Database (Denmark)
Kosbar, Tamer R.; Sofan, Mamdouh A.; Waly, Mohamed A.
2015-01-01
about 6.1 °C when the TFO strand was modified with Z and the Watson-Crick strand with adenine-LNA (AL). The molecular modeling results showed that, in case of nucleobases Y and Z a hydrogen bond (1.69 and 1.72 Å, respectively) was formed between the protonated 3-aminopropyn-1-yl chain and one...... of the phosphate groups in Watson-Crick strand. Also, it was shown that the nucleobase Y made a good stacking and binding with the other nucleobases in the TFO and Watson-Crick duplex, respectively. In contrast, the nucleobase Z with LNA moiety was forced to twist out of plane of Watson-Crick base pair which......The phosphoramidites of DNA monomers of 7-(3-aminopropyn-1-yl)-8-aza-7-deazaadenine (Y) and 7-(3-aminopropyn-1-yl)-8-aza-7-deazaadenine LNA (Z) are synthesized, and the thermal stability at pH 7.2 and 8.2 of anti-parallel triplexes modified with these two monomers is determined. When, the anti...
Parallel consensual neural networks.
Benediktsson, J A; Sveinsson, J R; Ersoy, O K; Swain, P H
1997-01-01
A new type of a neural-network architecture, the parallel consensual neural network (PCNN), is introduced and applied in classification/data fusion of multisource remote sensing and geographic data. The PCNN architecture is based on statistical consensus theory and involves using stage neural networks with transformed input data. The input data are transformed several times and the different transformed data are used as if they were independent inputs. The independent inputs are first classified using the stage neural networks. The output responses from the stage networks are then weighted and combined to make a consensual decision. In this paper, optimization methods are used in order to weight the outputs from the stage networks. Two approaches are proposed to compute the data transforms for the PCNN, one for binary data and another for analog data. The analog approach uses wavelet packets. The experimental results obtained with the proposed approach show that the PCNN outperforms both a conjugate-gradient backpropagation neural network and conventional statistical methods in terms of overall classification accuracy of test data.
A Parallel Particle Swarm Optimizer
National Research Council Canada - National Science Library
Schutte, J. F; Fregly, B .J; Haftka, R. T; George, A. D
2003-01-01
.... Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm...
Patterns for Parallel Software Design
Ortega-Arjona, Jorge Luis
2010-01-01
Essential reading to understand patterns for parallel programming Software patterns have revolutionized the way we think about how software is designed, built, and documented, and the design of parallel software requires you to consider other particular design aspects and special skills. From clusters to supercomputers, success heavily depends on the design skills of software developers. Patterns for Parallel Software Design presents a pattern-oriented software architecture approach to parallel software design. This approach is not a design method in the classic sense, but a new way of managin
DEFF Research Database (Denmark)
Christensen, Mark Schram; Ehrsson, H Henrik; Nielsen, Jens Bo
2013-01-01
a different network, involving bilateral dorsal premotor cortex (PMd), primary motor cortex, and SMA, was more active when subjects viewed parallel movements while performing either symmetrical or parallel movements. Correlations between behavioral instability and brain activity were present in right lateral...... adduction-abduction movements symmetrically or in parallel with real-time congruent or incongruent visual feedback of the movements. One network, consisting of bilateral superior and middle frontal gyrus and supplementary motor area (SMA), was more active when subjects performed parallel movements, whereas...
Energy Technology Data Exchange (ETDEWEB)
Briscese, Fabio [Northumbria University, Department of Mathematics, Physics and Electrical Engineering, Newcastle upon Tyne (United Kingdom); Citta Universitaria, Istituto Nazionale di Alta Matematica Francesco Severi, Gruppo Nazionale di Fisica Matematica, Rome (Italy)
2017-09-15
In this paper it is argued how the dynamics of the classical Newtonian N-body system can be described in terms of the Schroedinger-Poisson equations in the large N limit. This result is based on the stochastic quantization introduced by Nelson, and on the Calogero conjecture. According to the Calogero conjecture, the emerging effective Planck constant is computed in terms of the parameters of the N-body system as ℎ ∝ M{sup 5/3}G{sup 1/2}(N/ left angle ρ right angle){sup 1/6}, where is G the gravitational constant, N and M are the number and the mass of the bodies, and left angle ρ right angle is their average density. The relevance of this result in the context of large scale structure formation is discussed. In particular, this finding gives a further argument in support of the validity of the Schroedinger method as numerical double of the N-body simulations of dark matter dynamics at large cosmological scales. (orig.)
PARALLEL IMPORT: REALITY FOR RUSSIA
Directory of Open Access Journals (Sweden)
Т. А. Сухопарова
2014-01-01
Full Text Available Problem of parallel import is urgent question at now. Parallel import legalization in Russia is expedient. Such statement based on opposite experts opinion analysis. At the same time it’s necessary to negative consequences consider of this decision and to apply remedies to its minimization.Purchase on Elibrary.ru > Buy now
The Galley Parallel File System
Nieuwejaar, Nils; Kotz, David
1996-01-01
Most current multiprocessor file systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/0 requirements of parallel scientific applications. Many multiprocessor file systems provide applications with a conventional Unix-like interface, allowing the application to access multiple disks transparently. This interface conceals the parallelism within the file system, increasing the ease of programmability, but making it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. In addition to providing an insufficient interface, most current multiprocessor file systems are optimized for a different workload than they are being asked to support. We introduce Galley, a new parallel file system that is intended to efficiently support realistic scientific multiprocessor workloads. We discuss Galley's file structure and application interface, as well as the performance advantages offered by that interface.
Parallelization of the FLAPW method
International Nuclear Information System (INIS)
Canning, A.; Mannstadt, W.; Freeman, A.J.
1999-01-01
The FLAPW (full-potential linearized-augmented plane-wave) method is one of the most accurate first-principles methods for determining electronic and magnetic properties of crystals and surfaces. Until the present work, the FLAPW method has been limited to systems of less than about one hundred atoms due to a lack of an efficient parallel implementation to exploit the power and memory of parallel computers. In this work we present an efficient parallelization of the method by division among the processors of the plane-wave components for each state. The code is also optimized for RISC (reduced instruction set computer) architectures, such as those found on most parallel computers, making full use of BLAS (basic linear algebra subprograms) wherever possible. Scaling results are presented for systems of up to 686 silicon atoms and 343 palladium atoms per unit cell, running on up to 512 processors on a CRAY T3E parallel computer
Parallelization of the FLAPW method
Canning, A.; Mannstadt, W.; Freeman, A. J.
2000-08-01
The FLAPW (full-potential linearized-augmented plane-wave) method is one of the most accurate first-principles methods for determining structural, electronic and magnetic properties of crystals and surfaces. Until the present work, the FLAPW method has been limited to systems of less than about a hundred atoms due to the lack of an efficient parallel implementation to exploit the power and memory of parallel computers. In this work, we present an efficient parallelization of the method by division among the processors of the plane-wave components for each state. The code is also optimized for RISC (reduced instruction set computer) architectures, such as those found on most parallel computers, making full use of BLAS (basic linear algebra subprograms) wherever possible. Scaling results are presented for systems of up to 686 silicon atoms and 343 palladium atoms per unit cell, running on up to 512 processors on a CRAY T3E parallel supercomputer.
Is Monte Carlo embarrassingly parallel?
Energy Technology Data Exchange (ETDEWEB)
Hoogenboom, J. E. [Delft Univ. of Technology, Mekelweg 15, 2629 JB Delft (Netherlands); Delft Nuclear Consultancy, IJsselzoom 2, 2902 LB Capelle aan den IJssel (Netherlands)
2012-07-01
Monte Carlo is often stated as being embarrassingly parallel. However, running a Monte Carlo calculation, especially a reactor criticality calculation, in parallel using tens of processors shows a serious limitation in speedup and the execution time may even increase beyond a certain number of processors. In this paper the main causes of the loss of efficiency when using many processors are analyzed using a simple Monte Carlo program for criticality. The basic mechanism for parallel execution is MPI. One of the bottlenecks turn out to be the rendez-vous points in the parallel calculation used for synchronization and exchange of data between processors. This happens at least at the end of each cycle for fission source generation in order to collect the full fission source distribution for the next cycle and to estimate the effective multiplication factor, which is not only part of the requested results, but also input to the next cycle for population control. Basic improvements to overcome this limitation are suggested and tested. Also other time losses in the parallel calculation are identified. Moreover, the threading mechanism, which allows the parallel execution of tasks based on shared memory using OpenMP, is analyzed in detail. Recommendations are given to get the maximum efficiency out of a parallel Monte Carlo calculation. (authors)
Is Monte Carlo embarrassingly parallel?
International Nuclear Information System (INIS)
Hoogenboom, J. E.
2012-01-01
Monte Carlo is often stated as being embarrassingly parallel. However, running a Monte Carlo calculation, especially a reactor criticality calculation, in parallel using tens of processors shows a serious limitation in speedup and the execution time may even increase beyond a certain number of processors. In this paper the main causes of the loss of efficiency when using many processors are analyzed using a simple Monte Carlo program for criticality. The basic mechanism for parallel execution is MPI. One of the bottlenecks turn out to be the rendez-vous points in the parallel calculation used for synchronization and exchange of data between processors. This happens at least at the end of each cycle for fission source generation in order to collect the full fission source distribution for the next cycle and to estimate the effective multiplication factor, which is not only part of the requested results, but also input to the next cycle for population control. Basic improvements to overcome this limitation are suggested and tested. Also other time losses in the parallel calculation are identified. Moreover, the threading mechanism, which allows the parallel execution of tasks based on shared memory using OpenMP, is analyzed in detail. Recommendations are given to get the maximum efficiency out of a parallel Monte Carlo calculation. (authors)
Parallel integer sorting with medium and fine-scale parallelism
Dagum, Leonardo
1993-01-01
Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.
Template based parallel checkpointing in a massively parallel computer system
Archer, Charles Jens [Rochester, MN; Inglett, Todd Alan [Rochester, MN
2009-01-13
A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.
Parallel education: what is it?
Amos, Michelle Peta
2017-01-01
In the history of education it has long been discussed that single-sex and coeducation are the two models of education present in schools. With the introduction of parallel schools over the last 15 years, there has been very little research into this 'new model'. Many people do not understand what it means for a school to be parallel or they confuse a parallel model with co-education, due to the presence of both boys and girls within the one institution. Therefore, the main obj...
Balanced, parallel operation of flashlamps
International Nuclear Information System (INIS)
Carder, B.M.; Merritt, B.T.
1979-01-01
A new energy store, the Compensated Pulsed Alternator (CPA), promises to be a cost effective substitute for capacitors to drive flashlamps that pump large Nd:glass lasers. Because the CPA is large and discrete, it will be necessary that it drive many parallel flashlamp circuits, presenting a problem in equal current distribution. Current division to +- 20% between parallel flashlamps has been achieved, but this is marginal for laser pumping. A method is presented here that provides equal current sharing to about 1%, and it includes fused protection against short circuit faults. The method was tested with eight parallel circuits, including both open-circuit and short-circuit fault tests
Workspace Analysis for Parallel Robot
Directory of Open Access Journals (Sweden)
Ying Sun
2013-05-01
Full Text Available As a completely new-type of robot, the parallel robot possesses a lot of advantages that the serial robot does not, such as high rigidity, great load-carrying capacity, small error, high precision, small self-weight/load ratio, good dynamic behavior and easy control, hence its range is extended in using domain. In order to find workspace of parallel mechanism, the numerical boundary-searching algorithm based on the reverse solution of kinematics and limitation of link length has been introduced. This paper analyses position workspace, orientation workspace of parallel robot of the six degrees of freedom. The result shows: It is a main means to increase and decrease its workspace to change the length of branch of parallel mechanism; The radius of the movement platform has no effect on the size of workspace, but will change position of workspace.
"Feeling" Series and Parallel Resistances.
Morse, Robert A.
1993-01-01
Equipped with drinking straws and stirring straws, a teacher can help students understand how resistances in electric circuits combine in series and in parallel. Follow-up suggestions are provided. (ZWH)
Parallel encoders for pixel detectors
International Nuclear Information System (INIS)
Nikityuk, N.M.
1991-01-01
A new method of fast encoding and determining the multiplicity and coordinates of fired pixels is described. A specific example construction of parallel encodes and MCC for n=49 and t=2 is given. 16 refs.; 6 figs.; 2 tabs
Massively Parallel Finite Element Programming
Heister, Timo
2010-01-01
Today\\'s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data structures and algorithms to take advantage of the power of high performance computers in generic finite element codes. Existing generic finite element libraries often restrict the parallelization to parallel linear algebra routines. This is a limiting factor when solving on more than a few hundreds of cores. We describe routines for distributed storage of all major components coupled with efficient, scalable algorithms. We give an overview of our effort to enable the modern and generic finite element library deal.II to take advantage of the power of large clusters. In particular, we describe the construction of a distributed mesh and develop algorithms to fully parallelize the finite element calculation. Numerical results demonstrate good scalability. © 2010 Springer-Verlag.
Event monitoring of parallel computations
Directory of Open Access Journals (Sweden)
Gruzlikov Alexander M.
2015-06-01
Full Text Available The paper considers the monitoring of parallel computations for detection of abnormal events. It is assumed that computations are organized according to an event model, and monitoring is based on specific test sequences
Massively Parallel Finite Element Programming
Heister, Timo; Kronbichler, Martin; Bangerth, Wolfgang
2010-01-01
Today's large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data structures and algorithms to take advantage of the power of high performance computers in generic finite element codes. Existing generic finite element libraries often restrict the parallelization to parallel linear algebra routines. This is a limiting factor when solving on more than a few hundreds of cores. We describe routines for distributed storage of all major components coupled with efficient, scalable algorithms. We give an overview of our effort to enable the modern and generic finite element library deal.II to take advantage of the power of large clusters. In particular, we describe the construction of a distributed mesh and develop algorithms to fully parallelize the finite element calculation. Numerical results demonstrate good scalability. © 2010 Springer-Verlag.
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
Writing parallel programs that work
CERN. Geneva
2012-01-01
Serial algorithms typically run inefficiently on parallel machines. This may sound like an obvious statement, but it is the root cause of why parallel programming is considered to be difficult. The current state of the computer industry is still that almost all programs in existence are serial. This talk will describe the techniques used in the Intel Parallel Studio to provide a developer with the tools necessary to understand the behaviors and limitations of the existing serial programs. Once the limitations are known the developer can refactor the algorithms and reanalyze the resulting programs with the tools in the Intel Parallel Studio to create parallel programs that work. About the speaker Paul Petersen is a Sr. Principal Engineer in the Software and Solutions Group (SSG) at Intel. He received a Ph.D. degree in Computer Science from the University of Illinois in 1993. After UIUC, he was employed at Kuck and Associates, Inc. (KAI) working on auto-parallelizing compiler (KAP), and was involved in th...
Parallel algorithms for continuum dynamics
International Nuclear Information System (INIS)
Hicks, D.L.; Liebrock, L.M.
1987-01-01
Simply porting existing parallel programs to a new parallel processor may not achieve the full speedup possible; to achieve the maximum efficiency may require redesigning the parallel algorithms for the specific architecture. The authors discuss here parallel algorithms that were developed first for the HEP processor and then ported to the CRAY X-MP/4, the ELXSI/10, and the Intel iPSC/32. Focus is mainly on the most recent parallel processing results produced, i.e., those on the Intel Hypercube. The applications are simulations of continuum dynamics in which the momentum and stress gradients are important. Examples of these are inertial confinement fusion experiments, severe breaks in the coolant system of a reactor, weapons physics, shock-wave physics. Speedup efficiencies on the Intel iPSC Hypercube are very sensitive to the ratio of communication to computation. Great care must be taken in designing algorithms for this machine to avoid global communication. This is much more critical on the iPSC than it was on the three previous parallel processors
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.
2014-08-12
Endpoint-based parallel data processing in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing a data communications geometry, the geometry specifying, for tasks representing processes of execution of the parallel application, a set of endpoints that are used in collective operations of the PAMI including a plurality of endpoints for one of the tasks; receiving in endpoints of the geometry an instruction for a collective operation; and executing the instruction for a collective operation through the endpoints in dependence upon the geometry, including dividing data communications operations among the plurality of endpoints for one of the tasks.
Parallel Implicit Algorithms for CFD
Keyes, David E.
1998-01-01
The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.
Second derivative parallel block backward differentiation type ...
African Journals Online (AJOL)
Second derivative parallel block backward differentiation type formulas for Stiff ODEs. ... Log in or Register to get access to full text downloads. ... and the methods are inherently parallel and can be distributed over parallel processors. They are ...
A Parallel Approach to Fractal Image Compression
Lubomir Dedera
2004-01-01
The paper deals with a parallel approach to coding and decoding algorithms in fractal image compressionand presents experimental results comparing sequential and parallel algorithms from the point of view of achieved bothcoding and decoding time and effectiveness of parallelization.
Parallel fabrication of macroporous scaffolds.
Dobos, Andrew; Grandhi, Taraka Sai Pavan; Godeshala, Sudhakar; Meldrum, Deirdre R; Rege, Kaushal
2018-07-01
Scaffolds generated from naturally occurring and synthetic polymers have been investigated in several applications because of their biocompatibility and tunable chemo-mechanical properties. Existing methods for generation of 3D polymeric scaffolds typically cannot be parallelized, suffer from low throughputs, and do not allow for quick and easy removal of the fragile structures that are formed. Current molds used in hydrogel and scaffold fabrication using solvent casting and porogen leaching are often single-use and do not facilitate 3D scaffold formation in parallel. Here, we describe a simple device and related approaches for the parallel fabrication of macroporous scaffolds. This approach was employed for the generation of macroporous and non-macroporous materials in parallel, in higher throughput and allowed for easy retrieval of these 3D scaffolds once formed. In addition, macroporous scaffolds with interconnected as well as non-interconnected pores were generated, and the versatility of this approach was employed for the generation of 3D scaffolds from diverse materials including an aminoglycoside-derived cationic hydrogel ("Amikagel"), poly(lactic-co-glycolic acid) or PLGA, and collagen. Macroporous scaffolds generated using the device were investigated for plasmid DNA binding and cell loading, indicating the use of this approach for developing materials for different applications in biotechnology. Our results demonstrate that the device-based approach is a simple technology for generating scaffolds in parallel, which can enhance the toolbox of current fabrication techniques. © 2018 Wiley Periodicals, Inc.
Parallel plasma fluid turbulence calculations
International Nuclear Information System (INIS)
Leboeuf, J.N.; Carreras, B.A.; Charlton, L.A.; Drake, J.B.; Lynch, V.E.; Newman, D.E.; Sidikman, K.L.; Spong, D.A.
1994-01-01
The study of plasma turbulence and transport is a complex problem of critical importance for fusion-relevant plasmas. To this day, the fluid treatment of plasma dynamics is the best approach to realistic physics at the high resolution required for certain experimentally relevant calculations. Core and edge turbulence in a magnetic fusion device have been modeled using state-of-the-art, nonlinear, three-dimensional, initial-value fluid and gyrofluid codes. Parallel implementation of these models on diverse platforms--vector parallel (National Energy Research Supercomputer Center's CRAY Y-MP C90), massively parallel (Intel Paragon XP/S 35), and serial parallel (clusters of high-performance workstations using the Parallel Virtual Machine protocol)--offers a variety of paths to high resolution and significant improvements in real-time efficiency, each with its own advantages. The largest and most efficient calculations have been performed at the 200 Mword memory limit on the C90 in dedicated mode, where an overlap of 12 to 13 out of a maximum of 16 processors has been achieved with a gyrofluid model of core fluctuations. The richness of the physics captured by these calculations is commensurate with the increased resolution and efficiency and is limited only by the ingenuity brought to the analysis of the massive amounts of data generated
Evaluating parallel optimization on transputers
Directory of Open Access Journals (Sweden)
A.G. Chalmers
2003-12-01
Full Text Available The faster processing power of modern computers and the development of efficient algorithms have made it possible for operations researchers to tackle a much wider range of problems than ever before. Further improvements in processing speed can be achieved utilising relatively inexpensive transputers to process components of an algorithm in parallel. The Davidon-Fletcher-Powell method is one of the most successful and widely used optimisation algorithms for unconstrained problems. This paper examines the algorithm and identifies the components that can be processed in parallel. The results of some experiments with these components are presented which indicates under what conditions parallel processing with an inexpensive configuration is likely to be faster than the traditional sequential implementations. The performance of the whole algorithm with its parallel components is then compared with the original sequential algorithm. The implementation serves to illustrate the practicalities of speeding up typical OR algorithms in terms of difficulty, effort and cost. The results give an indication of the savings in time a given parallel implementation can be expected to yield.
Pattern-Driven Automatic Parallelization
Directory of Open Access Journals (Sweden)
Christoph W. Kessler
1996-01-01
Full Text Available This article describes a knowledge-based system for automatic parallelization of a wide class of sequential numerical codes operating on vectors and dense matrices, and for execution on distributed memory message-passing multiprocessors. Its main feature is a fast and powerful pattern recognition tool that locally identifies frequently occurring computations and programming concepts in the source code. This tool also works for dusty deck codes that have been "encrypted" by former machine-specific code transformations. Successful pattern recognition guides sophisticated code transformations including local algorithm replacement such that the parallelized code need not emerge from the sequential program structure by just parallelizing the loops. It allows access to an expert's knowledge on useful parallel algorithms, available machine-specific library routines, and powerful program transformations. The partially restored program semantics also supports local array alignment, distribution, and redistribution, and allows for faster and more exact prediction of the performance of the parallelized target code than is usually possible.
Energy Technology Data Exchange (ETDEWEB)
Miocchi, P.; Lanzoni, B.; Ferraro, F. R.; Dalessandro, E.; Alessandrini, E. [Dipartimento di Fisica e Astronomia, Università di Bologna, Viale Berti Pichat 6/2, I-40127 Bologna (Italy); Pasquato, M.; Lee, Y.-W. [Department of Astronomy and Center for Galaxy Evolution Research, Yonsei University, Seoul 120-749 (Korea, Republic of); Vesperini, E. [Department of Astronomy, Indiana University, Bloomington, IN 47405 (United States)
2015-01-20
We present semi-analytical models and simplified N-body simulations with 10{sup 4} particles aimed at probing the role of dynamical friction (DF) in determining the radial distribution of blue straggler stars (BSSs) in globular clusters. The semi-analytical models show that DF (which is the only evolutionary mechanism at work) is responsible for the formation of a bimodal distribution with a dip progressively moving toward the external regions of the cluster. However, these models fail to reproduce the formation of the long-lived central peak observed in all dynamically evolved clusters. The results of N-body simulations confirm the formation of a sharp central peak, which remains as a stable feature over time regardless of the initial concentration of the system. In spite of noisy behavior, a bimodal distribution forms in many cases, with the size of the dip increasing as a function of time. In the most advanced stages, the distribution becomes monotonic. These results are in agreement with the observations. Also, the shape of the peak and the location of the minimum (which, in most of cases, is within 10 core radii) turn out to be consistent with observational results. For a more detailed and close comparison with observations, including a proper calibration of the timescales of the dynamical processes driving the evolution of the BSS spatial distribution, more realistic simulations will be necessary.
Parallel artificial liquid membrane extraction
DEFF Research Database (Denmark)
Gjelstad, Astrid; Rasmussen, Knut Einar; Parmer, Marthe Petrine
2013-01-01
This paper reports development of a new approach towards analytical liquid-liquid-liquid membrane extraction termed parallel artificial liquid membrane extraction. A donor plate and acceptor plate create a sandwich, in which each sample (human plasma) and acceptor solution is separated by an arti......This paper reports development of a new approach towards analytical liquid-liquid-liquid membrane extraction termed parallel artificial liquid membrane extraction. A donor plate and acceptor plate create a sandwich, in which each sample (human plasma) and acceptor solution is separated...... by an artificial liquid membrane. Parallel artificial liquid membrane extraction is a modification of hollow-fiber liquid-phase microextraction, where the hollow fibers are replaced by flat membranes in a 96-well plate format....
Parallel algorithms for mapping pipelined and parallel computations
Nicol, David M.
1988-01-01
Many computational problems in image processing, signal processing, and scientific computing are naturally structured for either pipelined or parallel computation. When mapping such problems onto a parallel architecture it is often necessary to aggregate an obvious problem decomposition. Even in this context the general mapping problem is known to be computationally intractable, but recent advances have been made in identifying classes of problems and architectures for which optimal solutions can be found in polynomial time. Among these, the mapping of pipelined or parallel computations onto linear array, shared memory, and host-satellite systems figures prominently. This paper extends that work first by showing how to improve existing serial mapping algorithms. These improvements have significantly lower time and space complexities: in one case a published O(nm sup 3) time algorithm for mapping m modules onto n processors is reduced to an O(nm log m) time complexity, and its space requirements reduced from O(nm sup 2) to O(m). Run time complexity is further reduced with parallel mapping algorithms based on these improvements, which run on the architecture for which they create the mappings.
Cellular automata a parallel model
Mazoyer, J
1999-01-01
Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.
Parallel Sparse Matrix - Vector Product
DEFF Research Database (Denmark)
Alexandersen, Joe; Lazarov, Boyan Stefanov; Dammann, Bernd
This technical report contains a case study of a sparse matrix-vector product routine, implemented for parallel execution on a compute cluster with both pure MPI and hybrid MPI-OpenMP solutions. C++ classes for sparse data types were developed and the report shows how these class can be used...
[Falsified medicines in parallel trade].
Muckenfuß, Heide
2017-11-01
The number of falsified medicines on the German market has distinctly increased over the past few years. In particular, stolen pharmaceutical products, a form of falsified medicines, have increasingly been introduced into the legal supply chain via parallel trading. The reasons why parallel trading serves as a gateway for falsified medicines are most likely the complex supply chains and routes of transport. It is hardly possible for national authorities to trace the history of a medicinal product that was bought and sold by several intermediaries in different EU member states. In addition, the heterogeneous outward appearance of imported and relabelled pharmaceutical products facilitates the introduction of illegal products onto the market. Official batch release at the Paul-Ehrlich-Institut offers the possibility of checking some aspects that might provide an indication of a falsified medicine. In some circumstances, this may allow the identification of falsified medicines before they come onto the German market. However, this control is only possible for biomedicinal products that have not received a waiver regarding official batch release. For improved control of parallel trade, better networking among the EU member states would be beneficial. European-wide regulations, e. g., for disclosure of the complete supply chain, would help to minimise the risks of parallel trading and hinder the marketing of falsified medicines.
The parallel adult education system
DEFF Research Database (Denmark)
Wahlgren, Bjarne
2015-01-01
for competence development. The Danish university educational system includes two parallel programs: a traditional academic track (candidatus) and an alternative practice-based track (master). The practice-based program was established in 2001 and organized as part time. The total program takes half the time...
Where are the parallel algorithms?
Voigt, R. G.
1985-01-01
Four paradigms that can be useful in developing parallel algorithms are discussed. These include computational complexity analysis, changing the order of computation, asynchronous computation, and divide and conquer. Each is illustrated with an example from scientific computation, and it is shown that computational complexity must be used with great care or an inefficient algorithm may be selected.
Parallel imaging with phase scrambling.
Zaitsev, Maxim; Schultz, Gerrit; Hennig, Juergen; Gruetter, Rolf; Gallichan, Daniel
2015-04-01
Most existing methods for accelerated parallel imaging in MRI require additional data, which are used to derive information about the sensitivity profile of each radiofrequency (RF) channel. In this work, a method is presented to avoid the acquisition of separate coil calibration data for accelerated Cartesian trajectories. Quadratic phase is imparted to the image to spread the signals in k-space (aka phase scrambling). By rewriting the Fourier transform as a convolution operation, a window can be introduced to the convolved chirp function, allowing a low-resolution image to be reconstructed from phase-scrambled data without prominent aliasing. This image (for each RF channel) can be used to derive coil sensitivities to drive existing parallel imaging techniques. As a proof of concept, the quadratic phase was applied by introducing an offset to the x(2) - y(2) shim and the data were reconstructed using adapted versions of the image space-based sensitivity encoding and GeneRalized Autocalibrating Partially Parallel Acquisitions algorithms. The method is demonstrated in a phantom (1 × 2, 1 × 3, and 2 × 2 acceleration) and in vivo (2 × 2 acceleration) using a 3D gradient echo acquisition. Phase scrambling can be used to perform parallel imaging acceleration without acquisition of separate coil calibration data, demonstrated here for a 3D-Cartesian trajectory. Further research is required to prove the applicability to other 2D and 3D sampling schemes. © 2014 Wiley Periodicals, Inc.
Default Parallels Plesk Panel Page
services that small businesses want and need. Our software includes key building blocks of cloud service virtualized servers Service Provider Products ParallelsÂ® Automation Hosting, SaaS, and cloud computing , the leading hosting automation software. You see this page because there is no Web site at this
Parallel plate transmission line transformer
Voeten, S.J.; Brussaard, G.J.H.; Pemen, A.J.M.
2011-01-01
A Transmission Line Transformer (TLT) can be used to transform high-voltage nanosecond pulses. These transformers rely on the fact that the length of the pulse is shorter than the transmission lines used. This allows connecting the transmission lines in parallel at the input and in series at the
Matpar: Parallel Extensions for MATLAB
Springer, P. L.
1998-01-01
Matpar is a set of client/server software that allows a MATLAB user to take advantage of a parallel computer for very large problems. The user can replace calls to certain built-in MATLAB functions with calls to Matpar functions.
Massively parallel quantum computer simulator
De Raedt, K.; Michielsen, K.; De Raedt, H.; Trieu, B.; Arnold, G.; Richter, M.; Lippert, Th.; Watanabe, H.; Ito, N.
2007-01-01
We describe portable software to simulate universal quantum computers on massive parallel Computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray
Parallel computing: numerics, applications, and trends
National Research Council Canada - National Science Library
Trobec, Roman; Vajteršic, Marián; Zinterhof, Peter
2009-01-01
... and/or distributed systems. The contributions to this book are focused on topics most concerned in the trends of today's parallel computing. These range from parallel algorithmics, programming, tools, network computing to future parallel computing. Particular attention is paid to parallel numerics: linear algebra, differential equations, numerica...
Experiments with parallel algorithms for combinatorial problems
G.A.P. Kindervater (Gerard); H.W.J.M. Trienekens
1985-01-01
textabstractIn the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic parallel machines. The parallel machines
International Nuclear Information System (INIS)
Heggarty, J.W.
1999-06-01
For almost thirty years, sequential R-matrix computation has been used by atomic physics research groups, from around the world, to model collision phenomena involving the scattering of electrons or positrons with atomic or molecular targets. As considerable progress has been made in the understanding of fundamental scattering processes, new data, obtained from more complex calculations, is of current interest to experimentalists. Performing such calculations, however, places considerable demands on the computational resources to be provided by the target machine, in terms of both processor speed and memory requirement. Indeed, in some instances the computational requirements are so great that the proposed R-matrix calculations are intractable, even when utilising contemporary classic supercomputers. Historically, increases in the computational requirements of R-matrix computation were accommodated by porting the problem codes to a more powerful classic supercomputer. Although this approach has been successful in the past, it is no longer considered to be a satisfactory solution due to the limitations of current (and future) Von Neumann machines. As a consequence, there has been considerable interest in the high performance multicomputers, that have emerged over the last decade which appear to offer the computational resources required by contemporary R-matrix research. Unfortunately, developing codes for these machines is not as simple a task as it was to develop codes for successive classic supercomputers. The difficulty arises from the considerable differences in the computing models that exist between the two types of machine and results in the programming of multicomputers to be widely acknowledged as a difficult, time consuming and error-prone task. Nevertheless, unless parallel R-matrix computation is realised, important theoretical and experimental atomic physics research will continue to be hindered. This thesis describes work that was undertaken in
The numerical parallel computing of photon transport
International Nuclear Information System (INIS)
Huang Qingnan; Liang Xiaoguang; Zhang Lifa
1998-12-01
The parallel computing of photon transport is investigated, the parallel algorithm and the parallelization of programs on parallel computers both with shared memory and with distributed memory are discussed. By analyzing the inherent law of the mathematics and physics model of photon transport according to the structure feature of parallel computers, using the strategy of 'to divide and conquer', adjusting the algorithm structure of the program, dissolving the data relationship, finding parallel liable ingredients and creating large grain parallel subtasks, the sequential computing of photon transport into is efficiently transformed into parallel and vector computing. The program was run on various HP parallel computers such as the HY-1 (PVP), the Challenge (SMP) and the YH-3 (MPP) and very good parallel speedup has been gotten
International Nuclear Information System (INIS)
Borovsky, J.E.; Hansen, P.J.
1998-01-01
The evolution of ExB-drifting plasma clouds is investigated with the aid of a computational technique denoted here as open-quotes dielectric-in-cell.close quotes Many of the familiar phenomena associated with clouds of collisionless plasma are seen and explained and less-well-known phenomena associated with convection patterns, with the stripping of cloud material, and with the evolution of plasma clouds composed of differing ion species are investigated. The effects of spatially uniform diffusion are studied with the dielectric-in-cell technique and with another computational technique denoted as open-quotes N-body dielectric;close quotes the suppression of convection, the suppression of structure growth, the increase in material stripping, and the evolution of cloud anisotropy are examined. copyright 1998 American Institute of Physics
Automatic Parallelization Tool: Classification of Program Code for Parallel Computing
Directory of Open Access Journals (Sweden)
Mustafa Basthikodi
2016-04-01
Full Text Available Performance growth of single-core processors has come to a halt in the past decade, but was re-enabled by the introduction of parallelism in processors. Multicore frameworks along with Graphical Processing Units empowered to enhance parallelism broadly. Couples of compilers are updated to developing challenges forsynchronization and threading issues. Appropriate program and algorithm classifications will have advantage to a great extent to the group of software engineers to get opportunities for effective parallelization. In present work we investigated current species for classification of algorithms, in that related work on classification is discussed along with the comparison of issues that challenges the classification. The set of algorithms are chosen which matches the structure with different issues and perform given task. We have tested these algorithms utilizing existing automatic species extraction toolsalong with Bones compiler. We have added functionalities to existing tool, providing a more detailed characterization. The contributions of our work include support for pointer arithmetic, conditional and incremental statements, user defined types, constants and mathematical functions. With this, we can retain significant data which is not captured by original speciesof algorithms. We executed new theories into the device, empowering automatic characterization of program code.
Structural synthesis of parallel robots
Gogu, Grigore
This book represents the fifth part of a larger work dedicated to the structural synthesis of parallel robots. The originality of this work resides in the fact that it combines new formulae for mobility, connectivity, redundancy and overconstraints with evolutionary morphology in a unified structural synthesis approach that yields interesting and innovative solutions for parallel robotic manipulators. This is the first book on robotics that presents solutions for coupled, decoupled, uncoupled, fully-isotropic and maximally regular robotic manipulators with Schönflies motions systematically generated by using the structural synthesis approach proposed in Part 1. Overconstrained non-redundant/overactuated/redundantly actuated solutions with simple/complex limbs are proposed. Many solutions are presented here for the first time in the literature. The author had to make a difficult and challenging choice between protecting these solutions through patents and releasing them directly into the public domain. T...
GPU Parallel Bundle Block Adjustment
Directory of Open Access Journals (Sweden)
ZHENG Maoteng
2017-09-01
Full Text Available To deal with massive data in photogrammetry, we introduce the GPU parallel computing technology. The preconditioned conjugate gradient and inexact Newton method are also applied to decrease the iteration times while solving the normal equation. A brand new workflow of bundle adjustment is developed to utilize GPU parallel computing technology. Our method can avoid the storage and inversion of the big normal matrix, and compute the normal matrix in real time. The proposed method can not only largely decrease the memory requirement of normal matrix, but also largely improve the efficiency of bundle adjustment. It also achieves the same accuracy as the conventional method. Preliminary experiment results show that the bundle adjustment of a dataset with about 4500 images and 9 million image points can be done in only 1.5 minutes while achieving sub-pixel accuracy.
A tandem parallel plate analyzer
International Nuclear Information System (INIS)
Hamada, Y.; Fujisawa, A.; Iguchi, H.; Nishizawa, A.; Kawasumi, Y.
1996-11-01
By a new modification of a parallel plate analyzer the second-order focus is obtained in an arbitrary injection angle. This kind of an analyzer with a small injection angle will have an advantage of small operational voltage, compared to the Proca and Green analyzer where the injection angle is 30 degrees. Thus, the newly proposed analyzer will be very useful for the precise energy measurement of high energy particles in MeV range. (author)
International Nuclear Information System (INIS)
Gus'kov, B.N.; Kalinnikov, V.A.; Krastev, V.R.; Maksimov, A.N.; Nikityuk, N.M.
1985-01-01
This paper describes a high-speed parallel counter that contains 31 inputs and 15 outputs and is implemented by integrated circuits of series 500. The counter is designed for fast sampling of events according to the number of particles that pass simultaneously through the hodoscopic plane of the detector. The minimum delay of the output signals relative to the input is 43 nsec. The duration of the output signals can be varied from 75 to 120 nsec
An anthropologist in parallel structure
Directory of Open Access Journals (Sweden)
Noelle Molé Liston
2016-08-01
Full Text Available The essay examines the parallels between Molé Liston’s studies on labor and precarity in Italy and the United States’ anthropology job market. Probing the way economic shift reshaped the field of anthropology of Europe in the late 2000s, the piece explores how the neoliberalization of the American academy increased the value in studying the hardships and daily lives of non-western populations in Europe.
Combinatorics of spreads and parallelisms
Johnson, Norman
2010-01-01
Partitions of Vector Spaces Quasi-Subgeometry Partitions Finite Focal-SpreadsGeneralizing André SpreadsThe Going Up Construction for Focal-SpreadsSubgeometry Partitions Subgeometry and Quasi-Subgeometry Partitions Subgeometries from Focal-SpreadsExtended André SubgeometriesKantor's Flag-Transitive DesignsMaximal Additive Partial SpreadsSubplane Covered Nets and Baer Groups Partial Desarguesian t-Parallelisms Direct Products of Affine PlanesJha-Johnson SL(2,
New algorithms for parallel MRI
International Nuclear Information System (INIS)
Anzengruber, S; Ramlau, R; Bauer, F; Leitao, A
2008-01-01
Magnetic Resonance Imaging with parallel data acquisition requires algorithms for reconstructing the patient's image from a small number of measured lines of the Fourier domain (k-space). In contrast to well-known algorithms like SENSE and GRAPPA and its flavors we consider the problem as a non-linear inverse problem. However, in order to avoid cost intensive derivatives we will use Landweber-Kaczmarz iteration and in order to improve the overall results some additional sparsity constraints.
Wakefield calculations on parallel computers
International Nuclear Information System (INIS)
Schoessow, P.
1990-01-01
The use of parallelism in the solution of wakefield problems is illustrated for two different computer architectures (SIMD and MIMD). Results are given for finite difference codes which have been implemented on a Connection Machine and an Alliant FX/8 and which are used to compute wakefields in dielectric loaded structures. Benchmarks on code performance are presented for both cases. 4 refs., 3 figs., 2 tabs
Aspects of computation on asynchronous parallel processors
International Nuclear Information System (INIS)
Wright, M.
1989-01-01
The increasing availability of asynchronous parallel processors has provided opportunities for original and useful work in scientific computing. However, the field of parallel computing is still in a highly volatile state, and researchers display a wide range of opinion about many fundamental questions such as models of parallelism, approaches for detecting and analyzing parallelism of algorithms, and tools that allow software developers and users to make effective use of diverse forms of complex hardware. This volume collects the work of researchers specializing in different aspects of parallel computing, who met to discuss the framework and the mechanics of numerical computing. The far-reaching impact of high-performance asynchronous systems is reflected in the wide variety of topics, which include scientific applications (e.g. linear algebra, lattice gauge simulation, ordinary and partial differential equations), models of parallelism, parallel language features, task scheduling, automatic parallelization techniques, tools for algorithm development in parallel environments, and system design issues
Parallel processing of genomics data
Agapito, Giuseppe; Guzzi, Pietro Hiram; Cannataro, Mario
2016-10-01
The availability of high-throughput experimental platforms for the analysis of biological samples, such as mass spectrometry, microarrays and Next Generation Sequencing, have made possible to analyze a whole genome in a single experiment. Such platforms produce an enormous volume of data per single experiment, thus the analysis of this enormous flow of data poses several challenges in term of data storage, preprocessing, and analysis. To face those issues, efficient, possibly parallel, bioinformatics software needs to be used to preprocess and analyze data, for instance to highlight genetic variation associated with complex diseases. In this paper we present a parallel algorithm for the parallel preprocessing and statistical analysis of genomics data, able to face high dimension of data and resulting in good response time. The proposed system is able to find statistically significant biological markers able to discriminate classes of patients that respond to drugs in different ways. Experiments performed on real and synthetic genomic datasets show good speed-up and scalability.
Overview of the Force Scientific Parallel Language
Directory of Open Access Journals (Sweden)
Gita Alaghband
1994-01-01
Full Text Available The Force parallel programming language designed for large-scale shared-memory multiprocessors is presented. The language provides a number of parallel constructs as extensions to the ordinary Fortran language and is implemented as a two-level macro preprocessor to support portability across shared memory multiprocessors. The global parallelism model on which the Force is based provides a powerful parallel language. The parallel constructs, generic synchronization, and freedom from process management supported by the Force has resulted in structured parallel programs that are ported to the many multiprocessors on which the Force is implemented. Two new parallel constructs for looping and functional decomposition are discussed. Several programming examples to illustrate some parallel programming approaches using the Force are also presented.
Automatic Loop Parallelization via Compiler Guided Refactoring
DEFF Research Database (Denmark)
Larsen, Per; Ladelsky, Razya; Lidman, Jacob
For many parallel applications, performance relies not on instruction-level parallelism, but on loop-level parallelism. Unfortunately, many modern applications are written in ways that obstruct automatic loop parallelization. Since we cannot identify sufficient parallelization opportunities...... for these codes in a static, off-line compiler, we developed an interactive compilation feedback system that guides the programmer in iteratively modifying application source, thereby improving the compiler’s ability to generate loop-parallel code. We use this compilation system to modify two sequential...... benchmarks, finding that the code parallelized in this way runs up to 8.3 times faster on an octo-core Intel Xeon 5570 system and up to 12.5 times faster on a quad-core IBM POWER6 system. Benchmark performance varies significantly between the systems. This suggests that semi-automatic parallelization should...
Parallel kinematics type, kinematics, and optimal design
Liu, Xin-Jun
2014-01-01
Parallel Kinematics- Type, Kinematics, and Optimal Design presents the results of 15 year's research on parallel mechanisms and parallel kinematics machines. This book covers the systematic classification of parallel mechanisms (PMs) as well as providing a large number of mechanical architectures of PMs available for use in practical applications. It focuses on the kinematic design of parallel robots. One successful application of parallel mechanisms in the field of machine tools, which is also called parallel kinematics machines, has been the emerging trend in advanced machine tools. The book describes not only the main aspects and important topics in parallel kinematics, but also references novel concepts and approaches, i.e. type synthesis based on evolution, performance evaluation and optimization based on screw theory, singularity model taking into account motion and force transmissibility, and others. This book is intended for researchers, scientists, engineers and postgraduates or above with interes...
Applied Parallel Computing Industrial Computation and Optimization
DEFF Research Database (Denmark)
Madsen, Kaj; NA NA NA Olesen, Dorte
Proceedings and the Third International Workshop on Applied Parallel Computing in Industrial Problems and Optimization (PARA96)......Proceedings and the Third International Workshop on Applied Parallel Computing in Industrial Problems and Optimization (PARA96)...
Parallel algorithms and cluster computing
Hoffmann, Karl Heinz
2007-01-01
This book presents major advances in high performance computing as well as major advances due to high performance computing. It contains a collection of papers in which results achieved in the collaboration of scientists from computer science, mathematics, physics, and mechanical engineering are presented. From the science problems to the mathematical algorithms and on to the effective implementation of these algorithms on massively parallel and cluster computers we present state-of-the-art methods and technology as well as exemplary results in these fields. This book shows that problems which seem superficially distinct become intimately connected on a computational level.
Parallel computation of rotating flows
DEFF Research Database (Denmark)
Lundin, Lars Kristian; Barker, Vincent A.; Sørensen, Jens Nørkær
1999-01-01
This paper deals with the simulation of 3‐D rotating flows based on the velocity‐vorticity formulation of the Navier‐Stokes equations in cylindrical coordinates. The governing equations are discretized by a finite difference method. The solution is advanced to a new time level by a two‐step process...... is that of solving a singular, large, sparse, over‐determined linear system of equations, and the iterative method CGLS is applied for this purpose. We discuss some of the mathematical and numerical aspects of this procedure and report on the performance of our software on a wide range of parallel computers. Darbe...
The parallel volume at large distances
DEFF Research Database (Denmark)
Kampf, Jürgen
In this paper we examine the asymptotic behavior of the parallel volume of planar non-convex bodies as the distance tends to infinity. We show that the difference between the parallel volume of the convex hull of a body and the parallel volume of the body itself tends to . This yields a new proof...... for the fact that a planar body can only have polynomial parallel volume, if it is convex. Extensions to Minkowski spaces and random sets are also discussed....