Complex and symplectic geometry

CERN Document Server

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.

Symplectic and Poisson Geometry in Interaction with Analysis, Algebra and Topology & Symplectic Geometry, Noncommutative Geometry and Physics

CERN Document Server

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 ...

Function theory on symplectic manifolds

CERN Document Server

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...

Wigner functions on non-standard symplectic vector spaces

Science.gov (United States)

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.

Symplectic geometry and Fourier analysis

CERN Document Server

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.

Categorical Cell Decomposition of Quantized Symplectic Algebraic Varieties

OpenAIRE

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,...

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.

Complex/Symplectic Mirrors

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.

Singularity theory and equivariant symplectic maps

CERN Document Server

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...

Symplectic quantum structure

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.)

On local invariants of singular symplectic forms

Science.gov (United States)

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.

Formal Symplectic Groupoid of a Deformation Quantization

Science.gov (United States)

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.

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)

Deformations of symplectic Lie algebroids, deformations of holomorphic symplectic structures, and index theorems

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....

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

Symplectic Geometric Algorithms for Hamiltonian Systems

CERN Document Server

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

Orthogonal and symplectic

CERN Document Server

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...

The Maslov index in symplectic Banach spaces

CERN Document Server

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...

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....

Contact and symplectic topology

CERN Document Server

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.

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)

Coherent State Projection Operator Representation of Symplectic Transformations as a Loyal Representation of Symplectic Group

Science.gov (United States)

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

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

Symmetries of the Space of Linear Symplectic Connections

Science.gov (United States)

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.

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

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.

A modified symplectic PRK scheme for seismic wave modeling

Science.gov (United States)

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.

Elementary symplectic topology and mechanics

CERN Document Server

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...

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...

Examples of integrable and non-integrable systems on singular symplectic manifolds

Science.gov (United States)

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.

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.

Strongly stable real infinitesimally symplectic mappings

NARCIS (Netherlands)

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

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)

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

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.

Explicit symplectic algorithms based on generating functions for charged particle dynamics

Science.gov (United States)

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.

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

Symplectic integrators with adaptive time steps

Science.gov (United States)

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.

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.)

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.

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

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 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...

Lorentz covariant canonical symplectic algorithms for dynamics of charged particles

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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.

Symplectic approach to calculation of magnetic field line trajectories in physical space with realistic magnetic geometry in divertor tokamaks

Science.gov (United States)

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.

Symplectic approach to calculation of magnetic field line trajectories in physical space with realistic magnetic geometry in divertor tokamaks

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.

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

Explicit symplectic integrators of molecular dynamics algorithms for rigid-body molecules in the canonical, isobaric-isothermal, and related ensembles.

Science.gov (United States)

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.

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

Fedosov’s formal symplectic groupoids and contravariant connections

Science.gov (United States)

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.

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

Infinitesimal Deformations of a Formal Symplectic Groupoid

Science.gov (United States)

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)}.

Infinitesimal deformations of a formal symplectic groupoid

OpenAIRE

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...

Variational and symplectic integrators for satellite relative orbit propagation including drag

Science.gov (United States)

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.

Symplectic Synchronization of Lorenz-Stenflo System with Uncertain Chaotic Parameters via Adaptive Control

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.

Symplectic and semiclassical aspects of the Schläfli identity

Science.gov (United States)

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.

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

Mechanics of curved surfaces, with application to surface-parallel cracks

Science.gov (United States)

Martel, Stephen J.

2011-10-01

The surfaces of many bodies are weakened by shallow enigmatic cracks that parallel the surface. A re-formulation of the static equilibrium equations in a curvilinear reference frame shows that a tension perpendicular to a traction-free surface can arise at shallow depths even under the influence of gravity. This condition occurs if σ11k1 + σ22k2 > ρg cosβ, where k1 and k2 are the principal curvatures (negative if convex) at the surface, σ11 and σ22 are tensile (positive) or compressive (negative) stresses parallel to the respective principal curvature arcs, ρ is material density, g is gravitational acceleration, and β is the surface slope. The curvature terms do not appear in equilibrium equations in a Cartesian reference frame. Compression parallel to a convex surface thus can cause subsurface cracks to open. A quantitative test of the relationship above accounts for where sheeting joints (prominent shallow surface-parallel fractures in rock) are abundant and for where they are scarce or absent in the varied topography of Yosemite National Park, resolving key aspects of a classic problem in geology: the formation of sheeting joints. Moreover, since the equilibrium equations are independent of rheology, the relationship above can be applied to delamination or spalling caused by surface-parallel cracks in many materials.

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

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.

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.

Normal forms for Poisson maps and symplectic groupoids around Poisson transversals.

Science.gov (United States)

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.

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.

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

Differential and symplectic topology of knots and curves

CERN Document Server

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

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.

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.

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 ...

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

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...

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)

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)

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.

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)

A new multi-symplectic scheme for the generalized Kadomtsev-Petviashvili equation

Science.gov (United States)

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.

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.

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.

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.

Seismic wavefield modeling based on time-domain symplectic and Fourier finite-difference method

Science.gov (United States)

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.

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.)

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.

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.

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)

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)

Bianchi type A hyper-symplectic and hyper-K\\"ahler metrics in 4D

OpenAIRE

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.

Period mappings with applications to symplectic complex spaces

CERN Document Server

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.

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 ...

Spherical complexes attached to symplectic lattices

NARCIS (Netherlands)

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

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)

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

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.

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

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)

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)

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

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

Multi-symplectic variational integrators for nonlinear Schrödinger equations with variable coefficients

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)

On the Inverse Mapping of the Formal Symplectic Groupoid of a Deformation Quantization

Science.gov (United States)

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 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

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

GENERAL: Application of Symplectic Algebraic Dynamics Algorithm to Circular Restricted Three-Body Problem

Science.gov (United States)

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.

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 Lagrangian subvarieties of holomorphic symplectic manifolds

OpenAIRE

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.

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.)

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....

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.

From symplectic integrator to Poincare map: Spline expansion of a map generator in Cartesian coordinates

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

Constrained dynamics of two interacting relativistic particles in the Faddeev-Jackiw symplectic framework

Science.gov (United States)

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.

Explicit symplectic algorithms based on generating functions for relativistic charged particle dynamics in time-dependent electromagnetic field

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Hamiltonian dynamics on the symplectic extended phase space for autonomous and non-autonomous systems

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

Two modified symplectic partitioned Runge-Kutta methods for solving the elastic wave equation

Science.gov (United States)

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.

Stochastic deformation of a thermodynamic symplectic structure

OpenAIRE

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...

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.

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.

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.

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

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

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

Transverse vibration of pipe conveying fluid made of functionally graded materials using a symplectic method

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.

Transverse vibration of pipe conveying fluid made of functionally graded materials using a symplectic method

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.

Variational Symplectic Integrator for Long-Time Simulations of the Guiding-Center Motion of Charged Particles in General Magnetic Fields

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

Variational Symplectic Integrator for Long-Time Simulations of the Guiding-Center Motion of Charged Particles in General Magnetic Fields

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.

Algebraic dynamics algorithm: Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

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.

Algebraic dynamics algorithm:Numerical comparison with Runge-Kutta algorithm and 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.

A general symplectic method for the response analysis of infinitely periodic structures subjected to random excitations

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.

Canonical symplectic structure and structure-preserving geometric algorithms for Schrödinger-Maxwell systems

Science.gov (United States)

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.

Symplectic Tracking of Multi-Isotopic Heavy-Ion Beams in SixTrack

CERN Document Server

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.

An Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

KAUST Repository

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.

Symmetric and asymmetric capillary bridges between a rough surface and a parallel surface.

Science.gov (United States)

Wang, Yongxin; Michielsen, Stephen; Lee, Hoon Joo

2013-09-03

Although the formation of a capillary bridge between two parallel surfaces has been extensively studied, the majority of research has described only symmetric capillary bridges between two smooth surfaces. In this work, an instrument was built to form a capillary bridge by squeezing a liquid drop on one surface with another surface. An analytical solution that describes the shape of symmetric capillary bridges joining two smooth surfaces has been extended to bridges that are asymmetric about the midplane and to rough surfaces. The solution, given by elliptical integrals of the first and second kind, is consistent with a constant Laplace pressure over the entire surface and has been verified for water, Kaydol, and dodecane drops forming symmetric and asymmetric bridges between parallel smooth surfaces. This solution has been applied to asymmetric capillary bridges between a smooth surface and a rough fabric surface as well as symmetric bridges between two rough surfaces. These solutions have been experimentally verified, and good agreement has been found between predicted and experimental profiles for small drops where the effect of gravity is negligible. Finally, a protocol for determining the profile from the volume and height of the capillary bridge has been developed and experimentally verified.

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 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

An hp symplectic pseudospectral method for nonlinear optimal control

Science.gov (United States)

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.

Parallel Simulation of Three-Dimensional Free Surface Fluid Flow Problems

International Nuclear Information System (INIS)

BAER, THOMAS A.; SACKINGER, PHILIP A.; SUBIA, SAMUEL R.

1999-01-01

Simulation of viscous three-dimensional fluid flow typically involves a large number of unknowns. When free surfaces are included, the number of unknowns increases dramatically. Consequently, this class of problem is an obvious application of parallel high performance computing. We describe parallel computation of viscous, incompressible, free surface, Newtonian fluid flow problems that include dynamic contact fines. The Galerkin finite element method was used to discretize the fully-coupled governing conservation equations and a ''pseudo-solid'' mesh mapping approach was used to determine the shape of the free surface. In this approach, the finite element mesh is allowed to deform to satisfy quasi-static solid mechanics equations subject to geometric or kinematic constraints on the boundaries. As a result, nodal displacements must be included in the set of unknowns. Other issues discussed are the proper constraints appearing along the dynamic contact line in three dimensions. Issues affecting efficient parallel simulations include problem decomposition to equally distribute computational work among a SPMD computer and determination of robust, scalable preconditioners for the distributed matrix systems that must be solved. Solution continuation strategies important for serial simulations have an enhanced relevance in a parallel coquting environment due to the difficulty of solving large scale systems. Parallel computations will be demonstrated on an example taken from the coating flow industry: flow in the vicinity of a slot coater edge. This is a three dimensional free surface problem possessing a contact line that advances at the web speed in one region but transitions to static behavior in another region. As such, a significant fraction of the computational time is devoted to processing boundary data. Discussion focuses on parallel speed ups for fixed problem size, a class of problems of immediate practical importance

The electromagnetic Dirac-Fock-Podolsky problem and symplectic properties of the Maxwell and Yang-Mills type dynamical systems

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)

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

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.)

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

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.

Symplectic homoclinic tangles of the ideal separatrix of the DIII-D from type I ELMs

Science.gov (United States)

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.

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.

Surface topography of parallel grinding process for nonaxisymmetric aspheric lens

International Nuclear Information System (INIS)

Zhang Ningning; Wang Zhenzhong; Pan Ri; Wang Chunjin; Guo Yinbiao

2012-01-01

Workpiece surface profile, texture and roughness can be predicted by modeling the topography of wheel surface and modeling kinematics of grinding process, which compose an important part of precision grinding process theory. Parallel grinding technology is an important method for nonaxisymmetric aspheric lens machining, but there is few report on relevant simulation. In this paper, a simulation method based on parallel grinding for precision machining of aspheric lens is proposed. The method combines modeling the random surface of wheel and modeling the single grain track based on arc wheel contact points. Then, a mathematical algorithm for surface topography is proposed and applied in conditions of different machining parameters. The consistence between the results of simulation and test proves that the algorithm is correct and efficient. (authors)

Symplectic integrators for large scale molecular dynamics simulations: A comparison of several explicit methods

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

Supersymmetric symplectic quantum mechanics

Science.gov (United States)

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.

Higher-order force gradient symplectic algorithms

Science.gov (United States)

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.

An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

KAUST Repository

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.

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.``

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)

An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

KAUST Repository

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

Classification of the linear canonical transformation and its associated real symplectic matrix

NARCIS (Netherlands)

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

A differential algebraic integration algorithm for symplectic mappings in systems with three-dimensional magnetic field

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

A Differential Algebraic Integration Algorithm for Symplectic Mappings in Systems with Three-Dimensional Magnetic Field

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

An intrinsic algorithm for parallel Poisson disk sampling on arbitrary surfaces.

Science.gov (United States)

Ying, Xiang; Xin, Shi-Qing; Sun, Qian; He, Ying

2013-09-01

Poisson disk sampling has excellent spatial and spectral properties, and plays an important role in a variety of visual computing. Although many promising algorithms have been proposed for multidimensional sampling in euclidean space, very few studies have been reported with regard to the problem of generating Poisson disks on surfaces due to the complicated nature of the surface. This paper presents an intrinsic algorithm for parallel Poisson disk sampling on arbitrary surfaces. In sharp contrast to the conventional parallel approaches, our method neither partitions the given surface into small patches nor uses any spatial data structure to maintain the voids in the sampling domain. Instead, our approach assigns each sample candidate a random and unique priority that is unbiased with regard to the distribution. Hence, multiple threads can process the candidates simultaneously and resolve conflicts by checking the given priority values. Our algorithm guarantees that the generated Poisson disks are uniformly and randomly distributed without bias. It is worth noting that our method is intrinsic and independent of the embedding space. This intrinsic feature allows us to generate Poisson disk patterns on arbitrary surfaces in IR(n). To our knowledge, this is the first intrinsic, parallel, and accurate algorithm for surface Poisson disk sampling. Furthermore, by manipulating the spatially varying density function, we can obtain adaptive sampling easily.

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)

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

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

Stress fields around a crack lying parallel to a free surface

International Nuclear Information System (INIS)

Higashida, Yutaka; Kamada, K.

1980-12-01

A method of stress analysis for a two dimentional crack, which is subjected to internal gas pressure, and situated parallel to a free surface of a material, is presented. It is based on the concept of continuously distributed edge dislocations of two kinds, i.e. one with Burgers vector normal to the free surface and the other with parallel to it. Stress fields of individual dislocations are chosen so as to satisfy stress free boundary conditions at the free surface, by taking account of image dislocations. Distributions of the both kinds of dislocations in the crack are derived so as to give the internal gas pressure and, at the same time, to satisfy shear stress free boundary condition on the crack surface. Stress fields σsub(xx), σsub(yy) and σsub(xy) in the sub-surface layer are then determined from them. They have square root singularities at the crack-tip. (author)

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)

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.

A curvature theory for discrete surfaces based on mesh parallelity

KAUST Repository

Bobenko, Alexander Ivanovich

2009-12-18

We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces\\' areas and mixed areas. Remarkably these notions are capable of unifying notable previously defined classes of surfaces, such as discrete isothermic minimal surfaces and surfaces of constant mean curvature. We discuss various types of natural Gauss images, the existence of principal curvatures, constant curvature surfaces, Christoffel duality, Koenigs nets, contact element nets, s-isothermic nets, and interesting special cases such as discrete Delaunay surfaces derived from elliptic billiards. © 2009 Springer-Verlag.

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

The Monge-Ampère equation: Hamiltonian and symplectic structures, recursions, and hierarchies

NARCIS (Netherlands)

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

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.

An Intrinsic Algorithm for Parallel Poisson Disk Sampling on Arbitrary Surfaces.

Science.gov (United States)

Ying, Xiang; Xin, Shi-Qing; Sun, Qian; He, Ying

2013-03-08

Poisson disk sampling plays an important role in a variety of visual computing, due to its useful statistical property in distribution and the absence of aliasing artifacts. While many effective techniques have been proposed to generate Poisson disk distribution in Euclidean space, relatively few work has been reported to the surface counterpart. This paper presents an intrinsic algorithm for parallel Poisson disk sampling on arbitrary surfaces. We propose a new technique for parallelizing the dart throwing. Rather than the conventional approaches that explicitly partition the spatial domain to generate the samples in parallel, our approach assigns each sample candidate a random and unique priority that is unbiased with regard to the distribution. Hence, multiple threads can process the candidates simultaneously and resolve conflicts by checking the given priority values. It is worth noting that our algorithm is accurate as the generated Poisson disks are uniformly and randomly distributed without bias. Our method is intrinsic in that all the computations are based on the intrinsic metric and are independent of the embedding space. This intrinsic feature allows us to generate Poisson disk distributions on arbitrary surfaces. Furthermore, by manipulating the spatially varying density function, we can obtain adaptive sampling easily.

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

The endoscopic classification of representations orthogonal and symplectic groups

CERN Document Server

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

A curvature theory for discrete surfaces based on mesh parallelity

KAUST Repository

Bobenko, Alexander Ivanovich; Pottmann, Helmut; Wallner, Johannes

2009-01-01

We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces' areas and mixed areas. Remarkably these notions are capable

Fast parallel diffractive multi-beam femtosecond laser surface micro-structuring

Energy Technology Data Exchange (ETDEWEB)

Zheng Kuang, E-mail: z.kuang@liv.ac.uk [Laser Group, Department of Engineering, University of Liverpool, Brodie Building, Liverpool L69 3GQ (United Kingdom); Dun Liu; Perrie, Walter; Edwardson, Stuart; Sharp, Martin; Fearon, Eamonn; Dearden, Geoff; Watkins, Ken [Laser Group, Department of Engineering, University of Liverpool, Brodie Building, Liverpool L69 3GQ (United Kingdom)

2009-04-15

Fast parallel femtosecond laser surface micro-structuring is demonstrated using a spatial light modulator (SLM). The Gratings and Lenses algorithm, which is simple and computationally fast, is used to calculate computer generated holograms (CGHs) producing diffractive multiple beams for the parallel processing. The results show that the finite laser bandwidth can significantly alter the intensity distribution of diffracted beams at higher angles resulting in elongated hole shapes. In addition, by synchronisation of applied CGHs and the scanning system, true 3D micro-structures are created on Ti6Al4V.

The combinatorics computation for Casimir operators of the symplectic Lie algebra and the application for determining the center of the enveloping algebra of a semidirect product

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

Contribution of diffuser surfaces to efficiency of tilted T shape parallel highway noise barriers

Directory of Open Access Journals (Sweden)

N. Javid Rouzi

2009-04-01

Full Text Available Background and aimsThe paper presents the results of an investigation on the acoustic  performance of tilted profile parallel barriers with quadratic residue diffuser tops and faces.MethodsA2D boundary element method (BEM is used to predict the barrier insertion loss. The results of rigid and with absorptive coverage are also calculated for comparisons. Using QRD on the top surface and faces of all tilted profile parallel barrier models introduced here is found to  improve the efficiency of barriers compared with rigid equivalent parallel barrier at the examined  receiver positions.Results Applying a QRD with frequency design of 400 Hz on 5 degrees tilted parallel barrier  improves the overall performance of its equivalent rigid barrier by 1.8 dB(A. Increase the treated surfaces with reactive elements shifts the effective performance toward lower frequencies. It is  found that by tilting the barriers from 0 to 10 degrees in parallel set up, the degradation effects in  parallel barriers is reduced but the absorption effect of fibrous materials and also diffusivity of thequadratic residue diffuser is reduced significantly. In this case all the designed barriers have better  performance with 10 degrees tilting in parallel set up.ConclusionThe most economic traffic noise parallel barrier, which produces significantly  high performance, is achieved by covering the top surface of the barrier closed to the receiver by  just a QRD with frequency design of 400 Hz and tilting angle of 10 degrees. The average Aweighted  insertion loss in this barrier is predicted to be 16.3 dB (A.

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.

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.

Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes

Science.gov (United States)

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

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

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

Introduction to orthogonal, symplectic and unitary representations of finite groups

CERN Document Server

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

Dynamic surface-pressure instrumentation for rods in parallel flow

International Nuclear Information System (INIS)

Mulcahy, T.M.; Lawrence, W.

1979-01-01

Methods employed and experience gained in measuring random fluid boundary layer pressures on the surface of a small diameter cylindrical rod subject to dense, nonhomogeneous, turbulent, parallel flow in a relatively noise-contaminated flow loop are described. Emphasis is placed on identification of instrumentation problems; description of transducer construction, mounting, and waterproofing; and the pretest calibration required to achieve instrumentation capable of reliable data acquisition

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

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.

Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry

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 no-core shell-model approach to intermediate-mass nuclei

Science.gov (United States)

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.

Canonical symplectic particle-in-cell method for long-term large-scale simulations of the Vlasov–Maxwell equations

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.

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)

Memory effect on energy losses of charged particles moving parallel to solid surface

International Nuclear Information System (INIS)

Kwei, C.M.; Tu, Y.H.; Hsu, Y.H.; Tung, C.J.

2006-01-01

Theoretical derivations were made for the induced potential and the stopping power of a charged particle moving close and parallel to the surface of a solid. It was illustrated that the induced potential produced by the interaction of particle and solid depended not only on the velocity but also on the previous velocity of the particle before its last inelastic interaction. Another words, the particle kept a memory on its previous velocity, v , in determining the stopping power for the particle of velocity v. Based on the dielectric response theory, formulas were derived for the induced potential and the stopping power with memory effect. An extended Drude dielectric function with spatial dispersion was used in the application of these formulas for a proton moving parallel to Si surface. It was found that the induced potential with memory effect lay between induced potentials without memory effect for constant velocities v and v. The memory effect was manifest as the proton changes its velocity in the previous inelastic interaction. This memory effect also reduced the stopping power of the proton. The formulas derived in the present work can be applied to any solid surface and charged particle moving with arbitrary parallel trajectory either inside or outside the solid

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

Science.gov (United States)

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.

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

Parallel image-acquisition in continuous-wave electron paramagnetic resonance imaging with a surface coil array: Proof-of-concept experiments

Science.gov (United States)

Enomoto, Ayano; Hirata, Hiroshi

2014-02-01

This article describes a feasibility study of parallel image-acquisition using a two-channel surface coil array in continuous-wave electron paramagnetic resonance (CW-EPR) imaging. Parallel EPR imaging was performed by multiplexing of EPR detection in the frequency domain. The parallel acquisition system consists of two surface coil resonators and radiofrequency (RF) bridges for EPR detection. To demonstrate the feasibility of this method of parallel image-acquisition with a surface coil array, three-dimensional EPR imaging was carried out using a tube phantom. Technical issues in the multiplexing method of EPR detection were also clarified. We found that degradation in the signal-to-noise ratio due to the interference of RF carriers is a key problem to be solved.

Construction of nonlinear symplectic six-dimensional thin-lens maps by exponentiation

CERN Document Server

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...

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

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

CERN Document Server

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

High order three part split symplectic integrators: Efficient techniques for the long time simulation of the disordered discrete nonlinear Schrödinger equation

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.

High order three part split symplectic integrators: Efficient techniques for the long time simulation of the disordered discrete nonlinear Schrödinger equation

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.

Expansions with respect to squares, symplectic and Poisson structures associated with the Sturm-Liouville problem. II

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

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

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.)

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

From Massively Parallel Algorithms and Fluctuating Time Horizons to Nonequilibrium Surface Growth

International Nuclear Information System (INIS)

Korniss, G.; Toroczkai, Z.; Novotny, M. A.; Rikvold, P. A.

2000-01-01

We study the asymptotic scaling properties of a massively parallel algorithm for discrete-event simulations where the discrete events are Poisson arrivals. The evolution of the simulated time horizon is analogous to a nonequilibrium surface. Monte Carlo simulations and a coarse-grained approximation indicate that the macroscopic landscape in the steady state is governed by the Edwards-Wilkinson Hamiltonian. Since the efficiency of the algorithm corresponds to the density of local minima in the associated surface, our results imply that the algorithm is asymptotically scalable. (c) 2000 The American Physical Society

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.

Long-term numerical simulation of the interaction between a neutron field and a neutral meson field by a symplectic-preserving scheme

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

X-ray diffraction study of surface-layer structure in parallel grazing rays

International Nuclear Information System (INIS)

Shtypulyak, N.I.; Yakimov, I.I.; Litvintsev, V.V.

1989-01-01

An x-ray diffraction method is described for study of thin polycrystalline and amorphous films and surface layers in an extremely asymmetrical diffraction system in parallel grazing rays using a DRON-3.0 diffractometer. The minimum grazing angles correspond to diffraction under conditions of total external reflection and a layer depth of ∼ 2.5-8 nm

Symplectic Group Representation of the Two-Mode Squeezing Operator in the Coherent State Basis

Science.gov (United States)

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

Bistatic scattering from a three-dimensional object above a two-dimensional randomly rough surface modeled with the parallel FDTD approach.

Science.gov (United States)

Guo, L-X; Li, J; Zeng, H

2009-11-01

We present an investigation of the electromagnetic scattering from a three-dimensional (3-D) object above a two-dimensional (2-D) randomly rough surface. A Message Passing Interface-based parallel finite-difference time-domain (FDTD) approach is used, and the uniaxial perfectly matched layer (UPML) medium is adopted for truncation of the FDTD lattices, in which the finite-difference equations can be used for the total computation domain by properly choosing the uniaxial parameters. This makes the parallel FDTD algorithm easier to implement. The parallel performance with different number of processors is illustrated for one rough surface realization and shows that the computation time of our parallel FDTD algorithm is dramatically reduced relative to a single-processor implementation. Finally, the composite scattering coefficients versus scattered and azimuthal angle are presented and analyzed for different conditions, including the surface roughness, the dielectric constants, the polarization, and the size of the 3-D object.

Pair-breaking effects by parallel magnetic field in electric-field-induced surface superconductivity

International Nuclear Information System (INIS)

Nabeta, Masahiro; Tanaka, Kenta K.; Onari, Seiichiro; Ichioka, Masanori

2016-01-01

Highlights: • Zeeman effect shifts superconducting gaps of sub-band system, towards pair-breaking. • Higher-level sub-bands become normal-state-like electronic states by magnetic fields. • Magnetic field dependence of zero-energy DOS reflects multi-gap superconductivity. - Abstract: We study paramagnetic pair-breaking in electric-field-induced surface superconductivity, when magnetic field is applied parallel to the surface. The calculation is performed by Bogoliubov-de Gennes theory with s-wave pairing, including the screening effect of electric fields by the induced carriers near the surface. Due to the Zeeman shift by applied fields, electronic states at higher-level sub-bands become normal-state-like. Therefore, the magnetic field dependence of Fermi-energy density of states reflects the multi-gap structure in the surface superconductivity.

A hybrid symplectic principal component analysis and central tendency measure method for detection of determinism in noisy time series with application to mechanomyography.

Science.gov (United States)

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.

A Case Study of a Hybrid Parallel 3D Surface Rendering Graphics Architecture

DEFF Research Database (Denmark)

Holten-Lund, Hans Erik; Madsen, Jan; Pedersen, Steen

1997-01-01

This paper presents a case study in the design strategy used inbuilding a graphics computer, for drawing very complex 3Dgeometric surfaces. The goal is to build a PC based computer systemcapable of handling surfaces built from about 2 million triangles, andto be able to render a perspective view...... of these on a computer displayat interactive frame rates, i.e. processing around 50 milliontriangles per second. The paper presents a hardware/softwarearchitecture called HPGA (Hybrid Parallel Graphics Architecture) whichis likely to be able to carry out this task. The case study focuses ontechniques to increase...

Reduction of a symplectic-like Lie algebroid with momentum map and its application to fiberwise linear Poisson structures

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)

A Screen Space GPGPU Surface LIC Algorithm for Distributed Memory Data Parallel Sort Last Rendering Infrastructures

Energy Technology Data Exchange (ETDEWEB)

Loring, Burlen; Karimabadi, Homa; Rortershteyn, Vadim

2014-07-01

The surface line integral convolution(LIC) visualization technique produces dense visualization of vector fields on arbitrary surfaces. We present a screen space surface LIC algorithm for use in distributed memory data parallel sort last rendering infrastructures. The motivations for our work are to support analysis of datasets that are too large to fit in the main memory of a single computer and compatibility with prevalent parallel scientific visualization tools such as ParaView and VisIt. By working in screen space using OpenGL we can leverage the computational power of GPUs when they are available and run without them when they are not. We address efficiency and performance issues that arise from the transformation of data from physical to screen space by selecting an alternate screen space domain decomposition. We analyze the algorithm's scaling behavior with and without GPUs on two high performance computing systems using data from turbulent plasma simulations.

A symplectic integration method for elastic filaments

Science.gov (United States)

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.

Surface charges for gravity and electromagnetism in the first order formalism

Science.gov (United States)

Frodden, Ernesto; Hidalgo, Diego

2018-02-01

A new derivation of surface charges for 3  +  1 gravity coupled to electromagnetism is obtained. Gravity theory is written in the tetrad-connection variables. The general derivation starts from the Lagrangian, and uses the covariant symplectic formalism in the language of forms. For gauge theories, surface charges disentangle physical from gauge symmetries through the use of Noether identities and the exactness symmetry condition. The surface charges are quasilocal, explicitly coordinate independent, gauge invariant and background independent. For a black hole family solution, the surface charge conservation implies the first law of black hole mechanics. As a check, we show the first law for an electrically charged, rotating black hole with an asymptotically constant curvature (the Kerr–Newman (anti-)de Sitter family). The charges, including the would-be mass term appearing in the first law, are quasilocal. No reference to the asymptotic structure of the spacetime nor the boundary conditions is required and therefore topological terms do not play a rôle. Finally, surface charge formulae for Lovelock gravity coupled to electromagnetism are exhibited, generalizing the one derived in a recent work by Barnich et al Proc. Workshop ‘ About Various Kinds of Interactions’ in honour of Philippe Spindel (4–5 June 2015, Mons, Belgium) C15-06-04 (2016 (arXiv:1611.01777 [gr-qc])). The two different symplectic methods to define surface charges are compared and shown equivalent.

Message-passing-interface-based parallel FDTD investigation on the EM scattering from a 1-D rough sea surface using uniaxial perfectly matched layer absorbing boundary.

Science.gov (United States)

Li, J; Guo, L-X; Zeng, H; Han, X-B

2009-06-01

A message-passing-interface (MPI)-based parallel finite-difference time-domain (FDTD) algorithm for the electromagnetic scattering from a 1-D randomly rough sea surface is presented. The uniaxial perfectly matched layer (UPML) medium is adopted for truncation of FDTD lattices, in which the finite-difference equations can be used for the total computation domain by properly choosing the uniaxial parameters. This makes the parallel FDTD algorithm easier to implement. The parallel performance with different processors is illustrated for one sea surface realization, and the computation time of the parallel FDTD algorithm is dramatically reduced compared to a single-process implementation. Finally, some numerical results are shown, including the backscattering characteristics of sea surface for different polarization and the bistatic scattering from a sea surface with large incident angle and large wind speed.

Highly accurate symplectic element based on two variational principles

Science.gov (United States)

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

Detachment of polystyrene particles from collector surfaces by surface tension forces induced by air-bubble passage through a parallel plate flow chamber

NARCIS (Netherlands)

Wit, PJ; vanderMei, HC; Busscher, HJ

1997-01-01

By allowing an air-bubble to pass through a parallel plate flow chamber with negatively charged, colloidal polystyrene particles adhering to the bottom collector plate of the chamber, the detachment of adhering particles stimulated by surface tension forces induced by the passage of a liquid-air

X-ray diffractometric study on the near-surface layer structure in parallel glancing rays

International Nuclear Information System (INIS)

Shtypulyak, N.I.; Yakimov, I.I.; Litvintsev, V.V.

1988-01-01

X-ray diffraction method is suggested to use to investigate thin films and near-surface layers under the conditions of total external reflection (TER) and in the geometry of parallel glancing rays. Experimental realization of the method using the DRON-30 diffractometer is described. Calculation for the required width of the aperture of Soller slot system is presented. The described diffraction scheme is used to investigate thin film crystal structure at glancing angles in the range from TER up to 8-10 deg. The thickness of the investigated layer in this case changes from 2.5-8 nm up to 10 3 nm. The suggested diffraction method in parallel glancing rays is especially important when investigating the films with thickness lower than 1000-2000A

Anti-parallel polarization switching in a triglycine sulfate organic ferroelectric insulator: The role of surface charges

Science.gov (United States)

Ma, He; Wu, Zhuangchun; Peng, Dongwen; Wang, Yaojin; Wang, Yiping; Yang, Ying; Yuan, Guoliang

2018-04-01

Four consecutive ferroelectric polarization switchings and an abnormal ring-like domain pattern can be introduced by a single tip bias of a piezoresponse force microscope in the (010) triglycine sulfate (TGS) crystal. The external electric field anti-parallel to the original polarization induces the first polarization switching; however, the surface charges of TGS can move toward the tip location and induce the second polarization switching once the tip bias is removed. The two switchings allow a ring-like pattern composed of the central domain with downward polarization and the outer domain with upward polarization. Once the two domains disappear gradually as a result of depolarization, the other two polarization switchings occur one by one at the TGS where the tip contacts. However, the backswitching phenomenon does not occur when the external electric field is parallel to the original polarization. These results can be explained according to the surface charges instead of the charges injected inside.

Formation of Sheeting Joints as a Result of Compression Parallel to Convex Surfaces, With Examples from Yosemite National Park, California

Science.gov (United States)

Martel, S. J.

2008-12-01

The formation of sheeting joints has been an outstanding problem in geology. New observations and analyses indicate that sheeting joints develop in response to a near-surface tension induced by compressive stresses parallel to a convex slope (hypothesis 1) rather than by removal of overburden by erosion, as conventionally assumed (hypothesis 2). Opening mode displacements across the joints together with the absence of mineral precipitates within the joints mean that sheeting joints open in response to a near-surface tension normal to the surface rather than a pressurized fluid. Consideration of a plot of this tensile stress as a function of depth normal to the surface reveals that a true tension must arise in the shallow subsurface if the rate of that tensile stress change with depth is positive at the surface. Static equilibrium requires this rate (derivative) to equal P22 k2 + P33 k3 - ρ g cosβ, where k2 and k3 are the principal curvatures of the surface, P22 and P33 are the respective surface- parallel normal stresses along the principal curvatures, ρ is the material density, g is gravitational acceleration, and β is the slope. This derivative will be positive and sheeting joints can open if at least one principal curvature is sufficiently convex (negative) and the surface-parallel stresses are sufficiently compressive (negative). At several sites with sheeting joints (e.g., Yosemite National Park in California), the measured topographic curvatures and the measured surface-parallel stresses of about -10 MPa combine to meet this condition. In apparent violation of hypothesis 1, sheeting joints occur locally at the bottom of Tenaya Canyon, one of the deepest glaciated, U-shaped (concave) canyons in the park. The canyon-bottom sheeting joints only occur, however, where the canyon is convex downstream, a direction that nearly coincides with direction of the most compressive stress measured in the vicinity. The most compressive stress acting along the convex

Study of MPI based on parallel MOM on PC clusters for EM-beam scattering by 2-D PEC rough surfaces

International Nuclear Information System (INIS)

Jun, Ma; Li-Xin, Guo; An-Qi, Wang

2009-01-01

This paper firstly applies the finite impulse response filter (FIR) theory combined with the fast Fourier transform (FFT) method to generate two-dimensional Gaussian rough surface. Using the electric field integral equation (EFIE), it introduces the method of moment (MOM) with RWG vector basis function and Galerkin's method to investigate the electromagnetic beam scattering by a two-dimensional PEC Gaussian rough surface on personal computer (PC) clusters. The details of the parallel conjugate gradient method (CGM) for solving the matrix equation are also presented and the numerical simulations are obtained through the message passing interface (MPI) platform on the PC clusters. It finds significantly that the parallel MOM supplies a novel technique for solving a two-dimensional rough surface electromagnetic-scattering problem. The influences of the root-mean-square height, the correlation length and the polarization on the beam scattering characteristics by two-dimensional PEC Gaussian rough surfaces are finally discussed. (classical areas of phenomenology)

Empirical valence bond models for reactive potential energy surfaces: a parallel multilevel genetic program approach.

Science.gov (United States)

Bellucci, Michael A; Coker, David F

2011-07-28

We describe a new method for constructing empirical valence bond potential energy surfaces using a parallel multilevel genetic program (PMLGP). Genetic programs can be used to perform an efficient search through function space and parameter space to find the best functions and sets of parameters that fit energies obtained by ab initio electronic structure calculations. Building on the traditional genetic program approach, the PMLGP utilizes a hierarchy of genetic programming on two different levels. The lower level genetic programs are used to optimize coevolving populations in parallel while the higher level genetic program (HLGP) is used to optimize the genetic operator probabilities of the lower level genetic programs. The HLGP allows the algorithm to dynamically learn the mutation or combination of mutations that most effectively increase the fitness of the populations, causing a significant increase in the algorithm's accuracy and efficiency. The algorithm's accuracy and efficiency is tested against a standard parallel genetic program with a variety of one-dimensional test cases. Subsequently, the PMLGP is utilized to obtain an accurate empirical valence bond model for proton transfer in 3-hydroxy-gamma-pyrone in gas phase and protic solvent. © 2011 American Institute of Physics

The Differential-Algebraic Analysis of Symplectic and Lax Structures Related with New Riemann-Type Hydrodynamic Systems

Science.gov (United States)

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.

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

Solving very large scattering problems using a parallel PWTD-enhanced surface integral equation solver

KAUST Repository

Liu, Yang

2013-07-01

The computational complexity and memory requirements of multilevel plane wave time domain (PWTD)-accelerated marching-on-in-time (MOT)-based surface integral equation (SIE) solvers scale as O(NtNs(log 2)Ns) and O(Ns 1.5); here N t and Ns denote numbers of temporal and spatial basis functions discretizing the current [Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003]. In the past, serial versions of these solvers have been successfully applied to the analysis of scattering from perfect electrically conducting as well as homogeneous penetrable targets involving up to Ns ≈ 0.5 × 106 and Nt ≈ 10 3. To solve larger problems, parallel PWTD-enhanced MOT solvers are called for. Even though a simple parallelization strategy was demonstrated in the context of electromagnetic compatibility analysis [M. Lu et al., in Proc. IEEE Int. Symp. AP-S, 4, 4212-4215, 2004], by and large, progress in this area has been slow. The lack of progress can be attributed wholesale to difficulties associated with the construction of a scalable PWTD kernel. © 2013 IEEE.

Investigation of a cable-driven parallel mechanism for interaction with a variety of surface, applied to the cleaning of free-form buildings

NARCIS (Netherlands)

Voss, K.H.J.; van der Wijk, V.; Herder, Justus Laurens; Lenarcic, Jadran; Husty, Manfred

2012-01-01

In this paper, the capability of a specific cable-driven parallel mechanism to interact with a variety of surfaces is investigated. This capability could be of use in for example the cleaning of large building surfaces. A method is presented to investigate the workspace for which the cables do not

Air bubble-induced detachment of polystyrene particles with different sizes from collector surfaces in a parallel plate flow chamber

NARCIS (Netherlands)

Gomez-Suarez, C; van der Mei, HC; Busscher, HJ

2001-01-01

Particle size was found to be an important factor in air bubble-induced detachment of colloidal particles from collector surfaces in a parallel plate flow chamber and generally polystyrene particles with a diameter of 806 nm detached less than particles with a diameter of 1400 nm. Particle

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

A detailed chemistry model for transient hydrogen and carbon monoxide catalytic recombination on parallel flat Pt surfaces implemented in an integral code

International Nuclear Information System (INIS)

Jimenez, Miguel A.; Martin-Valdepenas, Juan M.; Martin-Fuertes, Francisco; Fernandez, Jose A.

2007-01-01

A detailed chemistry model has been adapted and developed for surface chemistry, heat and mass transfer between H 2 /CO/air/steam/CO 2 mixtures and vertical parallel Pt-coated surfaces. This model is based onto a simplified Deutschmann reaction scheme for methane surface combustion and the analysis by Elenbaas for buoyancy-induced heat transfer between parallel plates. Mass transfer is treated by the heat and mass transfer analogy. The proposed model is able to simulate the H 2 /CO recombination phenomena characteristic of parallel-plate Passive Autocatalytic Recombiners (PARs), which have been proposed and implemented as a promising hydrogen-control strategy in the safety of nuclear power stations or other industries. The transient model is able to approach the warm-up phase of the PAR and its shut-down as well as the dynamic changes within the surrounding atmosphere. The model has been implemented within the MELCOR code and assessed against results of the Battelle Model Containment tests of the Zx series. Results show accurate predictions and a better performance than traditional methods in integral codes, i.e. empirical correlations, which are also much case-specific. Influence of CO present in the mixture on the PAR performance is also addressed in this paper

Surface Casimir densities and induced cosmological constant on parallel branes in AdS spacetime

International Nuclear Information System (INIS)

Saharian, Aram A.

2004-01-01

Vacuum expectation value of the surface energy-momentum tensor is evaluated for a massive scalar field with general curvature coupling parameter subject to Robin boundary conditions on two parallel branes located on (D+1)-dimensional anti-de Sitter bulk. The general case of different Robin coefficients on separate branes is considered. As a regularization procedure the generalized zeta function technique is used, in combination with contour integral representations. The surface energies on the branes are presented in the form of the sums of single brane and second brane-induced parts. For the geometry of a single brane both regions, on the left (L-region) and on the right (R-region), of the brane are considered. The surface densities for separate L- and R-regions contain pole and finite contributions. For an infinitely thin brane taking these regions together, in odd spatial dimensions the pole parts cancel and the total surface energy is finite. The parts in the surface densities generated by the presence of the second brane are finite for all nonzero values of the interbrane separation. It is shown that for large distances between the branes the induced surface densities give rise to an exponentially suppressed cosmological constant on the brane. In the Randall-Sundrum braneworld model, for the interbrane distances solving the hierarchy problem between the gravitational and electroweak mass scales, the cosmological constant generated on the visible brane is of the right order of magnitude with the value suggested by the cosmological observations

Parallel paving: An algorithm for generating distributed, adaptive, all-quadrilateral meshes on parallel computers

Energy Technology Data Exchange (ETDEWEB)

Lober, R.R.; Tautges, T.J.; Vaughan, C.T.

1997-03-01

Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement.

Deformations of surface singularities

CERN Document Server

Szilárd, ágnes

2013-01-01

The present publication contains a special collection of research and review articles on deformations of surface singularities, that put together serve as an introductory survey of results and methods of the theory, as well as open problems, important examples and connections to other areas of mathematics. The aim is to collect material that will help mathematicians already working or wishing to work in this area to deepen their insight and eliminate the technical barriers in this learning process. This also is supported by review articles providing some global picture and an abundance of examples. Additionally, we introduce some material which emphasizes the newly found relationship with the theory of Stein fillings and symplectic geometry.  This links two main theories of mathematics: low dimensional topology and algebraic geometry. The theory of normal surface singularities is a distinguished part of analytic or algebraic geometry with several important results, its own technical machinery, and several op...

Air bubble-induced detachment of positively and negatively charged polystyrene particles from collector surfaces in a parallel-plate flow chamber

NARCIS (Netherlands)

Gomez-Suarez, C; Van der Mei, HC; Busscher, HJ

2000-01-01

Electrostatic interactions between colloidal particles and collector surfaces were found tcr be important in particle detachment as induced by the passage of air bubbles in a parallel-plate Row chamber. Electrostatic interactions between adhering particles and passing air bubbles, however, a-ere

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

Science.gov (United States)

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.

Obstructions for twist star products

Science.gov (United States)

Bieliavsky, Pierre; Esposito, Chiara; Waldmann, Stefan; Weber, Thomas

2018-05-01

In this short note, we point out that not every star product is induced by a Drinfel'd twist by showing that not every Poisson structure is induced by a classical r-matrix. Examples include the higher genus symplectic Pretzel surfaces and the symplectic sphere S^2.

A high performance parallel approach to medical imaging

International Nuclear Information System (INIS)

Frieder, G.; Frieder, O.; Stytz, M.R.

1988-01-01

Research into medical imaging using general purpose parallel processing architectures is described and a review of the performance of previous medical imaging machines is provided. Results demonstrating that general purpose parallel architectures can achieve performance comparable to other, specialized, medical imaging machine architectures is presented. A new back-to-front hidden-surface removal algorithm is described. Results demonstrating the computational savings obtained by using the modified back-to-front hidden-surface removal algorithm are presented. Performance figures for forming a full-scale medical image on a mesh interconnected multiprocessor are presented

Parallel Monte Carlo simulation of aerosol dynamics

KAUST Repository

Zhou, K.

2014-01-01

A highly efficient Monte Carlo (MC) algorithm is developed for the numerical simulation of aerosol dynamics, that is, nucleation, surface growth, and coagulation. Nucleation and surface growth are handled with deterministic means, while coagulation is simulated with a stochastic method (Marcus-Lushnikov stochastic process). Operator splitting techniques are used to synthesize the deterministic and stochastic parts in the algorithm. The algorithm is parallelized using the Message Passing Interface (MPI). The parallel computing efficiency is investigated through numerical examples. Near 60% parallel efficiency is achieved for the maximum testing case with 3.7 million MC particles running on 93 parallel computing nodes. The algorithm is verified through simulating various testing cases and comparing the simulation results with available analytical and/or other numerical solutions. Generally, it is found that only small number (hundreds or thousands) of MC particles is necessary to accurately predict the aerosol particle number density, volume fraction, and so forth, that is, low order moments of the Particle Size Distribution (PSD) function. Accurately predicting the high order moments of the PSD needs to dramatically increase the number of MC particles. 2014 Kun Zhou et al.

A Study of Parallels Between Antarctica South Pole Traverse Equipment and Lunar/Mars Surface Systems

Science.gov (United States)

Mueller, Robert P.; Hoffman, Stephen, J.; Thur, Paul

2010-01-01

The parallels between an actual Antarctica South Pole re-supply traverse conducted by the National Science Foundation (NSF) Office of Polar Programs in 2009 have been studied with respect to the latest mission architecture concepts being generated by the United States National Aeronautics and Space Administration (NASA) for lunar and Mars surface systems scenarios. The challenges faced by both endeavors are similar since they must both deliver equipment and supplies to support operations in an extreme environment with little margin for error in order to be successful. By carefully and closely monitoring the manifesting and operational support equipment lists which will enable this South Pole traverse, functional areas have been identified. The equipment required to support these functions will be listed with relevant properties such as mass, volume, spare parts and maintenance schedules. This equipment will be compared to space systems currently in use and projected to be required to support equivalent and parallel functions in Lunar and Mars missions in order to provide a level of realistic benchmarking. Space operations have historically required significant amounts of support equipment and tools to operate and maintain the space systems that are the primary focus of the mission. By gaining insight and expertise in Antarctic South Pole traverses, space missions can use the experience gained over the last half century of Antarctic operations in order to design for operations, maintenance, dual use, robustness and safety which will result in a more cost effective, user friendly, and lower risk surface system on the Moon and Mars. It is anticipated that the U.S Antarctic Program (USAP) will also realize benefits for this interaction with NASA in at least two areas: an understanding of how NASA plans and carries out its missions and possible improved efficiency through factors such as weight savings, alternative technologies, or modifications in training and

Unified picture of non-geometric fluxes and T-duality in double field theory via graded symplectic manifolds

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.

Parallel Computation of RCS of Electrically Large Platform with Coatings Modeled with NURBS Surfaces

Directory of Open Access Journals (Sweden)

Ying Yan

2012-01-01

Full Text Available The significance of Radar Cross Section (RCS in the military applications makes its prediction an important problem. This paper uses large-scale parallel Physical Optics (PO to realize the fast computation of RCS to electrically large targets, which are modeled by Non-Uniform Rational B-Spline (NURBS surfaces and coated with dielectric materials. Some numerical examples are presented to validate this paper’s method. In addition, 1024 CPUs are used in Shanghai Supercomputer Center (SSC to perform the simulation of a model with the maximum electrical size 1966.7 λ for the first time in China. From which, it can be found that this paper’s method can greatly speed the calculation and is capable of solving the real-life problem of RCS prediction.

Effect of parallel electric fields on the whistler mode wave propagation in the magnetosphere

International Nuclear Information System (INIS)

Gupta, G.P.; Singh, R.N.

1975-01-01

The effect of parallel electric fields on whistler mode wave propagation has been studied. To account for the parallel electric fields, the dispersion equation has been analyzed, and refractive index surfaces for magnetospheric plasma have been constructed. The presence of parallel electric fields deforms the refractive index surfaces which diffuse the energy flow and produce defocusing of the whistler mode waves. The parallel electric field induces an instability in the whistler mode waves propagating through the magnetosphere. The growth or decay of whistler mode instability depends on the direction of parallel electric fields. It is concluded that the analyses of whistler wave records received on the ground should account for the role of parallel electric fields

Proceedings – Mathematical Sciences | Indian Academy of Sciences

Indian Academy of Sciences (India)

Let X be a symplectic homotopy K3 surface and G = S 5 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 smoothstructures of X under the action of G .

Detachment of colloidal particles from collector surfaces with different electrostatic charge and hydrophobicity by attachment to air bubbles in a parallel plate flow chamber

NARCIS (Netherlands)

Suarez, CG; van der Mei, HC; Busscher, HJ

1999-01-01

The detachment of polystyrene particles adhering to collector surfaces with different electrostatic charge and hydrophobicity by attachment to a passing air bubble has been studied in a parallel plate flow chamber. Particle detachment decreased linearly with increasing air bubble velocity and

Surface flatness measurement of quasi-parallel plates employing three-beam interference with strong reference beam

Science.gov (United States)

Sunderland, Zofia; Patorski, Krzysztof

2016-12-01

A big challenge for standard interferogram analysis methods such as Temporal Phase Shifting or Fourier Transform is a parasitic set of fringes which might occur in the analyzed fringe pattern intensity distribution. It is encountered, for example, when transparent glass plates with quasi-parallel surfaces are tested in Fizeau or Twyman-Green interferometers. Besides the beams reflected from the plate front surface and the interferometer reference the beam reflected from the plate rear surface also plays important role; its amplitude is comparable with the amplitude of other beams. In result we face three families of fringes of high contrast which cannot be easily separated. Earlier we proposed a competitive solution for flatness measurements which relies on eliminating one of those fringe sets from the three-beam interferogram and separating two remaining ones with the use of 2D Continuous Wavelet Transform. In this work we cover the case when the intensity of the reference beam is significantly higher than the intensities of two object beams. The main advantage of differentiating beam intensities is the change in contrast of individual fringe families. Processing of such three-beam interferograms is modified but also takes advantage of 2D CWT. We show how to implement this method in Twyman-Green and Fizeau setups and compare this processing path and measurement procedures with previously proposed solutions.

Lectures on Hilbert schemes of points on surfaces

CERN Document Server

Nakajima, Hiraku

1999-01-01

This beautifully written book deals with one shining example: the Hilbert schemes of points on algebraic surfaces ... The topics are carefully and tastefully chosen ... The young person will profit from reading this book. --Mathematical Reviews The Hilbert scheme of a surface X describes collections of n (not necessarily distinct) points on X. More precisely, it is the moduli space for 0-dimensional subschemes of X of length n. Recently it was realized that Hilbert schemes originally studied in algebraic geometry are closely related to several branches of mathematics, such as singularities, symplectic geometry, representation theory--even theoretical physics. The discussion in the book reflects this feature of Hilbert schemes. One example of the modern, broader interest in the subject is a construction of the representation of the infinite-dimensional Heisenberg algebra, i.e., Fock space. This representation has been studied extensively in the literature in connection with affine Lie algebras, conformal field...

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.

A poloidal non-uniformity of the collisionless parallel current in a tokamak plasma

Energy Technology Data Exchange (ETDEWEB)

Romannikov, A.; Fenzi-Bonizec, C

2005-07-01

The collisionless distortion of the ion (electron) distribution function at certain points on a magnetic surface is studied in the framework of a simple model of a large aspect ratio tokamak plasma. The flow velocity driven by this distortion is calculated. The possibility of an additional non-uniform collisionless parallel current density on a magnetic surface, other than the known neo-classical non-uniformity is shown. The difference between the parallel current density on the low and high field side of a magnetic surface is close to the neoclassical bootstrap current density. The first Tore-Supra experimental test indicates the possibility of the poloidal non-uniformity of the parallel current density. (authors)

A parallel algorithm for transient solid dynamics simulations with contact detection

International Nuclear Information System (INIS)

Attaway, S.; Hendrickson, B.; Plimpton, S.; Gardner, D.; Vaughan, C.; Heinstein, M.; Peery, J.

1996-01-01

Solid dynamics simulations with Lagrangian finite elements are used to model a wide variety of problems, such as the calculation of impact damage to shipping containers for nuclear waste and the analysis of vehicular crashes. Using parallel computers for these simulations has been hindered by the difficulty of searching efficiently for material surface contacts in parallel. A new parallel algorithm for calculation of arbitrary material contacts in finite element simulations has been developed and implemented in the PRONTO3D transient solid dynamics code. This paper will explore some of the issues involved in developing efficient, portable, parallel finite element models for nonlinear transient solid dynamics simulations. The contact-detection problem poses interesting challenges for efficient implementation of a solid dynamics simulation on a parallel computer. The finite element mesh is typically partitioned so that each processor owns a localized region of the finite element mesh. This mesh partitioning is optimal for the finite element portion of the calculation since each processor must communicate only with the few connected neighboring processors that share boundaries with the decomposed mesh. However, contacts can occur between surfaces that may be owned by any two arbitrary processors. Hence, a global search across all processors is required at every time step to search for these contacts. Load-imbalance can become a problem since the finite element decomposition divides the volumetric mesh evenly across processors but typically leaves the surface elements unevenly distributed. In practice, these complications have been limiting factors in the performance and scalability of transient solid dynamics on massively parallel computers. In this paper the authors present a new parallel algorithm for contact detection that overcomes many of these limitations

(Non)local Hamiltonian and symplectic structures, recursions and hierarchies: a new approach and applications to the N = 1 supersymmetric KdV equation

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

Section sigma models coupled to symplectic duality bundles on Lorentzian four-manifolds

Science.gov (United States)

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".

Surface-modified CMOS IC electrochemical sensor array targeting single chromaffin cells for highly parallel amperometry measurements.

Science.gov (United States)

Huang, Meng; Delacruz, Joannalyn B; Ruelas, John C; Rathore, Shailendra S; Lindau, Manfred

2018-01-01

Amperometry is a powerful method to record quantal release events from chromaffin cells and is widely used to assess how specific drugs modify quantal size, kinetics of release, and early fusion pore properties. Surface-modified CMOS-based electrochemical sensor arrays allow simultaneous recordings from multiple cells. A reliable, low-cost technique is presented here for efficient targeting of single cells specifically to the electrode sites. An SU-8 microwell structure is patterned on the chip surface to provide insulation for the circuitry as well as cell trapping at the electrode sites. A shifted electrode design is also incorporated to increase the flexibility of the dimension and shape of the microwells. The sensitivity of the electrodes is validated by a dopamine injection experiment. Microwells with dimensions slightly larger than the cells to be trapped ensure excellent single-cell targeting efficiency, increasing the reliability and efficiency for on-chip single-cell amperometry measurements. The surface-modified device was validated with parallel recordings of live chromaffin cells trapped in the microwells. Rapid amperometric spikes with no diffusional broadening were observed, indicating that the trapped and recorded cells were in very close contact with the electrodes. The live cell recording confirms in a single experiment that spike parameters vary significantly from cell to cell but the large number of cells recorded simultaneously provides the statistical significance.

Biharmonic Submanifolds with Parallel Mean Curvature Vector in Pseudo-Euclidean Spaces

Energy Technology Data Exchange (ETDEWEB)

Fu, Yu, E-mail: yufudufe@gmail.com [Dongbei University of Finance and Economics, School of Mathematics and Quantitative Economics (China)

2013-12-15

In this paper, we investigate biharmonic submanifolds in pseudo-Euclidean spaces with arbitrary index and dimension. We give a complete classification of biharmonic spacelike submanifolds with parallel mean curvature vector in pseudo-Euclidean spaces. We also determine all biharmonic Lorentzian surfaces with parallel mean curvature vector field in pseudo-Euclidean spaces.

Biharmonic Submanifolds with Parallel Mean Curvature Vector in Pseudo-Euclidean Spaces

International Nuclear Information System (INIS)

Fu, Yu

2013-01-01

In this paper, we investigate biharmonic submanifolds in pseudo-Euclidean spaces with arbitrary index and dimension. We give a complete classification of biharmonic spacelike submanifolds with parallel mean curvature vector in pseudo-Euclidean spaces. We also determine all biharmonic Lorentzian surfaces with parallel mean curvature vector field in pseudo-Euclidean spaces

The role of bed-parallel slip in the development of complex normal fault zones

Science.gov (United States)

Delogkos, Efstratios; Childs, Conrad; Manzocchi, Tom; Walsh, John J.; Pavlides, Spyros

2017-04-01

Normal faults exposed in Kardia lignite mine, Ptolemais Basin, NW Greece formed at the same time as bed-parallel slip-surfaces, so that while the normal faults grew they were intermittently offset by bed-parallel slip. Following offset by a bed-parallel slip-surface, further fault growth is accommodated by reactivation on one or both of the offset fault segments. Where one fault is reactivated the site of bed-parallel slip is a bypassed asperity. Where both faults are reactivated, they propagate past each other to form a volume between overlapping fault segments that displays many of the characteristics of relay zones, including elevated strains and transfer of displacement between segments. Unlike conventional relay zones, however, these structures contain either a repeated or a missing section of stratigraphy which has a thickness equal to the throw of the fault at the time of the bed-parallel slip event, and the displacement profiles along the relay-bounding fault segments have discrete steps at their intersections with bed-parallel slip-surfaces. With further increase in displacement, the overlapping fault segments connect to form a fault-bound lens. Conventional relay zones form during initial fault propagation, but with coeval bed-parallel slip, relay-like structures can form later in the growth of a fault. Geometrical restoration of cross-sections through selected faults shows that repeated bed-parallel slip events during fault growth can lead to complex internal fault zone structure that masks its origin. Bed-parallel slip, in this case, is attributed to flexural-slip arising from hanging-wall rollover associated with a basin-bounding fault outside the study area.

Parallel Programming with Intel Parallel Studio XE

CERN Document Server

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

CONTRIBUTION OF QUADRATIC RESIDUE DIFFUSERS TO EFFICIENCY OF TILTED PROFILE PARALLEL HIGHWAY NOISE BARRIERS

Directory of Open Access Journals (Sweden)

M. R. Monazzam ، P. Nassiri

2009-10-01

Full Text Available This paper presents the results of an investigation on the acoustic performance of tilted profile parallel barriers with quadratic residue diffuser (QRD tops and faces. A 2D boundary element method (BEM is used to predict the barrier insertion loss. The results of rigid and with absorptive coverage are also calculated for comparisons. Using QRD on the top surface and faces of all tilted profile parallel barrier models introduced here is found to improve the efficiency of barriers compared with rigid equivalent parallel barrier at the examined receiver positions. Applying a QRD with frequency design of 400 Hz on 5 degrees tilted parallel barrier improves the overall performance of its equivalent rigid barrier by 1.8 dB(A. Increase in the treated surfaces with reactive elements shifts the effective performance toward lower frequencies. It is found that by tilting the barriers from 0 to 10 degrees in parallel set up, the degradation effects in parallel barriers is reduced but the absorption effect of fibrous materials and also diffusivity of the quadratic residue diffuser is reduced significantly. In this case all the designed barriers have better performance with 10 degrees tilting in parallel set up. The most economic traffic noise parallel barrier which produces significantly high performance, is achieved by covering the top surface of the barrier closed to the receiver by just a QRD with frequency design of 400 Hz and tilting angle of 10 degrees. The average A-weighted insertion loss in this barrier is predicted to be 16.3 dB (A.

Parallel comparative studies on toxicity of quantum dots synthesized and surface engineered with different methods in vitro and in vivo

Directory of Open Access Journals (Sweden)

Liu F

2017-07-01

Full Text Available Fengjun Liu1,* Wen Ye1,* Jun Wang2 Fengxiang Song1 Yingsheng Cheng3 Bingbo Zhang21Department of Radiology, Shanghai Public Health Clinical Center, 2Institute of Photomedicine, Shanghai Skin Disease Hospital, The Institute for Biomedical Engineering & Nano Science, Tongji University School of Medicine, 3Department of Radiology, Shanghai Sixth People’s Hospital, Shanghai Jiao Tong University, Shanghai, China *These authors contributed equally to this work Abstract: Quantum dots (QDs have been considered to be promising probes for biosensing, bioimaging, and diagnosis. However, their toxicity issues caused by heavy metals in QDs remain to be addressed, in particular for their in vivo biomedical applications. In this study, a parallel comparative investigation in vitro and in vivo is presented to disclose the impact of synthetic methods and their following surface modifications on the toxicity of QDs. Cellular assays after exposure to QDs were conducted including cell viability assessment, DNA breakage study in a single cellular level, intracellular reactive oxygen species (ROS receptor measurement, and transmission electron microscopy to evaluate their toxicity in vitro. Mice experiments after QD administration, including analysis of hemobiological indices, pharmacokinetics, histological examination, and body weight, were further carried out to evaluate their systematic toxicity in vivo. Results show that QDs fabricated by the thermal decomposition approach in organic phase and encapsulated by an amphiphilic polymer (denoted as QDs-1 present the least toxicity in acute damage, compared with those of QDs surface engineered by glutathione-mediated ligand exchange (denoted as QDs-2, and the ones prepared by coprecipitation approach in aqueous phase with mercaptopropionic acid capped (denoted as QDs-3. With the extension of the investigation time of mice respectively injected with QDs, we found that the damage caused by QDs to the organs can be

Lectures given at the C.I.M.E. Summer School

CERN Document Server

Tian, Gang

2008-01-01

Modern approaches to the study of symplectic 4-manifolds and algebraic surfaces combine a wide range of techniques and sources of inspiration. Gauge theory, symplectic geometry, pseudoholomorphic curves, singularity theory, moduli spaces, braid groups, monodromy, in addition to classical topology and algebraic geometry, combine to make this one of the most vibrant and active areas of research in mathematics. It is our hope that the five lectures of the present volume given at the C.I.M.E. Summer School held in Cetraro, Italy, September 2-10, 2003 will be useful to people working in related areas of mathematics and will become standard references on these topics. The volume is a coherent exposition of an active field of current research focusing on the introduction of new methods for the study of moduli spaces of complex structures on algebraic surfaces, and for the investigation of symplectic topology in dimension 4 and higher.

The island dynamics model on parallel quadtree grids

Science.gov (United States)

Mistani, Pouria; Guittet, Arthur; Bochkov, Daniil; Schneider, Joshua; Margetis, Dionisios; Ratsch, Christian; Gibou, Frederic

2018-05-01

We introduce an approach for simulating epitaxial growth by use of an island dynamics model on a forest of quadtree grids, and in a parallel environment. To this end, we use a parallel framework introduced in the context of the level-set method. This framework utilizes: discretizations that achieve a second-order accurate level-set method on non-graded adaptive Cartesian grids for solving the associated free boundary value problem for surface diffusion; and an established library for the partitioning of the grid. We consider the cases with: irreversible aggregation, which amounts to applying Dirichlet boundary conditions at the island boundary; and an asymmetric (Ehrlich-Schwoebel) energy barrier for attachment/detachment of atoms at the island boundary, which entails the use of a Robin boundary condition. We provide the scaling analyses performed on the Stampede supercomputer and numerical examples that illustrate the capability of our methodology to efficiently simulate different aspects of epitaxial growth. The combination of adaptivity and parallelism in our approach enables simulations that are several orders of magnitude faster than those reported in the recent literature and, thus, provides a viable framework for the systematic study of mound formation on crystal surfaces.

State of the art of parallel scientific visualization applications on PC clusters; Etat de l'art des applications de visualisation scientifique paralleles sur grappes de PC

Energy Technology Data Exchange (ETDEWEB)

Juliachs, M

2004-07-01

In this state of the art on parallel scientific visualization applications on PC clusters, we deal with both surface and volume rendering approaches. We first analyze available PC cluster configurations and existing parallel rendering software components for parallel graphics rendering. CEA/DIF has been studying cluster visualization since 2001. This report is part of a study to set up a new visualization research platform. This platform consisting of an eight-node PC cluster under Linux and a tiled display was installed in collaboration with Versailles-Saint-Quentin University in August 2003. (author)

State of the art of parallel scientific visualization applications on PC clusters; Etat de l'art des applications de visualisation scientifique paralleles sur grappes de PC

Energy Technology Data Exchange (ETDEWEB)

Juliachs, M

2004-07-01

In this state of the art on parallel scientific visualization applications on PC clusters, we deal with both surface and volume rendering approaches. We first analyze available PC cluster configurations and existing parallel rendering software components for parallel graphics rendering. CEA/DIF has been studying cluster visualization since 2001. This report is part of a study to set up a new visualization research platform. This platform consisting of an eight-node PC cluster under Linux and a tiled display was installed in collaboration with Versailles-Saint-Quentin University in August 2003. (author)

Momentum-energy transport from turbulence driven by parallel flow shear

International Nuclear Information System (INIS)

Dong, J.Q.; Horton, W.; Bengtson, R.D.; Li, G.X.

1994-04-01

The low frequency E x B turbulence driven by the shear in the mass flow velocity parallel to the magnetic field is studied using the fluid theory in a slab configuration with magnetic shear. Ion temperature gradient effects are taken into account. The eigenfunctions of the linear instability are asymmetric about the mode rational surfaces. Quasilinear Reynolds stress induced by such asymmetric fluctuations produces momentum and energy transport across the magnetic field. Analytic formulas for the parallel and perpendicular Reynolds stress, viscosity and energy transport coefficients are given. Experimental observations of the parallel and poloidal plasma flows on TEXT-U are presented and compared with the theoretical models

Practical parallel computing

CERN Document Server

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

Parallel rendering

Science.gov (United States)

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.

Position Analysis of a Hybrid Serial-Parallel Manipulator in Immersion Lithography

Directory of Open Access Journals (Sweden)

Jie-jie Shao

2015-01-01

Full Text Available This paper proposes a novel hybrid serial-parallel mechanism with 6 degrees of freedom. The new mechanism combines two different parallel modules in a serial form. 3-P̲(PH parallel module is architecture of 3 degrees of freedom based on higher joints and specializes in describing two planes’ relative pose. 3-P̲SP parallel module is typical architecture which has been widely investigated in recent researches. In this paper, the direct-inverse position problems of the 3-P̲SP parallel module in the couple mixed-type mode are analyzed in detail, and the solutions are obtained in an analytical form. Furthermore, the solutions for the direct and inverse position problems of the novel hybrid serial-parallel mechanism are also derived and obtained in the analytical form. The proposed hybrid serial-parallel mechanism is applied to regulate the immersion hood’s pose in an immersion lithography system. Through measuring and regulating the pose of the immersion hood with respect to the wafer surface simultaneously, the immersion hood can track the wafer surface’s pose in real-time and the gap status is stabilized. This is another exploration to hybrid serial-parallel mechanism’s application.

Parallel computations

CERN Document Server

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

Parallel sorting algorithms

CERN Document Server

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

Hitchin's connection, Toeplitz operators, and symmetry invariant deformation quantization

DEFF Research Database (Denmark)

Andersen, Jørgen Ellegaard

2012-01-01

We introduce the notion of a rigid family of Kähler structures on a symplectic manifold. We then prove that a Hitchin connection exists for any rigid holomorphic family of Kähler structures on any compact pre-quantizable symplectic manifold which satisfies certain simple topological constraints...... a mapping class group invariant formal quantization of the smooth symplectic leaves of the moduli space of flat SU(n)-connections on any compact surface....... quantization. Finally, these results are applied to the moduli space situation in which Hitchin originally constructed his connection. First we get a proof that the Hitchin connection in this case is the same as the connection constructed by Axelrod, Della Pietra, and Witten. Second we obtain in this way...

State of the art of parallel scientific visualization applications on PC clusters

International Nuclear Information System (INIS)

Juliachs, M.

2004-01-01

In this state of the art on parallel scientific visualization applications on PC clusters, we deal with both surface and volume rendering approaches. We first analyze available PC cluster configurations and existing parallel rendering software components for parallel graphics rendering. CEA/DIF has been studying cluster visualization since 2001. This report is part of a study to set up a new visualization research platform. This platform consisting of an eight-node PC cluster under Linux and a tiled display was installed in collaboration with Versailles-Saint-Quentin University in August 2003. (author)

Parallel MR imaging.

Science.gov (United States)

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.

Electron acceleration by surface plasma waves in double metal surface structure

Science.gov (United States)

Liu, C. S.; Kumar, Gagan; Singh, D. B.; Tripathi, V. K.

2007-12-01

Two parallel metal sheets, separated by a vacuum region, support a surface plasma wave whose amplitude is maximum on the two parallel interfaces and minimum in the middle. This mode can be excited by a laser using a glass prism. An electron beam launched into the middle region experiences a longitudinal ponderomotive force due to the surface plasma wave and gets accelerated to velocities of the order of phase velocity of the surface wave. The scheme is viable to achieve beams of tens of keV energy. In the case of a surface plasma wave excited on a single metal-vacuum interface, the field gradient normal to the interface pushes the electrons away from the high field region, limiting the acceleration process. The acceleration energy thus achieved is in agreement with the experimental observations.

High-Performance Psychometrics: The Parallel-E Parallel-M Algorithm for Generalized Latent Variable Models. Research Report. ETS RR-16-34

Science.gov (United States)

von Davier, Matthias

2016-01-01

This report presents results on a parallel implementation of the expectation-maximization (EM) algorithm for multidimensional latent variable models. The developments presented here are based on code that parallelizes both the E step and the M step of the parallel-E parallel-M algorithm. Examples presented in this report include item response…

Badlands: A parallel basin and landscape dynamics model

Directory of Open Access Journals (Sweden)

T. Salles

2016-01-01

Full Text Available Over more than three decades, a number of numerical landscape evolution models (LEMs have been developed to study the combined effects of climate, sea-level, tectonics and sediments on Earth surface dynamics. Most of them are written in efficient programming languages, but often cannot be used on parallel architectures. Here, I present a LEM which ports a common core of accepted physical principles governing landscape evolution into a distributed memory parallel environment. Badlands (acronym for BAsin anD LANdscape DynamicS is an open-source, flexible, TIN-based landscape evolution model, built to simulate topography development at various space and time scales.

Parallel nanostructuring of GeSbTe film with particle mask

Energy Technology Data Exchange (ETDEWEB)

Wang, Z.B.; Hong, M.H.; Wang, Q.F.; Chong, T.C. [Data Storage Institute, DSI Building, 5 Engineering Drive 1, 117608, Singapore (Singapore); Department of Electrical and Computer Engineering, National University of Singapore, 119260, Singapore (Singapore); Luk' yanchuk, B.S.; Huang, S.M.; Shi, L.P. [Data Storage Institute, DSI Building, 5 Engineering Drive 1, 117608, Singapore (Singapore)

2004-09-01

Parallel nanostructuring of a GeSbTe film may significantly improve the recording performance in data storage. In this paper, a method that permits direct and massively parallel nanopatterning of the substrate surface by laser irradiation is investigated. Polystyrene spherical particles were deposited on the surface in a monolayer array by self-assembly. The array was then irradiated with a 248-nm KrF laser. A sub-micron nanodent array can be obtained after single-pulse irradiation. These nanodents change their shapes at different laser energies. The optical near-field distribution around the particles was calculated according to the exact solution of the light-scattering problem. The influence of the presence of the substrate on the optical near field was also studied. The mechanisms for the generation of the nanodent structures are discussed. (orig.)

Surface tree languages and parallel derivation trees

NARCIS (Netherlands)

Engelfriet, Joost

1976-01-01

The surface tree languages obtained by top-down finite state transformation of monadic trees are exactly the frontier-preserving homomorphic images of sets of derivation trees of ETOL systems. The corresponding class of tree transformation languages is therefore equal to the class of ETOL languages.

Plane-parallel biases computed from inhomogeneous Arctic clouds and sea ice

Science.gov (United States)

Rozwadowska, Anna; Cahalan, Robert F.

2002-10-01

Monte Carlo simulations of the expected influence of nonuniformity in cloud structure and surface albedo on shortwave radiative fluxes in the Arctic atmosphere are presented. In particular, plane-parallel biases in cloud albedo and transmittance are studied for nonabsorbing, low-level, all-liquid stratus clouds over sea ice. The "absolute bias" is defined as the difference between the cloud albedo or transmittance for the uniform or plane-parallel case, and the albedo or transmittance for nonuniform conditions with the same mean cloud optical thickness and the same mean surface albedo, averaged over a given area (i.e., bias > 0 means plane-parallel overestimates). Ranges of means and standard deviations of input parameters typical of Arctic conditions are determined from the First International Satellite Cloud Climatology Project (ISCCP) Regional Experiment Artic Cloud Experiment (FIRE/ACE)/Surface Heat Budget of the Arctic Ocean (SHEBA)/Atmospheric Radiation Measurement Program (ARM) experiment, a cooperative effort of the Department of Energy, NASA, NSF, the National Oceanic and Atmospheric Administration, the Office of Naval Research, and the Atmospheric Environment Service. We determine the sensitivity of the bias with respect to the following: domain averaged means and spatial variances of cloud optical thickness and surface albedo, shape of the surface reflectance function, presence of a scattering layer under the clouds, and solar zenith angle. The simulations show that the biases in Arctic conditions are generally lower than in subtropical stratocumulus. The magnitudes of the absolute biases are unlikely to exceed 0.02 for albedo and 0.05 for transmittance. The "relative bias" expresses the absolute bias as a percentage of the actual cloud albedo or transmittance. The magnitude of the relative bias in albedo is typically below 2% over the reflective Arctic surface, while the magnitude of the relative bias in transmittance can exceed 10%.

Multilayer Relaxation and Surface Energies of Metallic Surfaces

Science.gov (United States)

Bozzolo, Guillermo; Rodriguez, Agustin M.; Ferrante, John

1994-01-01

The perpendicular and parallel multilayer relaxations of fcc (210) surfaces are studied using equivalent crystal theory (ECT). A comparison with experimental and theoretical results is made for AI(210). The effect of uncertainties in the input parameters on the magnitudes and ordering of surface relaxations for this semiempirical method is estimated. A new measure of surface roughness is proposed. Predictions for the multilayer relaxations and surface energies of the (210) face of Cu and Ni are also included.

Three-Dimensional Induced Polarization Parallel Inversion Using Nonlinear Conjugate Gradients Method

Directory of Open Access Journals (Sweden)

Huan Ma

2015-01-01

Full Text Available Four kinds of array of induced polarization (IP methods (surface, borehole-surface, surface-borehole, and borehole-borehole are widely used in resource exploration. However, due to the presence of large amounts of the sources, it will take much time to complete the inversion. In the paper, a new parallel algorithm is described which uses message passing interface (MPI and graphics processing unit (GPU to accelerate 3D inversion of these four methods. The forward finite differential equation is solved by ILU0 preconditioner and the conjugate gradient (CG solver. The inverse problem is solved by nonlinear conjugate gradients (NLCG iteration which is used to calculate one forward and two “pseudo-forward” modelings and update the direction, space, and model in turn. Because each source is independent in forward and “pseudo-forward” modelings, multiprocess modes are opened by calling MPI library. The iterative matrix solver within CULA is called in each process. Some tables and synthetic data examples illustrate that this parallel inversion algorithm is effective. Furthermore, we demonstrate that the joint inversion of surface and borehole data produces resistivity and chargeability results are superior to those obtained from inversions of individual surface data.

A SPECT reconstruction method for extending parallel to non-parallel geometries

International Nuclear Information System (INIS)

Wen Junhai; Liang Zhengrong

2010-01-01

Due to its simplicity, parallel-beam geometry is usually assumed for the development of image reconstruction algorithms. The established reconstruction methodologies are then extended to fan-beam, cone-beam and other non-parallel geometries for practical application. This situation occurs for quantitative SPECT (single photon emission computed tomography) imaging in inverting the attenuated Radon transform. Novikov reported an explicit parallel-beam formula for the inversion of the attenuated Radon transform in 2000. Thereafter, a formula for fan-beam geometry was reported by Bukhgeim and Kazantsev (2002 Preprint N. 99 Sobolev Institute of Mathematics). At the same time, we presented a formula for varying focal-length fan-beam geometry. Sometimes, the reconstruction formula is so implicit that we cannot obtain the explicit reconstruction formula in the non-parallel geometries. In this work, we propose a unified reconstruction framework for extending parallel-beam geometry to any non-parallel geometry using ray-driven techniques. Studies by computer simulations demonstrated the accuracy of the presented unified reconstruction framework for extending parallel-beam to non-parallel geometries in inverting the attenuated Radon transform.

The language parallel Pascal and other aspects of the massively parallel processor

Science.gov (United States)

Reeves, A. P.; Bruner, J. D.

1982-01-01

A high level language for the Massively Parallel Processor (MPP) was designed. This language, called Parallel Pascal, is described in detail. A description of the language design, a description of the intermediate language, Parallel P-Code, and details for the MPP implementation are included. Formal descriptions of Parallel Pascal and Parallel P-Code are given. A compiler was developed which converts programs in Parallel Pascal into the intermediate Parallel P-Code language. The code generator to complete the compiler for the MPP is being developed independently. A Parallel Pascal to Pascal translator was also developed. The architecture design for a VLSI version of the MPP was completed with a description of fault tolerant interconnection networks. The memory arrangement aspects of the MPP are discussed and a survey of other high level languages is given.

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.

Energy flow of electric dipole radiation in between parallel mirrors

Science.gov (United States)

Xu, Zhangjin; Arnoldus, Henk F.

2017-11-01

We have studied the energy flow patterns of the radiation emitted by an electric dipole located in between parallel mirrors. It appears that the field lines of the Poynting vector (the flow lines of energy) can have very intricate structures, including many singularities and vortices. The flow line patterns depend on the distance between the mirrors, the distance of the dipole to one of the mirrors and the angle of oscillation of the dipole moment with respect to the normal of the mirror surfaces. Already for the simplest case of a dipole moment oscillating perpendicular to the mirrors, singularities appear at regular intervals along the direction of propagation (parallel to the mirrors). For a parallel dipole, vortices appear in the neighbourhood of the dipole. For a dipole oscillating under a finite angle with the surface normal, the radiating tends to swirl around the dipole before travelling off parallel to the mirrors. For relatively large mirror separations, vortices appear in the pattern. When the dipole is off-centred with respect to the midway point between the mirrors, the flow line structure becomes even more complicated, with numerous vortices in the pattern, and tiny loops near the dipole. We have also investigated the locations of the vortices and singularities, and these can be found without any specific knowledge about the flow lines. This provides an independent means of studying the propagation of dipole radiation between mirrors.

Parallel integer sorting with medium and fine-scale parallelism

Science.gov (United States)

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.

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 computing works!

CERN Document Server

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

The distribution of deformation in parallel fault-related folds with migrating axial surfaces: comparison between fault-propagation and fault-bend folding

Science.gov (United States)

Salvini, Francesco; Storti, Fabrizio

2001-01-01

In fault-related folds that form by axial surface migration, rocks undergo deformation as they pass through axial surfaces. The distribution and intensity of deformation in these structures has been impacted by the history of axial surface migration. Upon fold initiation, unique dip panels develop, each with a characteristic deformation intensity, depending on their history. During fold growth, rocks that pass through axial surfaces are transported between dip panels and accumulate additional deformation. By tracking the pattern of axial surface migration in model folds, we predict the distribution of relative deformation intensity in simple-step, parallel fault-bend and fault-propagation anticlines. In both cases the deformation is partitioned into unique domains we call deformation panels. For a given rheology of the folded multilayer, deformation intensity will be homogeneously distributed in each deformation panel. Fold limbs are always deformed. The flat crests of fault-propagation anticlines are always undeformed. Two asymmetric deformation panels develop in fault-propagation folds above ramp angles exceeding 29°. For lower ramp angles, an additional, more intensely-deformed panel develops at the transition between the crest and the forelimb. Deformation in the flat crests of fault-bend anticlines occurs when fault displacement exceeds the length of the footwall ramp, but is never found immediately hinterland of the crest to forelimb transition. In environments dominated by brittle deformation, our models may serve as a first-order approximation of the distribution of fractures in fault-related folds.

Characterizing the adhesion of motile and nonmotile Escherichia coli to a glass surface using a parallel-plate flow chamber.

Science.gov (United States)

McClaine, Jennifer W; Ford, Roseanne M

2002-04-20

A parallel-plate flow chamber was used to measure the attachment and detachment rates of Escherichia coli to a glass surface at various fluid velocities. The effect of flagella on adhesion was investigated by performing experiments with several E. coli strains: AW405 (motile); HCB136 (nonmotile mutant with paralyzed flagella); and HCB137 (nonmotile mutant without flagella). We compared the total attachment rates and the fraction of bacteria retained on the surface to determine how the presence and movement of the flagella influence transport to the surface and adhesion strength in this dynamic system. At the lower fluid velocities, there was no significant difference in the total attachment rates for the three bacterial strains; nonmotile strains settled at a rate that was of the same order of magnitude as the diffusion rate of the motile strain. At the highest fluid velocity, the effect of settling was minimized to better illustrate the importance of motility, and the attachment rates of both nonmotile strains were approximately five times slower than that of the motile bacteria. Thus, different processes controlled the attachment rate depending on the parameter regime in which the experiment was performed. The fractions of motile bacteria retained on the glass surface increased with increasing velocity, whereas the opposite trend was found for the nonmotile strains. This suggests that the rotation of the flagella enables cells to detach from the surface (at the lower fluid velocities) and strengthens adhesion (at higher fluid velocities), whereas nonmotile cells detach as a result of shear. There was no significant difference in the initial attachment rates of the two nonmotile species, which suggests that merely the presence of flagella was not important in this stage of biofilm development. Copyright 2002 Wiley Periodicals, Inc.

Endpoint-based parallel data processing in a parallel active messaging interface of a parallel computer

Science.gov (United States)

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.

New Parallel Algorithms for Landscape Evolution Model

Science.gov (United States)

Jin, Y.; Zhang, H.; Shi, Y.

2017-12-01

Most landscape evolution models (LEM) developed in the last two decades solve the diffusion equation to simulate the transportation of surface sediments. This numerical approach is difficult to parallelize due to the computation of drainage area for each node, which needs huge amount of communication if run in parallel. In order to overcome this difficulty, we developed two parallel algorithms for LEM with a stream net. One algorithm handles the partition of grid with traditional methods and applies an efficient global reduction algorithm to do the computation of drainage areas and transport rates for the stream net; the other algorithm is based on a new partition algorithm, which partitions the nodes in catchments between processes first, and then partitions the cells according to the partition of nodes. Both methods focus on decreasing communication between processes and take the advantage of massive computing techniques, and numerical experiments show that they are both adequate to handle large scale problems with millions of cells. We implemented the two algorithms in our program based on the widely used finite element library deal.II, so that it can be easily coupled with ASPECT.

The Parallel SBAS-DInSAR algorithm: an effective and scalable tool for Earth's surface displacement retrieval

Science.gov (United States)

Zinno, Ivana; De Luca, Claudio; Elefante, Stefano; Imperatore, Pasquale; Manunta, Michele; Casu, Francesco

2014-05-01

been carried out on real data acquired by ENVISAT and COSMO-SkyMed sensors. Moreover, the P-SBAS performances with respect to the size of the input dataset will also be investigated. This kind of analysis is essential for assessing the goodness of the P-SBAS algorithm and gaining insight into its applicability to different scenarios. Besides, such results will also become crucial to identify and evaluate how to appropriately exploit P-SBAS to process the forthcoming large Sentinel-1 data stream. References [1] Massonnet, D., Briole, P., Arnaud, A., "Deflation of Mount Etna monitored by Spaceborne Radar Interferometry", Nature, vol. 375, pp. 567-570, 1995. [2] Berardino, P., G. Fornaro, R. Lanari, and E. Sansosti, "A new algorithm for surface deformation monitoring based on small baseline differential SAR interferograms", IEEE Trans. Geosci. Remote Sens., vol. 40, no. 11, pp. 2375-2383, Nov. 2002. [3] Elefante, S., Imperatore, P. , Zinno, I., M. Manunta, E. Mathot, F. Brito, J. Farres, W. Lengert, R. Lanari, F. Casu, "SBAS-DINSAR Time series generation on cloud computing platforms", IEEE IGARSS 2013, July 2013, Melbourne (AU). [4] Zinno, P. Imperatore, S. Elefante, F. Casu, M. Manunta, E. Mathot, F. Brito, J. Farres, W. Lengert, R. Lanari, "A Novel Parallel Computational Framework for Processing Large INSAR Data Sets", Living Planet Symposium 2013, Sept. 9-13, 2013.

Parallel phase model : a programming model for high-end parallel machines with manycores.

Energy Technology Data Exchange (ETDEWEB)

Wu, Junfeng (Syracuse University, Syracuse, NY); Wen, Zhaofang; Heroux, Michael Allen; Brightwell, Ronald Brian

2009-04-01

This paper presents a parallel programming model, Parallel Phase Model (PPM), for next-generation high-end parallel machines based on a distributed memory architecture consisting of a networked cluster of nodes with a large number of cores on each node. PPM has a unified high-level programming abstraction that facilitates the design and implementation of parallel algorithms to exploit both the parallelism of the many cores and the parallelism at the cluster level. The programming abstraction will be suitable for expressing both fine-grained and coarse-grained parallelism. It includes a few high-level parallel programming language constructs that can be added as an extension to an existing (sequential or parallel) programming language such as C; and the implementation of PPM also includes a light-weight runtime library that runs on top of an existing network communication software layer (e.g. MPI). Design philosophy of PPM and details of the programming abstraction are also presented. Several unstructured applications that inherently require high-volume random fine-grained data accesses have been implemented in PPM with very promising results.

Systematic approach for deriving feasible mappings of parallel algorithms to parallel computing platforms

NARCIS (Netherlands)

Arkin, Ethem; Tekinerdogan, Bedir; Imre, Kayhan M.

2017-01-01

The need for high-performance computing together with the increasing trend from single processor to parallel computer architectures has leveraged the adoption of parallel computing. To benefit from parallel computing power, usually parallel algorithms are defined that can be mapped and executed

Algebraic methods in random matrices and enumerative geometry

CERN Document Server

Eynard, Bertrand

2008-01-01

We review the method of symplectic invariants recently introduced to solve matrix models loop equations, and further extended beyond the context of matrix models. For any given spectral curve, one defined a sequence of differential forms, and a sequence of complex numbers Fg . We recall the definition of the invariants Fg, and we explain their main properties, in particular symplectic invariance, integrability, modularity,... Then, we give several example of applications, in particular matrix models, enumeration of discrete surfaces (maps), algebraic geometry and topological strings, non-intersecting brownian motions,...

Parallel algorithms

CERN Document Server

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

PFLOTRAN User Manual: A Massively Parallel Reactive Flow and Transport Model for Describing Surface and Subsurface Processes

Energy Technology Data Exchange (ETDEWEB)

Lichtner, Peter C. [OFM Research, Redmond, WA (United States); Hammond, Glenn E. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lu, Chuan [Idaho National Lab. (INL), Idaho Falls, ID (United States); Karra, Satish [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Bisht, Gautam [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Andre, Benjamin [National Center for Atmospheric Research, Boulder, CO (United States); Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Mills, Richard [Intel Corporation, Portland, OR (United States); Univ. of Tennessee, Knoxville, TN (United States); Kumar, Jitendra [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2015-01-20

PFLOTRAN solves a system of generally nonlinear partial differential equations describing multi-phase, multicomponent and multiscale reactive flow and transport in porous materials. The code is designed to run on massively parallel computing architectures as well as workstations and laptops (e.g. Hammond et al., 2011). Parallelization is achieved through domain decomposition using the PETSc (Portable Extensible Toolkit for Scientific Computation) libraries for the parallelization framework (Balay et al., 1997). PFLOTRAN has been developed from the ground up for parallel scalability and has been run on up to 218 processor cores with problem sizes up to 2 billion degrees of freedom. Written in object oriented Fortran 90, the code requires the latest compilers compatible with Fortran 2003. At the time of this writing this requires gcc 4.7.x, Intel 12.1.x and PGC compilers. As a requirement of running problems with a large number of degrees of freedom, PFLOTRAN allows reading input data that is too large to fit into memory allotted to a single processor core. The current limitation to the problem size PFLOTRAN can handle is the limitation of the HDF5 file format used for parallel IO to 32 bit integers. Noting that 2³² = 4; 294; 967; 296, this gives an estimate of the maximum problem size that can be currently run with PFLOTRAN. Hopefully this limitation will be remedied in the near future.

The parallel dynamics of drift wave turbulence in the WEGA stellarator

Energy Technology Data Exchange (ETDEWEB)

Marsen, S; Endler, M; Otte, M; Wagner, F, E-mail: stefan.marsen@ipp.mpg.d [Max-Planck-Institut fuer Plasmaphysik, EURATOM Association, Wendelsteinstrasse 1, 17491 Greifswald (Germany)

2009-08-15

The three-dimensional structure of turbulence in the edge (inside the last closed flux surface) of the WEGA stellarator is studied focusing on the parallel dynamics. WEGA as a small stellarator with moderate plasma parameters offers the opportunity to study turbulence with Langmuir probes providing high spatial and temporal resolution. Multiple probes with radial, poloidal and toroidal resolution are used to measure density fluctuations. Correlation analysis is used to reconstruct a 3D picture of turbulent structures. We find that these structures originate predominantly on the low field side and have a three-dimensional character with a finite averaged parallel wavenumber. The ratio between the parallel and perpendicular wavenumber component is in the order of 10{sup -2}. The parallel dynamics are compared at magnetic inductions of 57 and 500 mT. At 500 mT, the parallel wavelength is in the order of the field line connection length 2{pi}R{iota}-bar. A frequency resolved measure of k{sub ||}/k{sub {theta}} shows a constant ratio in this case. At 57 mT the observed k{sub ||} is much smaller than at 500 mT. However, the observed small average value is due to an averaging over positive and negative components pointing parallel and antiparallel to the magnetic field vector.

Interplay between surface and bulk states in the Topological Kondo Insulator SmB6

Science.gov (United States)

Biswas, Sangram; Hatnean, Monica Ciomaga; Balakrishnan, Geetha; Bid, Aveek

Kondo insulator SmB6 is predicted to have topologically protected conducting surface states(TSS). We have studied electrical transport through surface states(SS) at ultra-low temperatures in single crystals of SmB6 using local-nonlocal transport scheme and found a large nonlocal signal at temperatures lower than bulk Kondo gap scale. Using resistance fluctuation spectroscopy, we probed the local and nonlocal transport channels and showed that at low temperatures, transport in this system takes place only through SS. The measured noise in this temperature range arises due to Universal Conductance Fluctuations whose statistics was found to be consistent with theoretical predictions for that of 2D systems in the Symplectic symmetry class. We studied the temperature dependence of noise and found that, unlike the topological insulators of the dichalcogenide family, the noise in surface and bulk conduction channels in SmB6 are uncorrelated - at sufficiently low temperatures, the bulk has no discernible contribution to electrical transport in SmB6 making it an ideal platform for probing the physics of TSS. Nanomission, Department of Science & Technology (DST) and Indian Institute of Scienc and EPSRC, UK, Grant EP/L014963/1.

SU-F-J-146: Experimental Validation of 6 MV Photon PDD in Parallel Magnetic Field Calculated by EGSnrc

Energy Technology Data Exchange (ETDEWEB)

Ghila, A; Steciw, S; Fallone, B; Rathee, S [Cross Cancer Institute, Edmonton, AB (Canada)

2016-06-15

Purpose: Integrated linac-MR systems are uniquely suited for real time tumor tracking during radiation treatment. Understanding the magnetic field dose effects and incorporating them in treatment planning is paramount for linac-MR clinical implementation. We experimentally validated the EGSnrc dose calculations in the presence of a magnetic field parallel to the radiation beam travel. Methods: Two cylindrical bore electromagnets produced a 0.21 T magnetic field parallel to the central axis of a 6 MV photon beam. A parallel plate ion chamber was used to measure the PDD in a polystyrene phantom, placed inside the bore in two setups: phantom top surface coinciding with the magnet bore center (183 cm SSD), and with the magnet bore’s top surface (170 cm SSD). We measured the field of the magnet at several points and included the exact dimensions of the coils to generate a 3D magnetic field map in a finite element model. BEAMnrc and DOSXYZnrc simulated the PDD experiments in parallel magnetic field (i.e. 3D magnetic field included) and with no magnetic field. Results: With the phantom surface at the top of the electromagnet, the surface dose increased by 10% (compared to no-magnetic field), due to electrons being focused by the smaller fringe fields of the electromagnet. With the phantom surface at the bore center, the surface dose increased by 30% since extra 13 cm of air column was in relatively higher magnetic field (>0.13T) in the magnet bore. EGSnrc Monte Carlo code correctly calculated the radiation dose with and without the magnetic field, and all points passed the 2%, 2 mm Gamma criterion when the ion chamber’s entrance window and air cavity were included in the simulated phantom. Conclusion: A parallel magnetic field increases the surface and buildup dose during irradiation. The EGSnrc package can model these magnetic field dose effects accurately. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi

Parallel algorithms for mapping pipelined and parallel computations

Science.gov (United States)

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.

A parallelized three-dimensional cellular automaton model for grain growth during additive manufacturing

Science.gov (United States)

Lian, Yanping; Lin, Stephen; Yan, Wentao; Liu, Wing Kam; Wagner, Gregory J.

2018-05-01

In this paper, a parallelized 3D cellular automaton computational model is developed to predict grain morphology for solidification of metal during the additive manufacturing process. Solidification phenomena are characterized by highly localized events, such as the nucleation and growth of multiple grains. As a result, parallelization requires careful treatment of load balancing between processors as well as interprocess communication in order to maintain a high parallel efficiency. We give a detailed summary of the formulation of the model, as well as a description of the communication strategies implemented to ensure parallel efficiency. Scaling tests on a representative problem with about half a billion cells demonstrate parallel efficiency of more than 80% on 8 processors and around 50% on 64; loss of efficiency is attributable to load imbalance due to near-surface grain nucleation in this test problem. The model is further demonstrated through an additive manufacturing simulation with resulting grain structures showing reasonable agreement with those observed in experiments.

A parallelized three-dimensional cellular automaton model for grain growth during additive manufacturing

Science.gov (United States)

Lian, Yanping; Lin, Stephen; Yan, Wentao; Liu, Wing Kam; Wagner, Gregory J.

2018-01-01

In this paper, a parallelized 3D cellular automaton computational model is developed to predict grain morphology for solidification of metal during the additive manufacturing process. Solidification phenomena are characterized by highly localized events, such as the nucleation and growth of multiple grains. As a result, parallelization requires careful treatment of load balancing between processors as well as interprocess communication in order to maintain a high parallel efficiency. We give a detailed summary of the formulation of the model, as well as a description of the communication strategies implemented to ensure parallel efficiency. Scaling tests on a representative problem with about half a billion cells demonstrate parallel efficiency of more than 80% on 8 processors and around 50% on 64; loss of efficiency is attributable to load imbalance due to near-surface grain nucleation in this test problem. The model is further demonstrated through an additive manufacturing simulation with resulting grain structures showing reasonable agreement with those observed in experiments.

Parallel computing works

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.

Parallel time domain solvers for electrically large transient scattering problems

KAUST Repository

Liu, Yang

2014-09-26

Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. This presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. The GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.

Pair of null gravitating shells: III. Algebra of Dirac's observables

International Nuclear Information System (INIS)

Kouletsis, I; Hajicek, P

2002-01-01

The study of the two-shell system started in 'pair of null gravitating shells I and II' is continued. The pull back of the Liouville form to the constraint surface, which contains complete information about the Poisson brackets of Dirac observables, is computed in the singular double-null Eddington-Finkelstein (DNEF) gauge. The resulting formula shows that the variables conjugate to the Schwarzschild masses of the intershell spacetimes are simple combinations of the values of the DNEF coordinates on these spacetimes at the shells. The formula is valid for any number of in- and outgoing shells. After applying it to the two-shell system, the symplectic form is calculated for each component of the physical phase space; regular coordinates are found, defining it as a symplectic manifold. The symplectic transformation between the initial and final values of observables for the shell-crossing case is given

Template based parallel checkpointing in a massively parallel computer system

Science.gov (United States)

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.

Surface Aggregation of Candida albicans on Glass in the Absence and Presence of Adhering Streptococcus gordonii in a Parallel-Plate Flow Chamber: A Surface Thermodynamical Analysis Based on Acid-Base Interactions.

Science.gov (United States)

Millsap; Bos; Busscher; van der Mei HC

1999-04-15

Adhesive interactions between yeasts and bacteria are important in the maintenance of infectious mixed biofilms on natural and biomaterial surfaces in the human body. In this study, the extended DLVO (Derjaguin-Landau-Verwey-Overbeek) approach has been applied to explain adhesive interactions between C. albicans ATCC 10261 and S. gordonii NCTC 7869 adhering on glass. Contact angles with different liquids and the zeta potentials of both the yeasts and bacteria were determined and their adhesive interactions were measured in a parallel-plate flow chamber.Streptococci were first allowed to adhere to the bottom glass plate of the flow chamber to different seeding densities, and subsequently deposition of yeasts was monitored with an image analysis system, yielding the degree of initial surface aggregation of the adhering yeasts and their spatial arrangement in a stationary end point. Irrespective of growth temperature, the yeast cells appeared uncharged in TNMC buffer, but yeasts grown at 37 degrees C were intrinsically more hydrophilic and had an increased electron-donating character than cells grown at 30 degrees C. All yeasts showed surface aggregation due to attractive Lifshitz-van der Waals forces. In addition, acid-base interactions between yeasts, yeasts and the glass substratum, and yeasts and the streptococci were attractive for yeasts grown at 30 degrees C, but yeasts grown at 37 degrees C only had favorable acid-base interactions with the bacteria, explaining the positive relationship between the surface coverage of the glass by streptococci and the surface aggregation of the yeasts. Copyright 1999 Academic Press.

Fourier-transform infrared anisotropy in cross and parallel sections of tendon and articular cartilage

Directory of Open Access Journals (Sweden)

Bidthanapally Aruna

2008-10-01

Full Text Available Abstract Background Fourier Transform Infrared Imaging (FTIRI is used to investigate the amide anisotropies at different surfaces of a three-dimensional cartilage or tendon block. With the change in the polarization state of the incident infrared light, the resulting anisotropic behavior of the tissue structure is described here. Methods Thin sections (6 μm thick were obtained from three different surfaces of the canine tissue blocks and imaged at 6.25 μm pixel resolution. For each section, infrared imaging experiments were repeated thirteen times with the identical parameters except a 15° increment of the analyzer's angle in the 0° – 180° angular space. The anisotropies of amide I and amide II components were studied in order to probe the orientation of the collagen fibrils at different tissue surfaces. Results For tendon, the anisotropy of amide I and amide II components in parallel sections is comparable to that of regular sections; and tendon's cross sections show distinct, but weak anisotropic behavior for both the amide components. For articular cartilage, parallel sections in the superficial zone have the expected infrared anisotropy that is consistent with that of regular sections. The parallel sections in the radial zone, however, have a nearly isotropic amide II absorption and a distinct amide I anisotropy. Conclusion From the inconsistency in amide anisotropy between superficial to radial zone in parallel section results, a schematic model is used to explain the origins of these amide anisotropies in cartilage and tendon.

Introduction to parallel programming

CERN Document Server

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

Parallelism in matrix computations

CERN Document Server

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...

Model-driven product line engineering for mapping parallel algorithms to parallel computing platforms

NARCIS (Netherlands)

Arkin, Ethem; Tekinerdogan, Bedir

2016-01-01

Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, the mapping of the algorithm to the logical configuration platform and the implementation of the

Parallelization in Modern C++

CERN Multimedia

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...

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.

Computer-Aided Parallelizer and Optimizer

Science.gov (United States)

Jin, Haoqiang

2011-01-01

The Computer-Aided Parallelizer and Optimizer (CAPO) automates the insertion of compiler directives (see figure) to facilitate parallel processing on Shared Memory Parallel (SMP) machines. While CAPO currently is integrated seamlessly into CAPTools (developed at the University of Greenwich, now marketed as ParaWise), CAPO was independently developed at Ames Research Center as one of the components for the Legacy Code Modernization (LCM) project. The current version takes serial FORTRAN programs, performs interprocedural data dependence analysis, and generates OpenMP directives. Due to the widely supported OpenMP standard, the generated OpenMP codes have the potential to run on a wide range of SMP machines. CAPO relies on accurate interprocedural data dependence information currently provided by CAPTools. Compiler directives are generated through identification of parallel loops in the outermost level, construction of parallel regions around parallel loops and optimization of parallel regions, and insertion of directives with automatic identification of private, reduction, induction, and shared variables. Attempts also have been made to identify potential pipeline parallelism (implemented with point-to-point synchronization). Although directives are generated automatically, user interaction with the tool is still important for producing good parallel codes. A comprehensive graphical user interface is included for users to interact with the parallelization process.

Data communications in a parallel active messaging interface of a parallel computer

Science.gov (United States)

Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

2013-11-12

Data communications in a parallel active messaging interface (`PAMI`) of a parallel computer composed of compute nodes that execute a parallel application, each compute node including application processors that execute the parallel application and at least one management processor dedicated to gathering information regarding data communications. The PAMI is composed of data communications endpoints, each endpoint composed of 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 and the endpoints coupled for data communications through the PAMI and through data communications resources. Embodiments function by gathering call site statistics describing data communications resulting from execution of data communications instructions and identifying in dependence upon the call cite statistics a data communications algorithm for use in executing a data communications instruction at a call site in the parallel application.

Marginal Assessment of Crowns by the Aid of Parallel Radiography

Directory of Open Access Journals (Sweden)

Farnaz Fattahi

2015-03-01

Full Text Available Introduction: Marginal adaptation is the most critical item in long-term prognosis of single crowns. This study aimed to assess the marginal quality as well asthe discrepancies in marginal integrity of some PFM single crowns of posterior teeth by employing parallel radiography in Shiraz Dental School, Shiraz, Iran. Methods: In this descriptive study, parallel radiographies were taken from 200 fabricated PFM single crowns of posterior teeth after cementation and before discharging the patient. To calculate the magnification of the images, a metallic sphere with the thickness of 4 mm was placed in the direction of the crown margin on the occlusal surface. Thereafter, the horizontal and vertical space between the crown margins, the margin of preparations and also the vertical space between the crown margin and the bone crest were measured by using digital radiological software. Results: Analysis of data by descriptive statistics revealed that 75.5% and 60% of the cases had more than the acceptable space (50µm in the vertical (130±20µm and horizontal (90±15µm dimensions, respectively. Moreover, 85% of patients were found to have either horizontal or vertical gap. In 77% of cases, the margins of crowns invaded the biologic width in the mesial and 70% in distal surfaces. Conclusion: Parallel radiography can be expedient in the stage of framework try-in to yield some important information that cannot be obtained by routine clinical evaluations and may improve the treatment prognosis

A parallel buffer tree

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....

Application Portable Parallel Library

Science.gov (United States)

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.

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.

Realization of cantilever arrays for parallel proximity imaging

International Nuclear Information System (INIS)

Sarov, Y; Ivanov, Tz; Frank, A; Zoellner, J-P; Nikolov, N; Rangelow, I W

2010-01-01

This paper reports on the fabrication and characterisation of self-actuating, and self-sensing cantilever arrays for large-scale parallel surface scanning. Each cantilever is integrated with a sharp silicon tip, a thermal-driven bimorph actuator, and a piezoresistive deflection sensor. Thus, the tip to the sample distance can be controlled individually for each cantilever. A radius of the tips below 10 nm is obtained, which enables nanometre in-plane surface imaging by Angstrom resolution in vertical direction. The fabricated cantilever probe arrays are also applicable for large-area manipulation, sub-10 nm metrology, bottom-up synthesis, high-speed gas analysis, for different bio-applications like recognition of DNA, RNA, or various biomarkers of a single disease, etc.

Totally parallel multilevel algorithms

Science.gov (United States)

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.

Surface impedance of travelling--Wave antenna in magnetized plasma

International Nuclear Information System (INIS)

Denisenko, I.B.; Ostrikov, K.N.

1993-01-01

Wave properties of metal antennas immersed in a magnetoactive plasma are intensively studied nowadays with the objects of radio communications in ionosphere, plasma heating, gas discharge technique. Many papers are devoted to studies of sheath waves (SW) in magnetoplasma, which are surface by nature and propagate along the metal-low-density sheath-plasma waveguide structure. The results of these papers suggest that the existence of these waves makes significant contribution in antenna impedance. Note that the impedance measurement is one of possible ways of experimental surface waves characterization. In the present report the surface impedance of travelling SW antenna immersed in magnetoactive plasma is calculated and its dependence on the waveguide structure parameters such as plasma density, external magnetic field H 0 and electrons collisional frequency values, sheath region width, conductivity of metal surface is studied. The calculations have been carried out in a quasiplane approximation, when antenna radius greatly exceeds the SW skin depth. Note that the finite conductivity of metal is necessary to be taken into account to provide a finite surface impedance value. The surface impedance is calculated in two cases, namely when SW propagate along (Ζ parallel ) and across (Ζ perpendicular ) the external magnetic field. The relation between the values Ζ parallel and Ζ perpendicular is obtained. This relation shows that the values Ζ parallel and Ζ parallel may satisfy both inequalities Ζ parallel much-gt Ζ perpendicular and Ζ perpendicular approx-gt Ζ perpendicular dependent on the parameters of the structure. The comparison of dispersion properties of the SW propagating along Η 0 with the experimental results is carried out. The results are shown to satisfactorily correspond to the experimental results

Research on a Novel Parallel Engraving Machine and its Key Technologies

Directory of Open Access Journals (Sweden)

Zhang Shi-hui

2008-11-01

Full Text Available In order to compensate the disadvantages of conventional engraving machine and exert the advantages of parallel mechanism, a novel parallel engraving machine is presented and some key technologies are studied in this paper. Mechanism performances are analyzed in terms of the first and the second order influence coefficient matrix firstly. So the sizes of mechanism, which are better for all the performance indices of both kinematics and dynamics, can be confirmed and the restriction due to considering only the first order influence coefficient matrix in the past is broken through. Therefore, the theory basis for designing the mechanism size of novel engraving machine with better performances is provided. In addition, method for tool path planning and control technology for engraving force is also studied in the paper. The proposed algorithm for tool path planning on curved surface can be applied to arbitrary spacial curved surface in theory, control technology for engraving force based on fuzzy neural network(FNN has well adaptability to the changing environment. Research on teleoperation for parallel engraving machine based on B/S architecture resolves the key problems such as control mode, sharing mechanism for multiuser, real-time control for engraving job and real-time transmission for video information. Simulation results further show the feasibility and validity of the proposed methods.

Research on a Novel Parallel Engraving Machine and its Key Technologies

Directory of Open Access Journals (Sweden)

Kong Ling-fu

2004-12-01

Full Text Available In order to compensate the disadvantages of conventional engraving machine and exert the advantages of parallel mechanism, a novel parallel engraving machine is presented and some key technologies are studied in this paper. Mechanism performances are analyzed in terms of the first and the second order influence coefficient matrix firstly. So the sizes of mechanism, which are better for all the performance indices of both kinematics and dynamics, can be confirmed and the restriction due to considering only the first order influence coefficient matrix in the past is broken through. Therefore, the theory basis for designing the mechanism size of novel engraving machine with better performances is provided. In addition, method for tool path planning and control technology for engraving force is also studied in the paper. The proposed algorithm for tool path planning on curved surface can be applied to arbitrary spacial curved surface in theory, control technology for engraving force based on fuzzy neural network(FNN has well adaptability to the changing environment. Research on teleoperation for parallel engraving machine based on B/S architecture resolves the key problems such as control mode, sharing mechanism for multiuser, real-time control for engraving job and real-time transmission for video information. Simulation results further show the feasibility and validity of the proposed methods.

Neural Parallel Engine: A toolbox for massively parallel neural signal processing.

Science.gov (United States)

Tam, Wing-Kin; Yang, Zhi

2018-05-01

Large-scale neural recordings provide detailed information on neuronal activities and can help elicit the underlying neural mechanisms of the brain. However, the computational burden is also formidable when we try to process the huge data stream generated by such recordings. In this study, we report the development of Neural Parallel Engine (NPE), a toolbox for massively parallel neural signal processing on graphical processing units (GPUs). It offers a selection of the most commonly used routines in neural signal processing such as spike detection and spike sorting, including advanced algorithms such as exponential-component-power-component (EC-PC) spike detection and binary pursuit spike sorting. We also propose a new method for detecting peaks in parallel through a parallel compact operation. Our toolbox is able to offer a 5× to 110× speedup compared with its CPU counterparts depending on the algorithms. A user-friendly MATLAB interface is provided to allow easy integration of the toolbox into existing workflows. Previous efforts on GPU neural signal processing only focus on a few rudimentary algorithms, are not well-optimized and often do not provide a user-friendly programming interface to fit into existing workflows. There is a strong need for a comprehensive toolbox for massively parallel neural signal processing. A new toolbox for massively parallel neural signal processing has been created. It can offer significant speedup in processing signals from large-scale recordings up to thousands of channels. Copyright © 2018 Elsevier B.V. All rights reserved.

2D-RBUC for efficient parallel compression of residuals

Science.gov (United States)

Đurđević, Đorđe M.; Tartalja, Igor I.

2018-02-01

In this paper, we present a method for lossless compression of residuals with an efficient SIMD parallel decompression. The residuals originate from lossy or near lossless compression of height fields, which are commonly used to represent models of terrains. The algorithm is founded on the existing RBUC method for compression of non-uniform data sources. We have adapted the method to capture 2D spatial locality of height fields, and developed the data decompression algorithm for modern GPU architectures already present even in home computers. In combination with the point-level SIMD-parallel lossless/lossy high field compression method HFPaC, characterized by fast progressive decompression and seamlessly reconstructed surface, the newly proposed method trades off small efficiency degradation for a non negligible compression ratio (measured up to 91%) benefit.

Modeling of stochastic broadening in a poloidally diverted discharge with piecewise analytic symplectic mapping flux functions

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

Attractor hopping between polarization dynamical states in a vertical-cavity surface-emitting laser subject to parallel optical injection

Science.gov (United States)

Denis-le Coarer, Florian; Quirce, Ana; Valle, Angel; Pesquera, Luis; Rodríguez, Miguel A.; Panajotov, Krassimir; Sciamanna, Marc

2018-03-01

We present experimental and theoretical results of noise-induced attractor hopping between dynamical states found in a single transverse mode vertical-cavity surface-emitting laser (VCSEL) subject to parallel optical injection. These transitions involve dynamical states with different polarizations of the light emitted by the VCSEL. We report an experimental map identifying, in the injected power-frequency detuning plane, regions where attractor hopping between two, or even three, different states occur. The transition between these behaviors is characterized by using residence time distributions. We find multistability regions that are characterized by heavy-tailed residence time distributions. These distributions are characterized by a -1.83 ±0.17 power law. Between these regions we find coherence enhancement of noise-induced attractor hopping in which transitions between states occur regularly. Simulation results show that frequency detuning variations and spontaneous emission noise play a role in causing switching between attractors. We also find attractor hopping between chaotic states with different polarization properties. In this case, simulation results show that spontaneous emission noise inherent to the VCSEL is enough to induce this hopping.

A possibility of parallel and anti-parallel diffraction measurements on ...

Indian Academy of Sciences (India)

However, a bent perfect crystal (BPC) monochromator at monochromatic focusing condition can provide a quite flat and equal resolution property at both parallel and anti-parallel positions and thus one can have a chance to use both sides for the diffraction experiment. From the data of the FWHM and the / measured ...

Discrete variational Hamiltonian mechanics

International Nuclear Information System (INIS)

Lall, S; West, M

2006-01-01

The main contribution of this paper is to present a canonical choice of a Hamiltonian theory corresponding to the theory of discrete Lagrangian mechanics. We make use of Lagrange duality and follow a path parallel to that used for construction of the Pontryagin principle in optimal control theory. We use duality results regarding sensitivity and separability to show the relationship between generating functions and symplectic integrators. We also discuss connections to optimal control theory and numerical algorithms

Parallel implementation of the PHOENIX generalized stellar atmosphere program. II. Wavelength parallelization

International Nuclear Information System (INIS)

Baron, E.; Hauschildt, Peter H.

1998-01-01

We describe an important addition to the parallel implementation of our generalized nonlocal thermodynamic equilibrium (NLTE) stellar atmosphere and radiative transfer computer program PHOENIX. In a previous paper in this series we described data and task parallel algorithms we have developed for radiative transfer, spectral line opacity, and NLTE opacity and rate calculations. These algorithms divided the work spatially or by spectral lines, that is, distributing the radial zones, individual spectral lines, or characteristic rays among different processors and employ, in addition, task parallelism for logically independent functions (such as atomic and molecular line opacities). For finite, monotonic velocity fields, the radiative transfer equation is an initial value problem in wavelength, and hence each wavelength point depends upon the previous one. However, for sophisticated NLTE models of both static and moving atmospheres needed to accurately describe, e.g., novae and supernovae, the number of wavelength points is very large (200,000 - 300,000) and hence parallelization over wavelength can lead both to considerable speedup in calculation time and the ability to make use of the aggregate memory available on massively parallel supercomputers. Here, we describe an implementation of a pipelined design for the wavelength parallelization of PHOENIX, where the necessary data from the processor working on a previous wavelength point is sent to the processor working on the succeeding wavelength point as soon as it is known. Our implementation uses a MIMD design based on a relatively small number of standard message passing interface (MPI) library calls and is fully portable between serial and parallel computers. copyright 1998 The American Astronomical Society

Parallel k-means++

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.

Parallel Dynamic Analysis of a Large-Scale Water Conveyance Tunnel under Seismic Excitation Using ALE Finite-Element Method

Directory of Open Access Journals (Sweden)

Xiaoqing Wang

2016-01-01

Full Text Available Parallel analyses about the dynamic responses of a large-scale water conveyance tunnel under seismic excitation are presented in this paper. A full three-dimensional numerical model considering the water-tunnel-soil coupling is established and adopted to investigate the tunnel’s dynamic responses. The movement and sloshing of the internal water are simulated using the multi-material Arbitrary Lagrangian Eulerian (ALE method. Nonlinear fluid–structure interaction (FSI between tunnel and inner water is treated by using the penalty method. Nonlinear soil-structure interaction (SSI between soil and tunnel is dealt with by using the surface to surface contact algorithm. To overcome computing power limitations and to deal with such a large-scale calculation, a parallel algorithm based on the modified recursive coordinate bisection (MRCB considering the balance of SSI and FSI loads is proposed and used. The whole simulation is accomplished on Dawning 5000 A using the proposed MRCB based parallel algorithm optimized to run on supercomputers. The simulation model and the proposed approaches are validated by comparison with the added mass method. Dynamic responses of the tunnel are analyzed and the parallelism is discussed. Besides, factors affecting the dynamic responses are investigated. Better speedup and parallel efficiency show the scalability of the parallel method and the analysis results can be used to aid in the design of water conveyance tunnels.

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)

Plane parallel radiance transport for global illumination in vegetation

Energy Technology Data Exchange (ETDEWEB)

Max, N.; Mobley, C.; Keating, B.; Wu, E.H.

1997-01-05

This paper applies plane parallel radiance transport techniques to scattering from vegetation. The leaves, stems, and branches are represented as a volume density of scattering surfaces, depending only on height and the vertical component of the surface normal. Ordinary differential equations are written for the multiply scattered radiance as a function of the height above the ground, with the sky radiance and ground reflectance as boundary conditions. They are solved using a two-pass integration scheme to unify the two-point boundary conditions, and Fourier series for the dependence on the azimuthal angle. The resulting radiance distribution is used to precompute diffuse and specular `ambient` shading tables, as a function of height and surface normal, to be used in rendering, together with a z-buffer shadow algorithm for direct solar illumination.

Solving Large Quadratic|Assignment Problems in Parallel

DEFF Research Database (Denmark)

Clausen, Jens; Perregaard, Michael

1997-01-01

and recalculation of bounds between branchings when used in a parallel Branch-and-Bound algorithm. The algorithm has been implemented on a 16-processor MEIKO Computing Surface with Intel i860 processors. Computational results from the solution of a number of large QAPs, including the classical Nugent 20...... processors, and have hence not been ideally suited for computations essentially involving non-vectorizable computations on integers.In this paper we investigate the combination of one of the best bound functions for a Branch-and-Bound algorithm (the Gilmore-Lawler bound) and various testing, variable binding...

Radiation-hard/high-speed parallel optical links

Energy Technology Data Exchange (ETDEWEB)

Gan, K.K., E-mail: gan@mps.ohio-state.edu [Department of Physics, The Ohio State University, Columbus, OH 43210 (United States); Buchholz, P.; Heidbrink, S. [Fachbereich Physik, Universität Siegen, Siegen (Germany); Kagan, H.P.; Kass, R.D.; Moore, J.; Smith, D.S. [Department of Physics, The Ohio State University, Columbus, OH 43210 (United States); Vogt, M.; Ziolkowski, M. [Fachbereich Physik, Universität Siegen, Siegen (Germany)

2016-09-21

We have designed and fabricated a compact parallel optical engine for transmitting data at 5 Gb/s. The device consists of a 4-channel ASIC driving a VCSEL (Vertical Cavity Surface Emitting Laser) array in an optical package. The ASIC is designed using only core transistors in a 65 nm CMOS process to enhance the radiation-hardness. The ASIC contains an 8-bit DAC to control the bias and modulation currents of the individual channels in the VCSEL array. The performance of the optical engine up at 5 Gb/s is satisfactory.

Experiences in Data-Parallel Programming

Directory of Open Access Journals (Sweden)

Terry W. Clark

1997-01-01

Full Text Available To efficiently parallelize a scientific application with a data-parallel compiler requires certain structural properties in the source program, and conversely, the absence of others. A recent parallelization effort of ours reinforced this observation and motivated this correspondence. Specifically, we have transformed a Fortran 77 version of GROMOS, a popular dusty-deck program for molecular dynamics, into Fortran D, a data-parallel dialect of Fortran. During this transformation we have encountered a number of difficulties that probably are neither limited to this particular application nor do they seem likely to be addressed by improved compiler technology in the near future. Our experience with GROMOS suggests a number of points to keep in mind when developing software that may at some time in its life cycle be parallelized with a data-parallel compiler. This note presents some guidelines for engineering data-parallel applications that are compatible with Fortran D or High Performance Fortran compilers.

Non-Cartesian parallel imaging reconstruction.

Science.gov (United States)

Wright, Katherine L; Hamilton, Jesse I; Griswold, Mark A; Gulani, Vikas; Seiberlich, Nicole

2014-11-01

Non-Cartesian parallel imaging has played an important role in reducing data acquisition time in MRI. The use of non-Cartesian trajectories can enable more efficient coverage of k-space, which can be leveraged to reduce scan times. These trajectories can be undersampled to achieve even faster scan times, but the resulting images may contain aliasing artifacts. Just as Cartesian parallel imaging can be used to reconstruct images from undersampled Cartesian data, non-Cartesian parallel imaging methods can mitigate aliasing artifacts by using additional spatial encoding information in the form of the nonhomogeneous sensitivities of multi-coil phased arrays. This review will begin with an overview of non-Cartesian k-space trajectories and their sampling properties, followed by an in-depth discussion of several selected non-Cartesian parallel imaging algorithms. Three representative non-Cartesian parallel imaging methods will be described, including Conjugate Gradient SENSE (CG SENSE), non-Cartesian generalized autocalibrating partially parallel acquisition (GRAPPA), and Iterative Self-Consistent Parallel Imaging Reconstruction (SPIRiT). After a discussion of these three techniques, several potential promising clinical applications of non-Cartesian parallel imaging will be covered. © 2014 Wiley Periodicals, Inc.

Influence of Paralleling Dies and Paralleling Half-Bridges on Transient Current Distribution in Multichip Power Modules

DEFF Research Database (Denmark)

Li, Helong; Zhou, Wei; Wang, Xiongfei

2018-01-01

This paper addresses the transient current distribution in the multichip half-bridge power modules, where two types of paralleling connections with different current commutation mechanisms are considered: paralleling dies and paralleling half-bridges. It reveals that with paralleling dies, both t...

Improved performance of parallel surface/packed-bed discharge reactor for indoor VOCs decomposition: optimization of the reactor structure

International Nuclear Information System (INIS)

Jiang, Nan; Hui, Chun-Xue; Li, Jie; Lu, Na; Shang, Ke-Feng; Wu, Yan; Mizuno, Akira

2015-01-01

The purpose of this paper is to develop a high-efficiency air-cleaning system for volatile organic compounds (VOCs) existing in the workshop of a chemical factory. A novel parallel surface/packed-bed discharge (PSPBD) reactor, which utilized a combination of surface discharge (SD) plasma with packed-bed discharge (PBD) plasma, was designed and employed for VOCs removal in a closed vessel. In order to optimize the structure of the PSPBD reactor, the discharge characteristic, benzene removal efficiency, and energy yield were compared for different discharge lengths, quartz tube diameters, shapes of external high-voltage electrode, packed-bed discharge gaps, and packing pellet sizes, respectively. In the circulation test, 52.8% of benzene was removed and the energy yield achieved 0.79 mg kJ −1 after a 210 min discharge treatment in the PSPBD reactor, which was 10.3% and 0.18 mg kJ −1 higher, respectively, than in the SD reactor, 21.8% and 0.34 mg kJ −1 higher, respectively, than in the PBD reactor at 53 J l −1 . The improved performance in benzene removal and energy yield can be attributed to the plasma chemistry effect of the sequential processing in the PSPBD reactor. The VOCs mineralization and organic intermediates generated during discharge treatment were followed by CO x selectivity and FT-IR analyses. The experimental results indicate that the PSPBD plasma process is an effective and energy-efficient approach for VOCs removal in an indoor environment. (paper)

Parallel Architectures and Parallel Algorithms for Integrated Vision Systems. Ph.D. Thesis

Science.gov (United States)

Choudhary, Alok Nidhi

1989-01-01

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is a system that uses vision algorithms from all levels of processing to perform for a high level application (e.g., object recognition). An IVS normally involves algorithms from low level, intermediate level, and high level vision. Designing parallel architectures for vision systems is of tremendous interest to researchers. Several issues are addressed in parallel architectures and parallel algorithms for integrated vision systems.

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.

Data communications in a parallel active messaging interface of a parallel computer

Science.gov (United States)

Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

2013-10-29

Data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, 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 and the endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a data communications instruction, the instruction characterized by an instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance with the instruction type, the transfer data from the origin endpoint to the target endpoint.

The STAPL Parallel Graph Library

KAUST Repository

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

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.)

Vectorization, parallelization and porting of nuclear codes (vectorization and parallelization). Progress report fiscal 1998

International Nuclear Information System (INIS)

Ishizuki, Shigeru; Kawai, Wataru; Nemoto, Toshiyuki; Ogasawara, Shinobu; Kume, Etsuo; Adachi, Masaaki; Kawasaki, Nobuo; Yatake, Yo-ichi

2000-03-01

Several computer codes in the nuclear field have been vectorized, parallelized and transported on the FUJITSU VPP500 system, the AP3000 system and the Paragon system at Center for Promotion of Computational Science and Engineering in Japan Atomic Energy Research Institute. We dealt with 12 codes in fiscal 1998. These results are reported in 3 parts, i.e., the vectorization and parallelization on vector processors part, the parallelization on scalar processors part and the porting part. In this report, we describe the vectorization and parallelization on vector processors. In this vectorization and parallelization on vector processors part, the vectorization of General Tokamak Circuit Simulation Program code GTCSP, the vectorization and parallelization of Molecular Dynamics NTV (n-particle, Temperature and Velocity) Simulation code MSP2, Eddy Current Analysis code EDDYCAL, Thermal Analysis Code for Test of Passive Cooling System by HENDEL T2 code THANPACST2 and MHD Equilibrium code SELENEJ on the VPP500 are described. In the parallelization on scalar processors part, the parallelization of Monte Carlo N-Particle Transport code MCNP4B2, Plasma Hydrodynamics code using Cubic Interpolated Propagation Method PHCIP and Vectorized Monte Carlo code (continuous energy model / multi-group model) MVP/GMVP on the Paragon are described. In the porting part, the porting of Monte Carlo N-Particle Transport code MCNP4B2 and Reactor Safety Analysis code RELAP5 on the AP3000 are described. (author)

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....

Quantum degenerate systems

Energy Technology Data Exchange (ETDEWEB)

Micheli, Fiorenza de [Centro de Estudios Cientificos, Arturo Prat 514, Valdivia (Chile); Instituto de Fisica, Pontificia Universidad Catolica de Valparaiso, Casilla 4059, Valparaiso (Chile); Zanelli, Jorge [Centro de Estudios Cientificos, Arturo Prat 514, Valdivia (Chile); Universidad Andres Bello, Av. Republica 440, Santiago (Chile)

2012-10-15

A degenerate dynamical system is characterized by a symplectic structure whose rank is not constant throughout phase space. Its phase space is divided into causally disconnected, nonoverlapping regions in each of which the rank of the symplectic matrix is constant, and there are no classical orbits connecting two different regions. Here the question of whether this classical disconnectedness survives quantization is addressed. Our conclusion is that in irreducible degenerate systems-in which the degeneracy cannot be eliminated by redefining variables in the action-the disconnectedness is maintained in the quantum theory: there is no quantum tunnelling across degeneracy surfaces. This shows that the degeneracy surfaces are boundaries separating distinct physical systems, not only classically, but in the quantum realm as well. The relevance of this feature for gravitation and Chern-Simons theories in higher dimensions cannot be overstated.

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)

Formation of organic layer on femtosecond laser-induced periodic surface structures

Energy Technology Data Exchange (ETDEWEB)

Yasumaru, Naoki, E-mail: yasuma@fukui-nct.ac.jp [National Institute of Technology, Fukui College, Sabae, Fukui 916-8507 (Japan); Sentoku, Eisuke [National Institute of Technology, Fukui College, Sabae, Fukui 916-8507 (Japan); Kiuchi, Junsuke [Eyetec Co., Ltd., Sabae, Fukui 916-0016 (Japan)

2017-05-31

Highlights: • Surface analyses of two types of femtosecond laser-induced periodic surface structures (LIPSS) on titanium were conducted. • The parallel-oriented ultrafine LIPSS showed the almost same roughness and chemical states as the non-irradiated Ti surface. • The well-known perpendicular-oriented LIPSS were typically covered with an organic layer similar to a cellulose derivative. - Abstract: Two types of laser-induced periodic surface structures (LIPSS) formed on titanium by femtosecond (fs) laser pulses (λ = 800 nm, τ = 180 fs, ν = 1 kHz) in air were investigated experimentally. At a laser fluence F above the ablation threshold, LIPSS with a minimum mean spacing of D < λ⁄2 were observed perpendicular to the laser polarization direction. In contrast, for F slightly below than the ablation threshold, ultrafine LIPSS with a minimum value of D < λ/10 were formed parallel to the polarization direction. The surface roughness of the parallel-oriented LIPSS was almost the same as that of the non-irradiated surface, unlike the high roughness of the perpendicular-oriented LIPSS. In addition, although the surface state of the parallel-oriented LIPSS was the same as that of the non-irradiated surface, the perpendicular-oriented LIPSS were covered with an organic thin film similar to a cellulose derivative that cannot be easily formed by conventional chemical synthesis. The results of these surface analyses indicate that these two types of LIPSS are formed through different mechanisms. This fs-laser processing technique may become a new technology for the artificial synthesis of cellulose derivatives.

Seeing or moving in parallel

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...

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

Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

Science.gov (United States)

Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.

2017-07-01

Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).

Writing parallel programs that work

CERN Multimedia

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 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.

Compiler Technology for Parallel Scientific Computation

Directory of Open Access Journals (Sweden)

Can Özturan

1994-01-01

Full Text Available There is a need for compiler technology that, given the source program, will generate efficient parallel codes for different architectures with minimal user involvement. Parallel computation is becoming indispensable in solving large-scale problems in science and engineering. Yet, the use of parallel computation is limited by the high costs of developing the needed software. To overcome this difficulty we advocate a comprehensive approach to the development of scalable architecture-independent software for scientific computation based on our experience with equational programming language (EPL. Our approach is based on a program decomposition, parallel code synthesis, and run-time support for parallel scientific computation. The program decomposition is guided by the source program annotations provided by the user. The synthesis of parallel code is based on configurations that describe the overall computation as a set of interacting components. Run-time support is provided by the compiler-generated code that redistributes computation and data during object program execution. The generated parallel code is optimized using techniques of data alignment, operator placement, wavefront determination, and memory optimization. In this article we discuss annotations, configurations, parallel code generation, and run-time support suitable for parallel programs written in the functional parallel programming language EPL and in Fortran.

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...

Parallel Computing Strategies for Irregular Algorithms

Science.gov (United States)

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.

The Glasgow Parallel Reduction Machine: Programming Shared-memory Many-core Systems using Parallel Task Composition

Directory of Open Access Journals (Sweden)

Ashkan Tousimojarad

2013-12-01

Full Text Available We present the Glasgow Parallel Reduction Machine (GPRM, a novel, flexible framework for parallel task-composition based many-core programming. We allow the programmer to structure programs into task code, written as C++ classes, and communication code, written in a restricted subset of C++ with functional semantics and parallel evaluation. In this paper we discuss the GPRM, the virtual machine framework that enables the parallel task composition approach. We focus the discussion on GPIR, the functional language used as the intermediate representation of the bytecode running on the GPRM. Using examples in this language we show the flexibility and power of our task composition framework. We demonstrate the potential using an implementation of a merge sort algorithm on a 64-core Tilera processor, as well as on a conventional Intel quad-core processor and an AMD 48-core processor system. We also compare our framework with OpenMP tasks in a parallel pointer chasing algorithm running on the Tilera processor. Our results show that the GPRM programs outperform the corresponding OpenMP codes on all test platforms, and can greatly facilitate writing of parallel programs, in particular non-data parallel algorithms such as reductions.

Streaming for Functional Data-Parallel Languages

DEFF Research Database (Denmark)

Madsen, Frederik Meisner

In this thesis, we investigate streaming as a general solution to the space inefficiency commonly found in functional data-parallel programming languages. The data-parallel paradigm maps well to parallel SIMD-style hardware. However, the traditional fully materializing execution strategy...... by extending two existing data-parallel languages: NESL and Accelerate. In the extensions we map bulk operations to data-parallel streams that can evaluate fully sequential, fully parallel or anything in between. By a dataflow, piecewise parallel execution strategy, the runtime system can adjust to any target...... flattening necessitates all sub-computations to materialize at the same time. For example, naive n by n matrix multiplication requires n^3 space in NESL because the algorithm contains n^3 independent scalar multiplications. For large values of n, this is completely unacceptable. We address the problem...

Development of novel series and parallel sensing system based on nanostructured surface enhanced Raman scattering substrate for biomedical application

Science.gov (United States)

Chang, Te-Wei

With the advance of nanofabrication, the capability of nanoscale metallic structure fabrication opens a whole new study in nanoplasmonics, which is defined as the investigation of photon-electron interaction in the vicinity of nanoscale metallic structures. The strong oscillation of free electrons at the interface between metal and surrounding dielectric material caused by propagating surface plasmon resonance (SPR) or localized surface plasmon resonance (LSPR) enables a variety of new applications in different areas, especially biological sensing techniques. One of the promising biological sensing applications by surface resonance polariton is surface enhanced Raman spectroscopy (SERS), which significantly reinforces the feeble signal of traditional Raman scattering by at least 104 times. It enables highly sensitive and precise molecule identification with the assistance of a SERS substrate. Until now, the design of new SERS substrate fabrication process is still thriving since no dominant design has emerged yet. The ideal process should be able to achieve both a high sensitivity and low cost device in a simple and reliable way. In this thesis two promising approaches for fabricating nanostructured SERS substrate are proposed: thermal dewetting technique and nanoimprint replica technique. These two techniques are demonstrated to show the capability of fabricating high performance SERS substrate in a reliable and cost efficient fashion. In addition, these two techniques have their own unique characteristics and can be integrated with other sensing techniques to build a serial or parallel sensing system. The breakthrough of a combination system with different sensing techniques overcomes the inherent limitations of SERS detection and leverages it to a whole new level of systematic sensing. The development of a sensing platform based on thermal dewetting technique is covered as the first half of this thesis. The process optimization, selection of substrate material

Patterns for Parallel Software Design

CERN Document Server

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

High performance parallel I/O

CERN Document Server

Prabhat

2014-01-01

Gain Critical Insight into the Parallel I/O EcosystemParallel I/O is an integral component of modern high performance computing (HPC), especially in storing and processing very large datasets to facilitate scientific discovery. Revealing the state of the art in this field, High Performance Parallel I/O draws on insights from leading practitioners, researchers, software architects, developers, and scientists who shed light on the parallel I/O ecosystem.The first part of the book explains how large-scale HPC facilities scope, configure, and operate systems, with an emphasis on choices of I/O har

Parallel transport of long mean-free-path plasma along open magnetic field lines: Parallel heat flux

International Nuclear Information System (INIS)

Guo Zehua; Tang Xianzhu

2012-01-01

In a long mean-free-path plasma where temperature anisotropy can be sustained, the parallel heat flux has two components with one associated with the parallel thermal energy and the other the perpendicular thermal energy. Due to the large deviation of the distribution function from local Maxwellian in an open field line plasma with low collisionality, the conventional perturbative calculation of the parallel heat flux closure in its local or non-local form is no longer applicable. Here, a non-perturbative calculation is presented for a collisionless plasma in a two-dimensional flux expander bounded by absorbing walls. Specifically, closures of previously unfamiliar form are obtained for ions and electrons, which relate two distinct components of the species parallel heat flux to the lower order fluid moments such as density, parallel flow, parallel and perpendicular temperatures, and the field quantities such as the magnetic field strength and the electrostatic potential. The plasma source and boundary condition at the absorbing wall enter explicitly in the closure calculation. Although the closure calculation does not take into account wave-particle interactions, the results based on passing orbits from steady-state collisionless drift-kinetic equation show remarkable agreement with fully kinetic-Maxwell simulations. As an example of the physical implications of the theory, the parallel heat flux closures are found to predict a surprising observation in the kinetic-Maxwell simulation of the 2D magnetic flux expander problem, where the parallel heat flux of the parallel thermal energy flows from low to high parallel temperature region.

Representing and computing regular languages on massively parallel networks

Energy Technology Data Exchange (ETDEWEB)

Miller, M.I.; O' Sullivan, J.A. (Electronic Systems and Research Lab., of Electrical Engineering, Washington Univ., St. Louis, MO (US)); Boysam, B. (Dept. of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Inst., Troy, NY (US)); Smith, K.R. (Dept. of Electrical Engineering, Southern Illinois Univ., Edwardsville, IL (US))

1991-01-01

This paper proposes a general method for incorporating rule-based constraints corresponding to regular languages into stochastic inference problems, thereby allowing for a unified representation of stochastic and syntactic pattern constraints. The authors' approach first established the formal connection of rules to Chomsky grammars, and generalizes the original work of Shannon on the encoding of rule-based channel sequences to Markov chains of maximum entropy. This maximum entropy probabilistic view leads to Gibb's representations with potentials which have their number of minima growing at precisely the exponential rate that the language of deterministically constrained sequences grow. These representations are coupled to stochastic diffusion algorithms, which sample the language-constrained sequences by visiting the energy minima according to the underlying Gibbs' probability law. The coupling to stochastic search methods yields the all-important practical result that fully parallel stochastic cellular automata may be derived to generate samples from the rule-based constraint sets. The production rules and neighborhood state structure of the language of sequences directly determines the necessary connection structures of the required parallel computing surface. Representations of this type have been mapped to the DAP-510 massively-parallel processor consisting of 1024 mesh-connected bit-serial processing elements for performing automated segmentation of electron-micrograph images.

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 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

Parallel S/sub n/ iteration schemes

International Nuclear Information System (INIS)

Wienke, B.R.; Hiromoto, R.E.

1986-01-01

The iterative, multigroup, discrete ordinates (S/sub n/) technique for solving the linear transport equation enjoys widespread usage and appeal. Serial iteration schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor HEP, the authors investigate three parallel iteration schemes for solving the one-dimensional S/sub n/ transport equation. The multigroup representation and serial iteration methods are also reviewed. This analysis represents a first attempt to extend serial S/sub n/ algorithms to parallel environments and provides good baseline estimates on ease of parallel implementation, relative algorithm efficiency, comparative speedup, and some future directions. The authors examine ordered and chaotic versions of these strategies, with and without concurrent rebalance and diffusion acceleration. Two strategies efficiently support high degrees of parallelization and appear to be robust parallel iteration techniques. The third strategy is a weaker parallel algorithm. Chaotic iteration, difficult to simulate on serial machines, holds promise and converges faster than ordered versions of the schemes. Actual parallel speedup and efficiency are high and payoff appears substantial

Large-area parallel near-field optical nanopatterning of functional materials using microsphere mask

Energy Technology Data Exchange (ETDEWEB)

Chen, G.X. [NUS Nanoscience and Nanotechnology Initiative, National University of Singapore, 2 Engineering Drive 3, Singapore 117576 (Singapore); Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore); Hong, M.H. [NUS Nanoscience and Nanotechnology Initiative, National University of Singapore, 2 Engineering Drive 3, Singapore 117576 (Singapore); Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore); Data Storage Institute, ASTAR, DSI Building, 5 Engineering Drive 1, Singapore 117608 (Singapore)], E-mail: Hong_Minghui@dsi.a-star.edu.sg; Lin, Y. [NUS Nanoscience and Nanotechnology Initiative, National University of Singapore, 2 Engineering Drive 3, Singapore 117576 (Singapore); Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore); Wang, Z.B. [Data Storage Institute, ASTAR, DSI Building, 5 Engineering Drive 1, Singapore 117608 (Singapore); Ng, D.K.T. [Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore); Data Storage Institute, ASTAR, DSI Building, 5 Engineering Drive 1, Singapore 117608 (Singapore); Xie, Q. [Data Storage Institute, ASTAR, DSI Building, 5 Engineering Drive 1, Singapore 117608 (Singapore); Tan, L.S. [NUS Nanoscience and Nanotechnology Initiative, National University of Singapore, 2 Engineering Drive 3, Singapore 117576 (Singapore); Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore); Chong, T.C. [Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore); Data Storage Institute, ASTAR, DSI Building, 5 Engineering Drive 1, Singapore 117608 (Singapore)

2008-01-31

Large-area parallel near-field optical nanopatterning on functional material surfaces was investigated with KrF excimer laser irradiation. A monolayer of silicon dioxide microspheres was self-assembled on the sample surfaces as the processing mask. Nanoholes and nanospots were obtained on silicon surfaces and thin silver films, respectively. The nanopatterning results were affected by the refractive indices of the surrounding media. Near-field optical enhancement beneath the microspheres is the physical origin of nanostructure formation. Theoretical calculation was performed to study the intensity of optical field distributions under the microspheres according to the light scattering model of a sphere on the substrate.

A simplectic formulation of relativistic particle dynamics

International Nuclear Information System (INIS)

Tulczyjew, W.M.

1976-12-01

Particle mechanics is formulated in terms of symplectic relations and infinitesimal symplectic relations. Generating functions of symplectic relations are shown to be classical counterparts of Green's functions of wave mechanics. (orig.) [de

Multipactor saturation in parallel-plate waveguides

International Nuclear Information System (INIS)

Sorolla, E.; Mattes, M.

2012-01-01

The saturation stage of a multipactor discharge is considered of interest, since it can guide towards a criterion to assess the multipactor onset. The electron cloud under multipactor regime within a parallel-plate waveguide is modeled by a thin continuous distribution of charge and the equations of motion are calculated taking into account the space charge effects. The saturation is identified by the interaction of the electron cloud with its image charge. The stability of the electron population growth is analyzed and two mechanisms of saturation to explain the steady-state multipactor for voltages near above the threshold onset are identified. The impact energy in the collision against the metal plates decreases during the electron population growth due to the attraction of the electron sheet on the image through the initial plate. When this growth remains stable till the impact energy reaches the first cross-over point, the electron surface density tends to a constant value. When the stability is broken before reaching the first cross-over point the surface charge density oscillates chaotically bounded within a certain range. In this case, an expression to calculate the maximum electron surface charge density is found whose predictions agree with the simulations when the voltage is not too high.

Vectorization, parallelization and porting of nuclear codes. Vectorization and parallelization. Progress report fiscal 1999

Energy Technology Data Exchange (ETDEWEB)

Adachi, Masaaki; Ogasawara, Shinobu; Kume, Etsuo [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment; Ishizuki, Shigeru; Nemoto, Toshiyuki; Kawasaki, Nobuo; Kawai, Wataru [Fujitsu Ltd., Tokyo (Japan); Yatake, Yo-ichi [Hitachi Ltd., Tokyo (Japan)

2001-02-01

Several computer codes in the nuclear field have been vectorized, parallelized and trans-ported on the FUJITSU VPP500 system, the AP3000 system, the SX-4 system and the Paragon system at Center for Promotion of Computational Science and Engineering in Japan Atomic Energy Research Institute. We dealt with 18 codes in fiscal 1999. These results are reported in 3 parts, i.e., the vectorization and the parallelization part on vector processors, the parallelization part on scalar processors and the porting part. In this report, we describe the vectorization and parallelization on vector processors. In this vectorization and parallelization on vector processors part, the vectorization of Relativistic Molecular Orbital Calculation code RSCAT, a microscopic transport code for high energy nuclear collisions code JAM, three-dimensional non-steady thermal-fluid analysis code STREAM, Relativistic Density Functional Theory code RDFT and High Speed Three-Dimensional Nodal Diffusion code MOSRA-Light on the VPP500 system and the SX-4 system are described. (author)

Parallel R-matrix computation

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

Implementation and performance of parallelized elegant

International Nuclear Information System (INIS)

Wang, Y.; Borland, M.

2008-01-01

The program elegant is widely used for design and modeling of linacs for free-electron lasers and energy recovery linacs, as well as storage rings and other applications. As part of a multi-year effort, we have parallelized many aspects of the code, including single-particle dynamics, wakefields, and coherent synchrotron radiation. We report on the approach used for gradual parallelization, which proved very beneficial in getting parallel features into the hands of users quickly. We also report details of parallelization of collective effects. Finally, we discuss performance of the parallelized code in various applications.

Parallelizing the spectral transform method: A comparison of alternative parallel algorithms

International Nuclear Information System (INIS)

Foster, I.; Worley, P.H.

1993-01-01

The spectral transform method is a standard numerical technique for solving partial differential equations on the sphere and is widely used in global climate modeling. In this paper, we outline different approaches to parallelizing the method and describe experiments that we are conducting to evaluate the efficiency of these approaches on parallel computers. The experiments are conducted using a testbed code that solves the nonlinear shallow water equations on a sphere, but are designed to permit evaluation in the context of a global model. They allow us to evaluate the relative merits of the approaches as a function of problem size and number of processors. The results of this study are guiding ongoing work on PCCM2, a parallel implementation of the Community Climate Model developed at the National Center for Atmospheric Research

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.)

Parallel processing for fluid dynamics applications

International Nuclear Information System (INIS)

Johnson, G.M.

1989-01-01

The impact of parallel processing on computational science and, in particular, on computational fluid dynamics is growing rapidly. In this paper, particular emphasis is given to developments which have occurred within the past two years. Parallel processing is defined and the reasons for its importance in high-performance computing are reviewed. Parallel computer architectures are classified according to the number and power of their processing units, their memory, and the nature of their connection scheme. Architectures which show promise for fluid dynamics applications are emphasized. Fluid dynamics problems are examined for parallelism inherent at the physical level. CFD algorithms and their mappings onto parallel architectures are discussed. Several example are presented to document the performance of fluid dynamics applications on present-generation parallel processing devices

Poiseuille, thermal transpiration and Couette flows of a rarefied gas between plane parallel walls with nonuniform surface properties in the transverse direction and their reciprocity relations

Science.gov (United States)

Doi, Toshiyuki

2018-04-01

Slow flows of a rarefied gas between two plane parallel walls with nonuniform surface properties are studied based on kinetic theory. It is assumed that one wall is a diffuse reflection boundary and the other wall is a Maxwell-type boundary whose accommodation coefficient varies periodically in the direction perpendicular to the flow. The time-independent Poiseuille, thermal transpiration and Couette flows are considered. The flow behavior is numerically studied based on the linearized Bhatnagar-Gross-Krook-Welander model of the Boltzmann equation. The flow field, the mass and heat flow rates in the gas, and the tangential force acting on the wall surface are studied over a wide range of the gas rarefaction degree and the parameters characterizing the distribution of the accommodation coefficient. The locally convex velocity distribution is observed in Couette flow of a highly rarefied gas, similarly to Poiseuille flow and thermal transpiration. The reciprocity relations are numerically confirmed over a wide range of the flow parameters.

Parallel discrete event simulation

NARCIS (Netherlands)

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

Data Parallel Line Relaxation (DPLR) Code User Manual: Acadia - Version 4.01.1

Science.gov (United States)

Wright, Michael J.; White, Todd; Mangini, Nancy

2009-01-01

Data-Parallel Line Relaxation (DPLR) code is a computational fluid dynamic (CFD) solver that was developed at NASA Ames Research Center to help mission support teams generate high-value predictive solutions for hypersonic flow field problems. The DPLR Code Package is an MPI-based, parallel, full three-dimensional Navier-Stokes CFD solver with generalized models for finite-rate reaction kinetics, thermal and chemical non-equilibrium, accurate high-temperature transport coefficients, and ionized flow physics incorporated into the code. DPLR also includes a large selection of generalized realistic surface boundary conditions and links to enable loose coupling with external thermal protection system (TPS) material response and shock layer radiation codes.

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.

The Galley Parallel File System

Science.gov (United States)

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.

PDDP, A Data Parallel Programming Model

Directory of Open Access Journals (Sweden)

Karen H. Warren

1996-01-01

Full Text Available PDDP, the parallel data distribution preprocessor, is a data parallel programming model for distributed memory parallel computers. PDDP implements high-performance Fortran-compatible data distribution directives and parallelism expressed by the use of Fortran 90 array syntax, the FORALL statement, and the WHERE construct. Distributed data objects belong to a global name space; other data objects are treated as local and replicated on each processor. PDDP allows the user to program in a shared memory style and generates codes that are portable to a variety of parallel machines. For interprocessor communication, PDDP uses the fastest communication primitives on each platform.

Design considerations for parallel graphics libraries

Science.gov (United States)

Crockett, Thomas W.

1994-01-01

Applications which run on parallel supercomputers are often characterized by massive datasets. Converting these vast collections of numbers to visual form has proven to be a powerful aid to comprehension. For a variety of reasons, it may be desirable to provide this visual feedback at runtime. One way to accomplish this is to exploit the available parallelism to perform graphics operations in place. In order to do this, we need appropriate parallel rendering algorithms and library interfaces. This paper provides a tutorial introduction to some of the issues which arise in designing parallel graphics libraries and their underlying rendering algorithms. The focus is on polygon rendering for distributed memory message-passing systems. We illustrate our discussion with examples from PGL, a parallel graphics library which has been developed on the Intel family of parallel systems.

First results on irradiation of ceramic parallel plate chambers with gammas and neutrons

International Nuclear Information System (INIS)

Arefiev, A.; Bencze, Gy.L.; Bizzeti, A.; Choumilov, E.; Civinini, C.; Dajko, G.; D'Alessandro, R.; Fenyvesi, A.; Ferrando, A.; Fouz, M.C.; Iglesias, A.; Ivochkin, V.; Josa, M.I.; Malinin, A.; Meschini, M.; Molnar, J.; Pojidaev, V.; Salicio, J.M.; Tanko, L.; Vesztergombi, G.

1996-01-01

Ceramic parallel plate chambers were irradiated with gamma rays and neutrons. Results on radiation resistance are presented after 60 Mrad gamma and 0.5.10 16 neutrons per cm 2 irradiation of the detector surface. Results of activation analysis of chambers made of two different ceramic materials are also presented. (orig.)

On the problem of propagation of magnetoplasma surface waves in semiconductors

International Nuclear Information System (INIS)

Davydov, A.B.; Zakharov, V.A.

1975-01-01

A calculation is made of the spectrum of surface waves traveling along a boundary separating a dielectric from a magnetized semiconductor plasma parallel or at right angles to a magnetic field B. Dispersion relationships are obtained for the k is parallel to B case and these relationships explain the origin of the investigated surface waves on the boundary of a two-component (electron-hole) plasma in InSb. An analysis is made of the dispersion of the surface waves in the k is perpendicular to B case, which leads to a nonreciprocal propagation. (author)

Surface Topography Hinders Bacterial Surface Motility.

Science.gov (United States)

Chang, Yow-Ren; Weeks, Eric R; Ducker, William A

2018-03-21

We demonstrate that the surface motility of the bacterium, Pseudomonas aeruginosa, is hindered by a crystalline hemispherical topography with wavelength in the range of 2-8 μm. The motility was determined by the analysis of time-lapse microscopy images of cells in a flowing growth medium maintained at 37 °C. The net displacement of bacteria over 5 min is much lower on surfaces containing 2-8 μm hemispheres than on flat topography, but displacement on the 1 μm hemispheres is not lower. That is, there is a threshold between 1 and 2 μm for response to the topography. Cells on the 4 μm hemispheres were more likely to travel parallel to the local crystal axis than in other directions. Cells on the 8 μm topography were less likely to travel across the crowns of the hemispheres and were also more likely to make 30°-50° turns than on flat surfaces. These results show that surface topography can act as a significant barrier to surface motility and may therefore hinder surface exploration by bacteria. Because surface exploration can be a part of the process whereby bacteria form colonies and seek nutrients, these results help to elucidate the mechanism by which surface topography hinders biofilm formation.

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...

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

Mn-silicide nanostructures aligned on massively parallel silicon nano-ribbons

International Nuclear Information System (INIS)

De Padova, Paola; Ottaviani, Carlo; Ronci, Fabio; Colonna, Stefano; Quaresima, Claudio; Cricenti, Antonio; Olivieri, Bruno; Dávila, Maria E; Hennies, Franz; Pietzsch, Annette; Shariati, Nina; Le Lay, Guy

2013-01-01

The growth of Mn nanostructures on a 1D grating of silicon nano-ribbons is investigated at atomic scale by means of scanning tunneling microscopy, low energy electron diffraction and core level photoelectron spectroscopy. The grating of silicon nano-ribbons represents an atomic scale template that can be used in a surface-driven route to control the combination of Si with Mn in the development of novel materials for spintronics devices. The Mn atoms show a preferential adsorption site on silicon atoms, forming one-dimensional nanostructures. They are parallel oriented with respect to the surface Si array, which probably predetermines the diffusion pathways of the Mn atoms during the process of nanostructure formation.

Depth-Averaged Non-Hydrostatic Hydrodynamic Model Using a New Multithreading Parallel Computing Method

Directory of Open Access Journals (Sweden)

Ling Kang

2017-03-01

Full Text Available Compared to the hydrostatic hydrodynamic model, the non-hydrostatic hydrodynamic model can accurately simulate flows that feature vertical accelerations. The model’s low computational efficiency severely restricts its wider application. This paper proposes a non-hydrostatic hydrodynamic model based on a multithreading parallel computing method. The horizontal momentum equation is obtained by integrating the Navier–Stokes equations from the bottom to the free surface. The vertical momentum equation is approximated by the Keller-box scheme. A two-step method is used to solve the model equations. A parallel strategy based on block decomposition computation is utilized. The original computational domain is subdivided into two subdomains that are physically connected via a virtual boundary technique. Two sub-threads are created and tasked with the computation of the two subdomains. The producer–consumer model and the thread lock technique are used to achieve synchronous communication between sub-threads. The validity of the model was verified by solitary wave propagation experiments over a flat bottom and slope, followed by two sinusoidal wave propagation experiments over submerged breakwater. The parallel computing method proposed here was found to effectively enhance computational efficiency and save 20%–40% computation time compared to serial computing. The parallel acceleration rate and acceleration efficiency are approximately 1.45% and 72%, respectively. The parallel computing method makes a contribution to the popularization of non-hydrostatic models.

Modeling and experimental study of oil/water contact angle on biomimetic micro-parallel-patterned self-cleaning surfaces of selected alloys used in water industry

Energy Technology Data Exchange (ETDEWEB)

Nickelsen, Simin; Moghadam, Afsaneh Dorri, E-mail: afsaneh@uwm.edu; Ferguson, J.B.; Rohatgi, Pradeep

2015-10-30

Graphical abstract: - Highlights: • Wetting behavior of four metallic materials as a function of surface roughness has been studied. • A model to predict the abrasive particle size and water/oil contact angles relationship is proposed. • Active wetting regime is determined in different materials using the proposed model. - Abstract: In the present study, the wetting behavior of surfaces of various common metallic materials used in the water industry including C84400 brass, commercially pure aluminum (99.0% pure), Nickle–Molybdenum alloy (Hastelloy C22), and 316 Stainless Steel prepared by mechanical abrasion and contact angles of several materials after mechanical abrasion were measured. A model to estimate roughness factor, R{sub f}, and fraction of solid/oil interface, ƒ{sub so}, for surfaces prepared by mechanical abrasion is proposed based on the assumption that abrasive particles acting on a metallic surface would result in scratches parallel to each other and each scratch would have a semi-round cross-section. The model geometrically describes the relation between sandpaper particle size and water/oil contact angle predicted by both the Wenzel and Cassie–Baxter contact type, which can then be used for comparison with experimental data to find which regime is active. Results show that brass and Hastelloy followed Cassie–Baxter behavior, aluminum followed Wenzel behavior and stainless steel exhibited a transition from Wenzel to Cassie–Baxter. Microstructural studies have also been done to rule out effects beyond the Wenzel and Cassie–Baxter theories such as size of structural details.

Numerical studies on the interaction between atmosphere and ocean using different kinds of parallel computers

International Nuclear Information System (INIS)

Lee, Soon-Hwan; Chino, Masamichi

2000-01-01

The coupling between atmosphere and ocean model has physical and computational difficulties for short-term forecasting of weather and ocean current. In this research, a combination system between high-resolution meso-scale atmospheric model and ocean model has been constructed using a new message-passing library, called Stampi (Seamless Thinking Aid Message Passing Interface), for prediction of particle dispersion at emergency nuclear accident. Stampi, which is based on the MPI (Message Passing Interface) 2 specification, makes us carry out parallel calculations of combination system without parallelization skill to model code. And it realizes dynamic process creation on different machines and communication between spawned one within the scope of MPI semantics. The models included in this combination system are PHYSIC as an atmosphere model, and POM (Princeton Ocean Model) as an ocean model. We applied this combination system to predict sea surface current at Sea of Japan in winter season. Simulation results indicate that the wind stress near the sea surface tends to be a predominant factor to determine surface ocean currents and dispersion of radioactive contamination in the ocean. The surface ocean current is well correspondent with wind direction, induced by high mountains at North Korea. The satellite data of NSCAT (NASA-SCATterometer), which is an image of sea surface current, also agrees well with the results of this system. (author)

Generating multiplex gradients of biomolecules for controlling cellular adhesion in parallel microfluidic channels.

Science.gov (United States)

Didar, Tohid Fatanat; Tabrizian, Maryam

2012-11-07

Here we present a microfluidic platform to generate multiplex gradients of biomolecules within parallel microfluidic channels, in which a range of multiplex concentration gradients with different profile shapes are simultaneously produced. Nonlinear polynomial gradients were also generated using this device. The gradient generation principle is based on implementing parrallel channels with each providing a different hydrodynamic resistance. The generated biomolecule gradients were then covalently functionalized onto the microchannel surfaces. Surface gradients along the channel width were a result of covalent attachments of biomolecules to the surface, which remained functional under high shear stresses (50 dyn/cm(2)). An IgG antibody conjugated to three different fluorescence dyes (FITC, Cy5 and Cy3) was used to demonstrate the resulting multiplex concentration gradients of biomolecules. The device enabled generation of gradients with up to three different biomolecules in each channel with varying concentration profiles. We were also able to produce 2-dimensional gradients in which biomolecules were distributed along the length and width of the channel. To demonstrate the applicability of the developed design, three different multiplex concentration gradients of REDV and KRSR peptides were patterned along the width of three parallel channels and adhesion of primary human umbilical vein endothelial cell (HUVEC) in each channel was subsequently investigated using a single chip.

Parallelization of 2-D lattice Boltzmann codes

International Nuclear Information System (INIS)

Suzuki, Soichiro; Kaburaki, Hideo; Yokokawa, Mitsuo.

1996-03-01

Lattice Boltzmann (LB) codes to simulate two dimensional fluid flow are developed on vector parallel computer Fujitsu VPP500 and scalar parallel computer Intel Paragon XP/S. While a 2-D domain decomposition method is used for the scalar parallel LB code, a 1-D domain decomposition method is used for the vector parallel LB code to be vectorized along with the axis perpendicular to the direction of the decomposition. High parallel efficiency of 95.1% by the vector parallel calculation on 16 processors with 1152x1152 grid and 88.6% by the scalar parallel calculation on 100 processors with 800x800 grid are obtained. The performance models are developed to analyze the performance of the LB codes. It is shown by our performance models that the execution speed of the vector parallel code is about one hundred times faster than that of the scalar parallel code with the same number of processors up to 100 processors. We also analyze the scalability in keeping the available memory size of one processor element at maximum. Our performance model predicts that the execution time of the vector parallel code increases about 3% on 500 processors. Although the 1-D domain decomposition method has in general a drawback in the interprocessor communication, the vector parallel LB code is still suitable for the large scale and/or high resolution simulations. (author)

Parallelization of 2-D lattice Boltzmann codes

Energy Technology Data Exchange (ETDEWEB)

Suzuki, Soichiro; Kaburaki, Hideo; Yokokawa, Mitsuo

1996-03-01

Lattice Boltzmann (LB) codes to simulate two dimensional fluid flow are developed on vector parallel computer Fujitsu VPP500 and scalar parallel computer Intel Paragon XP/S. While a 2-D domain decomposition method is used for the scalar parallel LB code, a 1-D domain decomposition method is used for the vector parallel LB code to be vectorized along with the axis perpendicular to the direction of the decomposition. High parallel efficiency of 95.1% by the vector parallel calculation on 16 processors with 1152x1152 grid and 88.6% by the scalar parallel calculation on 100 processors with 800x800 grid are obtained. The performance models are developed to analyze the performance of the LB codes. It is shown by our performance models that the execution speed of the vector parallel code is about one hundred times faster than that of the scalar parallel code with the same number of processors up to 100 processors. We also analyze the scalability in keeping the available memory size of one processor element at maximum. Our performance model predicts that the execution time of the vector parallel code increases about 3% on 500 processors. Although the 1-D domain decomposition method has in general a drawback in the interprocessor communication, the vector parallel LB code is still suitable for the large scale and/or high resolution simulations. (author).

Explorations of the implementation of a parallel IDW interpolation algorithm in a Linux cluster-based parallel GIS

Science.gov (United States)

Huang, Fang; Liu, Dingsheng; Tan, Xicheng; Wang, Jian; Chen, Yunping; He, Binbin

2011-04-01

To design and implement an open-source parallel GIS (OP-GIS) based on a Linux cluster, the parallel inverse distance weighting (IDW) interpolation algorithm has been chosen as an example to explore the working model and the principle of algorithm parallel pattern (APP), one of the parallelization patterns for OP-GIS. Based on an analysis of the serial IDW interpolation algorithm of GRASS GIS, this paper has proposed and designed a specific parallel IDW interpolation algorithm, incorporating both single process, multiple data (SPMD) and master/slave (M/S) programming modes. The main steps of the parallel IDW interpolation algorithm are: (1) the master node packages the related information, and then broadcasts it to the slave nodes; (2) each node calculates its assigned data extent along one row using the serial algorithm; (3) the master node gathers the data from all nodes; and (4) iterations continue until all rows have been processed, after which the results are outputted. According to the experiments performed in the course of this work, the parallel IDW interpolation algorithm can attain an efficiency greater than 0.93 compared with similar algorithms, which indicates that the parallel algorithm can greatly reduce processing time and maximize speed and performance.

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

Parallel Implicit Algorithms for CFD

Science.gov (United States)

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.

Parallel kinematics type, kinematics, and optimal design

CERN Document Server

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...

Experiments with parallel algorithms for combinatorial problems

NARCIS (Netherlands)

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

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

The STAPL Parallel Graph Library

KAUST Repository

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.

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....

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 0. 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....

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

Science.gov (United States)

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 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.

DEVELOPMENT AND USE OF A PARALLEL-PLATE FLOW CHAMBER FOR STUDYING CELLULAR ADHESION TO SOLID-SURFACES

NARCIS (Netherlands)

VANKOOTEN, TG; SCHAKENRAAD, JM; VANDERMEI, HC; BUSSCHER, HJ

A parallel-plate flow chamber is developed in order to study cellular adhesion phenomena. An image analysis system is used to observe individual cells exposed to flow in situ and to determine area, perimeter, and shape of these cells as a function of time and shear stress. With this flow system the

Shared Variable Oriented Parallel Precompiler for SPMD Model

Institute of Scientific and Technical Information of China (English)

无

1995-01-01

For the moment,commercial parallel computer systems with distributed memory architecture are usually provided with parallel FORTRAN or parallel C compliers,which are just traditional sequential FORTRAN or C compilers expanded with communication statements.Programmers suffer from writing parallel programs with communication statements. The Shared Variable Oriented Parallel Precompiler (SVOPP) proposed in this paper can automatically generate appropriate communication statements based on shared variables for SPMD(Single Program Multiple Data) computation model and greatly ease the parallel programming with high communication efficiency.The core function of parallel C precompiler has been successfully verified on a transputer-based parallel computer.Its prominent performance shows that SVOPP is probably a break-through in parallel programming technique.

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.

Programming massively parallel processors a hands-on approach

CERN Document Server

Kirk, David B

2010-01-01

Programming Massively Parallel Processors discusses basic concepts about parallel programming and GPU architecture. ""Massively parallel"" refers to the use of a large number of processors to perform a set of computations in a coordinated parallel way. The book details various techniques for constructing parallel programs. It also discusses the development process, performance level, floating-point format, parallel patterns, and dynamic parallelism. The book serves as a teaching guide where parallel programming is the main topic of the course. It builds on the basics of C programming for CUDA, a parallel programming environment that is supported on NVI- DIA GPUs. Composed of 12 chapters, the book begins with basic information about the GPU as a parallel computer source. It also explains the main concepts of CUDA, data parallelism, and the importance of memory access efficiency using CUDA. The target audience of the book is graduate and undergraduate students from all science and engineering disciplines who ...

Parallel computing simulation of fluid flow in the unsaturated zone of Yucca Mountain, Nevada

International Nuclear Information System (INIS)

Zhang, Keni; Wu, Yu-Shu; Bodvarsson, G.S.

2001-01-01

This paper presents the application of parallel computing techniques to large-scale modeling of fluid flow in the unsaturated zone (UZ) at Yucca Mountain, Nevada. In this study, parallel computing techniques, as implemented into the TOUGH2 code, are applied in large-scale numerical simulations on a distributed-memory parallel computer. The modeling study has been conducted using an over-one-million-cell three-dimensional numerical model, which incorporates a wide variety of field data for the highly heterogeneous fractured formation at Yucca Mountain. The objective of this study is to analyze the impact of various surface infiltration scenarios (under current and possible future climates) on flow through the UZ system, using various hydrogeological conceptual models with refined grids. The results indicate that the one-million-cell models produce better resolution results and reveal some flow patterns that cannot be obtained using coarse-grid modeling models

Exploiting Symmetry on Parallel Architectures.

Science.gov (United States)

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.

Advanced parallel processing with supercomputer architectures

International Nuclear Information System (INIS)

Hwang, K.

1987-01-01

This paper investigates advanced parallel processing techniques and innovative hardware/software architectures that can be applied to boost the performance of supercomputers. Critical issues on architectural choices, parallel languages, compiling techniques, resource management, concurrency control, programming environment, parallel algorithms, and performance enhancement methods are examined and the best answers are presented. The authors cover advanced processing techniques suitable for supercomputers, high-end mainframes, minisupers, and array processors. The coverage emphasizes vectorization, multitasking, multiprocessing, and distributed computing. In order to achieve these operation modes, parallel languages, smart compilers, synchronization mechanisms, load balancing methods, mapping parallel algorithms, operating system functions, application library, and multidiscipline interactions are investigated to ensure high performance. At the end, they assess the potentials of optical and neural technologies for developing future supercomputers

Endpoint-based parallel data processing with non-blocking collective instructions in a parallel active messaging interface of a parallel computer

Science.gov (United States)

Archer, Charles J; Blocksome, Michael A; Cernohous, Bob R; Ratterman, Joseph D; Smith, Brian E

2014-11-11

Endpoint-based parallel data processing with non-blocking collective instructions in a PAMI of a parallel computer is disclosed. The PAMI is composed of data communications endpoints, each 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 are coupled for data communications through the PAMI. The parallel application establishes a data communications geometry specifying a set of endpoints that are used in collective operations of the PAMI by associating with the geometry a list of collective algorithms valid for use with the endpoints of the geometry; registering in each endpoint in the geometry a dispatch callback function for a collective operation; and executing without blocking, through a single one of the endpoints in the geometry, an instruction for the collective operation.

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.

An Introduction to Parallel Computation R

Indian Academy of Sciences (India)

How are they programmed? This article provides an introduction. A parallel computer is a network of processors built for ... and have been used to solve problems much faster than a single ... in parallel computer design is to select an organization which ..... The most ambitious approach to parallel computing is to develop.

Building a parallel file system simulator

International Nuclear Information System (INIS)

Molina-Estolano, E; Maltzahn, C; Brandt, S A; Bent, J

2009-01-01

Parallel file systems are gaining in popularity in high-end computing centers as well as commercial data centers. High-end computing systems are expected to scale exponentially and to pose new challenges to their storage scalability in terms of cost and power. To address these challenges scientists and file system designers will need a thorough understanding of the design space of parallel file systems. Yet there exist few systematic studies of parallel file system behavior at petabyte- and exabyte scale. An important reason is the significant cost of getting access to large-scale hardware to test parallel file systems. To contribute to this understanding we are building a parallel file system simulator that can simulate parallel file systems at very large scale. Our goal is to simulate petabyte-scale parallel file systems on a small cluster or even a single machine in reasonable time and fidelity. With this simulator, file system experts will be able to tune existing file systems for specific workloads, scientists and file system deployment engineers will be able to better communicate workload requirements, file system designers and researchers will be able to try out design alternatives and innovations at scale, and instructors will be able to study very large-scale parallel file system behavior in the class room. In this paper we describe our approach and provide preliminary results that are encouraging both in terms of fidelity and simulation scalability.

Professional Parallel Programming with C# Master Parallel Extensions with NET 4

CERN Document Server

Hillar, Gastón

2010-01-01

Expert guidance for those programming today's dual-core processors PCs As PC processors explode from one or two to now eight processors, there is an urgent need for programmers to master concurrent programming. This book dives deep into the latest technologies available to programmers for creating professional parallel applications using C#, .NET 4, and Visual Studio 2010. The book covers task-based programming, coordination data structures, PLINQ, thread pools, asynchronous programming model, and more. It also teaches other parallel programming techniques, such as SIMD and vectorization.Teach

About the geometry of the Earth geodetic reference surfaces

Science.gov (United States)

Husár, Ladislav; Švaral, Peter; Janák, Juraj

2017-10-01

The paper focuses on the comparison of metrics of three most common reference surfaces of the Earth used in geodesy (excluding the plane which also belongs to reference surfaces used in geodesy when dealing with small areas): a sphere, an ellipsoid of revolution and a triaxial ellipsoid. The two latter surfaces are treated in a more detailed way. First, the mathematical form of the metric tensors using three types of coordinates is derived and the lengths of meridian and parallel arcs between the two types of ellipsoids are compared. Three kinds of parallels, according to the type of latitude, can be defined on a triaxial ellipsoid. We show that two types of parallels are spatial curves and one is represented by ellipses. The differences of curvature of both kinds of ellipsoid are analysed using the normal curvature radii. Priority of the chosen triaxial ellipsoid is documented by its better fit with respect to the high-degree geoid model EIGEN6c4 computed up to degree and order 2160.

Parallelization for first principles electronic state calculation program

International Nuclear Information System (INIS)

Watanabe, Hiroshi; Oguchi, Tamio.

1997-03-01

In this report we study the parallelization for First principles electronic state calculation program. The target machines are NEC SX-4 for shared memory type parallelization and FUJITSU VPP300 for distributed memory type parallelization. The features of each parallel machine are surveyed, and the parallelization methods suitable for each are proposed. It is shown that 1.60 times acceleration is achieved with 2 CPU parallelization by SX-4 and 4.97 times acceleration is achieved with 12 PE parallelization by VPP 300. (author)

Parallel computation

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

Neoclassical parallel flow calculation in the presence of external parallel momentum sources in Heliotron J

Energy Technology Data Exchange (ETDEWEB)

Nishioka, K.; Nakamura, Y. [Graduate School of Energy Science, Kyoto University, Gokasho, Uji, Kyoto 611-0011 (Japan); Nishimura, S. [National Institute for Fusion Science, 322-6 Oroshi-cho, Toki, Gifu 509-5292 (Japan); Lee, H. Y. [Korea Advanced Institute of Science and Technology, Daejeon 305-701 (Korea, Republic of); Kobayashi, S.; Mizuuchi, T.; Nagasaki, K.; Okada, H.; Minami, T.; Kado, S.; Yamamoto, S.; Ohshima, S.; Konoshima, S.; Sano, F. [Institute of Advanced Energy, Kyoto University, Gokasho, Uji, Kyoto 611-0011 (Japan)

2016-03-15

A moment approach to calculate neoclassical transport in non-axisymmetric torus plasmas composed of multiple ion species is extended to include the external parallel momentum sources due to unbalanced tangential neutral beam injections (NBIs). The momentum sources that are included in the parallel momentum balance are calculated from the collision operators of background particles with fast ions. This method is applied for the clarification of the physical mechanism of the neoclassical parallel ion flows and the multi-ion species effect on them in Heliotron J NBI plasmas. It is found that parallel ion flow can be determined by the balance between the parallel viscosity and the external momentum source in the region where the external source is much larger than the thermodynamic force driven source in the collisional plasmas. This is because the friction between C{sup 6+} and D{sup +} prevents a large difference between C{sup 6+} and D{sup +} flow velocities in such plasmas. The C{sup 6+} flow velocities, which are measured by the charge exchange recombination spectroscopy system, are numerically evaluated with this method. It is shown that the experimentally measured C{sup 6+} impurity flow velocities do not contradict clearly with the neoclassical estimations, and the dependence of parallel flow velocities on the magnetic field ripples is consistent in both results.

Structural Properties of G,T-Parallel Duplexes

Directory of Open Access Journals (Sweden)

Anna Aviñó

2010-01-01

Full Text Available The structure of G,T-parallel-stranded duplexes of DNA carrying similar amounts of adenine and guanine residues is studied by means of molecular dynamics (MD simulations and UV- and CD spectroscopies. In addition the impact of the substitution of adenine by 8-aminoadenine and guanine by 8-aminoguanine is analyzed. The presence of 8-aminoadenine and 8-aminoguanine stabilizes the parallel duplex structure. Binding of these oligonucleotides to their target polypyrimidine sequences to form the corresponding G,T-parallel triplex was not observed. Instead, when unmodified parallel-stranded duplexes were mixed with their polypyrimidine target, an interstrand Watson-Crick duplex was formed. As predicted by theoretical calculations parallel-stranded duplexes carrying 8-aminopurines did not bind to their target. The preference for the parallel-duplex over the Watson-Crick antiparallel duplex is attributed to the strong stabilization of the parallel duplex produced by the 8-aminopurines. Theoretical studies show that the isomorphism of the triads is crucial for the stability of the parallel triplex.

High-speed parallel solution of the neutron diffusion equation with the hierarchical domain decomposition boundary element method incorporating parallel communications

International Nuclear Information System (INIS)

Tsuji, Masashi; Chiba, Gou

2000-01-01

A hierarchical domain decomposition boundary element method (HDD-BEM) for solving the multiregion neutron diffusion equation (NDE) has been fully parallelized, both for numerical computations and for data communications, to accomplish a high parallel efficiency on distributed memory message passing parallel computers. Data exchanges between node processors that are repeated during iteration processes of HDD-BEM are implemented, without any intervention of the host processor that was used to supervise parallel processing in the conventional parallelized HDD-BEM (P-HDD-BEM). Thus, the parallel processing can be executed with only cooperative operations of node processors. The communication overhead was even the dominant time consuming part in the conventional P-HDD-BEM, and the parallelization efficiency decreased steeply with the increase of the number of processors. With the parallel data communication, the efficiency is affected only by the number of boundary elements assigned to decomposed subregions, and the communication overhead can be drastically reduced. This feature can be particularly advantageous in the analysis of three-dimensional problems where a large number of processors are required. The proposed P-HDD-BEM offers a promising solution to the deterioration problem of parallel efficiency and opens a new path to parallel computations of NDEs on distributed memory message passing parallel computers. (author)

Parallel education: what is it?

OpenAIRE

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...

Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism.

Science.gov (United States)

Bhandarkar, S M; Chirravuri, S; Arnold, J

1996-01-01

Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.

On synchronous parallel computations with independent probabilistic choice

International Nuclear Information System (INIS)

Reif, J.H.

1984-01-01

This paper introduces probabilistic choice to synchronous parallel machine models; in particular parallel RAMs. The power of probabilistic choice in parallel computations is illustrate by parallelizing some known probabilistic sequential algorithms. The authors characterize the computational complexity of time, space, and processor bounded probabilistic parallel RAMs in terms of the computational complexity of probabilistic sequential RAMs. They show that parallelism uniformly speeds up time bounded probabilistic sequential RAM computations by nearly a quadratic factor. They also show that probabilistic choice can be eliminated from parallel computations by introducing nonuniformity

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.

Noncommutative configuration space. Classical and quantum mechanical aspects

OpenAIRE

Vanhecke, F. J.; Sigaud, C.; da Silva, A. R.

2005-01-01

In this work we examine noncommutativity of position coordinates in classical symplectic mechanics and its quantisation. In coordinates $\\{q^i,p_k\\}$ the canonical symplectic two-form is $\\omega_0=dq^i\\wedge dp_i$. It is well known in symplectic mechanics {\\bf\\cite{Souriau,Abraham,Guillemin}} that the interaction of a charged particle with a magnetic field can be described in a Hamiltonian formalism without a choice of a potential. This is done by means of a modified symplectic two-form $\\ome...

Seidel-Smith cohomology for tangles

DEFF Research Database (Denmark)

Rezazadegan, Reza

2009-01-01

We generalize the “symplectic Khovanov cohomology” of Seidel and Smith (Duke Math J 134(3):453–514, 2006) to tangles using the notion of symplectic valued topological field theory introduced by Wehrheim and Woodward (arXiv:0905.1368).......We generalize the “symplectic Khovanov cohomology” of Seidel and Smith (Duke Math J 134(3):453–514, 2006) to tangles using the notion of symplectic valued topological field theory introduced by Wehrheim and Woodward (arXiv:0905.1368)....

Resistor Combinations for Parallel Circuits.

Science.gov (United States)

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)

Coarse-grain parallel solution of few-group neutron diffusion equations

International Nuclear Information System (INIS)

Sarsour, H.N.; Turinsky, P.J.

1991-01-01

The authors present a parallel numerical algorithm for the solution of the finite difference representation of the few-group neutron diffusion equations. The targeted architectures are multiprocessor computers with shared memory like the Cray Y-MP and the IBM 3090/VF, where coarse granularity is important for minimizing overhead. Most of the work done in the past, which attempts to exploit concurrence, has concentrated on the inner iterations of the standard outer-inner iterative strategy. This produces very fine granularity. To coarsen granularity, the authors introduce parallelism at the nested outer-inner level. The problem's spatial domain was partitioned into contiguous subregions and assigned a processor to solve for each subregion independent of all other subregions, hence, processors; i.e., each subregion is treated as a reactor core with imposed boundary conditions. Since those boundary conditions on interior surfaces, referred to as internal boundary conditions (IBCs), are not known, a third iterative level, the recomposition iterations, is introduced to communicate results between subregions

Parallelization methods study of thermal-hydraulics codes

International Nuclear Information System (INIS)

Gaudart, Catherine

2000-01-01

The variety of parallelization methods and machines leads to a wide selection for programmers. In this study we suggest, in an industrial context, some solutions from the experience acquired through different parallelization methods. The study is about several scientific codes which simulate a large variety of thermal-hydraulics phenomena. A bibliography on parallelization methods and a first analysis of the codes showed the difficulty of our process on the whole applications to study. Therefore, it would be necessary to identify and extract a representative part of these applications and parallelization methods. The linear solver part of the codes forced itself. On this particular part several parallelization methods had been used. From these developments one could estimate the necessary work for a non initiate programmer to parallelize his application, and the impact of the development constraints. The different methods of parallelization tested are the numerical library PETSc, the parallelizer PAF, the language HPF, the formalism PEI and the communications library MPI and PYM. In order to test several methods on different applications and to follow the constraint of minimization of the modifications in codes, a tool called SPS (Server of Parallel Solvers) had be developed. We propose to describe the different constraints about the optimization of codes in an industrial context, to present the solutions given by the tool SPS, to show the development of the linear solver part with the tested parallelization methods and lastly to compare the results against the imposed criteria. (author) [fr

Simulation Exploration through Immersive Parallel Planes

Energy Technology Data Exchange (ETDEWEB)

Brunhart-Lupo, Nicholas J [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Bush, Brian W [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gruchalla, Kenny M [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Smith, Steve [Los Alamos Visualization Associates

2017-05-25

We present a visualization-driven simulation system that tightly couples systems dynamics simulations with an immersive virtual environment to allow analysts to rapidly develop and test hypotheses in a high-dimensional parameter space. To accomplish this, we generalize the two-dimensional parallel-coordinates statistical graphic as an immersive 'parallel-planes' visualization for multivariate time series emitted by simulations running in parallel with the visualization. In contrast to traditional parallel coordinate's mapping the multivariate dimensions onto coordinate axes represented by a series of parallel lines, we map pairs of the multivariate dimensions onto a series of parallel rectangles. As in the case of parallel coordinates, each individual observation in the dataset is mapped to a polyline whose vertices coincide with its coordinate values. Regions of the rectangles can be 'brushed' to highlight and select observations of interest: a 'slider' control allows the user to filter the observations by their time coordinate. In an immersive virtual environment, users interact with the parallel planes using a joystick that can select regions on the planes, manipulate selection, and filter time. The brushing and selection actions are used to both explore existing data as well as to launch additional simulations corresponding to the visually selected portions of the input parameter space. As soon as the new simulations complete, their resulting observations are displayed in the virtual environment. This tight feedback loop between simulation and immersive analytics accelerates users' realization of insights about the simulation and its output.

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.

Massively Parallel Finite Element Programming

KAUST Repository

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.

Massively Parallel Finite Element Programming

KAUST Repository

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.

Collectively loading an application in a parallel computer

Science.gov (United States)

Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.; Miller, Samuel J.; Mundy, Michael B.

2016-01-05

Collectively loading an application in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: identifying, by a parallel computer control system, a subset of compute nodes in the parallel computer to execute a job; selecting, by the parallel computer control system, one of the subset of compute nodes in the parallel computer as a job leader compute node; retrieving, by the job leader compute node from computer memory, an application for executing the job; and broadcasting, by the job leader to the subset of compute nodes in the parallel computer, the application for executing the job.

Productive Parallel Programming: The PCN Approach

Directory of Open Access Journals (Sweden)

Ian Foster

1992-01-01

Full Text Available We describe the PCN programming system, focusing on those features designed to improve the productivity of scientists and engineers using parallel supercomputers. These features include a simple notation for the concise specification of concurrent algorithms, the ability to incorporate existing Fortran and C code into parallel applications, facilities for reusing parallel program components, a portable toolkit that allows applications to be developed on a workstation or small parallel computer and run unchanged on supercomputers, and integrated debugging and performance analysis tools. We survey representative scientific applications and identify problem classes for which PCN has proved particularly useful.

High-resolution brain SPECT imaging by combination of parallel and tilted detector heads.

Science.gov (United States)

Suzuki, Atsuro; Takeuchi, Wataru; Ishitsu, Takafumi; Morimoto, Yuichi; Kobashi, Keiji; Ueno, Yuichiro

2015-10-01

To improve the spatial resolution of brain single-photon emission computed tomography (SPECT), we propose a new brain SPECT system in which the detector heads are tilted towards the rotation axis so that they are closer to the brain. In addition, parallel detector heads are used to obtain the complete projection data set. We evaluated this parallel and tilted detector head system (PT-SPECT) in simulations. In the simulation study, the tilt angle of the detector heads relative to the axis was 45°. The distance from the collimator surface of the parallel detector heads to the axis was 130 mm. The distance from the collimator surface of the tilted detector heads to the origin on the axis was 110 mm. A CdTe semiconductor panel with a 1.4 mm detector pitch and a parallel-hole collimator were employed in both types of detector head. A line source phantom, cold-rod brain-shaped phantom, and cerebral blood flow phantom were evaluated. The projection data were generated by forward-projection of the phantom images using physics models, and Poisson noise at clinical levels was applied to the projection data. The ordered-subsets expectation maximization algorithm with physics models was used. We also evaluated conventional SPECT using four parallel detector heads for the sake of comparison. The evaluation of the line source phantom showed that the transaxial FWHM in the central slice for conventional SPECT ranged from 6.1 to 8.5 mm, while that for PT-SPECT ranged from 5.3 to 6.9 mm. The cold-rod brain-shaped phantom image showed that conventional SPECT could visualize up to 8-mm-diameter rods. By contrast, PT-SPECT could visualize up to 6-mm-diameter rods in upper slices of a cerebrum. The cerebral blood flow phantom image showed that the PT-SPECT system provided higher resolution at the thalamus and caudate nucleus as well as at the longitudinal fissure of the cerebrum compared with conventional SPECT. PT-SPECT provides improved image resolution at not only upper but also at

Parallel-In-Time For Moving Meshes

Energy Technology Data Exchange (ETDEWEB)

Falgout, R. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Manteuffel, T. A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Southworth, B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Schroder, J. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2016-02-04

With steadily growing computational resources available, scientists must develop e ective ways to utilize the increased resources. High performance, highly parallel software has be- come a standard. However until recent years parallelism has focused primarily on the spatial domain. When solving a space-time partial di erential equation (PDE), this leads to a sequential bottleneck in the temporal dimension, particularly when taking a large number of time steps. The XBraid parallel-in-time library was developed as a practical way to add temporal parallelism to existing se- quential codes with only minor modi cations. In this work, a rezoning-type moving mesh is applied to a di usion problem and formulated in a parallel-in-time framework. Tests and scaling studies are run using XBraid and demonstrate excellent results for the simple model problem considered herein.

Integrated Task And Data Parallel Programming: Language Design

Science.gov (United States)

Grimshaw, Andrew S.; West, Emily A.

1998-01-01

his research investigates the combination of task and data parallel language constructs within a single programming language. There are an number of applications that exhibit properties which would be well served by such an integrated language. Examples include global climate models, aircraft design problems, and multidisciplinary design optimization problems. Our approach incorporates data parallel language constructs into an existing, object oriented, task parallel language. The language will support creation and manipulation of parallel classes and objects of both types (task parallel and data parallel). Ultimately, the language will allow data parallel and task parallel classes to be used either as building blocks or managers of parallel objects of either type, thus allowing the development of single and multi-paradigm parallel applications. 1995 Research Accomplishments In February I presented a paper at Frontiers '95 describing the design of the data parallel language subset. During the spring I wrote and defended my dissertation proposal. Since that time I have developed a runtime model for the language subset. I have begun implementing the model and hand-coding simple examples which demonstrate the language subset. I have identified an astrophysical fluid flow application which will validate the data parallel language subset. 1996 Research Agenda Milestones for the coming year include implementing a significant portion of the data parallel language subset over the Legion system. Using simple hand-coded methods, I plan to demonstrate (1) concurrent task and data parallel objects and (2) task parallel objects managing both task and data parallel objects. My next steps will focus on constructing a compiler and implementing the fluid flow application with the language. Concurrently, I will conduct a search for a real-world application exhibiting both task and data parallelism within the same program m. Additional 1995 Activities During the fall I collaborated

Performance of the Galley Parallel File System

Science.gov (United States)

Nieuwejaar, Nils; Kotz, David

1996-01-01

As the input/output (I/O) needs of parallel scientific applications increase, file systems for multiprocessors are being designed to provide applications with parallel access to multiple disks. Many parallel file systems present applications with a conventional Unix-like interface that allows the application to access multiple disks transparently. This interface conceals the parallism within the file system, which increases the ease of programmability, but makes it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. Furthermore, most current parallel 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 parallel workloads. Initial experiments, reported in this paper, indicate that Galley is capable of providing high-performance 1/O to applications the applications that rely on them. In Section 3 we describe that access data in patterns that have been observed to be common.

Unified Singularity Modeling and Reconfiguration of 3rTPS Metamorphic Parallel Mechanisms with Parallel Constraint Screws

Directory of Open Access Journals (Sweden)

Yufeng Zhuang

2015-01-01

Full Text Available This paper presents a unified singularity modeling and reconfiguration analysis of variable topologies of a class of metamorphic parallel mechanisms with parallel constraint screws. The new parallel mechanisms consist of three reconfigurable rTPS limbs that have two working phases stemming from the reconfigurable Hooke (rT joint. While one phase has full mobility, the other supplies a constraint force to the platform. Based on these, the platform constraint screw systems show that the new metamorphic parallel mechanisms have four topologies by altering the limb phases with mobility change among 1R2T (one rotation with two translations, 2R2T, and 3R2T and mobility 6. Geometric conditions of the mechanism design are investigated with some special topologies illustrated considering the limb arrangement. Following this and the actuation scheme analysis, a unified Jacobian matrix is formed using screw theory to include the change between geometric constraints and actuation constraints in the topology reconfiguration. Various singular configurations are identified by analyzing screw dependency in the Jacobian matrix. The work in this paper provides basis for singularity-free workspace analysis and optimal design of the class of metamorphic parallel mechanisms with parallel constraint screws which shows simple geometric constraints with potential simple kinematics and dynamics properties.

Radiographic film: surface dose extrapolation techniques

International Nuclear Information System (INIS)

Cheung, T.; Yu, P.K.N.; Butson, M.J.; Cancer Services, Wollongong, NSW; Currie, M.

2004-01-01

Full text: Assessment of surface dose delivered from radiotherapy x-ray beams for optimal results should be performed both inside and outside the prescribed treatment fields An extrapolation technique can be used with radiographic film to perform surface dose assessment for open field high energy x-ray beams. This can produce an accurate 2 dimensional map of surface dose if required. Results have shown that surface % dose can be estimated within ±3% of parallel plate ionisation chamber results with radiographic film using a series of film layers to produce an extrapolated result. Extrapolated percentage dose assessment for 10cm, 20cmand 30cm square fields was estimated to be 15% ± 2%, 29% ± 3% and 38% ± 3% at the central axis and relatively uniform across the treatment field. Corresponding parallel plate ionisation chamber measurement are 16%, 27% and 37% respectively. Surface doses are also measured outside the treatment field which are mainly due to scattered electron contamination. To achieve this result, film calibration curves must be irradiated to similar x-ray field sizes as the experimental film to minimize quantitative variations in film optical density caused by varying x-ray spectrum with field size. Copyright (2004) Australasian College of Physical Scientists and Engineers in Medicine

Infrared studies of gold nanochains on the Si(557) stepped surface

Energy Technology Data Exchange (ETDEWEB)

Vu Hoang, Chung; Klevenz, Markus; Lovrincic, Robert; Skibbe, Olaf; Neubrech, Frank; Pucci, Annemarie [Kirchhoff-Institut fuer Physik der Universitaet Heidelberg (Germany)

2008-07-01

Gold nanochains on Si(557) will be fabricated under ultra high vacuum conditions. The terraces of the stepped surface serve as one-dimensional diffusion channels, which leads to the formation of parallel monoatomic chains. Due to the appearance of metallic chains an anisotropic change of the conductivity of the substrate surface can be expected. The chain growth process and conductivity dependence versus gold composition will be investigated in-situ by using transmittance infrared spectroscopy (IRS) with light polarized parallel and perpendicular to the chains, respectively. IRS is a well-established method to observe conductivity changes on surfaces. The temperature dependent behaviour of gold chains will be studied as well.

Continuous development of schemes for parallel computing of the electrostatics in biological systems: implementation in DelPhi.

Science.gov (United States)

Li, Chuan; Petukh, Marharyta; Li, Lin; Alexov, Emil

2013-08-15

Due to the enormous importance of electrostatics in molecular biology, calculating the electrostatic potential and corresponding energies has become a standard computational approach for the study of biomolecules and nano-objects immersed in water and salt phase or other media. However, the electrostatics of large macromolecules and macromolecular complexes, including nano-objects, may not be obtainable via explicit methods and even the standard continuum electrostatics methods may not be applicable due to high computational time and memory requirements. Here, we report further development of the parallelization scheme reported in our previous work (Li, et al., J. Comput. Chem. 2012, 33, 1960) to include parallelization of the molecular surface and energy calculations components of the algorithm. The parallelization scheme utilizes different approaches such as space domain parallelization, algorithmic parallelization, multithreading, and task scheduling, depending on the quantity being calculated. This allows for efficient use of the computing resources of the corresponding computer cluster. The parallelization scheme is implemented in the popular software DelPhi and results in speedup of several folds. As a demonstration of the efficiency and capability of this methodology, the electrostatic potential, and electric field distributions are calculated for the bovine mitochondrial supercomplex illustrating their complex topology, which cannot be obtained by modeling the supercomplex components alone. Copyright © 2013 Wiley Periodicals, Inc.

Fast ℓ1-SPIRiT Compressed Sensing Parallel Imaging MRI: Scalable Parallel Implementation and Clinically Feasible Runtime

Science.gov (United States)

Murphy, Mark; Alley, Marcus; Demmel, James; Keutzer, Kurt; Vasanawala, Shreyas; Lustig, Michael

2012-01-01

We present ℓ1-SPIRiT, a simple algorithm for auto calibrating parallel imaging (acPI) and compressed sensing (CS) that permits an efficient implementation with clinically-feasible runtimes. We propose a CS objective function that minimizes cross-channel joint sparsity in the Wavelet domain. Our reconstruction minimizes this objective via iterative soft-thresholding, and integrates naturally with iterative Self-Consistent Parallel Imaging (SPIRiT). Like many iterative MRI reconstructions, ℓ1-SPIRiT’s image quality comes at a high computational cost. Excessively long runtimes are a barrier to the clinical use of any reconstruction approach, and thus we discuss our approach to efficiently parallelizing ℓ1-SPIRiT and to achieving clinically-feasible runtimes. We present parallelizations of ℓ1-SPIRiT for both multi-GPU systems and multi-core CPUs, and discuss the software optimization and parallelization decisions made in our implementation. The performance of these alternatives depends on the processor architecture, the size of the image matrix, and the number of parallel imaging channels. Fundamentally, achieving fast runtime requires the correct trade-off between cache usage and parallelization overheads. We demonstrate image quality via a case from our clinical experimentation, using a custom 3DFT Spoiled Gradient Echo (SPGR) sequence with up to 8× acceleration via poisson-disc undersampling in the two phase-encoded directions. PMID:22345529

Parallel and non-parallel laminar mixed convection flow in an inclined tube: The effect of the boundary conditions

International Nuclear Information System (INIS)

Barletta, A.

2008-01-01

The necessary condition for the onset of parallel flow in the fully developed region of an inclined duct is applied to the case of a circular tube. Parallel flow in inclined ducts is an uncommon regime, since in most cases buoyancy tends to produce the onset of secondary flow. The present study shows how proper thermal boundary conditions may preserve parallel flow regime. Mixed convection flow is studied for a special non-axisymmetric thermal boundary condition that, with a proper choice of a switch parameter, may be compatible with parallel flow. More precisely, a circumferentially variable heat flux distribution is prescribed on the tube wall, expressed as a sinusoidal function of the azimuthal coordinate θ with period 2π. A π/2 rotation in the position of the maximum heat flux, achieved by setting the switch parameter, may allow or not the existence of parallel flow. Two cases are considered corresponding to parallel and non-parallel flow. In the first case, the governing balance equations allow a simple analytical solution. On the contrary, in the second case, the local balance equations are solved numerically by employing a finite element method

Parallel programming with Easy Java Simulations

Science.gov (United States)

Esquembre, F.; Christian, W.; Belloni, M.

2018-01-01

Nearly all of today's processors are multicore, and ideally programming and algorithm development utilizing the entire processor should be introduced early in the computational physics curriculum. Parallel programming is often not introduced because it requires a new programming environment and uses constructs that are unfamiliar to many teachers. We describe how we decrease the barrier to parallel programming by using a java-based programming environment to treat problems in the usual undergraduate curriculum. We use the easy java simulations programming and authoring tool to create the program's graphical user interface together with objects based on those developed by Kaminsky [Building Parallel Programs (Course Technology, Boston, 2010)] to handle common parallel programming tasks. Shared-memory parallel implementations of physics problems, such as time evolution of the Schrödinger equation, are available as source code and as ready-to-run programs from the AAPT-ComPADRE digital library.

The surface diffusion coefficient for an arbitrarily curved fluid-fluid interface. (I). General expression

Science.gov (United States)

M. C. Sagis, Leonard

2001-03-01

In this paper, we develop a theory for the calculation of the surface diffusion coefficient for an arbitrarily curved fluid-fluid interface. The theory is valid for systems in hydrodynamic equilibrium, with zero mass-averaged velocities in the bulk and interfacial regions. We restrict our attention to systems with isotropic bulk phases, and an interfacial region that is isotropic in the plane parallel to the dividing surface. The dividing surface is assumed to be a simple interface, without memory effects or yield stresses. We derive an expression for the surface diffusion coefficient in terms of two parameters of the interfacial region: the coefficient for plane-parallel diffusion D (AB)aa(ξ) , and the driving force d(B)I||(ξ) . This driving force is the parallel component of the driving force for diffusion in the interfacial region. We derive an expression for this driving force using the entropy balance.

Multicoil resonance-based parallel array for smart wireless power delivery.

Science.gov (United States)

Mirbozorgi, S A; Sawan, M; Gosselin, B

2013-01-01

This paper presents a novel resonance-based multicoil structure as a smart power surface to wirelessly power up apparatus like mobile, animal headstage, implanted devices, etc. The proposed powering system is based on a 4-coil resonance-based inductive link, the resonance coil of which is formed by an array of several paralleled coils as a smart power transmitter. The power transmitter employs simple circuit connections and includes only one power driver circuit per multicoil resonance-based array, which enables higher power transfer efficiency and power delivery to the load. The power transmitted by the driver circuit is proportional to the load seen by the individual coil in the array. Thus, the transmitted power scales with respect to the load of the electric/electronic system to power up, and does not divide equally over every parallel coils that form the array. Instead, only the loaded coils of the parallel array transmit significant part of total transmitted power to the receiver. Such adaptive behavior enables superior power, size and cost efficiency then other solutions since it does not need to use complex detection circuitry to find the location of the load. The performance of the proposed structure is verified by measurement results. Natural load detection and covering 4 times bigger area than conventional topologies with a power transfer efficiency of 55% are the novelties of presented paper.

Parallelism and Scalability in an Image Processing Application

DEFF Research Database (Denmark)

Rasmussen, Morten Sleth; Stuart, Matthias Bo; Karlsson, Sven

2008-01-01

parallel programs. This paper investigates parallelism and scalability of an embedded image processing application. The major challenges faced when parallelizing the application were to extract enough parallelism from the application and to reduce load imbalance. The application has limited immediately......The recent trends in processor architecture show that parallel processing is moving into new areas of computing in the form of many-core desktop processors and multi-processor system-on-chip. This means that parallel processing is required in application areas that traditionally have not used...

Parallelism and Scalability in an Image Processing Application

DEFF Research Database (Denmark)

Rasmussen, Morten Sleth; Stuart, Matthias Bo; Karlsson, Sven

2009-01-01

parallel programs. This paper investigates parallelism and scalability of an embedded image processing application. The major challenges faced when parallelizing the application were to extract enough parallelism from the application and to reduce load imbalance. The application has limited immediately......The recent trends in processor architecture show that parallel processing is moving into new areas of computing in the form of many-core desktop processors and multi-processor system-on-chips. This means that parallel processing is required in application areas that traditionally have not used...

Parallel auto-correlative statistics with VTK.

Energy Technology Data Exchange (ETDEWEB)

Pebay, Philippe Pierre; Bennett, Janine Camille

2013-08-01

This report summarizes existing statistical engines in VTK and presents both the serial and parallel auto-correlative statistics engines. It is a sequel to [PT08, BPRT09b, PT09, BPT09, PT10] which studied the parallel descriptive, correlative, multi-correlative, principal component analysis, contingency, k-means, and order statistics engines. The ease of use of the new parallel auto-correlative statistics engine is illustrated by the means of C++ code snippets and algorithm verification is provided. This report justifies the design of the statistics engines with parallel scalability in mind, and provides scalability and speed-up analysis results for the autocorrelative statistics engine.

Conformal pure radiation with parallel rays

International Nuclear Information System (INIS)

Leistner, Thomas; Paweł Nurowski

2012-01-01

We define pure radiation metrics with parallel rays to be n-dimensional pseudo-Riemannian metrics that admit a parallel null line bundle K and whose Ricci tensor vanishes on vectors that are orthogonal to K. We give necessary conditions in terms of the Weyl, Cotton and Bach tensors for a pseudo-Riemannian metric to be conformal to a pure radiation metric with parallel rays. Then, we derive conditions in terms of the tractor calculus that are equivalent to the existence of a pure radiation metric with parallel rays in a conformal class. We also give analogous results for n-dimensional pseudo-Riemannian pp-waves. (paper)

Surface Reconstruction from Parallel Curves with Application to Parietal Bone Fracture Reconstruction.

Directory of Open Access Journals (Sweden)

Abdul Majeed

Full Text Available Maxillofacial trauma are common, secondary to road traffic accident, sports injury, falls and require sophisticated radiological imaging to precisely diagnose. A direct surgical reconstruction is complex and require clinical expertise. Bio-modelling helps in reconstructing surface model from 2D contours. In this manuscript we have constructed the 3D surface using 2D Computerized Tomography (CT scan contours. The fracture part of the cranial vault are reconstructed using GC1 rational cubic Ball curve with three free parameters, later the 2D contours are flipped into 3D with equidistant z component. The constructed surface is represented by contours blending interpolant. At the end of this manuscript a case report of parietal bone fracture is also illustrated by employing this method with a Graphical User Interface (GUI illustration.

The influence of collisional and anomalous radial diffusion on parallel ion transport in edge plasmas

International Nuclear Information System (INIS)

Helander, P.; Hazeltine, R.D.; Catto, P.J.

1996-01-01

The orderings in the kinetic equations commonly used to study the plasma core of a tokamak do not allow a balance between parallel ion streaming and radial diffusion, and are, therefore, inappropriate in the plasma edge. Different orderings are required in the edge region where radial transport across the steep gradients associated with the scrape-off layer is large enough to balance the rapid parallel flow caused by conditions close to collecting surfaces (such as the Bohm sheath condition). In the present work, we derive and solve novel kinetic equations, allowing for such a balance, and construct distinctive transport laws for impure, collisional, edge plasmas in which the perpendicular transport is (i) due to Coulomb collisions of ions with heavy impurities, or (ii) governed by anomalous diffusion driven by electrostatic turbulence. In both the collisional and anomalous radial transport cases, we find that one single diffusion coefficient determines the radial transport of particles, momentum and heat. The parallel transport laws and parallel thermal force in the scrape-off layer assume an unconventional form, in which the relative ion-impurity flow is driven by a combination of the conventional parallel gradients, and new (i) collisional or (ii) anomalous terms involving products of radial derivatives of the temperature and density with the radial shear of the parallel velocity. Thus, in the presence of anomalous radial diffusion, the parallel ion transport cannot be entirely classical, as usually assumed in numerical edge computations. The underlying physical reason is the appearance of a novel type of parallel thermal force resulting from the combined action of anomalous diffusion and radial temperature and velocity gradients. In highly sheared flows the new terms can modify impurity penetration into the core plasma

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

A task parallel implementation of fast multipole methods

KAUST Repository