8,963 research outputs found

    Knots and Numbers in Ï•4\phi^4 Theory to 7 Loops and Beyond

    Full text link
    We evaluate all the primitive divergences contributing to the 7--loop β\beta\/--function of ϕ4\phi^4 theory, i.e.\ all 59 diagrams that are free of subdivergences and hence give scheme--independent contributions. Guided by the association of diagrams with knots, we obtain analytical results for 56 diagrams. The remaining three diagrams, associated with the knots 1012410_{124}, 1013910_{139}, and 1015210_{152}, are evaluated numerically, to 10 sf. Only one satellite knot with 11 crossings is encountered and the transcendental number associated with it is found. Thus we achieve an analytical result for the 6--loop contributions, and a numerical result at 7 loops that is accurate to one part in 101110^{11}. The series of `zig--zag' counterterms, {6ζ3, 20ζ5, 4418ζ7, 168ζ9, …}\{6\zeta_3,\,20\zeta_5,\, \frac{441}{8}\zeta_7,\,168\zeta_9,\,\ldots\}, previously known for n=3,4,5,6n=3,4,5,6 loops, is evaluated to 10 loops, corresponding to 17 crossings, revealing that the nn\/--loop zig--zag term is 4Cn−1∑p>0(−1)pn−np2n−34C_{n-1} \sum_{p>0}\frac{(-1)^{p n - n}}{p^{2n-3}}, where Cn=1n+1(2nn)C_n=\frac{1}{n+1}{2n \choose n} are the Catalan numbers, familiar in knot theory. The investigations reported here entailed intensive use of REDUCE, to generate O(104){\rm O}(10^4) lines of code for multiple precision FORTRAN computations, enabled by Bailey's MPFUN routines, running for O(103){\rm O}(10^3) CPUhours on DecAlpha machines.Comment: 6 pages plain LaTe

    Convergence Acceleration via Combined Nonlinear-Condensation Transformations

    Full text link
    A method of numerically evaluating slowly convergent monotone series is described. First, we apply a condensation transformation due to Van Wijngaarden to the original series. This transforms the original monotone series into an alternating series. In the second step, the convergence of the transformed series is accelerated with the help of suitable nonlinear sequence transformations that are known to be particularly powerful for alternating series. Some theoretical aspects of our approach are discussed. The efficiency, numerical stability, and wide applicability of the combined nonlinear-condensation transformation is illustrated by a number of examples. We discuss the evaluation of special functions close to or on the boundary of the circle of convergence, even in the vicinity of singularities. We also consider a series of products of spherical Bessel functions, which serves as a model for partial wave expansions occurring in quantum electrodynamic bound state calculations.Comment: 24 pages, LaTeX, 12 tables (accepted for publication in Comput. Phys. Comm.

    Level truncation and the quartic tachyon coupling

    Full text link
    We discuss the convergence of level truncation in bosonic open string field theory. As a test case we consider the calculation of the quartic tachyon coupling γ4\gamma_4. We determine the exact contribution from states up to level L=28 and discuss the L→∞L\to\infty extrapolation by means of the BST algorithm. We determine in a self-consistent way both the coupling and the exponent ω\omega of the leading correction to γ4\gamma_4 at finite LL that we assume to be ∼1/Lω\sim 1/L^\omega. The results are γ4=−1.7422006(9)\gamma_4 = -1.7422006(9) and ∣ω−1∣≲10−4|\omega-1|\lesssim 10^{-4}.}Comment: 17 pages, 2 eps figure

    Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations

    Full text link
    We consider the numerical discretization of the time-domain Maxwell's equations with an energy-conserving discontinuous Galerkin finite element formulation. This particular formulation allows for higher order approximations of the electric and magnetic field. Special emphasis is placed on an efficient implementation which is achieved by taking advantage of recurrence properties and the tensor-product structure of the chosen shape functions. These recurrences have been derived symbolically with computer algebra methods reminiscent of the holonomic systems approach.Comment: 16 pages, 1 figure, 1 table; Springer Wien, ISBN 978-3-7091-0793-
    • …
    corecore