DOCSLIB.ORG

New Computational Methods for NLO and NNLO Calculations in QCD

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
New Computational Methods for NLO and NNLO Calculations in QCD New computational methods for NLO and NNLO calculations in QCD Stefan Weinzierl Institut für Physik, Universität Mainz I: Techniques already encountered at LO II: Methods at NLO III: Steps towards NNLO Part I: Prelude Physics is about numbers Monte Carlo integration We are interested in multi-dimensional integrals: n I = d u f (u1,...,u ) Z n [0,1]n Evaluate the integrand at N random points ~u j =(u j,1,...,u j,n). 1 N I = ∑ f (~u j) N j=1 Error scales as 1 σ ∼ √N Simulation of scattering events pdf’s hard parton hadronisation and decay scattering shower Underlying event: Interactions of the proton remnants. Multiple interactions: more than one pair of partons undergo hard scattering Pile-up events: more than one hadron-hadron scattering within a bunch crossing Fixed-order calculations Done at the parton level with quarks and gluons. Usually only a few partons in the final state. Amplitudes calculated in perturbation theory. Method of choice to describe well-separated jets. pdf’s hard scattering The master formula for the calculation of observables 1 1 O = dx1 fa(x1) dx2 fb(x2) ∑Z Z 2K sˆ spin spin colour colour h i a,b ( ) na nb na nb pdf’s flux factor average over initial spins and colours | {z } 2 dφn O(p1,..., p|n){z }An |2 {z } ×∑ Z | + | n observable amplitude integral over phase space | {z } | {z } | {z } We will discuss: Required properties of observables • Calculation of the amplitude • Integration over the phase space • Part I Infrared-safe observables Soft and collinear particles A particle detector has a finite resolution. Finite angular resolution: A pair of particles moving in (almost) the same direction • can not be resolved below a certain angle. We call these particles a pair of collinear particles. Example: An electron and a photon not resolved by the electromagnetic calorimeter. Detection only above a certain threshold: A particle with an energy below a certain • threshold will not be detected. We call this particle a soft particle. Example: A low-energy photon. Infrared-safe observables Observables which do not depend on long-distance behaviour, are called infrared-safe observables and can reliably be calculated in perturbation theory. In particular, it is required that they do not change value, if infinitessimal soft or collinear particles are added. For example: collinear : lim On(p1,..., pi,..., p j,..., pn)= On 1(p1,..., pi j,..., pn) pi p j − || soft : lim On(p1,..., p j,..., pn)= On 1(p1,..., p j 1, p j+1,..., pn) p j 0 − − → Event shapes Event shapes are observables calculated from all particles in an event. Typical examples of infrared-safe event shapes in electron-positron annihilation are thrust, heavy jet mass, wide jet broadening, total jet broadening, C parameter, etc. Definition: Thrust ∑ ~pi nˆ i | · | T = max nˆ ∑ ~pi i | | For two particles back-to-back one has T = 1 For many particles, isotropically distributed we have 1 T = 2 Spherocity versus sphericity Spherocity: 2 2 ∑ ~pi⊥ 4 i | | S = min π nˆ ∑ ~pi i | | Sphericity: 2 2 ~p 4 ∑ i⊥ min i | | 2 π nˆ ∑ ~pi i | | Sphericity is not infrared-safe ! (Altarelli, Phys. Rept. 1981) ... however this does not stop experimentalists from measuring it ... (Aleph 1990) Jet algorithms The most fine-grained look at hadronic events consistent with infrared safety is given by classifying the particles into jets. Ingredients for a sequential recombination algorithm: a resolution variable yi j where a smaller yi j means that particles i and j are “closer”; • 2(1 cosθi j) yDurham = − min(E2,E2) i j Q2 i j a combination procedure which combines two four-momenta into one; • µ µ µ p(i j) = pi + p j. a cut-off y which provides a stopping point for the algorithm. • cut Jet algorithms In electron-positron annihilation one uses mainly exclusive jet algorithms, where • each particle in an event is assigned uniquely to one jet. In hadron-hadron collisions one uses mainly inclusive jet algorithms, where each • particle is either assigned uniquely to one jet or to no jet at all. One distinguishes further sequential recombination algorithm and cone algorithms. • Infrared-safe cone algorithm: SISCone. Once jets are defined we can look at cross sections, p distributions, rapidity ⊥ • distributions, etc. Modeling of jets In a perturbative calculation jets are modeled by only a few partons. This improves with the order to which the calculation is done. y At leading order: cut y y At next-to-leading order: cut cut y y y At next-to-next-to-leading order: cut cut cut Part I Amplitudes Quantum chromodynamics QCD describes quarks and gluons. The gauge group is the non-Abelian group SU(3). 1 L = Fa Faµν + ψ¯ (i∂/ + gγµT aAa m )ψ QCD 4 µν ∑ µ q − quarks − Field strength: a a a abc b c F = ∂µA ∂νA + gf A A µν ν − µ µ ν SU(3) matrices: T a,T b = if abcT c If we neglect quark masses, then QCD depends on one parameter g2 α = s 4π Perturbation theory Due to the smallness of the coupling constants αs at high energies, we may compute the amplitude reliable in perturbation theory, n 2 (0) 2 (1) 4 (2) 6 (3) An = g − An + g An + g An + g An + ... (l) An : amplitude with n external particles and l loops. Some examples of diagrams: (0) (1) (2) A4 A4 A4 | {z } | {z } | {z } Perturbation theory We need the amplitude squared: At leading order (LO) only Born amplitudes contribute: ∗ g4 ∼ At next-to-leading order (NLO): One-loop amplitudes and Born amplitudes with an additional parton. ∗ ∗ 2 Re + g6, virtual part g6, real part ∼ ∼ | {z } | {z } Real part contributes whenever the additional parton is not resolved. Perturbation theory Perturbative expansion of the amplitude squared (LO, NLO, NNLO): 2 2 2 2n 4 (0) 2n 2 (0) (1) 2n (1) (0) (2) An = g − A + g − 2 Re A ∗ A + g A + 2 Re A ∗ A | | n n n n n n virtual Born one-loop squared and two-loop | {z } | {z } | {z } 2 2 2n 2 (0) 2n (0) ∗ (1) An 1 = g − A + g 2 Re A A | + | n+1 n+1 n+1 loop+unresolved real | {z } | {z } 2 2 2n (0) An 2 = g A | + | n+2 double unresolved | {z } Feynman rules Each piece of a Feynman diagram corresponds to a mathematical expression: External edge: µ,a a = εµ(k) Internal edge: i k k µ,a µ ν ab ν,b = gµν +(1 ξ) δ k2 − − k2 Vertex: µ k1,a abc µν λ λ νλ µ µ λµ ν ν = gf g k1 k2 + g (k2 k3)+ g (k3 k1) λ kν,b − − − k3,c 2 h i Inconveniences we know to handle Loop amplitudes may have ultraviolet and infrared (soft and collinear) divergences. • Dimensional regularisation is the method of choice for the regularisation of loop • integrals. Ultraviolet divergences are removed by renormalisation. • Phase space integration for the real emission diverges in the soft or collinear region. • Unitarity requires the same regularisation (i.e. dimensional regularisation) for these • divergences. Infrared divergences cancel between real and virtual contribution, or with an • additional collinear counterterm in the case of initial-state partons. The textbook method The amplitude is given as a sum of Feynman diagrams. • Squaring the amplitude implies summing over spins and colour. • One-loop tensor integrals can always be reduced to scalar integrals • (Passarino-Veltman). All one-loop scalar integrals are known. • Phase space slicing or subtraction method to handle infrared divergences. • Works in principle, but not in practice ... An analogy: Testing prime numbers To check if an integer N is prime, For 2 j √N check if j divides N. • ≤ ≤ If such a j is found, N is not prime. • Otherwise N is prime. • Works in principle, but not in practice ... Brute force Number of Feynman Feynman rules: diagrams contributing to gg ng at tree level: → abc = gf (k2 k3)µg +(k3 k1)νg − νλ − λµ 2 4 +(k1 k2)λgµν] 3 25 − 4 220 5 2485 2 abe ecd 6 34300 = ig f f g gνρ gµρg − µλ − νλ 7 559405 ace ebd + f f gµνgλρ gµρgλν 8 10525900 − ade ebc + f f gµνgλρ gµλgνρ − Feynman diagrams are not the method of choice ! Helicity amplitudes Suppose that an amplitude is given as the sum of N Feynman diagrams. To calculate the amplitude squared à la Bjorken-Drell: Sum over all spins and use kµnν + nµkν ∑εµ∗(k,λ)εν(k,λ) = gµν + , λ − kn ∑u(p,λ)u¯(p,λ) = p/ + m, λ ∑v(p,λ)v¯(p,λ) = p/ m. λ − This gives of the order N2 terms. Better: For each spin configuration evaluate the amplitude to a complex number. Taking the norm of a complex number is a cheap operation. Spinors Spinors are solutions of the Dirac equation. For massless particles two-component Weyl spinors are a convenient choice: 1 p 1 p+ p+ = − ⊥∗ p = | i p p+ | −i p p | +| | +| ⊥ p 1 p1 p+ = ( p , p+) p = (p+, p ) h | p − ⊥ h −| p ⊥∗ | +| | +| p p Light-cone coordinates: p+ = p0 + p3, p = p0 p3, p = p1 + ip2, p = p1 ip2 − − ⊥ ⊥∗ − Spinor products: pq = p q+ , [qp]= q + p . h i h −| i h | −i The spinor products are anti-symmetric. Bra-ket notation versus dotted-undotted indices Two different notations for the same thing: p+ = pB p + = p ˙ | i h | A ˙ p = pB p = pA | −i h −| The spinor helicity method Gluon polarisation vectors: + k + γµ q+ k γµ q εµ (k,q)= h | | i , εµ−(k,q)= h −| | −i √2 q k+ √2 k + q h −| i h | −i q is an arbitrary light-like reference momentum.
Load more

Recommended publications
  • Numerical Solution of Ordinary Differential Equations
    NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS Kendall Atkinson, Weimin Han, David Stewart University of Iowa Iowa City, Iowa A JOHN WILEY & SONS, INC., PUBLICATION Copyright c 2009 by John Wiley & Sons, Inc. All rights reserved. Published by John Wiley & Sons, Inc., Hoboken, New Jersey. Published simultaneously in Canada. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 646-8600, or on the web at www.copyright.com. Requests to the Publisher for permission should be addressed to the Permissions Department, John Wiley & Sons, Inc., 111 River Street, Hoboken, NJ 07030, (201) 748-6011, fax (201) 748-6008. Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created ore extended by sales representatives or written sales materials. The advice and strategies contained herin may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages.
    [Show full text]
  • Numerical Integration
    Chapter 12 Numerical Integration Numerical differentiation methods compute approximations to the derivative of a function from known values of the function. Numerical integration uses the same information to compute numerical approximations to the integral of the function. An important use of both types of methods is estimation of derivatives and integrals for functions that are only known at isolated points, as is the case with for example measurement data. An important difference between differen- tiation and integration is that for most functions it is not possible to determine the integral via symbolic methods, but we can still compute numerical approx- imations to virtually any definite integral. Numerical integration methods are therefore more useful than numerical differentiation methods, and are essential in many practical situations. We use the same general strategy for deriving numerical integration meth- ods as we did for numerical differentiation methods: We find the polynomial that interpolates the function at some suitable points, and use the integral of the polynomial as an approximation to the function. This means that the truncation error can be analysed in basically the same way as for numerical differentiation. However, when it comes to round-off error, integration behaves differently from differentiation: Numerical integration is very insensitive to round-off errors, so we will ignore round-off in our analysis. The mathematical definition of the integral is basically via a numerical in- tegration method, and we therefore start by reviewing this definition. We then derive the simplest numerical integration method, and see how its error can be analysed. We then derive two other methods that are more accurate, but for these we just indicate how the error analysis can be done.
    [Show full text]
  • Perturbation Theory and Exact Solutions
    PERTURBATION THEORY AND EXACT SOLUTIONS by J J. LODDER R|nhtdnn Report 76~96 DISSIPATIVE MOTION PERTURBATION THEORY AND EXACT SOLUTIONS J J. LODOER ASSOCIATIE EURATOM-FOM Jun»»76 FOM-INST1TUUT VOOR PLASMAFYSICA RUNHUIZEN - JUTPHAAS - NEDERLAND DISSIPATIVE MOTION PERTURBATION THEORY AND EXACT SOLUTIONS by JJ LODDER R^nhuizen Report 76-95 Thisworkwat performed at part of th«r«Mvchprogmmncof thcHMCiattofiafrccmentof EnratoniOTd th« Stichting voor FundtmenteelOiutereoek der Matctk" (FOM) wtihnnmcWMppoft from the Nederhmdie Organiutic voor Zuiver Wetemchap- pcigk Onderzoek (ZWO) and Evntom It it abo pabHtfMd w a the* of Ac Univenrty of Utrecht CONTENTS page SUMMARY iii I. INTRODUCTION 1 II. GENERALIZED FUNCTIONS DEFINED ON DISCONTINUOUS TEST FUNC­ TIONS AND THEIR FOURIER, LAPLACE, AND HILBERT TRANSFORMS 1. Introduction 4 2. Discontinuous test functions 5 3. Differentiation 7 4. Powers of x. The partie finie 10 5. Fourier transforms 16 6. Laplace transforms 20 7. Hubert transforms 20 8. Dispersion relations 21 III. PERTURBATION THEORY 1. Introduction 24 2. Arbitrary potential, momentum coupling 24 3. Dissipative equation of motion 31 4. Expectation values 32 5. Matrix elements, transition probabilities 33 6. Harmonic oscillator 36 7. Classical mechanics and quantum corrections 36 8. Discussion of the Pu strength function 38 IV. EXACTLY SOLVABLE MODELS FOR DISSIPATIVE MOTION 1. Introduction 40 2. General quadratic Kami1tonians 41 3. Differential equations 46 4. Classical mechanics and quantum corrections 49 5. Equation of motion for observables 51 V. SPECIAL QUADRATIC HAMILTONIANS 1. Introduction 53 2. Hamiltcnians with coordinate coupling 53 3. Double coordinate coupled Hamiltonians 62 4. Symmetric Hamiltonians 63 i page VI. DISCUSSION 1. Introduction 66 ?.
    [Show full text]
  • Chapter 8 Stability Theory
    Chapter 8 Stability theory We discuss properties of solutions of a first order two dimensional system, and stability theory for a special class of linear systems. We denote the independent variable by ‘t’ in place of ‘x’, and x,y denote dependent variables. Let I ⊆ R be an interval, and Ω ⊆ R2 be a domain. Let us consider the system dx = F (t, x, y), dt (8.1) dy = G(t, x, y), dt where the functions are defined on I × Ω, and are locally Lipschitz w.r.t. variable (x, y) ∈ Ω. Definition 8.1 (Autonomous system) A system of ODE having the form (8.1) is called an autonomous system if the functions F (t, x, y) and G(t, x, y) are constant w.r.t. variable t. That is, dx = F (x, y), dt (8.2) dy = G(x, y), dt Definition 8.2 A point (x0, y0) ∈ Ω is said to be a critical point of the autonomous system (8.2) if F (x0, y0) = G(x0, y0) = 0. (8.3) A critical point is also called an equilibrium point, a rest point. Definition 8.3 Let (x(t), y(t)) be a solution of a two-dimensional (planar) autonomous system (8.2). The trace of (x(t), y(t)) as t varies is a curve in the plane. This curve is called trajectory. Remark 8.4 (On solutions of autonomous systems) (i) Two different solutions may represent the same trajectory. For, (1) If (x1(t), y1(t)) defined on an interval J is a solution of the autonomous system (8.2), then the pair of functions (x2(t), y2(t)) defined by (x2(t), y2(t)) := (x1(t − s), y1(t − s)), for t ∈ s + J (8.4) is a solution on interval s + J, for every arbitrary but fixed s ∈ R.
    [Show full text]
  • On the Numerical Solution of Equations Involving Differential Operators with Constant Coefficients 1
    ON THE NUMERICAL SOLUTION OF EQUATIONS 219 The author acknowledges with thanks the aid of Dolores Ufford, who assisted in the calculations. Yudell L. Luke Midwest Research Institute Kansas City 2, Missouri 1 W. E. Milne, "The remainder in linear methods of approximation," NBS, Jn. of Research, v. 43, 1949, p. 501-511. 2W. E. Milne, Numerical Calculus, p. 108-116. 3 M. Bates, On the Development of Some New Formulas for Numerical Integration. Stanford University, June, 1929. 4 M. E. Youngberg, Formulas for Mechanical Quadrature of Irrational Functions. Oregon State College, June, 1937. (The author is indebted to the referee for references 3 and 4.) 6 E. L. Kaplan, "Numerical integration near a singularity," Jn. Math. Phys., v. 26, April, 1952, p. 1-28. On the Numerical Solution of Equations Involving Differential Operators with Constant Coefficients 1. The General Linear Differential Operator. Consider the differential equation of order n (1) Ly + Fiy, x) = 0, where the operator L is defined by j» dky **£**»%- and the functions Pk(x) and Fiy, x) are such that a solution y and its first m derivatives exist in 0 < x < X. In the special case when (1) is linear the solution can be completely determined by the well known method of varia- tion of parameters when n independent solutions of the associated homo- geneous equations are known. Thus for the case when Fiy, x) is independent of y, the solution of the non-homogeneous equation can be obtained by mere quadratures, rather than by laborious stepwise integrations. It does not seem to have been observed, however, that even when Fiy, x) involves the dependent variable y, the numerical integrations can be so arranged that the contributions to the integral from the upper limit at each step of the integration, at the time when y is still unknown at the upper limit, drop out.
    [Show full text]
  • The Original Euler's Calculus-Of-Variations Method: Key
    Submitted to EJP 1 Jozef Hanc, [email protected] The original Euler’s calculus-of-variations method: Key to Lagrangian mechanics for beginners Jozef Hanca) Technical University, Vysokoskolska 4, 042 00 Kosice, Slovakia Leonhard Euler's original version of the calculus of variations (1744) used elementary mathematics and was intuitive, geometric, and easily visualized. In 1755 Euler (1707-1783) abandoned his version and adopted instead the more rigorous and formal algebraic method of Lagrange. Lagrange’s elegant technique of variations not only bypassed the need for Euler’s intuitive use of a limit-taking process leading to the Euler-Lagrange equation but also eliminated Euler’s geometrical insight. More recently Euler's method has been resurrected, shown to be rigorous, and applied as one of the direct variational methods important in analysis and in computer solutions of physical processes. In our classrooms, however, the study of advanced mechanics is still dominated by Lagrange's analytic method, which students often apply uncritically using "variational recipes" because they have difficulty understanding it intuitively. The present paper describes an adaptation of Euler's method that restores intuition and geometric visualization. This adaptation can be used as an introductory variational treatment in almost all of undergraduate physics and is especially powerful in modern physics. Finally, we present Euler's method as a natural introduction to computer-executed numerical analysis of boundary value problems and the finite element method. I. INTRODUCTION In his pioneering 1744 work The method of finding plane curves that show some property of maximum and minimum,1 Leonhard Euler introduced a general mathematical procedure or method for the systematic investigation of variational problems.
    [Show full text]
  • Improving Numerical Integration and Event Generation with Normalizing Flows — HET Brown Bag Seminar, University of Michigan —
    Improving Numerical Integration and Event Generation with Normalizing Flows | HET Brown Bag Seminar, University of Michigan | Claudius Krause Fermi National Accelerator Laboratory September 25, 2019 In collaboration with: Christina Gao, Stefan H¨oche,Joshua Isaacson arXiv: 191x.abcde Claudius Krause (Fermilab) Machine Learning Phase Space September 25, 2019 1 / 27 Monte Carlo Simulations are increasingly important. https://twiki.cern.ch/twiki/bin/view/AtlasPublic/ComputingandSoftwarePublicResults MC event generation is needed for signal and background predictions. ) The required CPU time will increase in the next years. ) Claudius Krause (Fermilab) Machine Learning Phase Space September 25, 2019 2 / 27 Monte Carlo Simulations are increasingly important. 106 3 10− parton level W+0j 105 particle level W+1j 10 4 W+2j particle level − W+3j 104 WTA (> 6j) W+4j 5 10− W+5j 3 W+6j 10 Sherpa MC @ NERSC Mevt W+7j / 6 Sherpa / Pythia + DIY @ NERSC 10− W+8j 2 10 Frequency W+9j CPUh 7 10− 101 8 10− + 100 W +jets, LHC@14TeV pT,j > 20GeV, ηj < 6 9 | | 10− 1 10− 0 50000 100000 150000 200000 250000 300000 0 1 2 3 4 5 6 7 8 9 Ntrials Njet Stefan H¨oche,Stefan Prestel, Holger Schulz [1905.05120;PRD] The bottlenecks for evaluating large final state multiplicities are a slow evaluation of the matrix element a low unweighting efficiency Claudius Krause (Fermilab) Machine Learning Phase Space September 25, 2019 3 / 27 Monte Carlo Simulations are increasingly important. 106 3 10− parton level W+0j 105 particle level W+1j 10 4 W+2j particle level − W+3j 104 WTA (>
    [Show full text]
  • ATTRACTORS: STRANGE and OTHERWISE Attractor - in Mathematics, an Attractor Is a Region of Phase Space That "Attracts" All Nearby Points As Time Passes
    ATTRACTORS: STRANGE AND OTHERWISE Attractor - In mathematics, an attractor is a region of phase space that "attracts" all nearby points as time passes. That is, the changing values have a trajectory which moves across the phase space toward the attractor, like a ball rolling down a hilly landscape toward the valley it is attracted to. PHASE SPACE - imagine a standard graph with an x-y axis; it is a phase space. We plot the position of an x-y variable on the graph as a point. That single point summarizes all the information about x and y. If the values of x and/or y change systematically a series of points will plot as a curve or trajectory moving across the phase space. Phase space turns numbers into pictures. There are as many phase space dimensions as there are variables. The strange attractor below has 3 dimensions. LIMIT CYCLE (OR PERIODIC) ATTRACTOR STRANGE (OR COMPLEX) ATTRACTOR A system which repeats itself exactly, continuously, like A strange (or chaotic) attractor is one in which the - + a clock pendulum (left) Position (right) trajectory of the points circle around a region of phase space, but never exactly repeat their path. That is, they do have a predictable overall form, but the form is made up of unpredictable details. Velocity More important, the trajectory of nearby points diverge 0 rapidly reflecting sensitive dependence. Many different strange attractors exist, including the Lorenz, Julian, and Henon, each generated by a Velocity Y different equation. 0 Z The attractors + (right) exhibit fractal X geometry. Velocity 0 ATTRACTORS IN GENERAL We can generalize an attractor as any state toward which a Velocity system naturally evolves.
    [Show full text]
  • Polarization Fields and Phase Space Densities in Storage Rings: Stroboscopic Averaging and the Ergodic Theorem
    Physica D 234 (2007) 131–149 www.elsevier.com/locate/physd Polarization fields and phase space densities in storage rings: Stroboscopic averaging and the ergodic theorem✩ James A. Ellison∗, Klaus Heinemann Department of Mathematics and Statistics, University of New Mexico, Albuquerque, NM 87131, United States Received 1 May 2007; received in revised form 6 July 2007; accepted 9 July 2007 Available online 14 July 2007 Communicated by C.K.R.T. Jones Abstract A class of orbital motions with volume preserving flows and with vector fields periodic in the “time” parameter θ is defined. Spin motion coupled to the orbital dynamics is then defined, resulting in a class of spin–orbit motions which are important for storage rings. Phase space densities and polarization fields are introduced. It is important, in the context of storage rings, to understand the behavior of periodic polarization fields and phase space densities. Due to the 2π time periodicity of the spin–orbit equations of motion the polarization field, taken at a sequence of increasing time values θ,θ 2π,θ 4π,... , gives a sequence of polarization fields, called the stroboscopic sequence. We show, by using the + + Birkhoff ergodic theorem, that under very general conditions the Cesaro` averages of that sequence converge almost everywhere on phase space to a polarization field which is 2π-periodic in time. This fulfills the main aim of this paper in that it demonstrates that the tracking algorithm for stroboscopic averaging, encoded in the program SPRINT and used in the study of spin motion in storage rings, is mathematically well-founded.
    [Show full text]
  • Phase Plane Methods
    Chapter 10 Phase Plane Methods Contents 10.1 Planar Autonomous Systems . 680 10.2 Planar Constant Linear Systems . 694 10.3 Planar Almost Linear Systems . 705 10.4 Biological Models . 715 10.5 Mechanical Models . 730 Studied here are planar autonomous systems of differential equations. The topics: Planar Autonomous Systems: Phase Portraits, Stability. Planar Constant Linear Systems: Classification of isolated equilib- ria, Phase portraits. Planar Almost Linear Systems: Phase portraits, Nonlinear classi- fications of equilibria. Biological Models: Predator-prey models, Competition models, Survival of one species, Co-existence, Alligators, doomsday and extinction. Mechanical Models: Nonlinear spring-mass system, Soft and hard springs, Energy conservation, Phase plane and scenes. 680 Phase Plane Methods 10.1 Planar Autonomous Systems A set of two scalar differential equations of the form x0(t) = f(x(t); y(t)); (1) y0(t) = g(x(t); y(t)): is called a planar autonomous system. The term autonomous means self-governing, justified by the absence of the time variable t in the functions f(x; y), g(x; y). ! ! x(t) f(x; y) To obtain the vector form, let ~u(t) = , F~ (x; y) = y(t) g(x; y) and write (1) as the first order vector-matrix system d (2) ~u(t) = F~ (~u(t)): dt It is assumed that f, g are continuously differentiable in some region D in the xy-plane. This assumption makes F~ continuously differentiable in D and guarantees that Picard's existence-uniqueness theorem for initial d ~ value problems applies to the initial value problem dt ~u(t) = F (~u(t)), ~u(0) = ~u0.
    [Show full text]
  • Calculus and Differential Equations II
    Calculus and Differential Equations II MATH 250 B Linear systems of differential equations Linear systems of differential equations Calculus and Differential Equations II Second order autonomous linear systems We are mostly interested with2 × 2 first order autonomous systems of the form x0 = a x + b y y 0 = c x + d y where x and y are functions of t and a, b, c, and d are real constants. Such a system may be re-written in matrix form as d x x a b = M ; M = : dt y y c d The purpose of this section is to classify the dynamics of the solutions of the above system, in terms of the properties of the matrix M. Linear systems of differential equations Calculus and Differential Equations II Existence and uniqueness (general statement) Consider a linear system of the form dY = M(t)Y + F (t); dt where Y and F (t) are n × 1 column vectors, and M(t) is an n × n matrix whose entries may depend on t. Existence and uniqueness theorem: If the entries of the matrix M(t) and of the vector F (t) are continuous on some open interval I containing t0, then the initial value problem dY = M(t)Y + F (t); Y (t ) = Y dt 0 0 has a unique solution on I . In particular, this means that trajectories in the phase space do not cross. Linear systems of differential equations Calculus and Differential Equations II General solution The general solution to Y 0 = M(t)Y + F (t) reads Y (t) = C1 Y1(t) + C2 Y2(t) + ··· + Cn Yn(t) + Yp(t); = U(t) C + Yp(t); where 0 Yp(t) is a particular solution to Y = M(t)Y + F (t).
    [Show full text]
  • Visualizing Quantum Mechanics in Phase Space
    Visualizing quantum mechanics in phase space Heiko Baukea) and Noya Ruth Itzhak Max-Planck-Institut für Kernphysik, Saupfercheckweg 1, 69117 Heidelberg, Germany (Dated: 17 January 2011) We examine the visualization of quantum mechanics in phase space by means of the Wigner function and the Wigner function flow as a complementary approach to illustrating quantum mechanics in configuration space by wave func- tions. The Wigner function formalism resembles the mathematical language of classical mechanics of non-interacting particles. Thus, it allows a more direct comparison between classical and quantum dynamical features. PACS numbers: 03.65.-w, 03.65.Ca Keywords: 1. Introduction 2. Visualizing quantum dynamics in position space or momentum Quantum mechanics is a corner stone of modern physics and technology. Virtually all processes that take place on an space atomar scale require a quantum mechanical description. For example, it is not possible to understand chemical reactionsor A (one-dimensional) quantum mechanical position space the characteristics of solid states without a sound knowledge wave function maps each point x on the position axis to a of quantum mechanics. Quantum mechanical effects are uti- time dependent complex number Ψ(x, t). Equivalently, one lized in many technical devices ranging from transistors and may consider the wave function Ψ˜ (p, t) in momentum space, Flash memory to tunneling microscopes and quantum cryp- which is given by a Fourier transform of Ψ(x, t), viz. tography, just to mention a few applications. Quantum effects, however, are not directly accessible to hu- 1 ixp/~ Ψ˜ (p, t) = Ψ(x, t)e− dx . (1) man senses, the mathematical formulations of quantum me- (2π~)1/2 chanics are abstract and its implications are often unintuitive in terms of classical physics.
    [Show full text]