Search NASA⌕ Search

Engineering topics

Brandt, A.

Publications and source records attributed to Brandt, A..

15 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

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↗
NASA NTRS1999

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.↗
NASA NTRS1996

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.↗
NASA NTRS1986

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.↗
NASA NTRS1985

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.↗
NASA NTRS1985

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.↗
NASA NTRS1985

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.↗
NASA NTRS1981

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.↗
NASA NTRS1979

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.↗
NASA NTRS1979

Multi-level adaptive computations in fluid dynamics

The multi-level adaptive technique (MLAT) is a general strategy of solving continuous problems by cycling between coarser and finer levels of discretization. It provides very fast solvers together with adaptive, nearly optimal discretization schemes to general boundary-value problems in general domains. Here the state of the art is surveyed, emphasizing steady-state fluid dynamics applications, from slow viscous flows to transonic ones. Various new techniques are briefly discussed, including distributive relaxation schemes, the treatment of evolution problems, the combined use of upstream and central differencing, local truncation extrapolations, and other 'super-solver' techniques.

Brandt, A.↗
NASA NTRS1978

Multi-Level Adaptive Techniques (MLAT) for singular-perturbation problems

The multilevel (multigrid) adaptive technique, a general strategy of solving continuous problems by cycling between coarser and finer levels of discretization is described. It provides very fast general solvers, together with adaptive, nearly optimal discretization schemes. In the process, boundary layers are automatically either resolved or skipped, depending on a control function which expresses the computational goal. The global error decreases exponentially as a function of the overall computational work, in a uniform rate independent of the magnitude of the singular-perturbation terms. The key is high-order uniformly stable difference equations, and uniformly smoothing relaxation schemes.

Brandt, A.↗
NASA NTRS1977

Application of a multi-level grid method to transonic flow calculations

A multi-level grid method has been studied as a possible means of accelerating convergence in relaxation calculations for transonic flows. The method employs a hierarchy of grids, ranging from very coarse (e.g., 8 x 2 mesh cells) to fine (e.g., 128 x 32); the coarser grids are used to diminish the magnitude of the smooth part of the residuals, hopefully with far less total work than would be required with, say, optimal SLOR iterations on the finest grid. The method was applied to the solution of the transonic small-disturbance equation for the velocity potential in the conservation form. Nonlifting transonic flow past a parabolic-arc airfoil is the example studied, with meshes of both constant and variable step size.

South, J. C., Jr.↗
NASA NTRS1976

Application of a multi-level grid method to transonic flow calculations

A multi-level grid method was studied as a possible means of accelerating convergence in relaxation calculations for transonic flows. The method employs a hierarchy of grids, ranging from very coarse to fine. The coarser grids are used to diminish the magnitude of the smooth part of the residuals. The method was applied to the solution of the transonic small disturbance equation for the velocity potential in conservation form. Nonlifting transonic flow past a parabolic arc airfoil is studied with meshes of both constant and variable step size.

South, J. C., Jr.↗
NASA NTRS1976

The multigrid method: Fast relaxation

A multi-level grid method was studied as a possible means of accelerating convergence in relaxation calculations for transonic flows. The method employs a hierarchy of grids, ranging from very coarse (e.g. 4 x 2 mesh cells) to fine (e.g. 64 x 32); the coarser grids are used to diminish the magnitude of the smooth part of the residuals, hopefully with far less total work than would be required with optimal iterations on the finest grid. To date the method was applied quite successfully to the solution of the transonic small-disturbance equation for the velocity potential in conservation form. Nonlifting transonic flow past a parabolic arc airfoil is the example studied, with meshes of both constant and variable step size.

South, J. C., Jr.↗