Search NASA⌕ Search

Engineering topics

Brandt, A.

Publications and source records attributed to Brandt, A..

At least 19 records

Up and down quark structure of the proton

We report an improved measurement of the valence u and d quark distributions from the forward-backward asymmetry in the Drell-Yan process using 8.6 fb − 1 of data collected with the D0 detector in p p ¯ collisions at s = 1.96 . This analysis provides the values of new structure parameters that are directly related to the valence up and down quark distributions in the proton. In other experimental results measuring the quark content of the proton, d quark contributions are mixed with those from other quark flavors. In this measurement, the u and d quark contributions are separately extracted by applying a factorization of the QCD and electroweak portions of the forward-backward asymmetry. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scintillation light in SBND: simulation, reconstruction, and expected performance of the photon detection system

SBND is the near detector of the Short-Baseline Neutrino program at Fermilab. Its location near to the Booster Neutrino Beam source and relatively large mass will allow the study of neutrino interactions on argon with unprecedented statistics. This paper describes the expected performance of the SBND photon detection system, using a simulated sample of beam neutrinos and cosmogenic particles. Its design is a dual readout concept combining a system of 120 photomultiplier tubes, used for triggering, with a system of 192 X-ARAPUCA devices, located behind the anode wire planes. Furthermore, covering the cathode plane with highly-reflective panels coated with a wavelength-shifting compound recovers part of the light emitted towards the cathode, where no optical detectors exist. We show how this new design provides a high light yield and a more uniform detection efficiency, an excellent timing resolution and an independent 3D-position reconstruction using only the scintillation light. Finally, the whole reconstruction chain is applied to recover the temporal structure of the beam spill, which is resolved with a resolution on the order of nanoseconds.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Characterization of the miniPlanacon XPM85112-S-R2D2 MCP-PMT with custom modified backend electronics

We report the results of the measurements of three pieces of the new Photonis miniPLANACON microchannel-plate photomultipliers (MCP-PMTs) intended for use in the demanding environment of the Large Hadron Collider (LHC) beamline as a part of the AFP Time-of-Flight detector. These photomultipliers were modified in cooperation with the manufacturer by using a custom backend and were subjected to numerous tests, with the focus on the rate capability and crosstalk behaviour. We determined that the two of them with a lower MCP resistance are able to operate without significant saturation at an anode current density of 1 μA/cm 2 . These two are, therefore, suitable for the intended use and are currently installed as part of the AFP detector packages.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Study of the normalized transverse momentum distribution of W bosons produced in $p\bar{p}$ collisions at $\sqrt{s}$ = 1.96 TeV

We present a study of the normalized transverse momentum distribution of W bosons produced in $p\bar{p}$ collisions, using data corresponding to an integrated luminosity of 4.35 fb -1 collected with the D0 detector at the Fermilab Tevatron collider at $\sqrt{s}$ = 1.96 TeV. The measurement focuses on the transverse momentum region below 15 GeV, which is of special interest for electroweak precision measurements; it relies on the same detector calibration methods which were used for the precision measurement of the W boson mass. The measured distribution is compared to different QCD predictions and a procedure is given to allow the comparison of any further theoretical models to the D0 data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Timing resolution and rate capability of Photonis miniPlanacon XPM85212/A1-S MCP-PMT

In this paper we report on a set of experiments that focus on measuring the timing performance of the Photonis miniPlanacon XPM85212/A1-S microchannel plate photomultiplier tubes along with the detector response at high event rates. The detector has a single photoelectron timing resolution of 30 ps at low rates ( 10 kHz ). We show that both the gain and the timing start to deteriorate around 1 MHz with 20 photoelectrons per channel at 1 0 4 target gain, giving the current per unit of area limits of 1.38 μ A / cm 2 and 2.38 μ A / cm 2 for the two tested devices. Photo-multiplier tubes with lower micro-channel plate resistivity exhibit a better rate capability due to the faster replenishment of the charge inside the microchannels. As we demonstrate, another method to improve the rate capability is to operate the photon detector tubes at a lower gain by reducing the supply voltage and compensating for the loss of amplitude by an additional amplification stage at the expense of the achieved timing resolution. The tube active area over which the beam is spread also plays a role since the same amount of light yields a better rate capability when spread over a larger area. The tubes exposed to high event rates showed an uncharacteristically slow recovery back to its initial gain with 80 % of the initial gain recovered only after several tens of minutes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Construction of precision wire readout planes for the Short-Baseline Near Detector (SBND)

The Short-Baseline Near Detector time projection chamber is unique in the design of its charge readout planes. These anode plane assemblies (APAs) have been fabricated and assembled to meet strict accuracy and precision requirements: wire spacing of 3 mm ± 0.5 mm and wire tension of 7 N ± 1 N across 3,964 wires per APA, and flatness within 0.5 mm over the 4 m × 2.5 m extent of each APA . Here, we describe the design, manufacture and assembly of these key detector components, with a focus on the quality assurance at each stage.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Distributed Relaxation Multigrid and Defect Correction Applied to the Compressible Navier-Stokes Equations

The distributed-relaxation multigrid and defect- correction methods are applied to the two- dimensional compressible Navier-Stokes equations. The formulation is intended for high Reynolds number applications and several applications are made at a laminar Reynolds number of 10,000. A staggered- grid arrangement of variables is used; the coupled pressure and internal energy equations are solved together with multigrid, requiring a block 2x2 matrix solution. Textbook multigrid efficiencies are attained for incompressible and slightly compressible simulations of the boundary layer on a flat plate. Textbook efficiencies are obtained for compressible simulations up to Mach numbers of 0.7 for a viscous wake simulation.

Thomas, J. L.↗

Effective Boundary Treatment for the Biharmonic Dirichlet Problem

The biharmonic equation can be rewritten as a system of two Poisson equations. Multigrid solution of this system is expected to converge with the same amount of work as solving two Poisson equations, requiring less than 70 floating point operations (scalar multiply or addition) per fine grid point to reach a solution using an FMG algorithm. For periodic boundary conditions, this goal is attained by simple, straightforward application of multigrid. For Dirichlet boundary conditions, however, convergence is impeded by poor interaction with the boundaries. Attempts to overcome the slowness without specifically addressing the boundaries have resulted in multigrid algorithms not attaining the Poisson convergence rate. We present three methods of boundary treatment with which full multigrid efficiency can be obtained. All implement an approach described by Brandt, concentrating some additional effort near the boundary. The first approach simply adds a number of relaxation sweeps over points close to the boundary. The second uses joint relaxation on near-boundary points. The third method takes something from each of the first two methods, resulting in a solver more suitable for highly parallel applications.

Brandt, A.↗

Multigrid method for nearly singular and slightly indefinite problems

This paper deals with nearly singular, possibly indefinite problems for which the usual multigrid solvers converge very slowly or even diverge. The main difficulty is related to some badly approximated smooth functions which correspond to eigenfunctions with nearly zero eigenvalues. A correction to the usual coarse-grid equations is derived, both in the correction scheme and in the full approximation scheme. The performance of the new algorithm using this correction is essentially as that of usual multigrid for definite problems.

Brandt, A.↗

Multigrid method for nearly singular and slightly indefinite problems

This paper deals with nearly singular, possibly indefinite problems for which the usual multigrid solvers converge very slowly or even diverge. The main difficulty is related to some badly approximated smooth functions which correspond to eigenfunctions with nearly zero eigenvalues. A correction to the usual coarse-grid equations is derived, both in the correction scheme and in the full approximation scheme. The performance of the new algorithm using this correction is essentially as that of usual multigrid for definite problems.

Brandt, A.↗

Multigrid solutions to quasi-elliptic schemes

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate then corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Brandt, A.↗

Multigrid solutions to quasi-elliptic schemes

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate than corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Brandt, A.↗

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗

Multi-level adaptive finite element methods. 1: Variation problems

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

Brandt, A.↗