Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrices”

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 1,225 records · Page 68

Universal mass matrix for quarks and leptons and CP violation

The measurements of the neutrino and quark mixing angles satisfy the empirical relations called quark-lepton complementarity. These empirical relations suggest the existence of a correlation between the mixing matrices of leptons and quarks. In this work, we examine the possibility that this correlation between the mixing angles of quarks and leptons originates in the similar hierarchy of quarks and charged lepton masses and the seesaw mechanism type I, that gives mass to the Majorana neutrinos. We assume that the similar mass hierarchies of charged lepton and quark masses allows us to represent all the mass matrices of Dirac fermions in terms of a universal form with four texture zeroes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bispectrum as baryon acoustic oscillation interferometer

The galaxy bispectrum, measuring excess clustering of galaxy triplets, offers a probe of dark energy via baryon acoustic oscillations (BAOs). However up to now it has been severely underused due to the combinatorically explosive number of triangles. Here we exploit interference in the bispectrum to identify triangles that amplify BAOs. Here, this approach reduces the computational cost of estimating covariance matrices, offers an improvement in BAO constraints equivalent to lengthening BOSS by 30% and simplifies adding bispectrum BAO information to future large-scale redshift survey analyses.

47 OTHER INSTRUMENTATION↗

Quantum Many-Body Theory from a Solution of the N -Representability Problem

Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.

74 ATOMIC AND MOLECULAR PHYSICS↗

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗

Two transitions in complex eigenvalue statistics: Hermiticity and integrability breaking

Open quantum systems have complex energy eigenvalues which are expected to follow non-Hermitian random matrix statistics, when chaotic, or two-dimensional (2d) Poisson statistics, when integrable. We investigate the spectral properties of a many-body quantum spin chain, i.e., the Hermitian Heisenberg model with imaginary disorder. Its rich complex eigenvalue statistics is found to separately break both Hermiticity and integrability at different scales of the disorder strength. With no disorder, the system is integrable and Hermitian, with spectral statistics corresponding to the 1d Poisson point process. At very small disorder, we find a transition from 1d Poisson statistics to an effective D -dimensional Poisson point process, showing Hermiticity breaking. At intermediate disorder, we find integrability breaking, as inferred from the statistics matching that of non-Hermitian complex symmetric random matrices in class AI † . For large disorder, as the spins align, we recover the expected integrability (now in the non-Hermitian setup), indicated by 2d Poisson statistics. These conclusions are based on fitting the spin-chain data of numerically generated nearest- and next-to-nearest-neighbor spacing distributions to an effective 2d Coulomb gas description at inverse temperature β . We confirm that such an effective description of random matrices also applies in classes AI † and AII † up to next-to-nearest-neighbor spacings. Published by the American Physical Society 2025

Akemann, Gernot (ORCID:0000000217104258)↗

Strong CP and flavor in multi-Higgs theories

We introduce a class of multi-Higgs doublet extensions of the Standard Model that solve the strong problem with profound consequences for the flavor sector. The Yukawa matrices are constrained to have many zero entries by a “Higgs-flavor” symmetry, , that acts on Higgs and quark fields. The violation of both and occurs in the Higgs mass matrix so that, for certain choices of charges, the strong parameter is zero at tree level. Radiative corrections to are computed in this class of theories. They vanish in realistic two-Higgs doublet models with . We also construct realistic three-Higgs models with , where the one-loop results for are model-dependent. Requiring has important implications for the flavor problem by constraining the Yukawa coupling and Higgs mass matrices. Contributions to from higher-dimension operators are computed at one loop and can also be sufficiently small, although the hierarchy problem of this class of theories is worse than in the Standard Model.

Hall, Lawrence↗

Diamonds in the rough: a strong case for the inclusion of weak-intensity X-ray diffraction data

Here, new evidence is provided to show that the inclusion of weak-intensity, high-resolution X-ray diffraction data helps to improve the quality of experimental phases by imposing proper constraints on electron-density models during noncrystallographic symmetry averaging. Overwhelming evidence exists to show that the inclusion of weak-intensity, high-resolution X-ray diffraction data helps improve the refinement of atomic models by imposing strong constraints on individual and overall temperature B factors and thus the quality of crystal structures. Some researchers consider these data to be of little value and opt to discard them during data processing, particularly at medium and low resolution, at which individual B factors of atomic models cannot be refined. Here, new evidence is provided to show that the inclusion of these data helps to improve the quality of experimental phases by imposing proper constraints on electron-density models during noncrystallographic symmetry (NCS) averaging. Using electron-density correlation coefficients as criteria, the resolution of data has successfully been extended from 3.1 to 2.5 Å resolution with redundancy-independent merging R factors from below 100% to about 310%. It is further demonstrated that phase information can be fully extracted from observed amplitudes through de novo NCS averaging. Averaging starts with uniform density inside double-shelled spherical masks and NCS matrices that are derived from bound heavy-atom clusters at the vertices of cuboctahedrally symmetric protein particles.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

Accelerating Subsurface Transport Simulation on Heterogeneous Clusters

Reactive transport numerical models simulate chemical and microbiological reactions that occur along a flowpath. These models have to compute reactions for a large number of locations. They solve the set of ordinary differential equations (ODEs) that describes the reaction for each location through the Newton-Raphson technique. This technique involves computing a Jacobian matrix and a residual vector for each set of equation, and then solving iteratively the linearized system by performing Gaussian Elimination and LU decomposition until convergence. STOMP, a well known subsurface flow simulation tool, employs matrices with sizes in the order of 100x100 elements and, for numerical accuracy, LU factorization with full pivoting instead of the faster partial pivoting. Modern high performance computing systems are heterogeneous machines whose nodes integrate both CPUs and GPUs, exposing unprecedented amounts of parallelism. To exploit all their computational power, applications must use both the types of processing elements. For the case of subsurface flow simulation, this mainly requires implementing efficient batched LU-based solvers and identifying efficient solutions for enabling load balancing among the different processors of the system. In this paper we discuss two approaches that allows scaling STOMP's performance on heterogeneous clusters. We initially identify the challenges in implementing batched LU-based solvers for small matrices on GPUs, and propose an implementation that fulfills STOMP's requirements. We compare this implementation to other existing solutions. Then, we combine the batched GPU solver with an OpenMP-based CPU solver, and present an adaptive load balancer that dynamically distributes the linear systems to solve between the two components inside a node. We show how these approaches, integrated into the full application, provide speed ups from 6 to 7 times on large problems, executed on up to 16 nodes of a cluster with two AMD Opteron 6272 and a Tesla M2090 per node.

GPU↗

Convolutional Neural Networks for Hydrometeor Classification using Dual Polarization Doppler Radars

Traditional fuzzy logic hydrometeor classification algorithm is a common way to classify precipitation type from dual polarization doppler radar. We propose a deep learning-based method to estimate hydrometeors efficiently using observed radar variables such as horizontal reflectivity (Z H ), differential reflectivity (Z DR ), correlation coefficient (ρ HV ) and specific differential phase (K DP ) from National Weather Service NEXRAD collected at Vance AFB facility at the first elevation angle from January 1st, 2015 to July 31th, 2019. We stack matrices of values from these four polarimetric variables as one 3D array. Samples are preprocessed and divided into training, validation and test set with four target hydrometeor categories (Ice Crystals (IC), Dry Snow (DS), Light and/or Moderate Rain (RA) and Big Drops (rain) (BD)). We developed and optimized five Convolutional Neural Networks (CNNs) architectures and achieved an accuracy of 87.23% and 93.736% respectively using modified ResNet with two different input data selection strategies for hydrometeor classification. Training data selection strategies were important to ensure use of available samples in training for robust performance evaluated by applying the models to novel time period beyond what was use to train the model. Seasonal variation in atmospheric conditions lead to seasonal patterns of liquid vs solid forms of precipitation, that poses challenge for classifier and offer insights into domain specific approaches required for problem of hydrometeor identification. Computationally efficient and scalable approach for classification of hydrometeors offer opportunties to effectively use the large volumes of rich time series of radar observations that are becoming increasingly available.

Lu, Yuping↗

Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations

Obtaining highly accurate predictions on the properties of light atomic nuclei using the configuration interaction (CI) approach requires computing a few extremal Eigen pairs of the many-body nuclear Hamiltonian matrix. In the Many-body Fermion Dynamics for nuclei (MFDn) code, a block Eigen solver is used for this purpose. Due to the large size of the sparse matrices involved, a significant fraction of the time spent on the Eigen value computations is associated with the multiplication of a sparse matrix (and the transpose of that matrix) with multiple vectors (SpMM and SpMM-T). Existing implementations of SpMM and SpMM-T significantly underperform expectations. Thus, in this paper, we present and analyze optimized implementations of SpMM and SpMM-T. We base our implementation on the compressed sparse blocks (CSB) matrix format and target systems with multi-core architectures. We develop a performance model that allows us to understand and estimate the performance characteristics of our SpMM kernel implementations, and demonstrate the efficiency of our implementation on a series of real-world matrices extracted from MFDn. In particular, we obtain 3-4 speedup on the requisite operations over good implementations based on the commonly used compressed sparse row (CSR) matrix format. The improvements in the SpMM kernel suggest we may attain roughly a 40% speed up in the overall execution time of the block Eigen solver used in MFDn.

97 MATHEMATICS AND COMPUTING↗

A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm

We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algorithms including breadth-first search, bipartite graph matching, and maximal independent set. As thread counts increase, existing multithreaded SpMSpV algorithms can spend more time accessing the sparse matrix data structure than doing arithmetic. Our shared-memory parallel SpMSpV algorithm is work efficient in the sense that its total work is proportional to the number of arithmetic operations required. The key insight is to avoid each thread individually scan the list of matrix columns. Our algorithm is simple to implement and operates on existing column-based sparse matrix formats. It performs well on diverse matrices and vectors with heterogeneous sparsity patterns. A high-performance implementation of the algorithm attains up to 15x speedup on a 24-core Intel Ivy Bridge processor and up to 49x speedup on a 64-core Intel KNL manycore processor. In contrast to implementations of existing algorithms, the performance of our algorithm is sustained on a variety of different input types include matrices representing scale-free and high-diameter graphs.

97 MATHEMATICS AND COMPUTING↗

The Reverse Cuthill-McKee Algorithm in Distributed-Memory

Ordering vertices of a graph is key to minimize fill-in and data structure size in sparse direct solvers, maximize locality in iterative solvers, and improve performance in graph algorithms. Except for naturally parallelizable ordering methods such as nested dissection, many important ordering methods have not been efficiently mapped to distributed-memory architectures. In this paper, we present the first-ever distributed-memory implementation of the reverse Cuthill-McKee (RCM) algorithm for reducing the profile of a sparse matrix. Our parallelization uses a two-dimensional sparse matrix decomposition. We achieve high performance by decomposing the problem into a small number of primitives and utilizing optimized implementations of these primitives. Our implementation shows strong scaling up to 1024 cores for smaller matrices and up to 4096 cores for larger matrices.

97 MATHEMATICS AND COMPUTING↗

Marine Animal Classification With Correntropy-Loss-Based Multiview Learning

To analyze marine animals' behavior, seasonal distribution, and abundance, digital imagery can be acquired by a camera or a Lidar. Depending on the quantity and properties of acquired imagery, the animals are characterized as either features (shape, color, texture, etc.) or dissimilarity matrices derived from different shape analysis methods (shape context, internal distance shape context, etc.). For both cases, multiview learning is critical in integrating more than one set of feature/dissimilarity matrix for higher classification accuracy. This paper adopts correntropy loss as the cost function in multiview learning, which has favorable statistical properties for rejecting noise. For the case of features, the correntropy-loss-based multiview learning and its “entrywise” variation are developed based on the multiview intact space learning algorithm. For the case of dissimilarity matrices, the robust Euclidean embedding algorithm is extended to its multiview form with the correntropy loss function. Results from simulated data and real-world marine animal imagery show that the proposed algorithms can effectively enhance classification rate as well as suppress noise under different noise conditions.

59 BASIC BIOLOGICAL SCIENCES↗

Effective matrix model for nuclear physics on a quantum computer

In this project we studied a simplified potential from [1] describing nuclear physics from quark and gluon fields, where spatial degrees of freedom have been integrated over. This potential deals with the phase structure of the strong interaction. We created a matrix representation of the Hamiltonian for this theory using discrete quantum mechanics [2]. We then feed this Hamiltonian to IBM's Qiskit package [3]. We run on IBM's 32-qubit quantum simulator, which approximates the ground state energy using the variational quantum eigensolver (VQE) algorithm [4]. This result is then compared with the exact ground state energy, which we can calculate classically since the matrices we use are still small enough. The bosonic Hamiltonian for a 6-qubit representation took over 1000 Pauli factors to represent fully. To improve our performance, we can look for a more efficient representation of this model's Hamiltonian. We will develop a better variational trial wave function and initial state, as well as include the effect of fermions and heavy quarks on the potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computation of nanosheets in a background magnetic field for external control of nanosystems

We ran quantum simulations on lattices of interacting fermions in a background magnetic field [1]. We created discretized Hamiltonian matrices for each system and pre-processed them so that they could be read by the quantum simulator implemented in IBM's Qiskit package [2]. The simulator uses the variational quantum eigensolver (VQE) algorithm [3] to approximate the ground state energy of the input Hamiltonian, which is then compared to the classically-calculated exact value. This classical evaluation is possible because the systems studied are still within the grasp of classical computers. We also investigated ways to simplify the system before the pre-processing step. We found that in almost all cases these simplifications made our quantum calculations converge to better answers using simpler starting conditions. We are exploring other ways to interface with IBM's quantum computing software so that we no longer need to explicitly define the Hamiltonian matrices for our systems, a problem which will itself soon become intractable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fault isolation and fault-tolerant control for Takagi-Sugeno fuzzy time-varying delay stochastic distribution systems

A fault isolation, estimation, and fault-tolerant control (FTC) scheme for nonlinear time-varying delay stochastic distribution control systems was presented in this paper. The Takagi-Sugeno fuzzy model was adopted to approach the nonlinear dynamics of time-varying delay systems. According to the output equivalence principle and Laplace transformation, an augmented state vector was given to solve the time-varying delay problem. When multiple actuator faults and interference occur simultaneously, fault detection, isolation and fault estimation was designed to obtained the fault information. To decouple faults and obtain the value and location information of the fault, the system was separated into two parts through the designed multiple conversion matrices, in which one subsystem was only affected by one actuator fault. This has simplified the design of fault isolation and estimation. A adaptive observer for fault estimation was given. Then, fault information such as the time, location, and size was determined. The observer gain matrices were calculated using linear matrix inequality (LMI). When a fault was detected and diagnosed, a FTC algorithm was devised using the proportional-integral control scheme to compensate the fault as much as possible. It has been shown that even if multiple faults actuator occurred simultaneously, the FTC controller still ensured the output probability density function of the system traced the desired probability density function when a fault occurred. Finally, the expected results were obtained through the simulation example, which confirmed the effectiveness of the method.

42 ENGINEERING↗