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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Machine Learning Using Rapidity-Mass Matrices for Event Classification Problems in HEP

In this work, supervised artificial neural networks (ANN) with rapidity–mass matrix (RMM) inputs are studied using several Monte Carlo event samples for various pp collision processes. The study shows the usability of this approach for general event classification problems. The proposed standardization of the ANN feature space can simplify searches for signatures of new physics at the Large Hadron Collider (LHC) when using machine learning techniques. In particular, we illustrate how to improve signal-over-background ratios in the search for new physics, how to filter out Standard Model events for model-agnostic searches, and how to separate gluon and quark jets for Standard Model measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Reply to: How much does corrosion of nuclear waste matrices matter

We thank Mallants and Chapman for their comments on our recent work and are mostly in agreement. However, while the applicability of the results to different environmental conditions requires more attention, we maintain that this study could be relevant even to repositories in saturated reduced environments. Oxidants other than oxygen might be present in anoxic groundwater repository environments and could also trigger the corrosion mechanism we described. .

Guo, Xiaolei↗
DOE OSTI2020

Milestone 2.7: Evaluation of Techniques for the Measurement of Molecular Hydrogen Gas in Helium Matrices

Published data by Task 2 (Oxyhydroxide Layer Radiolytic Gas Generation Resolution) for Technical Considerations and Challenges for Extended (>50 yrs) Dry Storage of Aluminum Cladded Spent Nuclear Fuel (ASNF), demonstrated that radiolytic molecular hydrogen (H2) production from gamma irradiated aluminum alloy 1100 (Al-1100) coupons exhibited significant dependence on backfill gaseous environment conditions: air, due to the presence of oxygen, completely inhibited H2 production; nitrogen promoted H2 production; and argon yielded more H2 than nitrogen environments. The concern here is that helium has been proposed as the backfill gas for extended storage and is more inert than argon, which may translate into significantly more H2 production than current Task 3 argon-based models predict. However, the measurement of H2 in helium media was not possible using the previously establish gas chromatography (GC) flame ionization detector, due to similarities in thermal conductivity. This milestone was initiated to evaluate an alternative GC approach that employed a mercuric oxide (HgO) reduction gas detector (RGD). Using the HgO RGD setup, H2 was successfully calibrated in the presence of a helium carrier gas, and then subsequently measured in control and irradiated crush-tube sample vials, consistent with previous sample measurements. Overall, the HgO RGD approach was found to be sufficient for future helium environment irradiations.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Covariance Shaping Over Riemannian Manifolds for Massive MIMO Communication

Acquiring accurate instantaneous channel state information (CSI) is a challenging aspect of massive multi-input multi-output (MIMO) communication. Utilizing statistical information, such as channel covariance matrix, to design statistical beamforming vectors is robust when compared to instantaneous CSI. In this paper, we propose a novel MIMO covariance shaping scheme over Riemannian manifolds. It serves as an effective statistical beamforming solution to a number of close proximity user equipment (UE) that are undergoing substantial channel correlation. Proposed algorithm exploits the Hermitian positive definite nature of covariance matrices lying over Riemannian manifold. We introduce Wasserstein distance function as a Riemannian metric to measure distances between channel covariance matrices. Furthermore, K-means clustering technique is utilized to effectively identify the optimal shape of effective optimal covariance matrices. Our findings suggest that maximizing the geodesic distance between covariance matrices ultimately leads to a corresponding increase in the network throughput, as determined by the beamforming vector used to shape the covariance matrices. Simulation results validate that the proposed solution converges faster than Euclidean-based state-of-the-art, while maintaining the same computational complexity. Finally, the sum rate performance asymptotically achieves full capacity for two-UE case and more than 96% of the upper bound exhaustive search benchmark for multi-UE scenario.

42 ENGINEERING↗
DOE OSTI2021

The R-matrix bootstrap for the 2d O( N ) bosonic model with a boundary

The S-matrix bootstrap is extended to a 1+1d theory with O(N) symmetry and a boundary in what we call the R-matrix bootstrap since the quantity of interest is the reflection matrix (R-matrix). Given a bulk S-matrix, the space of allowed R-matrices is an infinite dimensional convex space from which we plot a two dimensional section given by a convex domain on a 2d plane. In certain cases, at the boundary of the domain, we find vertices corresponding to integrable R-matrices with no free parameters. In other cases, when there is a one-parameter family of integrable R-matrices, the whole boundary represents integrable theories. We also consider R-matrices which are analytic in an extended region beyond the physical cuts, thus forbidding poles (resonances) in that region. In certain models, this drastically reduces the allowed space of R-matrices leading to new vertices that again correspond to integrable theories. We also work out the dual problem, in particular in the case of extended analyticity, the dual function has cuts on the physical line whenever unitarity is saturated. For the periodic Yang-Baxter solution that has zero transmission, we computed the R-matrix initially using the bootstrap and then derived its previously unknown analytic form.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

High performance sparse multifrontal solvers on modern GPUs

Here, we have ported the numerical factorization and triangular solve phases of the sparse direct solver STRUMPACK to GPU. STRUMPACK implements sparse LU factorization using the multifrontal algorithm, which performs most of its operations in dense linear algebra operations on so-called frontal matrices of various sizes. Our GPU implementation off-loads these dense linear algebra operations, as well as the sparse scatter–gather operations between frontal matrices. For the larger frontal matrices, our GPU implementation relies on vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs and rocBLAS and rocSOLVER for AMD GPUs. For the smaller frontal matrices we developed custom CUDA and HIP kernels to reduce kernel launch overhead. Overall, high performance is achieved by identifying submatrix factorizations corresponding to sub-trees of the multifrontal assembly tree which fit entirely in GPU memory. The multi-GPU setting uses SLATE (Software for Linear Algebra Targeting Exascale) as a modern GPU-aware replacement for ScaLAPACK. On 4 nodes of SUMMIT the code runs ~10X faster when using all 24 V100 GPUs compared to when it only uses the 168 POWER9 cores. On 8 SUMMIT nodes, using 48 V100 GPUs, the sparse solver reaches over 50TFlop/s. Compared to SuperLU, on a single V100, for a set of 17 matrices our implementation is faster for all but one matrix, and is on average 5X (median 4X) faster

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances

Quantum computing is a new and rapidly evolving paradigm for solving chemistry problems. In previous work, we developed the Quantum Annealer Eigensolver (QAE) and applied it to the calculation of the vibrational spectrum of a molecule on the D-Wave quantum annealer. However, the original QAE methodology was applicable to real symmetric matrices only. For many physics and chemistry problems, the diagonalization of complex matrices is required. For example, the calculation of quantum scattering resonances can be formulated as a complex eigenvalue problem where the real part of the eigenvalue is the resonance energy and the imaginary part is proportional to the resonance width. In the present work, we generalize the QAE to treat complex matrices: first complex Hermitian matrices and then complex symmetric matrices. These generalizations are then used to compute a quantum scattering resonance state in a 1D model potential for O + O collisions. These calculations are performed using both a software (classical) annealer and hardware annealer (the D-Wave 2000Q). The results of the complex QAE are also benchmarked against a standard linear algebra library (LAPACK). Furthermore, this work presents the first numerical solution of a complex eigenvalue problem of any kind on a quantum annealer, and it is the first treatment of a quantum scattering resonance on any quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

The Grassmann interpolation method for spin-unrestricted open-shell systems

The recently reported Grassmann interpolation (G-Int) method [J. A. Tan and K. U. Lao, J. Chem. Phys. 158, 051101 (2023)] has been extended to spin-unrestricted open-shell systems. In contrast to closed-shell systems, where G-Int has to be performed only once since the α and β density matrices are the same, spin-unrestricted open-shell systems require G-Int to be performed twice—one for the α spin and another for the β spin density matrix. In this work, we tested the performance of G-Int to the carbon monoxide radical cation CO●+ and nickelocene complex, which have the doublet and triple ground states, respectively. We found that the Frobenius norm errors associated with the interpolations for the α and β spin density matrices are comparable for a given molecular geometry. These G-Int density matrices, when used as an initial guess for a self-consistent field (SCF) calculation, outperform the conventional SCF guess schemes, such as the superposition of atomic densities, purified superposition of atomic densities, core Hamiltonian, and generalized Wolfsberg–Helmholtz approximation. Depending on the desired accuracy, these G-Int density matrices can be used to directly evaluate the SCF energy without performing SCF iterations. In addition, the spin-unrestricted G-Int density matrices have been used for the first time to directly calculate the atomic charges using the Mulliken and ChElPG population analysis.

Chemistry↗
DOE OSTI2022

SparseLU, A Novel Algorithm and Math Library for Sparse LU Factorization

Decomposing sparse matrices into lower and upper triangular matrices (sparse LU factorization) is a key operation in many computational scientific applications. We developed SparseLU, a sparse linear algebra library that implements a new algorithm for LU factorization on general sparse matrices. The new algorithm divides the input matrix into tiles to which OpenMP tasks are created for factorization computation, where only tiles that contain nonzero elements are computed. For comparative performance analysis, we used the reference library SuperLU. Testing was performed on synthetically generated matrices which replicate the conditions of the real-world matrices. SparseLU is able to reach a mean speedup of ~29× compared to SuperLU.

Valero Lara, Pedro↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Macromolecular gelatin properties affect fibrin microarchitecture and tumor spheroid behavior in fibrin-gelatin gels

The biophysical properties of extracellular matrices (ECM) are known to regulate cell behavior, however decoupling cell behavior changes due to the relative contributions of material microstructure versus biomechanics or nutrient permeability remains challenging, especially within complex, multi-material matrices. We developed four gelatin-fibrin interpenetrating network (IPN) formulations which are identical in composition but possess variable gelatin molecular weight distributions, and display differences in microstructure, biomechanics, and diffusivity. In this work we interrogate the response of multicellular tumor spheroids to these IPN formulations and found that a high stiffness, gelatin-network dominated IPNs impeded remodeling and invasion of multicellular tumor spheroids; whereas relatively lower stiffness, fibrin-network dominated IPNs permitted protease-dependent remodeling and spheroid invasion. Cell proliferation correlated to nutrient diffusivity across tested IPN formulations. These findings demonstrate the complexity of ECM IPNs, relative to single polymer matrices, and highlight that cell response does not derive from a single aspect of the ECM, but rather from the interplay of multiple biomechanical properties. The methodology developed in this study represents a framework for future studies which aim to characterize cellular phenotypic responses to biophysical cues present within complex, multi-material matrices.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Statistical learning for predicting density–matrix-based electron dynamics

In this study, we consider the problem of learning density-dependent molecular Hamiltonian matrices from time series of electron density matrices, all in the context of Hartree–Fock theory. Prior work developed a solution to this problem for small molecular systems with density and Hamiltonian matrices of size at most 6 × 6. Here, using a battery of techniques, we scale prior methods to larger molecular systems with, for example, 29 × 29 matrices. This includes systems that either have more electrons or are expressed in large basis sets such as 6-311++G**. Scaling the method to larger systems enhances its relevance for realistic applications in chemistry and physics. To achieve this scaling, we apply dimensionality reduction, ridge regression and analytic computation of Hessians. Through the combination of these techniques, we are able to learn Hamiltonians by minimizing an objective function that encodes local propagation error. Importantly, these learned Hamiltonians can then be used to predict electron dynamics for thousands of steps: When we use our learned Hamiltonians to numerically solve the time-dependent Hartree–Fock equation, we obtain predicted dynamics that are in close quantitative agreement with ground truth dynamics. This includes field-off trajectories similar to the training data and field-on trajectories outside of the training data.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Assessment the leaching characteristics and long-term leaching behavior of some radionuclides from synthesized zeolite cement matrix

Highlights: • Synthesis and characterization of zeolite cement synthesized from fly ash • Leaching tests were used to assess the release rate of {sup 85}Sr and {sup 60}Co radionuclides. • Simple mathematical models were used to detect leaching mechanisms. • Long-term leaching behavior of {sup 85}Sr and {sup 60}Co from cementitious matrix was assessed. The development of cementitious materials remains a vital goal to produce valuable products with good mechanical, physical and chemical properties suitable for the safe disposal of concentrated radionuclides resulted from the treatment of contaminated solutions. In this paper, zeolite cement with good properties was laboratory synthesized from industrial by-products fly ash and characterized using various characterization techniques. The leaching characteristics of strontium and cobalt radionuclides from the synthesized zeolite cement were scrutinized conforming with the standard leaching methodology of International Atomic Energy Authority (IAEA). A mechanical strength assessment was executed to characterize the extent of immobilization process of the solidified matrices. The cumulative leaching fraction (φ) of the two studied radionuclides was found to be less than 5% in all examined conditions, which implies the applicability of the IAEA-recommended methodology for estimating the diffusion coefficient. The experimental leaching data were regressed nonlinearly to various mathematical kinetic models to assess the controlling leaching mechanism and to determine the leaching parameters. The regression results indicated that strontium ({sup 85}Sr) and cobalt ({sup 60}Co) leaching resulted from two succeeding mechanisms: as first order kinetic reaction, and then diffusion. The calculated values of leachability indices signify that the performance of each of the studied matrices is within an acceptable range. A simplified mathematical model, rooted in the first order reaction and diffusion mechanisms, was simulated to predict the radionuclides leaching rates from zeolite cement matrices. By comparing the synthesized zeolite cement with other cementitious materials, it can be concluded that the synthesized material can be classified as an efficient material suitable to immobilize {sup 85}Sr and {sup 60}Co from radioactive wastes. The acquired findings demonstrated that the studied immobilized waste matrices have acceptable mechanical effectiveness.

36 MATERIALS SCIENCE↗
DOE OSTI2021

On the use of limestone calcined clay cement (LC3) in high-strength strain-hardening cement-based composites (HS-SHCC)

Highlights: • Use of LC{sup 3} slightly reduces flowability and shortens the setting time of fresh matrices. • Highly polymerized C-A-S-H gel and abundant ettringite benefit flexural strength of LC{sup 3}-matrices. • Use of LC{sup 3} enhances the bond strength between fiber and high-strength matrix. • LC{sup 3}-based HS-SHCC yields similar flexural performance as the composite with Portland cement. High-strength strain-hardening cement-based composites (HS-SHCC) demonstrate excellent mechanical and durability properties. However, high cement content typical to HS-SHCC results not only in high carbon footprint, but also in excessive hydration heat and severe autogenous shrinkage. In this investigation, Limestone Calcined Clay Cement (LC{sup 3}) was used to produce sustainable HS-SHCC. The LC{sup 3} substitution resulted in higher energy consumption during mixing and in shorter setting times of the fresh, plain matrices. Although the LC{sup 3} substitution slightly reduced the compressive strength, the formation of highly polymerized C-A-S-H gel and abundant ettringite benefited the flexural strength of the plain matrices. Additionally, single-fiber pullout experiments showed that the use of LC{sup 3} led to increased fiber-matrix bond strength and pullout energy. Finally, the replacement of Portland cement by LC{sup 3} resulted in HS-SHCC with similar mechanical performance to the reference composite, indicating a high potential for using LC{sup 3} in high-performance cement-based composites.

36 MATERIALS SCIENCE↗