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.

SourceResearch connectionFrom yearThrough year

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

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Multipartite entanglement in two-dimensional chiral topological liquids

The multipartite entanglement structure for the ground states of two-dimensional (2D) topological phases is an interesting albeit not well-understood question. Utilizing the bulk-boundary correspondence, the calculation of tripartite entanglement in 2D topological phases can be reduced to that of the vertex state, defined by the boundary conditions at the interfaces between spatial regions. In this paper, we use the conformal interface technique to calculate entanglement measures in the vertex state, which include area-law terms, corner contributions, and topological pieces, and a possible additional order-one contribution. Furthermore, this explains our previous observation of the Markov gap ℎ = $\frac{c}{3}$ ⁢ln⁡2 in the three-vertex state, and generalizes this result to the p-vertex state, general rational conformal field theories, and more choices of subsystems. Finally, we support our prediction by numerical evidence, finding precise agreement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Universal features of 2 → N scattering in QCD and gravity from shockwave collisions

A remarkable double-copy relation of Einstein gravity to QCD in Regge asymptotics is Γ μ ν = 1 2 C μ C ν − 1 2 N μ N ν , where Γ μ ν is the gravitational Lipatov vertex in the 2 → 3 graviton scattering amplitude, C μ its Yang-Mills counterpart, and N μ the QED bremsstrahlung vertex. In QCD, the Lipatov vertex is a fundamental building block of the BFKL equation describing the 2 → N scattering of gluons at high energies. Likewise, the gravitational Lipatov vertex is a key ingredient in a 2D effective field theory framework describing trans-Planckian 2 → N graviton scattering. We construct a quantitative correspondence between a semiclassical Yang-Mills framework for radiation in gluon shockwave collisions and its counterpart in general relativity. In particular, we demonstrate the Lipatov double copy in a dilute-dilute approximation corresponding to R S , L , R S , H ≪ b , where R S , L , R S , H are the respective emergent Schwarzchild radii generated in shockwave collisions and b is the impact parameter. We outline extensions of the correspondence developed here to the dilute-dense computation of gravitational wave radiation in the close vicinity of one of the black holes, the construction of graviton propagators in the shockwave background, and a renormalization group approach to compute 2 → N amplitudes that incorporates graviton Reggeization and coherent graviton multiple scattering. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2015

Dynamical mass generation in unquenched QED using the Dyson-Schwinger equations

We present a comprehensive numerical study of dynamical mass generation for unquenched QED in four dimensions, in the absence of four-fermion interactions, using the Dyson-Schwinger approach. We begin with an overview of previous investigations of criticality in the quenched approximation. To this we add an analysis using a new fermion-antifermion-boson interaction ansatz, the Kizilersu-Pennington (KP) vertex, developed for an unquenched treatment. After surveying criticality in previous unquenched studies, we investigate the performance of the KP vertex in dynamical mass generation using a renormalized fully unquenched system of equations. This we compare with the results for two hybrid vertices incorporating the Curtis-Pennington vertex in the fermion equation. We conclude that the KP vertex is as yet incomplete, and its relative gauge-variance is due to its lack of massive transverse components in its design.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2019

A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs

In this paper, we propose a distributed, unordered, label-correcting distance-1 Grundy (vertex) coloring algorithm, namely, Distributed Control (DC) coloring algorithm. Our algorithm eliminates the need for vertex-centric barriers and global synchronization for color refinement, relying only on atomic operations and local termination detection to update vertex color. DC proceeds optimistically, correcting the colors asynchronously as the algorithm progresses and depends on local ordering of tasks to minimize the execution of sub-optimal work. We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm and compare their performance with 4 different types of standard RMAT graphs and real-world graphs. We show that the elimination of waiting time of global and vertex-centric barriers and investing this time for local ordering leads to improved scaling for graphs with prominent power-law characteristics and densely interconnected local subgraphs.

Firoz, Jesun S.↗

DOE OSTI2021

Trust: Triangle Counting Reloaded on GPUs

Triangle counting is a building block for a wide range of graph applications. Here, traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle counting beats vertex-centric design, and iii) communication-free and workload balanced graph partitioning is a grand challenge for triangle counting. On the contrary, we advocate that i) hashing can help the key operations for scalable triangle counting on Graphics Processing Units (GPUs), i.e., list intersection and graph partitioning, ii) vertex-centric option reduces both hash table construction cost and memory consumption, which is limited on GPUs. In addition, iii) we exploit graph and workload collaborative, and hash-based 2D partitioning to scale vertex-centric triangle counting over 1,000 GPUs with sustained scalability. In this work, we present TRUST, which performs triangle counting with the hash operation and vertex-centric paradigm. To the best of our knowledge, TRUST is the first work that achieves over one trillion Traversed Edges Per Second (TEPS) rate for triangle counting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Reconstruction of primary vertices at the ATLAS experiment in Run 1 proton–proton collisions at the LHC

This paper presents the method and performance of primary vertex reconstruction in proton–proton collision data recorded by the ATLAS experiment during Run 1 of the LHC. The studies presented focus on data taken during 2012 at a centre-of-mass energy of √s = 8 TeV. The performance has been measured as a function of the number of interactions per bunch crossing over a wide range, from one to seventy. The measurement of the position and size of the luminous region and its use as a constraint to improve the primary vertex resolution are discussed. A longitudinal vertex position resolution of about 30 μm is achieved for events with high multiplicity of reconstructed tracks. The transverse position resolution is better than 20 μm and is dominated by the precision on the size of the luminous region. An analytical model is proposed to describe the primary vertex reconstruction efficiency as a function of the number of interactions per bunch crossing and of the longitudinal size of the luminous region. Agreement between the data and the predictions of this model is better than 3% up to seventy interactions per bunch crossing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2017

CUDA Enabled Graph Subset Examiner

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k vertices with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.

Johnston, JeremyT.↗

DOE OSTI2023

Hyperbolic string tadpole

Hyperbolic geometry on the one-bordered torus is numerically uniformized using Liouville theory. This geometry is relevant for the hyperbolic string tadpole vertex describing the one-loop quantum corrections of closed string field theory. We argue that the Lamé equation, upon fixing its accessory parameter via Polyakov conjecture, provides the input for the characterization. The explicit expressions for the Weil-Petersson metric as well as the local coordinates and the associated vertex region for the tadpole vertex are given in terms of classical torus conformal blocks. The relevance of this vertex for vacuum shift computations in string theory is highlighted.

Firat, Atakan Hilmi↗

NASA NTRS1971

Eigenvalues of the Laplacian of a graph

Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

Anderson, W. N., Jr.↗

NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

DOE OSTI2016

CUDA Enabled Graph Subset Examiner

Johnston, Jeremy T.↗

DOE OSTI2021

Universal image representation based on a multimodal graph

A system for classifying a target image with segments having attributes is provided. The system generates a graph for the target image that includes vertices representing segments of the image and edges representing relationships between the connected vertices. For each vertex, the system generates a subgraph that includes the vertex as a home vertex and neighboring vertices representing segments of the target image within a neighborhood of the segment represented by the home vertex. The system applies an autoencoder to each subgraph to generate latent variables to represent the subgraph. The system applies a machine learning algorithm to a feature vector comprising a universal image representation of the target image that is derived from the generated latent variables of the subgraphs to generate a classification for the target image.

Bremer, Peer-Timo↗

DOE OSTI2023

Universal image representation based on a multimodal graph

Bremer, Peer-Timo↗

DOE OSTI2025

Unraveling the role of temperature on the onset of ejecta formation at atomic scales

Shock wave interactions with perturbations on a free surface can lead to the inversion and growth of the perturbation and eventual ejection of a jet of material, referred to as an ejecta microjet, from shocked surfaces. Here, this study carries out large-scale molecular dynamics (MD) simulations using single-crystal Cu and Sn systems with a pre-existing groove to characterize the localized gradients in temperatures and pressures generated that render the microjet formation. MD simulations are carried out for three loading orientations (along the [001], [011], and [111] directions) and shock pressures ranging from 16 GPa to 100 GPa to understand the role of temperatures generated at the groove vertex on the formation of ejecta. The simulations suggest that the interaction of the shock wave with the groove results in a localized increase in temperatures, leading to localized softening at the groove vertex and the generation of an ejecta microjet. For Cu systems, the simulations suggest that the orientation effects on shock wave structures, velocities, and localized softening affect the ejecta formation at low pressures. Jetting is only observed when temperatures at the groove vertex are high enough to induce localized softening (close to melting temperature), and the jet velocity increases with shock pressure. In contrast, the loading orientation is rendered inconsequential for Sn systems due to the melting of the material during shock compression at the pressures chosen. The jet velocities are similar, regardless of crystal orientation in Sn systems.

36 MATERIALS SCIENCE↗

DOE OSTI2013

The neutrino charge radius as a probe of physics beyond the standard model

In this paper, we review the search of possible physics effects beyond the standard model on the electromagnetic charge and anapole form factors, f{sub Q}(q{sup 2}) and f{sub A}(q{sup 2}), for a no massive Dirac neutrino, when these quantities are calculated in the frame of an effective electroweak Yang-Mills theory, which induces the most general SU{sub L}(2)-invariant Lorentz tensor structure of nonrenormalizable type for the WW{gamma} vertex. We found that in this frame, besides the standard model contribution, the additional contribution to f{sub Q}(q{sup 2}) and f{sub A}(q{sup 2}) (f{sub Q}{sup O{sub W}}(q{sup 2}) and f{sub A}{sup O{sub W}}(q{sup 2}), respectively) are gauge independent and finite functions of q{sup 2} after adopting a renormalization scheme. These form factors, f{sub Q}{sup O{sub W}}(q{sup 2}) and f{sub A}{sup O{sub W}}(q{sup 2}), get contribution at the one loop level only from the proper neutrino electromagnetic vertex. Besides, the relation f{sub Q}{sup eff}(q{sup 2}) = q{sup 2}f{sub A}{sup eff}(q{sup 2})(f{sub Q}{sup eff}(q{sup 2}) = f{sub Q}{sup SM}(q{sup 2})+f{sub Q}{sup O{sub W}}(q{sup 2}),f{sub A}{sup eff}(q{sup 2}) = f{sub A}{sup SM}(q{sup 2})+f{sub A}{sup O{sub W}}(q{sup 2})) is still fulfilled and hence the relation a{sub v}{sup eff} = {sup eff}/6(a{sub v}{sup eff} = a{sub v}{sup SM}+a{sub v}{sup O{sub W}}, {sup eff} = {sup SM}+ {sup O{sub W}}) is obtained, just as in the SM. Using the experimental constraint on the anomalous WW{gamma} vertex, a value for the additional contribution to the charge radius of Double-Vertical-Line {sup O{sub W}} Double-Vertical-Line Less-Than-Or-Equivalent-To 10{sup -34} cm{sup 2} is gotten, which is one order of magnitude lower than the SM value.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

New insights into the electronic structure of α-U and δ-Pu

Here, this work presents the results of a theoretical study of the electronic structure of two actinide metals, α -U and δ -Pu. We compare our ab-initio results obtained with the recently developed self-consistent Vertex corrected GW approach with previously published experimental measurements such as photo-electron spectroscopy, for the occupied density of states, and bremsstralung isochromat spectroscopy (BIS) and inverse photo-electron spectroscopy (IPES), for the unoccupied density of states. Our ab-initio approach includes all important relativistic effects (it is based on Dirac’s equation) and it represents the first application of the Vertex corrected GW approach in the physics of actinides. Overall, our theoretical results are in good agreement with the experimental data, which supports the level of approximations which our theoretical method is based upon. By comparing our vertex corrected GW results with our results obtained with less sophisticated approaches (local density approximation and self-consistent GW) we differentiate the strength of correlation effects in Uranium and Plutonium. Also, our theoretical results allow us to elucidate the subtle differences between the previously published experimental BIS and IPES data on the unoccupied density of states in α -U.

36 MATERIALS SCIENCE↗

DOE OSTI2017

Development of the self-consistent approximation and its application to the problem of magnetoelastic resonance in an inhomogeneous medium

Our previously proposed approximation involving both the first and second terms of the expansion of the vertex function is generalized to the system of two interacting wavefields of different physical nature. A system of self-consistent equations for the matrix Green’s function and matrix vertex function is derived. On the basis of this matrix generalization of the new self-consistent approximation, a theory of magnetoelastic resonance is developed for a ferromagnetic model, where the magnetoelastic coupling parameter ε(x) is inhomogeneous. Equations for magnetoelastic resonance are analyzed for one-dimensional inhomogeneities of the coupling parameter. The diagonal and off-diagonal elements of the matrix Green’s function of the system of coupled spin and elastic waves are calculated with the change in the ratio between the average value ε and rms fluctuation Δε of the coupling parameter between waves from the homogeneous case (ε ≠ 0, Δε = 0) to the extremely randomized case (ε = 0, Δε ≠ 0) at various correlation wavenumbers of inhomogeneities k{sub c}. For the limiting case of infinite correlation radius (k{sub c} = 0), in addition to approximate expressions, exact analytical expressions corresponding to the summation of all diagrams of elements of the matrix Green’s function are obtained. The results calculated for an arbitrary k{sub c} value in the new self-consistent approximation are compared to the results obtained in the standard self-consistent approximation, where only the first term of the expansion of the vertex function is taken into account. It is shown that the new approximation corrects disadvantages of the Green’s functions calculated in the standard approximation such as the dome shape of resonances and bends on the sides of resonance peaks. The appearance of a fine structure of the spectrum in the form of a narrow resonance on the Green’s function of spin waves and a narrow antiresonance on the Green’s function of elastic waves, which was previously predicted in the standard self-consistent approximation, is confirmed. With an increase in the parameter k{sub c}, the Green’s functions calculated in the standard and new approximations approach each other and almost coincide with each other at k{sub c}/k ≥ 0.5. At the same time, the results of this work indicate that the new self-consistent approximation has a certain advantage for studying the problems of stochastic radiophysics in media with long-wavelength inhomogeneities (small k{sub c} values), because it describes both the shape and width of peaks much better than the standard approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

A dynamic variational multiscale method on unstructured meshes for stationary transport problems

Here, this paper presents a variational multiscale (VMS) based finite element method where the stabilization parameter is computed dynamically. The current dynamic procedure takes in a general structure/form of the stabilization parameter with unknown coefficients and computes them dynamically in a local fashion resulting in a dynamic VMS-based finite element method. Thus, a static stabilization parameter with pre-defined coefficients is not needed. A variational Germano identity (VGI) based local procedure suitable for unstructured meshes is developed to perform the dynamic computation in a local fashion. The local VGI based procedure is applied for each interior vertex in the mesh and unknown coefficients are first determined locally at each vertex, and subsequently, for each element a maximum value is taken over the vertices of the element. To make the current procedure practical, a coarser secondary solution is constructed from the primary coarse-scale solution, which is done locally over a patch of elements around each interior vertex. Further, averaging steps are employed to make the local dynamic procedure robust. Currently, the new dynamic VMS formulation is applied to steady problems governed by the advection-diffusion and incompressible Navier-Stokes equations in both 1D and 2D to demonstrate its efficacy and effectiveness.

97 MATHEMATICS AND COMPUTING↗