Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Vertex”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

A genuinely multi-dimensional upwind cell-vertex scheme for the Euler equations

A scheme of solving the two-dimensional Euler equations is developed. The scheme is genuinely two-dimensional. At each iteration, the data are locally decomposed into four variables, allowing convection in appropriate directions. This is done via a cell-vertex scheme with a downwind-weighted distribution step. The scheme is conservative and third-order accurate in space. The derivation and stability analysis of the scheme for the convection equation, and the derivation of the extension to the Euler equations are given. Preconditioning techniques based on local values of the convection speeds are discussed. The scheme for the Euler equations is applied to two channel-flow problems. It is shown to converge rapidly to a solution that agrees well with that of a third-order upwind solver.

Powell, Kenneth G.↗

An investigation of cell centered and cell vertex multigrid schemes for the Navier-Stokes equations

Two efficient and robust finite-volume multigrid schemes for solving the Navier-Stokes equations are investigated. These schemes employ either a cell centered or a cell vertex discretization technique. An explicit Runge-Kutta algorithm is used to advance the solution in time. Acceleration techniques are applied to obtain faster steady-state convergence. Accuracy and convergence of the schemes are examined. Computational results for transonic airfoil flows are essentially the same, even for a coarse mesh. Both schemes exhibit good convergence rates for a broad range of artificial dissipation coefficients.

Radespiel, R.↗

An efficient cell-vertex multigrid scheme for the three-dimensional Navier-Stokes equations

A cell-vertex scheme for the three-dimensional Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing with locally varying coefficients, a multigrid method and carefully controlled dissipative terms, very good convergence rates are obtained for two- and three-dimensional flows. Details of the acceleration techniques, which are important for convergence on meshes with high aspect-ratio cells, are discussed. Emphasis is put on the analysis of the stability properties of the implicit smoothing of the explicit residuals with coefficients, which depend on cell aspect ratios.

Radespiel, R.↗

A Full Multi-Grid Method for the Solution of the Cell Vertex Finite Volume Cauchy-Riemann Equations

The system of inhomogeneous Cauchy-Riemann equations defined on a square domain and subject to Dirichlet boundary conditions is considered. This problem is discretised by using the cell vertex finite volume method on quadrilateral meshes. The resulting algebraic problem is overdetermined and the solution is defined in a least squares sense. By this approach a consistent algebraic problem is obtained which differs from the original one by O(h(exp 2)) perturbations of the right-hand side. A suitable cell-based convergent smoothing iteration is presented which is naturally linked to the least squares formulation. Hence, a standard multi-grid algorithm is reported which combines the given smoother and cell-based transfer operators. Some remarkable reduction properties of these operators are shown. A full multi-grid method is discussed which solves the discrete problem to the level of truncation error by employing one multi-grid cycle at each current level of discretisation. Experiments and applications of the full multi-grid scheme are presented.

Borzi, A.↗

Vertex Movement for Mission Status Graphics: A Polar-Star Display

Humans are traditionally bad monitors, especially over long periods of time on reliable systems, and they are being called upon to do this more and more as systems become further automated. Because of this, there is a need to find a way to display the monitoring information to the human operator in such a way that he can notice pertinent deviations in a timely manner. One possible solution is to use polar-star displays that will show deviations from normal in a more salient manner. A polar-star display uses a polygon's vertices to report values. An important question arises, though, of how the vertices should move. This experiment investigated two particular issues of how the vertices should move: (1) whether the movement of the vertices should be continuous or discrete and (2) whether the parameters that made up each vertex should always move in one direction regardless of parameter sign or move in both directions indicating parameter sign. The results indicate that relative movement direction is best. Subjects performed better with this movement type and they subjectively preferred it to the absolute movement direction. As for movement type, no strong preferences were shown.

Trujillo, Anna↗

Low-mass materials and vertex detector systems

Physics requirements set the material budget and the precision and stability necessary in low-mass vertex detector systems. Operational considerations, along with physics requirements, set the operating environment to be provided and determine the heat to be removed. Representative materials for fulfilling those requirements are described and properties of the materials are tabulated. A figure of merit is proposed to aid in material selection. Multi-layer structures are examined as a method to allow material to be used effectively, thereby reducing material contributions. Lastly, comments are made on future directions to be considered in using present materials effectively and in developing new materials.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Vertex Reordering for Real-world Graphs and Applications: An Empirical Evaluation

Vertex reordering is a way to improve locality in graph computations. Given an input (or ``natural'') order, reordering aims to compute an alternate permutation of the vertices that is aimed at maximizing a locality-based objective. Given decades of research on this topic, there are tens of graph reordering schemes, and there are also several linear arrangement ``gap'' measures for treatment as objectives. However, a comprehensive empirical analysis of the efficacy of the ordering schemes against the different gap measures, and against real-world applications is currently lacking. In this study, we present an extensive empirical evaluation of up to 11 ordering schemes, taken from different classes of approaches, on a set of 34 real-world graphs emerging from different application domains. Our study is presented in two parts: a) a thorough comparative evaluation of the different ordering schemes on their effectiveness to optimize different linear arrangement gap measures, relevant to preserving locality; and b) extensive evaluation of the impact of the ordering schemes on two real-world, parallel graph applications, namely, community detection and influence maximization. Our studies show a significant divergence among the ordering schemes (up to $40\times$ between the best and the poor) in their effectiveness to reduce the gap measures; and a wide ranging impact of the ordering schemes on various aspects including application runtime (up to $4\times$), memory and cache use, load balancing, and parallel work and efficiency. The comparative study also help reveal the nuances of a parallel environment (compared to serial) on the ordering schemes and their role in optimizing applications.

Barik, Reet↗

Characterization and performance of the Silicon Vertex Tracker modules for the CLAS12 experiment

The Continuous Electron Beam Accelerator Facility's (CEBAF) Large Acceptance Spectrometer (CLAS) is being upgraded for the 12 GeV electron beam. The Silicon Vertex Tracker (SVT) will be part of the Central Tracker for the CLAS12 experiment and will be centered inside of the solenoid, which has 5 T magnetic field. We present the design, fabrication, characterization and performance of the SVT modules.

Gotra, Yuri↗

Test of Harmonic Coil Accuracy Using a Multi Vertex Probe

Magnets are integral components of particle accelerators, with different multipoles used to perform various beam conditioning functions, like steering and focusing. Testing accelerator magnets to ensure compliance with specification is a crucial step of fabrication. One of the most popular techniques for verifying magnetic field strength and integrity is the harmonic coil probe. Harmonic coil probes are comprised of passive loops that are rotated around the aperture of a magnet and are used to measure magnetic flux. Oftentimes the measurements of the harmonic coil probe are affected by transverse vibrations along the axis of rotation and torsional vibrations of the position closure sensor, both causing spurious harmonics. To make matters challenging, it is difficult to distinguish between the real harmonics of the magnet and the spurious harmonics during analysis. This research explores the use of a novel configuration of harmonic coil probe, Multi-Vertex Probe (MVP), to address multiple factors that affect the accuracy and repeatability of harmonic coil probe measurement. Most of the results are based on simulation data, in which artificial torsional distortions are introduced and removed with the proposed processing method. In addition to implementing torsional vibration removal in simulation, laboratory analysis regarding the source of vibrations was performed using a pre-fabricated MVP. More specifically, various mechanical conditions were used to explore the standard deviation of main harmonic’s flux amplitude. The conditions included: coupling type (rigid or soft), rotation speed, probe starting position within magnetic field, and cabling location inside the magnetic field. Along with this, the MVP’s measured noise floor in and outside a magnetic field was quantified.

Lofquist, Claire [Northern Illinois U.]↗

Thermodynamics of spin chains of Haldane-Shastry type and one-dimensional vertex models

We study the thermodynamic properties of spin chains of Haldane-Shastry type associated with the A{sub N-1} root system in the presence of a uniform external magnetic field. To this end, we exactly compute the partition function of these models for an arbitrary finite number of spins. We then show that these chains are equivalent to a suitable inhomogeneous classical Ising model in a spatially dependent magnetic field, generalizing the results of Basu-Mallick et al. for the zero magnetic field case. Using the standard transfer matrix approach, we are able to compute in closed form the free energy per site in the thermodynamic limit. We perform a detailed analysis of the chains' thermodynamics in a unified way, with special emphasis on the zero field and zero temperature limits. Finally, we provide a novel interpretation of the thermodynamic quantities of spin chains of Haldane-Shastry type as weighted averages of the analogous quantities over an ensemble of classical Ising models. - Highlights: Black-Right-Pointing-Pointer Partition function of spin chains of Haldane-Shastry type in magnetic field. Black-Right-Pointing-Pointer Equivalence to classical inhomogeneous Ising models. Black-Right-Pointing-Pointer Free energy per site, other thermodynamic quantities in thermodynamic limit. Black-Right-Pointing-Pointer Zero field, zero temperature limits. Black-Right-Pointing-Pointer Thermodynamic equivalence with ensemble of classical Ising models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗