Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Matrix”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Machine-learning prediction for quasiparton distribution function matrix elements

There have been rapid developments in the direct calculation in lattice QCD (LQCD) of the Bjorken-x dependence of hadron structure through large-momentum effective theory (LaMET). LaMET overcomes the previous limitation of LQCD to moments (that is, integrals over Bjorken x) of hadron structure, allowing LQCD to directly provide the kinematic regions where the experimental values are least known. LaMET requires large-momentum hadron states to minimize its systematics and allow us to reach small- x reliably. This means that very fine lattice spacing to minimize lattice artifacts at order $(P_za)^n$ will become crucial for next-generation LaMET-like structure calculations. Furthermore, such calculations require operators with long Wilson-link displacements, especially in finer lattice units, increasing the communication costs relative to that of the propagator inversion. In this work, we explore whether machine-learning algorithms can make predictions of correlators to reduce the computational cost of these LQCD calculations. We consider two algorithms, gradient-boosting decision tree and linear models, applied to LaMET data, the matrix elements needed to determine the kaon and $η_s$ unpolarized parton distribution functions (PDFs), meson distribution amplitude (DA), and the nucleon gluon PDF. We find that both algorithms can reliably predict the target observables with different prediction accuracy and systematic errors. The predictions from smaller displacement z to larger ones work better than those for momentum p due to the higher correlation among the data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Comparing models for a unitary black hole S matrix

This paper compares features, challenges, and puzzles of different models for a unitary black hole S -matrix, focusing on both recent nonisometric models, as well as “nonviolent unitarization,” which is based on new quantum interactions of a black hole. As a foundation for comparison, the description of real-time Hawking evolution is first overviewed, including leading effects of gravitational dressing and backreaction. Connection is then made to qubit models for evolution, and some technology is outlined to facilitate their description. Important features of both nonisometric models and nonviolent unitarization are investigated in qubit models, which illustrate essential differences between the respective approaches. The nonisometric models present puzzles for understanding evolution of internal outgoing excitations, which can be excited by interactions such as particle decay. Qubit models for nonviolent unitarization are further developed, and nicely illustrate aspects of that approach. Some remaining questions in generalizing to more complete models for evolution are discussed. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2024

Random matrix model of the Virasoro minimal string

The model of two dimensional quantum gravity defining the Virasoro minimal string, presented recently by Collier, Eberhardt, Mühlmann, and Rodriguez, was also shown to be perturbatively (in topology) equivalent to a random matrix model. An alternative definition is presented here, in terms of double-scaled orthogonal polynomials, thereby allowing direct access to nonperturbative physics. Already at leading order, the defining string equation’s properties yield valuable information about the nonperturbative fate of the model, confirming that the case ( c = 25 , c ^ = 1 ) (central charges of spacelike and timelike Liouville sectors) is special, by virtue of sharing certain key features of the N = 1 supersymmetric JT gravity string equation. Solutions of the full string equation are constructed using a special limit, and the (Cardy) spectral density is completed to all genus and beyond. The distributions of the underlying discrete spectra are readily accessible too, as is the spectral form factor. Some examples of these are exhibited. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2024

Nonperturbative random matrix model of N = 2 JT supergravity

It is shown how to nonperturbatively define a random matrix model that captures key physics of N = 2 Jackiw-Teitelboim supergravity, going well beyond the perturbative topological expansion defined recently by Turiaci and Witten. A decomposition into an infinite family of certain multicritical models is derived, leading to the definition of a nonlinear ordinary differential equation from which the physics may be computed. Bogomol’nyi-Prasad-Sommerfield (BPS) states are naturally described by the model. The nonperturbative completions of the spectral densities for non-BPS multiplets are readily extracted. Published by the American Physical Society 2024

Johnson, Clifford V. (ORCID:0000000189645830)↗
DOE OSTI2025

Finite-temperature phase diagram of the Berenstein-Maldacena-Nastase matrix model on the lattice

We investigate the thermal phase structure of the Berenstein-Maldacena-Nastase matrix model using nonperturbative lattice Monte Carlo calculations. Our main analyses span 3 orders of magnitude in the coupling, involving systems with sizes up to 𝑁𝜏 =24 lattice sites and SU⁡(𝑁) gauge groups with 8 ≤𝑁 ≤16. In addition, we carry out extended checks of discretization artifacts for 𝑁𝜏 ≤128 and gauge group SU(4). We find results for the deconfinement temperature that interpolate between the perturbative prediction at weak coupling and the large-𝑁 dual supergravity calculation at strong coupling. While we confirm that the phase transition is first order for strong coupling, it appears to be continuous for weaker couplings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Equilibrium solute segregation to matrix- θ' precipitate interfaces in Al-Cu alloys from first principles

Particular combinations of solute atoms segregated to the interface of the Al and θ ' - Al 2 Cu in Al-Cu alloys can help stabilize θ ' precipitates at high temperatures. Stabilization of such precipitates is determined by a combination of thermodynamics (including driving forces for coarsening and transformation and solute segregation tendencies) and kinetic effects (including solute diffusion and interfacial mobility in the presence of interfacial solute segregation). For some alloys such as recent Al-Cu-based alloys, multiple solutes segregate in significant quantities to interfaces, and solute-solute interactions at the interface are important, with multiple types of solutes competing for similar interfacial sites. To treat this situation, we develop and apply a statistical mechanics approach to calculate the temperature-dependent equilibrium solute atoms distribution near the coherent and semicoherent interfaces between the Al matrix and the θ ' - Al 2 Cu precipitates. The developed approach is applied to the investigation of Si, Mn, and Zr segregation at the interface, as particular combinations of these elements affect the thermal stability of the θ ' precipitates. We demonstrate that because Si and Mn atoms segregate on the same semicoherent interface, the presence of Si reduces the concentration of Mn solutes at the interface. Si atoms preferably occupy the first layer of the interface and compete with Mn atoms for one type of particular sites in the layer. Mn atoms preferably occupy the second layer of the semicoherent interface, and the Mn-Mn interaction plays an important role in their distribution. Zr atoms mostly segregate on one of the two nonequivalent sites of the second layer of the coherent interface. Due to symmetry properties of the coherent interface, the calculations show that the segregation Zr of atoms to this interface will likely lead to the formation of L 1 2 ordered Al 3 Zr layer.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Effect of organic electroactive crystallites in a dielectric matrix on the electrical properties of a polymer dielectric

In this work, the effects of inserting chargeable α-quaterthiophene (α4T) crystallites in polystyrene (PS) multilayers used as a transistor gate and capacitor dielectric were investigated. X-ray diffraction (XRD), scanning electron microscopy with energy dispersive x-ray spectroscopy (SEM/EDS), and confocal microscopy indicated the formation of α4T crystallites in the PS matrix. A modified saturation-regime current voltage relationship was used to estimate organic field-effect transistor (OFET) threshold voltage V TH shifting, and in turn the quantities of stored charge that were observed as a result of dielectric charging. The crystallites increased the maximum charge storage capacity as well as the charge retention capability of the dielectrics. Kelvin probe force microscopy (KPFM) showed that charges were localized near the α4T crystallites upon charging. Trilayer experiments validated the charge retention improvement of α4T crystallite-embedded PS dielectrics. The crystallites also improved breakdown characteristics in PS used as a capacitor dielectric, suggesting their application to storage capacitors in addition to OFET logic.

25 ENERGY STORAGE↗
DOE OSTI2024

Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it has been shown that the Affleck-Kennedy-Lieb-Tasaki state—a paradigmatic example of an MPS—can be exactly prepared with an adaptive quantum circuit of constant depth, an impossible feat with local unitary gates alone due to its nonzero correlation length [Smith , PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming theoretically optimal preparation with unitary circuits. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states. Published by the American Physical Society 2024

Smith, Kevin C. (ORCID:0000000223971518)↗
DOE OSTI2025

Bottomonium properties in the quark-gluon plasma from a lattice-QCD informed 𝑇-matrix approach

Recent computations of bottomonium correlation functions with extended sources in lattice-discretized quantum chromodynamics (lQCD) provide new insights into heavy-quark dynamics at distance scales which are of the order of the inverse temperature. We analyze these results employing the thermodynamic 𝑇-matrix framework, in a continued effort to interpret lQCD data for quarkonium correlation functions in a nonperturbative and self-consistently solved quantum-many-body approach to a strongly coupled quark-gluon plasma (QGP). Its key inputs are the in-medium driving kernel (potential) of the scattering equation and an interference function which implements 3-body effects in the quarkonium coupling to the thermal medium. A simultaneous description of lQCD results for the bottomonium correlators with extended operators and the previously analyzed Wilson line correlators only requires minor refinements of the potential but calls for stronger interference effects at larger separation of the bottom quark and antiquark. We then analyze the poles of the self-consistent 𝑇 matrices on the real axis to assess the survival of the various bound states. Here, we estimate the pertinent temperatures where the poles disappear for the various bottomonium states and discuss the relation to the corresponding peaks in the bottomonium spectral functions. We also recalculate the spatial diffusion coefficient of the QGP and find it to be similar to that in our previous study.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Assessment of the Distributed Ledger Technology for Energy Sector Industrial and Operational Applications Using the MITRE ATT&CK® ICS Matrix

In recent times, Distributed Ledger Technology (DLT) has gained significant attention for its potential application in the energy sector. Utilizing blockchain and DLT has demonstrated the ability to enhance the resilience of the electric infrastructure, which will support a more flexible infrastructure and advance grid modernization. However, the deployment of these technologies increases the overall attack surface. The MITRE ATT&CK® matrices have been developed to document an adversary’s tactics and techniques based on real-world observations. The MITRE ATT&CK® matrices provide a common taxonomy for offense and defense and have become a valuable conceptual tool across multiple cybersecurity disciplines for conveying threat intelligence, performing testing through red teaming or adversary emulation, and enhancing network and system defenses against intrusions. The MITRE ATT&CK® for Industrial Control Systems (ICS) matrix was created to provide knowledge about adversary behavior in the ICS technology domain. This study analyzes the relevance of various tactics and techniques across a seven-layer DLT engineering and cybersecurity stack, known as the DLT stack, designed by the Cybersecurity Taskforce under IEEE P2418.5 - Standard for Blockchain in Energy working group sponsored by Power and Energy Systems - Smart Buildings, Loads and Customer Systems (PES/SBLC) Technical Committee. Additionally, this paper identifies specific mitigation strategies tailored to the energy ICS environment

42 ENGINEERING↗
DOE OSTI2021

Nodal Admittance Matrix Based Area Partition Method for Small-Signal Stability Analysis of Large-Scale Power Electronics Based Power Systems

In power electronics-based power systems (PEPSs), small-signal stability is an important factor for system design and operation, where the impedance-based approach is often used. However, unlike small-scale PEPSs with simple and straightforward impedance models, it would take much more efforts to derive the large-scale PEPSs impedance model, which is very complicated and sometimes may get wrong results due to the elimination of right-half plane (RHP) poles during the impedance aggregation process. To simplify the derivation procedure and analyze the small-signal stability of large-scale PEPSs, this paper proposes a nodal admittance matrix (NAM) based area partition method. In this method, the large-scale PEPS is divided into several sub-areas, and the stability is analyzed within the sub-area first, and then the interconnection stability among these sub-areas is analyzed. The proposed method is scalable and can help to locate the weakest areas/converters that may cause instability in the whole system. In this paper, the concept of the proposed method and its application to an example system are introduced. Experimental results are also given to validate the effectiveness of the proposed method.

Qiao, Liang↗
DOE OSTI2024

On Rank Selection for Nonnegative Matrix Factorization

Rank selection, i.e. the choice of factorization rank, is the first step in constructing Nonnegative Matrix Factorization (NMF) models. It is a long-standing problem which is not unique to NMF, but arises in most models which attempt to decompose data into its underlying components. Since these models are often used in the unsupervised setting, the rank selection problem is further complicated by the lack of ground truth labels. In this paper, we review and empirically evaluate the most commonly used schemes for NMF rank selection.

Eswar, Srinivas [Argonne National Laboratory]↗
DOE OSTI2024

FTTN: Feature-Targeted Testing for Numerical Properties of NVIDIA & AMD Matrix Accelerators

While NVIDIA has been the dominant provider of GPUs for HPC and ML, now AMD has several offerings of GPUs. This encourages programmers to try out AMD GPUs for new codes and also port existing codes over. Unfortunately, without understanding the floating-point differences between these GPU types, software development or porting can introduce bugs—and currently such an understanding is lacking. The magnitude of this open question becomes clear if one imagines the the number of floating-point precision choices (FP16, FP32, etc.), floating-point formats (standard floats, brain-float, etc.), and execution units available (elementary units, matrix/tensor cores, etc.) Questions such as rounding modes and subnormal support are also important. Most of these answers are unknown today or are hard to access. We provide the first testing-guided approach that answers a significant number of these questions. We also devise tests to reveal internal information (e.g., extra bits kept) to make sure that our findings are reliable. Many of our tests employ systematically generated random-programs, others apply fast-math flags and some involve fused multiplyadd. Especially for tensor/matrix cores, the tests have nontrivial logic that we present Our testing approach is reusable for the plethora of GPUs yet to be introduced. Our findings include up to 7 ulps of difference between NVIDIA and AMD for sin and cos at FP32 precision and 3 ulp at FP64. In our study of matrix cores (NVIDIA) and tensor cores (AMD), we have extensively characterized rounding modes (truncation versus round-to-nearest), the number of extra internal bits kept (whether 3 bits are kept or not), subnormal support for inputs and outputs across four different floating-point formats and across NVIDIA A100 and AMD MI250X GPUs. We believe that this wealth of data becoming available for the first time may help avoid significant porting bugs when migrating code across these platforms.

Li, Xinyi↗
DOE OSTI2022

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In the graph data structure like adjacency matrix, the connectivity of two nodes can be sufficiently represented using only 1 bit, but they are generally treated as 32-bit full-precision in state-of-the-art graph frameworks to adopt common sparse format such as CSR. Meanwhile, bit-level parallelism has recently be explored to have high-performance potential and low storage requirement on GPUs with dense bit-tiles. To fill the gap, our solution is a hierarchical storage format that contains the bit-indexing base and dense bit-tile units. Inherently, the granularity of the bit-tile is an essential factor in achieving both storage compression and GPU parallelism. How to find a sweet spot that trades off between avoiding sparsity and exploiting is comprehensively researched in this work. In the experiment, we evaluate the proposed storage format and algorithms on modern generation GPUs, including Pascal and Volta, to figure out critical software co-designs in conjunction with existing hardware-specific optimization.

Chen, Jou-An↗
DOE OSTI2026

A Novel Low-Profile High-Efficiency Three-Phase Matrix Transformer

High step-down isolated DC-DC conversion from an 800 V DC bus to low-voltage, high-current outputs is required in automotive auxiliary converters and data center power supplies. In such applications, conventional transformer-based converters require large turns ratios, which increase winding resistance, leakage inductance, and magnetic height. This paper proposes a novel low-profile three-phase matrix transformer that realizes a large effective voltage ratio through flux division among multiple secondary legs, without increasing the physical turns count of each winding. As a result, the proposed structure reduces copper usage and transformer height while preserving the voltage conversion capability of a conventional three-phase transformer. Finite element analysis shows that the proposed design reduces magnetic height by 27%, ferrite volume by 34%, and copper volume by 28%. Circuit-level simulations of an 800 V/12 V,3 kW CLLLC dual-active-bridge converter further show that the lower winding resistance reduces total system loss by 91% and increases DC-DC efficiency from 82.6% to 97.6% at 3 kW output.

Inoue, Shuntaro [ORNL] (ORCID:0000000262637627)↗
DOE OSTI2024

On the Stability of Power Transmission Systems Under Persistent Inverter Attacks: A Bi-Linear Matrix Approach

We investigate the stability and robustness properties of a power transmission system under persistent deceiving attacks on inverter-interfaced energy resources. The attacks can corrupt the damping coefficients in the inverters' controllers and measurements of the frequency at the points of coupling. Leveraging tools from hybrid dynamical systems theory, we characterize a broad family of persistent (and not necessarily periodic) attacks acting on the inverters, under which the stability properties of the transmission system can be shown to not be compromised. To address potentially conservative conditions identified through conventional bounding techniques, sufficient conditions on the average activation time of the attacks are identified via Lyapunov theory, as well as the formulation and solution of a class of bilinear matrix inequalities (BMI). The results are obtained for constant and slowly time-varying loads via input-to-state stability (ISS) tools. Numerical simulations on the IEEE 39-bus test system are also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization

We develop the first distributed-memory parallel implementation of Symmetric Nonnegative Matrix Factorization (SymNMF), a key data analytics kernel for clustering and dimensionality reduction. Our implementation includes two different algorithms for SymNMF, which give comparable results in terms of time and accuracy. The first algorithm is a parallelization of an existing sequential approach that uses solvers for non symmetric NMF. The second algorithm is a novel approach based on the Gauss-Newton method. It exploits second-order information without incurring large computational and memory costs. We evaluate the scalability of our algorithms on the Summit system at Oak Ridge National Laboratory, scaling up to 128 nodes (4,096 cores) with 70% efficiency. Additionally, we demonstrate our software on an image segmentation task.

Eswar, Srinivas↗
DOE OSTI2023

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗