437 research outputs found

    The integration of systems of linear PDEs using conservation laws of syzygies

    Get PDF
    A new integration technique is presented for systems of linear partial differential equations (PDEs) for which syzygies can be formulated that obey conservation laws. These syzygies come for free as a by-product of the differential Groebner Basis computation. Compared with the more obvious way of integrating a single equation and substituting the result in other equations the new technique integrates more than one equation at once and therefore introduces temporarily fewer new functions of integration that in addition depend on fewer variables. Especially for high order PDE systems in many variables the conventional integration technique may lead to an explosion of the number of functions of integration which is avoided with the new method. A further benefit is that redundant free functions in the solution are either prevented or that their number is at least reduced.Comment: 26 page

    Integrating factors for second order ODEs

    Get PDF
    A systematic algorithm for building integrating factors of the form mu(x,y), mu(x,y') or mu(y,y') for second order ODEs is presented. The algorithm can determine the existence and explicit form of the integrating factors themselves without solving any differential equations, except for a linear ODE in one subcase of the mu(x,y) problem. Examples of ODEs not having point symmetries are shown to be solvable using this algorithm. The scheme was implemented in Maple, in the framework of the "ODEtools" package and its ODE-solver. A comparison between this implementation and other computer algebra ODE-solvers in tackling non-linear examples from Kamke's book is shown.Comment: 21 pages - original version submitted Nov/1997. Related Maple programs for finding integrating factors together with the ODEtools package (versions for MapleV R4 and MapleV R5) are available at http://lie.uwaterloo.ca/odetools.ht

    Conservation Laws of Some Physical Models via Symbolic Package GeM

    Get PDF
    We study the conservation laws of evolution equation, lubrication models, sinh-Poisson equation, Kaup-Kupershmidt equation, and modified Sawada-Kotera equation. The symbolic software GeM (Cheviakov (2007) and (2010)) is used to derive the multipliers and conservation law fluxes. Software GeM is Maple-based package, and it computes conservation laws by direct method and first homotopy and second homotopy formulas

    GRACE at ONE-LOOP: Automatic calculation of 1-loop diagrams in the electroweak theory with gauge parameter independence checks

    Full text link
    We describe the main building blocks of a generic automated package for the calculation of Feynman diagrams. These blocks include the generation and creation of a model file, the graph generation, the symbolic calculation at an intermediate level of the Dirac and tensor algebra, implementation of the loop integrals, the generation of the matrix elements or helicity amplitudes, methods for the phase space integrations and eventually the event generation. The report focuses on the fully automated systems for the calculation of physical processes based on the experience in developing GRACE-loop. As such, a detailed description of the renormalisation procedure in the Standard Model is given emphasizing the central role played by the non-linear gauge fixing conditions for the construction of such automated codes. The need for such gauges is better appreciated when it comes to devising efficient and powerful algorithms for the reduction of the tensorial structures of the loop integrals. A new technique for these reduction algorithms is described. Explicit formulae for all two-point functions in a generalised non-linear gauge are given, together with the complete set of counterterms. We also show how infrared divergences are dealt with in the system. We give a comprehensive presentation of some systematic test-runs which have been performed at the one-loop level for a wide variety of two-to-two processes to show the validity of the gauge check. These cover fermion-fermion scattering, gauge boson scattering into fermions, gauge bosons and Higgs bosons scattering processes. Comparisons with existing results on some one-loop computation in the Standard Model show excellent agreement. We also briefly recount some recent development concerning the calculation of mutli-leg one-loop corrections.Comment: 131 pages. Manuscript expanded quite substantially with the inclusion of an overview of automatic systems for the calculation of Feynman diagrams both at tree-level and one-loop. Other additions include issues of regularisation, width effects and renormalisation with unstable particles and reduction of 5- and 6-point functions. This is a preprint version, final version to appear as a Phys. Re

    The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems

    Full text link
    We present a compendium of numerical simulation techniques, based on tensor network methods, aiming to address problems of many-body quantum mechanics on a classical computer. The core setting of this anthology are lattice problems in low spatial dimension at finite size, a physical scenario where tensor network methods, both Density Matrix Renormalization Group and beyond, have long proven to be winning strategies. Here we explore in detail the numerical frameworks and methods employed to deal with low-dimension physical setups, from a computational physics perspective. We focus on symmetries and closed-system simulations in arbitrary boundary conditions, while discussing the numerical data structures and linear algebra manipulation routines involved, which form the core libraries of any tensor network code. At a higher level, we put the spotlight on loop-free network geometries, discussing their advantages, and presenting in detail algorithms to simulate low-energy equilibrium states. Accompanied by discussions of data structures, numerical techniques and performance, this anthology serves as a programmer's companion, as well as a self-contained introduction and review of the basic and selected advanced concepts in tensor networks, including examples of their applications.Comment: 115 pages, 56 figure

    Conservation laws for some compacton equations using the multiplier approach

    Get PDF
    AbstractThis paper is an application of the variational derivative method to the derivation of the conservation laws for partial differential equations. The conservation laws for (1+1) dimensional compacton k(2,2) and compacton k(3,3) equations are studied via multiplier approach. Also the conservation laws for (2+1) dimensional compacton Zk(2,2) equation are established by first computing the multipliers

    CosmoLattice

    Full text link
    This is the user manual for CosmoLattice, a modern package for lattice simulations of the dynamics of interacting scalar and gauge fields in an expanding universe. CosmoLattice incorporates a series of features that makes it very versatile and powerful: i)i) it is written in C++ fully exploiting the object oriented programming paradigm, with a modular structure and a clear separation between the physics and the technical details, ii)ii) it is MPI-based and uses a discrete Fourier transform parallelized in multiple spatial dimensions, which makes it specially appropriate for probing scenarios with well-separated scales, running very high resolution simulations, or simply very long ones, iii)iii) it introduces its own symbolic language, defining field variables and operations over them, so that one can introduce differential equations and operators in a manner as close as possible to the continuum, iv)iv) it includes a library of numerical algorithms, ranging from O(δt2)O(\delta t^2) to O(δt10)O(\delta t^{10}) methods, suitable for simulating global and gauge theories in an expanding grid, including the case of `self-consistent' expansion sourced by the fields themselves. Relevant observables are provided for each algorithm (e.g.~energy densities, field spectra, lattice snapshots) and we note that remarkably all our algorithms for gauge theories always respect the Gauss constraint to machine precision. In this manual we explain how to obtain and run CosmoLattice in a computer (let it be your laptop, desktop or a cluster). We introduce the general structure of the code and describe in detail the basic files that any user needs to handle. We explain how to implement any model characterized by a scalar potential and a set of scalar fields, either singlets or interacting with U(1)U(1) and/or SU(2)SU(2) gauge fields. CosmoLattice is publicly available at www.cosmolattice.net.Comment: 111 pages, 3 figures and O(100) code file
    corecore