Vector boson pair production at the LHC

We present phenomenological results for vector boson pair production at the LHC, obtained using the parton-level next-to-leading order program MCFM. We include the implementation of a new process in the code, pp -> \gamma\gamma, and important updates to existing processes. We incorporate fragmentation contributions in order to allow for the experimental isolation of photons in \gamma\gamma, W\gamma, and Z\gamma production and also account for gluon-gluon initial state contributions for all relevant processes. We present results for a variety of phenomenological scenarios, at the current operating energy of \sqrt{s} = 7 TeV and for the ultimate machine goal, \sqrt{s} = 14 TeV. We investigate the impact of our predictions on several important distributions that enter into searches for new physics at the LHC.Comment: 35 pages, 14 figure

Block-control methods for low-order automotive control

Robust linear and nonlinear control is a continuing requirement for automotive powertrain controls. Newton iteration techniques have been proposed for both nonparametric linear and recently nonlinear control. Such nonparametric methods may eventually allow benefits of both low-order controllers and more rapid calibration time. This paper evaluates the feasibility of such Newton iteration techniques by an experimental comparison of a standard Riccati method a Riccati J-spectral factorisation and a novel l2 algebraic J-spectral factorisation using Newton iteration techniques in a SI engine idle controller. The methods are each applied in a 2- block H∞formulation. The results of experimentally implementing robust idle speed controllers show broadly similar outcomes for all the methods compared and thus indicate the potential of the Newton iteration methods for further development in more advanced nonparametric, low-order and nonlinear control

Charge asymmetry ratio as a probe of quark flavour couplings of resonant particles at the LHC

We show how a precise knowledge of parton distribution functions, in particular those of the u and d quarks, can be used to constrain a certain class of New Physics models in which new heavy charged resonances couple to quarks and leptons. We illustrate the method by considering a left-right symmetric model with a W' from a SU(2)_R gauge sector produced in quark-antiquark annihilation and decaying into a charged lepton and a heavy Majorana neutrino. We discuss a number of quark and lepton mixing scenarios, and simulate both signals and backgrounds in order to determine the size of the expected charge asymmetry. We show that various quark-W' mixing scenarios can indeed be constrained by charge asymmetry measurements at the LHC, particularly at 14 TeV centre of mass energy.Comment: 14 pages, 3 figure

Design and analysis of numerical algorithms for the solution of linear systems on parallel and distributed architectures

The increasing availability of parallel computers is having a very significant impact on all aspects of scientific computation, including algorithm research and software development in numerical linear algebra. In particular, the solution of linear systems, which lies at the heart of most calculations in scientific computing is an important computation found in many engineering and scientific applications. In this thesis, well-known parallel algorithms for the solution of linear systems are compared with implicit parallel algorithms or the Quadrant Interlocking (QI) class of algorithms to solve linear systems. These implicit algorithms are (2x2) block algorithms expressed in explicit point form notation. [Continues.

Adapting the interior point method for the solution of LPs on serial, coarse grain parallel and massively parallel computers

In this paper we describe a unified scheme for implementing an interior point algorithm (IPM) over a range of computer architectures. In the inner iteration of the IPM a search direction is computed using Newton's method. Computationally this involves solving a sparse symmetric positive definite (SSPD) system of equations. The choice of direct and indirect methods for the solution of this system, and the design of data structures to take advantage of serial, coarse grain parallel and massively parallel computer architectures, are considered in detail. We put forward arguments as to why integration of the system within a sparse simplex solver is important and outline how the system is designed to achieve this integration

Measurement of the Z(→ ℓ + ℓ −)γ production cross-section in pp collisions at √s = 13 TeV with the ATLAS detector

The production of a prompt photon in association with a Z boson is studied in proton-proton collisions at a centre-of-mass energy s = 13 TeV. The analysis uses a data sample with an integrated luminosity of 139 fb−1 collected by the ATLAS detector at the LHC from 2015 to 2018. The production cross-section for the process pp → ℓ+ℓ−γ + X (ℓ = e, μ) is measured within a fiducial phase-space region defined by kinematic requirements on the photon and the leptons, and by isolation requirements on the photon. An experimental precision of 2.9% is achieved for the fiducial cross-section. Differential cross-sections are measured as a function of each of six kinematic variables characterising the ℓ+ℓ−γ system. The data are compared with theoretical predictions based on next-to-leading-order and next-to-next-to-leading-order perturbative QCD calculations. The impact of next-to-leading-order electroweak corrections is also considered. [Figure not available: see fulltext.]

Alternative methods for representing the inverse of linear programming basis matrices

Methods for representing the inverse of Linear Programming (LP) basis matrices are closely related to techniques for solving a system of sparse unsymmetric linear equations by direct methods. It is now well accepted that for these problems the static process of reordering the matrix in the lower block triangular (LBT) form constitutes the initial step. We introduce a combined static and dynamic factorisation of a basis matrix and derive its inverse which we call the partial elimination form of the inverse (PEFI). This factorization takes advantage of the LBT structure and produces a sparser representation of the inverse than the elimination form of the inverse (EFI). In this we make use of the original columns (of the constraint matrix) which are in the basis. To represent the factored inverse it is, however, necessary to introduce special data structures which are used in the forward and the backward transformations (the two major algorithmic steps) of the simplex method. These correspond to solving a system of equations and solving a system of equations with the transposed matrix respectively. In this paper we compare the nonzero build up of PEFI with that of EFI. We have also investigated alternative methods for updating the basis inverse in the PEFI representation. The results of our experimental investigation are presented in this pape