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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), doi:10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. We examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 × 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Impact of fission yield covariance matrices on decay heat uncertainty quantification with the DARWIN2 package

Although fission yields are strongly correlated, correlations between them are usually not taken into account when performing decay heat uncertainty calculations with the CEA DARWIN2 package due to the lack of reference covariance matrices associated to the JEFF-3.1.1 evaluation. However, covariance matrices for {sup 235}U and {sup 239}Pu thermal fission yields have been produced recently by the subgroup 37 of OECD/NEA Working Party on International Nuclear Data Evaluation Cooperation (WPEC). The study presented in this paper evaluates the effect of those covariances on the decay heat uncertainty calculation, both on fission burst experiments and on integral decay heat measurements that are part of the DARWIN2 experimental validation database. Although some differences are observed, partly due to the variety of models used to produce the matrices, the propagation of fission yield covariances always leads to a reduction of the decay heat uncertainty for cooling time above 10 seconds, indicating that not taking them into account is a conservative hypothesis from a safety point of view. Nevertheless, the strong impact of those covariances on the decay heat uncertainty also highlights the need of documented and consistent fission yield uncertainties and correlation data. On top of that, all the covariance matrices used for this study represent the correlation between the physical model parameters, but none of them includes the experimental correlations. An evaluation of the experimental correlations would also be of strong interest for decay heat uncertainty calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Controlling matric potential in microfluidics to examine microbial dynamics in unsaturated porous media

The use of microfluidics for the study of soil microbial ecology is an emerging field. Most microfluidic studies of biological systems, however, have been performed under fully saturated conditions that are not representative of natural soil. Therefore, while microfluidics offer many unique capabilities that other methodologies cannot, they are not currently suited to address the effects of matric potential, an important variable defining the microbial moisture niche. Here, a methodology is presented that allows the user to control the aqueous conditions within microfluidic networks by manipulating matric potential using a hanging water column. The method relies on hydrophilic surface treatment of the microfluidic device using polyvinyl alcohol (PVA) and incorporating a bed of small pores at the network boundaries, which serve as a porous ceramic plate analogue (PPA). The method was validated on a simple capillary bundle and then on a more complex pore network. A water retention curve, exhibiting hysteresis, was generated for the pore network over a narrow matric potential range of 0 to – 5 kPa. Both the drainage and wetting curves were reproducible, as were the spatial configuration and the number of fragmented moisture niches in the pore network, particularly on the drainage curve. In contrast, the wetting curve exhibited greater variability in spatial configuration due to the “ink bottle effect,” where capillarity was interrupted by wider pore bodies. Ultimately, the methodology provides realistic pore-scale moisture conditions that can be easily manipulated and maintained, enabling new opportunities to explore soil biophysics and microbial biogeography in unsaturated porous media. As a brief example, images showing the localization of fluorescently tagged Pantoea sp. YR343 at −4.3 kPa are presented, highlighting bacterial distributions in water films and air-water interfaces.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Universal Polarization Transformations: Spatial Programming of Polarization Scattering Matrices Using a Deep Learning‐Designed Diffractive Polarization Transformer

Abstract Controlled synthesis of optical fields having nonuniform polarization distributions presents a challenging task. Here, a universal polarization transformer is demonstrated that can synthesize a large set of arbitrarily‐selected, complex‐valued polarization scattering matrices between the polarization states at different positions within its input and output field‐of‐views (FOVs). This framework comprises 2D arrays of linear polarizers positioned between isotropic diffractive layers, each containing tens of thousands of diffractive features with optimizable transmission coefficients. After its deep learning‐based training, this diffractive polarization transformer can successfully implement N i N o = 10 000 different spatially‐encoded polarization scattering matrices with negligible error, where N i and N o represent the number of pixels in the input and output FOVs, respectively. This universal polarization transformation framework is experimentally validated in the terahertz spectrum by fabricating wire‐grid polarizers and integrating them with 3D‐printed diffractive layers to form a physical polarization transformer. Through this set‐up, an all‐optical polarization permutation operation of spatially‐varying polarization fields is demonstrated, and distinct spatially‐encoded polarization scattering matrices are simultaneously implemented between the input and output FOVs of a compact diffractive processor. This framework opens up new avenues for developing novel devices for universal polarization control and may find applications in, e.g., remote sensing, medical imaging, security, material inspection, and machine vision.

Optical neural networks↗
DOE OSTI2024

Reduced-order model to approximate response matrices for filter stack spectrometers

We present a reduced-order model to calculate response matrices rapidly for filter stack spectrometers (FSSs). The reduced-order model allows response matrices to be built modularly from a set of pre-computed photon and electron transport and scattering calculations through various filter and detector materials. While these modular response matrices are not appropriate for high-fidelity analysis of experimental data, they encode sufficient physics to be used as a forward model in design optimization studies of FSSs, particularly for machine learning approaches that require sampling and testing a large number of FSS designs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Perturbation theory approach to predict the covariance matrices of the galaxy power spectrum and bispectrum in redshift space

In this paper, we predict the covariance matrices of both the power spectrum and the bispectrum, including full non-Gaussian contributions, redshift space distortions, linear bias effects, and shot-noise corrections, using perturbation theory (PT). To quantify the redshift-space distortion effect, we focus mainly on the monopole and quadrupole components of both the power and bispectra. We, for the first time, compute the 5- and 6-point spectra to predict the cross-covariance between the power and bispectra, and the autocovariance of the bispectrum in redshift space. Further, we test the validity of our calculations by comparing them with the covariance matrices measured from the MultiDark-Patchy mock catalogues that are designed to reproduce the galaxy clustering measured from the Baryon Oscillation Spectroscopic Survey Data Release 12. We argue that the simple, leading-order PT works because the shot-noise corrections for the Patchy mocks are more dominant than other higher order terms we ignore. In the meantime, we confirm some discrepancies in the comparison, especially of the cross-covariance. We discuss potential sources of such discrepancies. We also show that our PT model reproduces well the cumulative signal-to-noise ratio of the power spectrum and the bispectrum as a function of maximum wavenumber, implying that our PT model captures successfully essential contributions to the covariance matrices.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Validation of semi-analytical, semi-empirical covariance matrices for two-point correlation function for early DESI data

ABSTRACT We present an extended validation of semi-analytical, semi-empirical covariance matrices for the two-point correlation function (2PCF) on simulated catalogs representative of luminous red galaxies (LRGs) data collected during the initial 2 months of operations of the Stage-IV ground-based Dark Energy Spectroscopic Instrument (DESI). We run the pipeline on multiple effective Zel’dovich (EZ) mock galaxy catalogs with the corresponding cuts applied and compare the results with the mock sample covariance to assess the accuracy and its fluctuations. We propose an extension of the previously developed formalism for catalogs processed with standard reconstruction algorithms. We consider methods for comparing covariance matrices in detail, highlighting their interpretation and statistical properties caused by sample variance, in particular, non-trivial expectation values of certain metrics even when the external covariance estimate is perfect. With improved mocks and validation techniques, we confirm a good agreement between our predictions and sample covariance. This allows one to generate covariance matrices for comparable data sets without the need to create numerous mock galaxy catalogs with matching clustering, only requiring 2PCF measurements from the data itself. The code used in this paper is publicly available at https://github.com/oliverphilcox/RascalC.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Skew-Symmetric adjacency matrices for clustering directed graphs

Graph clustering methods often critically rely on the symmetry of graph matrices. Developing analogous methods for digraphs often proves more challenging, because digraph matrices are typically asymmetric and not orthogonally diagonalizable. However, researchers have recently proposed several complex-valued Hermitian digraph matrices. In particular, one such representation has been utilized as an input to an algorithm for finding imbalanced cuts. In this work, we establish an algebraic relationship between this matrix and an associated real-valued matrix. We show using this real-valued matrix for imbalanced cut-finding algorithms is not only sufficient but advantageous. Our algorithm uses less memory and asymptotically less computation while provably preserving solution quality. We also show our method can be easily implemented using standing computational building blocks, possesses better numerical properties, and loans itself to a natural interpretation via an objective function relaxation argument. We empirically demonstrate these advantages on real world data sets and show how our algorithm can uncover meaningful cluster structure.

Hayashi, Koby↗
DOE OSTI2022

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Implementation of a feature selection algorithm in FARM to identify important state variables and time-invariant matrices

The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM aids the HERON software module in the evaluation of the optimal dispatch for the different IES components. Set-point trajectories are required to meet limits on both production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.). To evaluate the feasibility of HERON generated set-points and to do so in an acceptable time, FARM employs reduced order models to represent the dynamic behavior of the systems to be dispatched. These surrogate models take the form of a linear dynamic system with sets of Linear Parameter Varying (LPV) matrices that are mapped to the system operating space. These matrices are derived from the trajectories of system state variables and system output variables during transients. The accuracy of LPV matrices depends on the selection of state variables. In previous reports, state variables were selected by adopting a complicated workflow requiring multiple software licenses and an advanced level of user expertise. In this report, a new workflow that automates the state variable selection process is presented. It significantly reduces the frequency of user interventions and does not require multiple software licenses. Each module in the new workflow is described in detail, and the input / output examples in each step of the workflow are provided. It was demonstrated that this workflow can greatly reduce the complexity of the state variable selection process, and that the updated FARM-Gamma and FARM-Delta validators can benefit from this workflow when solving the power dispatch problem of a representative IES test case. Finally, some code improvements that can further enhance the efficiency are suggested.

42 ENGINEERING↗
DOE OSTI2026

Quantum block encoding for one-pair semiseparable matrices

Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE has mostly focused on sparse matrices; less effort has been devoted to data-sparse (e.g., rank-structured) matrices. In this work we examine a particular case of rank structure, namely, one-pair semiseparable matrices. We present a new block encoding approach that relies on a suitable factorization of the given matrix as the product of triangular and diagonal factors. To encode the matrix, the algorithm needs $2\log(N)+7$ ancillary qubits. Assuming that the data input oracles can be implemented with polylogarithmic depth, or that a QRAM input model is available, our proposed method requires $\mathcal{O}({\rm polylog} (N))$ time and has an error of $\mathcal{O}(N^2)$, where $N$ is the matrix size.

Antonioli, Giacomo [Pisa U.; CERN] (ORCID:00090000↗
DOE OSTI2020

Computationally Efficient Decompositions of Oblique Projection Matrices

Oblique projection matrices arise in problems in weighted least squares, signal processing, and optimization. While these matrices can be potentially very large, their low-rank structure can be exploited for efficient computation. Here, we propose fast and scalable algorithms for computing their eigendecomposition and singular value decomposition (SVD). Numerical experiments that compare our proposed approaches to existing methods, including randomized SVD, are presented. In addition, we test their accuracy on linear systems from equality constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A data analysis method to rapidly characterize gallium concentration in plutonium matrices using LIBS

The processing of actinide samples is a complex and costly endeavor that requires compositional analysis at various stages. Laser-induced breakdown spectroscopy (LIBS) has been used to analyze actinide-containing samples in many nuclear applications including waste management, fuel processing and forensics. The LIBS spectrum obtained from actinide materials are generally extremely complex, exhibiting many thousands of strong emission lines. This makes it difficult to identify other elements within the sample of interest, given the rich and dominant actinide spectrum. Here, in this article, we describe a recent effort to identify and quantify impurities and alloying constituents in plutonium matrices using a hand-held LIBS instrument that is used to rapidly and efficiently measure an emission spectrum from a material sample. We tabulate the emission line positions and intensities of plutonium. We report the development of machine-learning software that can identify gallium and quantify its concentration in plutonium matrices. This work has the potential to provide a rapid and nearly non-destructive technique that allows more confidence in characterizing the composition of materials that are present within complex actinide associated targets. We describe how our LIBS measurements and data analysis methods have successfully quantified the gallium concentration in a variety of samples.

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

Current and future federal and state sampling guidance for per- and polyfluoroalkyl substances in environmental matrices

Per- and polyfluoroalkyl substances (PFAS) are a class of emerging contaminants composed of an estimated 5000 to 10,000 human-made, fluorinated, organic chemicals. Due to the complexity of PFAS, the need for multiple environmental matrix considerations and the absence of a promulgated federal standard for environmental sampling and analysis, U.S. states have begun developing health-based regulatory and/or guidance values for a limited number of PFAS in environmental matrices. As there is a growing body of science to inform PFAS sampling guidance standard development, it is important to understand which U.S. states are implementing sampling guidelines and how they plan to handle emerging PFAS. This critical review discusses the current and impending federal and state sampling guidelines for PFAS in environmental matrices, the data gaps surrounding PFAS sampling guidance in U.S. states, and the future impacts of impending guidance documents and regulations. Ten federal guidance documents are available for PFAS sampling guidance and analysis. The maximum number of PFAS covered in these guidance documents is 25 analytes spanning across 8 unique media. While the EPA has developed several different sampling and analytical guidelines for PFAS, there is no formal regulation of PFAS or requirements of states to enforce these guidelines. Consequently, only 31 states have informally adopted sampling guidelines, while the other 19 states have no guidance documentation in place for PFAS. The introduction of new PFAS sampling guidelines by the EPA, as well as updated analytical guidelines that target more PFAS or total organofluoride, is expected to continuously shift the landscape of federal and state guidance for PFAS sampling moving forward.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Carbamoylation as an Effective Tool in the Analysis of the Soman Nerve Agent Marker Pinacolyl Alcohol in Soil Matrices by EI-GC-MS and LC-HRMS

Pinacolyl alcohol (PA) is a Schedule 2 chemical commonly featured in most proficiency tests (PTs) administered by the Organisation for the Prohibition of Chemical Weapons (OPCW) due to its direct as well as forensic link to the nerve agent Soman. Therefore, its detection by Chemical Weapons Convention (CWC) inspection teams during on-site investigations is a strong indicator of the past or latent presence of Soman in the environment. Its small molecular weight (102), early elution time, and poor ionization profile make PA a challenging analyte to detect particularly at low concentrations (∼1–10 μg/g). In this work, 1,1′-carbonyldimidazole (CDI) has been used to effectively modify PA for the first time in two different soil matrices (Virginia type A soil and silt sediment) at two separate concentrations (1 and 10 μg/g) for its subsequent detection by EI-GC-MS and LC-HRMS methods. For the EI-GC-MS analysis, the PA carbamate derivative (PIC) exhibits improved chromatography relative to PA such as improved peak shape, increased molecular weight (196 for PIC and 102 for PA) and increased retention time (16.9 min for PIC and ∼4.1 min for PA). In addition, the derivatization also improves the detection of PA by LC-HRMS as the PIC product possesses protonation sites (i.e., imidazole ring) relative to none exhibited by PA. More importantly, the carbamoylation proceeds under mild conditions (55 °C, no base) and rapidly (3 h), characteristics that make it an appealing protocol for the analysis of PA during OPCW PTs or real case scenarios particularly in instances where it is present at low concentrations. It is anticipated that the protocol can be applied to the forensic analysis of this important Soman marker in various environmental matrices.

Chemistry↗
DOE OSTI2024

Cosmic topology. Part IIa. Eigenmodes, correlation matrices, and detectability of orientable Euclidean manifolds

Abstract If the Universe has non-trivial spatial topology, observables depend on both the parameters of the spatial manifold and the position and orientation of the observer. In infinite Euclidean space, most cosmological observables arise from the amplitudes of Fourier modes of primordial scalar curvature perturbations. Topological boundary conditions replace the full set of Fourier modes with specific linear combinations of selected Fourier modes as the eigenmodes of the scalar Laplacian. We present formulas for eigenmodes in orientable Euclidean manifolds with the topologiesE 1 –E 6 ,E 11 ,E 12 ,E 16 , andE 18 that encompass the full range of manifold parameters and observer positions, generalizing previous treatments. Under the assumption that the amplitudes of primordial scalar curvature eigenmodes are independent random variables, for each topology we obtain the correlation matrices of Fourier-mode amplitudes (of scalar fields linearly related to the scalar curvature) and the correlation matrices of spherical-harmonic coefficients of such fields sampled on a sphere, such as the temperature of the cosmic microwave background (CMB). We evaluate the detectability of these correlations given the cosmic variance of the observed CMB sky. We find that topologies where the distance to our nearest clone is less than about 1.2 times the diameter of the last scattering surface of the CMB give a correlation signal that is larger than cosmic variance noise in the CMB. This implies that if cosmic topology is the explanation of large-angle anomalies in the CMB, then the distance to our nearest clone is not much larger than the diameter of the last scattering surface. We argue that the topological information is likely to be better preserved in three-dimensional data, such as will eventually be available from large-scale structure surveys.

Astronomy & Astrophysics↗