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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Semi-analytical covariance matrices for two-point correlation function for DESI 2024 data

We present an optimized way of producing the fast semi-analytical covariance matrices for the Legendre moments of the two-point correlation function, taking into account survey geometry and mimicking the non-Gaussian effects. We validate the approach on simulated (mock) catalogs for different galaxy types, representative of the Dark Energy Spectroscopic Instrument (DESI) Data Release 1, used in 2024 analyses. We find only a few percent differences between the mock sample covariance matrix and our results, which can be expected given the approximate nature of the mocks, although we do identify discrepancies between the shot-noise properties of the DESI fiber assignment algorithm and the faster approximation (emulator) used in the mocks. Importantly, we find a close agreement (≤ 8% relative differences) in the projected errorbars for distance scale parameters for the baryon acoustic oscillation measurements. This confirms our method as an attractive alternative to simulation-based covariance matrices, especially for non-standard models or galaxy sample selections, making it particularly relevant to the broad current and future analyses of DESI data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Covariance matrices for variance-suppressed simulations

ABSTRACT Cosmological N-body simulations provide numerical predictions of the structure of the Universe against which to compare data from ongoing and future surveys, but the growing volume of the Universe mapped by surveys requires correspondingly lower statistical uncertainties in simulations, usually achieved by increasing simulation sizes at the expense of computational power. It was recently proposed to reduce simulation variance without incurring additional computational costs by adopting fixed-amplitude initial conditions. This method has been demonstrated not to introduce bias in various statistics, including the two-point statistics of galaxy samples typically used for extracting cosmological parameters from galaxy redshift survey data, but requires us to revisit current methods for estimating covariance matrices of clustering statistics for simulations. In this work, we find that it is not trivial to construct covariance matrices analytically for fixed-amplitude simulations, but we demonstrate that ezmock (Effective Zel’dovich approximation mock catalogue), the most efficient method for constructing mock catalogues with accurate two- and three-point statistics, provides reasonable covariance matrix estimates for such simulations. We further examine how the variance suppression obtained by amplitude-fixing depends on three-point clustering, small-scale clustering, and galaxy bias, and propose intuitive explanations for the effects we observe based on the ezmock bias model.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Quantum simulation of quantum phase transitions using the convex geometry of reduced density matrices

Transitions of many-particle quantum systems between distinct phases at absolute-zero temperature, known as quantum phase transitions, require an exacting treatment of particle correlations. Here in this work, we present a general quantum-computing approach to quantum phase transitions that exploits the geometric structure of reduced density matrices. While typical approaches to quantum phase transitions examine discontinuities in the order parameters, the origin of phase transitions—their order parameters and symmetry breaking—can be understood geometrically in terms of the set of two-particle reduced density matrices (2-RDMs). The convex set of 2-RDMs provides a comprehensive map of the quantum system including its distinct phases as well as the transitions connecting these phases. Because 2-RDMs can potentially be computed on quantum computers at nonexponential cost, even when the quantum system is strongly correlated, they are ideally suited for a quantum-computing approach to quantum phase transitions. We compute the convex set of 2-RDMs for a Lipkin-Meshkov-Glick spin model on IBM superconducting-qubit quantum processors. Even though computations are limited to few-particle models due to device noise, comparisons with a classically solvable 1000-particle model reveal that the finite-particle quantum solutions capture the key features of the phase transitions including the strong correlation and the symmetry breaking.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Generalized Analytical Estimation of Sensitivity Matrices in Unbalanced Distribution Networks

Fast and accurate estimation of sensitivity matrices is significant for the enhancement of distribution system modeling and automation. Analytical estimations have mainly focused on voltage magnitude sensitivity to active/reactive power injections for unbalanced networks with Wye-connected loads and neglecting DERs' smart inverter functionality. Hence, this paper enhances the scope of analytical estimation of sensitivity matrices for unbalanced networks with 1- Φ, 2- Φ, and 3- Φ Delta/Wye-connected loads, DERs with smart inverter functionality, and substation/line step-voltage regulators (SVR). A composite bus model comprising of DER, Delta- and Wye-connected load is proposed to represent a generic distribution bus, which can be simplified to load, PV, or voltage-controlled bus as required. Furthermore, the proposed matrix-based analytical method consolidates voltage magnitude and angle sensitivity to active/reactive power injection and tap-position of all SVRs into a single algorithm. Extensive case studies on IEEE and EPRI networks show the accuracy and wide scope of the proposed algorithm compared to the existing benchmark method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

A customized MOF-polymer composite for rapid gold extraction from water matrices

With the fast-growing accumulation of electronic waste and rising demand for rare metals, it is compelling to develop technologies that can promotionally recover targeted metals, like gold, from waste, a process referred to as urban mining. Thus, there is increasing interest in the design of materials to achieve rapid, selective gold capture while maintaining high adsorption capacity, especially in complex aqueous-based matrices. Here, a highly porous metal-organic framework (MOF)–polymer composite, BUT-33–poly(para-phenylenediamine) (PpPD), is assessed for gold extraction from several matrices including river water, seawater, and leaching solutions from CPUs. BUT-33–PpPD exhibits a record-breaking extraction rate, with high Au3+ removal efficiency (>99%) within seconds (less than 45 s), a competitive capacity (1600 mg/g), high selectivity, long-term stability, and recycling ability. Furthermore, the high porosity and redox adsorption mechanism were shown to be underlying reasons for the material’s excellent performance. Given the accumulation of recovered metallic gold nanoparticles inside, the material was also efficiently applied as a catalyst.

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

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices

We introduce a new parallel algorithm for solving sparse LU factorization of planar matrices, which commonly arise in the finite element method for 2D PDEs. Existing scalable methods, such as the multifrontal approach with subtree-to-subcube mapping by Gupta et al. [1] and right-looking with 3D mapping by Sao et al. [2] fail to achieve optimal communication costs for these matrices. Our new algorithm combines 3D mapping and subtree-to-subcube mapping to minimize communication costs while allowing trade-offs between extra memory and reduced communication. We demonstrate that our proposed algorithm attains the communication lower bound up to a factor of O(log log n) in the memory-optimal case and up to a factor of O(log P) in the memory-independent case for an n-dimensional planar sparse matrix on P processors.

Sao, Piyush↗
DOE OSTI2024

Rare Earth Elements (REEs) Measurement in Coal and Rock Mineral Matrices

Although critical minerals including rare earth elements (REEs) can be analyzed in laboratory by some established and reliable laboratory based analytical techniques, their in-situ measurements in the field have always been challenging. For identification of REE-rich sites and REEs distribution measurement, portable field applicable technologies are paramount. As Laser-induced breakdown spectroscopy (LIBS) has enormous potential for field measurement, it has been explored for REEs measurements by many research groups. However, most of the studies are still dealing with simulated samples with traditional bench top experiments. In real world, REEs are available in various types of natural complex matrices in low content depending on the geographical locations. Considering this, LIBS has been evaluated for REE measurement in two different complex coal and rock mineral matrices representing some natural REE-rich sites. In addition, multiple samples collected from some natural sites in Wyoming, USA were experimented by using NETL’s bench top as well as miniaturized prototype setups for REE measurements.

Bhatt, Chet R.↗
DOE OSTI2025

Rare Earth Element Detection and Quantification in Coal and Rock Mineral Matrices

As global demand for rare earth elements (REEs) increases, maintaining the production and supply chain is critical. Technologies capable of being used in the field and in situ in the subsurface for rapid REE detection and quantification facilitates the efficient mining of known resources and exploration of new and unconventional resources. Laser-induced breakdown spectroscopy (LIBS) is a promising technique for rapid elemental analysis both in the laboratory and in the field. Multiple articles have been published evaluating LIBS for detection and quantification of REEs; however, REEs in their natural deposits have not been adequately studied. In this work, detection and quantification of two REEs, La and Nd, have been studied in both synthetic and natural mineral matrices at concentrations relevant to REE extraction. Measurements were performed on REE-containing rock and coal samples (natural and synthetic) utilizing different LIBS instruments and techniques, specifically a commercial benchtop instrument, a custom benchtop instrument (single- and double-pulse modes), and a custom LIBS probe currently being developed for in situ, subsurface, borehole wall detection and quantification of REEs. Plasma expansion, emission intensity, detection limits, and double-pulse signal enhancement were studied. The limits of detection (LOD) were found to be 10/14 ppm for La and 15/25 ppm for Nd in simulated coal/rock matrices in single-pulse mode. Signal enhancement of 3.5 to 6-fold was obtained with double-pulse mode as compared to single-pulse operation.

La detection↗
DOE OSTI2024

Entropy Analysis of FPGA Interconnect and Switch Matrices for Physical Unclonable Functions

Random variations in microelectronic circuit structures represent the source of entropy for physical unclonable functions (PUFs). In this paper, we investigate delay variations that occur through the routing network and switch matrices of a field-programmable gate array (FPGA). The delay variations are isolated from other components of the programmable logic, e.g., look-up tables (LUTs), flip-flops (FFs), etc., using a feature of Xilinx FPGAs called dynamic partial reconfiguration (DPR). A set of partial designs is created to fix the placement of a time-to-digital converter (TDC) and supporting infrastructure to enable the path delays through the target interconnect and switch matrices to be extracted by subtracting out common-mode delay components. Delay variations are analyzed in the different levels of routing resources available within FPGAs, i.e., local routing and across-chip routing. Data are collected from a set of Xilinx Zynq 7010 devices, and a statistical analysis of within-die variations in delay through a set of the randomly-generated and hand-crafted interconnects is presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Square Root Statistics of Density Matrices and Their Applications

To estimate the degree of quantum entanglement of random pure states, it is crucial to understand the statistical behavior of entanglement indicators such as the von Neumann entropy, quantum purity, and entanglement capacity. These entanglement metrics are functions of the spectrum of density matrices, and their statistical behavior over different generic state ensembles have been intensively studied in the literature. As an alternative metric, in this work, we study the sum of the square root spectrum of density matrices, which is relevant to negativity and fidelity in quantum information processing. In particular, we derive the finite-size mean and variance formulas of the sum of the square root spectrum over the Bures–Hall ensemble, extending known results obtained recently over the Hilbert–Schmidt ensemble.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Biomass for Carbon Removal and Storage (BiCRS) Variables Matrices

The Biomass for Carbon Removal and Storage (BiCRS) Variables Matrices provide insights related to measured, monitored, reported and verified (MMRV) components (variables) across a BiCRS value chain. Suggested variable values and components to be measured with literature references and context obtained from industry and scientists are provided for several biomass sources, conversion routes and storage scenarios. The Variables Matrices are meant to support life cycle assessment and MMRV efforts for BiCRS projects. These variables and insights may need to be updated in the future as additional information, scientific advancements, and data become available (Version 1 issued in 2025).

09 BIOMASS FUELS↗
DOE OSTI2021

Power spectrum and form factor in random diagonal matrices and integrable billiards

Triggered by a controversy surrounding a universal behavior of the power spectrum in quantum systems exhibiting regular classical dynamics, we focus on a model of random diagonal matrices (RDM), often associated with the Poisson spectral universality class, and examine how the power spectrum and the form factor get affected by two-sided truncations of RDM spectra. Having developed a nonperturbative description of both statistics, we perform their detailed asymptotic analysis to demonstrate explicitly how a traditional assumption (lying at the heart of the controversy) – that the power spectrum is merely determined by the spectral form factor – breaks down for truncated spectra. This observation has important consequences as we further argue that bounded quantum systems with integrable classical dynamics are described by heavily truncated rather than complete RDM spectra. High-precision numerical simulations of semicircular and irrational rectangular billiards lend independent support to these conclusions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Performances of ionic liquid matrices with butyl ammonium counterion for matrix-assisted laser desorption/ionization mass spectrometric detection and analysis of sucralfate

In this work, the performances of two ionic liquid matrices (ILMs) with the same ammonium counterpart for mass spectrometric analysis of the insoluble and soluble sucralfate were compared. Matrix-assisted laser desorption/ionization mass spectrometry (MALDI MS) was performed assisted by the butylammonium salts of α-cyano-hydroxycinnamic acid (CHCAB) and 2,5-dihydroxybenzoic acid (DHBB). CHCAB has a higher IE than DHBB, but better optical properties. CHCAB is more suitable for the analysis of sucralfate, although molecular ions of both compounds were detectable only with low intensities. Thus, optical properties of ILMs are crucial to enhance the sensitivity of MALDI MS detection of polysulfated oligosaccharides. © 2019, © 2019 Taylor & Francis Group, LLC.

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

Soil water content, matric potential, carbon dioxide and oxygen concentrations, Oct 2018-Dec 2021, Slate River Floodplain, Crested Butte, Colorado

This data package includes a time series of soil sensor data (temperature, water content, bulk electrical conductivity, porewater dissolved oxygen and porewater dissolved carbon dioxide) in a vertical profile from the Slate River floodplain outside Crested Butte, Colorado, a focus field site for the SLAC Floodplain Hydro-Biogeochemistry SFA. The data was generated as part of the work targeting the overarching research question for the SLAC SFA: How do ubiquitous subsurface interfaces mediate molecular-scale biogeochemical processes and groundwater quality in floodplains and watersheds? The package includes: (1) soil temperature, volumetric water content and electrical conductivity at 40, 60 and 82.5 cm depth; (2) soil matric potential at 40, 60, 79 and 100 cm depth; (3) soil CO2 concentrations at 40, 60 and 82.5 cm depth; and (4) soil oxygen concentrations at 60, 82.5, 100, 135, 170 and 182 cm depth. Both the carbon dioxide and oxygen sensors are optical sensors that can measure the partial pressure of oxygen in both saturated and unsaturated conditions. Unfortunately, soil CO2 in the profile is unexpectedly high and above the sensor calibration range (0-25,000 ppm). In addition, soil CO2 sensors failed within a year of deployment, so we only report CO2 data from 2019-2020.Within the data package, "FLMD.csv" describes file-level metadata and "dd.csv" defines column headers and universal terms across the dataset. The data package includes 4 "*data.csv" files, one for each calendar year in the dataset. Each "*data.csv" file has a corresponding "*_InstallationMethods.csv" file that describes the location, sensor model, sensor serial number and other metadata corresponding for each measured parameter. Because sensors have been added over time, not every sensor has data dating back to Oct 2018. Note that there is a data gap over winter 2019-2020 due to a power outage. While this repository currently only contains data through December 2021, the dataset will be updated as additional years are collected and processed.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗