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,279 records · Page 71

Teko v. 1.0

Teko is a C++ library for implementation of blocked and segregated preconditioners in the context of iterative solvers for linear systems. Capabilities for decomposing larger matrices into user defined sub blocks are also provided. Additional functionality for creating approximate inverse operators utilizing solver and preconditioning packages in the Trilinos framework has also been implemented. Teko's primary application is in multiphysics simulation environment where a decomposition of the linear system in to physically meaningful blocks can be utilized to enhance performance of an iterative solver. However, applicability may extend to other problem domains where matrices can be decomposed into meaningful blocks.

Cyr, Eric↗

Smisc - A collection of miscellaneous functions

A collection of functions for statistical computing and data manipulation. These include routines for rapidly aggregating heterogeneous matrices, manipulating file names, loading R objects, sourcing multiple R files, formatting datetimes, multi-core parallel computing, stream editing, specialized plotting, etc. Smisc-package A collection of miscellaneous functions allMissing Identifies missing rows or columns in a data frame or matrix as.numericSilent Silent wrapper for coercing a vector to numeric comboList Produces all possible combinations of a set of linear model predictors cumMax Computes the maximum of the vector up to the current index cumsumNA Computes the cummulative sum of a vector without propogating NAs d2binom Probability functions for the sum of two independent binomials dataIn A flexible way to import data into R. dbb The Beta-Binomial Distribution df2list Row-wise conversion of a data frame to a list dfplapply Parallelized single row processing of a data frame dframeEquiv Examines the equivalence of two dataframes or matrices dkbinom Probability functions for the sum of k independent binomials factor2character Converts all factor variables in a dataframe to character variables findDepMat Identify linearly dependent rows or columns in a matrix formatDT Converts date or datetime strings into alternate formats getExtension Filename manipulations: remove the extension or path, extract the extension or path getPath Filename manipulations: remove the extension or path, extract the extension or path grabLast Filename manipulations: remove the extension or path, extract the extension or path ifelse1 Non-vectorized version of ifelse integ Simple numerical integration routine interactionPlot Two-way Interaction Plot with Error Bar linearMap Linear mapping of a numerical vector or scalar list2df Convert a list to a data frame loadObject Loads and returns the object(s) in an ".Rdata" file more Display the contents of a file to the R terminal movAvg2 Calculate the moving average using a 2-sided window openDevice Opens a graphics device based on the filename extension p2binom Probability functions for the sum of two independent binomials padZero Pad a vector of numbers with zeros parseJob Parses a collection of elements into (almost) equal sized groups pbb The Beta-Binomial Distribution pcbinom A continuous version of the binomial cdf pkbinom Probability functions for the sum of k independent binomials plapply Simple parallelization of lapply plotFun Plot one or more functions on a single plot PowerData An example of power data pvar Prints the name and value of one or more objects qbb The Beta-Binomial Distribution rbb And numerous others (space limits reporting).

Landon Sego, PNNL↗

Sandia Hyperspectral Upper-Bound Spectrum Version 1.0

The Sandia hyperspectral upper-bound spectrum algorithm (hyper-UBS) is a cosmic ray despiking algorithm for hyperspectral data sets. When naturally-occurring, high-energy (gigaelectronvolt) cosmic rays impact the earth’s atmosphere, they create an avalanche of secondary particles which will register as a large, positive spike on any spectroscopic detector they hit. Cosmic ray spikes are therefore an unavoidable spectroscopic contaminant which can interfere with subsequent analysis. A variety of cosmic ray despiking algorithms already exist and can potentially be applied to hyperspectral data matrices, most notably the upper-bound spectrum data matrices (UBS-DM) algorithm by Dongmao Zhang and Dor Ben-Amotz which served as the basis for the hyper-UBS algorithm. However, the existing algorithms either cannot be applied to hyperspectral data, require information that is not always available, introduce undesired spectral bias, or have otherwise limited effectiveness for some experimentally relevant conditions. Hyper-UBS is more effective at removing a wider variety of cosmic ray spikes from hyperspectral data without introducing undesired spectral bias. In addition to the core algorithm the Sandia hyper-UBS software package includes additional source code useful in evaluating the effectiveness of the hyper-UBS algorithm. The accompanying source code includes code to generate simulated hyperspectral data contaminated by cosmic ray spikes, several existing despiking algorithms, and code to evaluate the performance of the despiking algorithms on simulated data.

Anthony, Stephen↗

HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\WW$ and $\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\WW$ and $\HH$ within the alternating iterations.

Kannan, Ramakrishnan↗

Fully Homomorphic Encryption

This code implements a Fully Homomorphic Encryption (FHE) system, enabling secure computation on encrypted data without requiring decryption. It supports encryption, decryption, and homomorphic operations like matrix multiplication and addition. This code is adaptable for integrating FHE into linear-time invariant (LTI) systems, including digital control and filtering. With proper configuration from subject matter expertise, encrypted system parameters and signals can be manipulated to perform tasks like state updates, output calculations, and convolution in the encrypted domain. By preserving the structure of LTI systems while ensuring privacy, the framework facilitates secure applications in areas such as autonomous systems, signal processing, and industrial automation. The code initializes the encryption system using parameters provided in the env dictionary. These parameters include the ciphertext modulus, key dimension, plaintext fixed-point scaling factor, and noise bound. During initialization, a secret key is generated, which is essential for encrypting and decrypting data securely. The modular design allows users to tailor these parameters to specific use cases or security requirements. The code implements multiple cryptographic schemes. The learning with errors (LWE) encryption method encodes cleartext message to their plaintext fixed-point representation then encrypted into ciphertext space with additive noise. This noise ensures the security of the scheme, relying on the computational hardness of the LWE problem. The code also includes the Gentry-Sahai-Waters (GSW) scheme based off the LWE problem. Homomorphic matrix multiplication is performed between the LWE and GSW to encrypted data. This is achieved using a decomposition function on the LWE ciphertext during the multiplication operation. For higher-dimensional data, the code includes a method to encrypt entire matrices (GSWMat) using GSW encryption. These encrypted matrices can then be used for homomorphic matrix multiplications (MatMult). The decryption function uses the secret key to recover the original plaintext, removing the added noise and scaling that was originally applied during encryption.

Lois, Roberts [Idaho National Laboratory (INL), Id↗

Matrix-based Parallel Redistribution

MatRed is a parallel redistribution tool for HPC applications. It provides a simple approach that only requires a few relation matrices between entities to build redistribution matrices in parallel simulation codes. In particular, MatRed is well-suited for simulation codes based on finite element/volume methods.

Kalchev, DelyanZ [Lawrence Livermore National Labo↗

Dataset of Simulated Intracardiac Transmembrane Voltage Recordings and ECG Signals

The dataset consists of pairs of computationally simulated intracardiac transmembrane voltage recordings and ECG signals. In total, 16140 organ-level simulations were conducted to create this dataset, using a range of cardiac geometries and physiological parameters. Simulations were performed at LLNL's Lassen supercomputer, concurrently utilizing 4 GPUs and 40 CPU cores. Each simulation produced pairs of 500ms-by-10 ECG signals and 500ms-by-75 transmembrane voltage signals. For convenience, the signals are concatenated and saved as matrices. Each of these matrices is then stored as a numpy array. See the documentation for further details.

Landajuela, Mikel↗

GridPACK™ : A Framework for Developing Power Grid Simulations on High-Performance Computing Platforms

This paper describes the GridPACK™ framework, which is designed to help power grid engineers develop modeling software capable of running on high performance computers. The framework makes extensive use of software templates to provide high level functionality while at the same time allowing developers the freedom to express whatever models and algorithms they are using. GridPACK™ contains modules for setting up distributed power grid networks, assigning buses and branches with arbitrary behaviors to the network, creating distributed matrices and vectors and using parallel linear and non-linear solvers to solve algebraic equations. It also provides mappers to create matrices and vectors based on properties of the network and functionality to support IO and to mana

Palmer, Bruce J.↗

CASTELO: clustered atom subtypes aided lead optimization—a combined machine learning and molecular modeling method

Background: Drug discovery is a multi-stage process that comprises two costly major steps: pre-clinical research and clinical trials. Among its stages, lead optimization easily consumes more than half of the pre-clinical budget. We propose a combined machine learning and molecular modeling approach that partially automates lead optimization workflow in silico, providing suggestions for modification hot spots. Results: The initial data collection is achieved with physics-based molecular dynamics simulation. Contact matrices are calculated as the preliminary features extracted from the simulations. To take advantage of the temporal information from the simulations, we enhanced contact matrices data with temporal dynamism representation, which are then modeled with unsupervised convolutional variational autoencoder (CVAE). Finally, conventional and CVAE-based clustering methods are compared with metrics to rank the submolecular structures and propose potential candidates for lead optimization. Conclusion: With no need for extensive structure-activity data, our method provides new hints for drug modification hotspots which can be used to improve drug potency and reduce the lead optimization time. It can potentially become a valuable tool for medicinal chemists.

59 BASIC BIOLOGICAL SCIENCES↗

Rotational symmetry relation for efficient response function generation in the coarse mesh transport method COMET

The coarse mesh transport code COMET is a continuous energy hybrid stochastic-deterministic neutronics solver with high fidelity and formidable computation speed in solving reactor core problems. Its method is based on the incident flux expansion theory. In this work, we take advantage of the local geometric symmetry in many reactor cores lattices (e.g., fuel lattices and reflector blocks) to develop relations among the flux response expansion coefficients for symmetric surfaces to further improve the computational efficiency of the COMET response function generation tool (method). This is done by a rigorous derivation of the transformation matrices for the angular and spatial expansion moments resulting from a rotation of a coarse mesh by an arbitrary angle. The relations for the response coefficients for the symmetric surfaces can be then written as the Kronecker product of those transformation matrices. The method is implemented into COMET and tested on two advanced high temperature reactor (AHTR) full-length single assembly benchmark problems. The COMET results using the response function library based on the symmetry relations were compared to those using the library directly generated by continuous energy Monte Carlo for all surfaces. It was found that the eigenvalues and stripe-wise fission densities using the two libraries are in statistical agreement as expected. This indicates that the new method maintains the high fidelity of the original COMET method while improving the computational efficiency in the response function generation by 270% to 400%, depending on the local geometric symmetry. This method also reduces the size of the response function library by the same magnitude (270% to 400%). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗

Analysis, identification and confirmation of synthetic opioids using chloroformate chemistry: Retrospective detection of fentanyl and acetylfentanyl in urine and plasma samples by EI-GC-MS and HR-LC-MS

Electron Impact Gas Chromatography-Mass Spectrometry (EI-GC-MS) and High Resolution Liquid Chromatography-Mass Spectrometry (HR-LC-MS) have been used in the analysis of products arising from the trichloroethoxycarbonylation of fentanyl and acetylfentanyl in urine and plasma matrices. The method involves the initial extraction of both synthetic opioids separately from the matrices followed by detection of the unique products that arise from their reaction with 2,2,2-trichloroethoxycarbonyl chloride (Troc-Cl), namely Troc-norfentanyl and Troc-noracetylfentanyl. The optimized protocol was successfully evaluated for its efficacy at detecting these species formed from fentanyl and acetylfentanyl when present at low and high levels in urine (fentanyl: 5 and 10 ng/mL and acetylfentanyl: 20 and 100 ng/mL) and plasma (fentanyl: 10 and 20 ng/mL and acetylfentanyl: 50 and 200 ng/mL), values that reflect levels reported in overdose victims. The HR-LC-MS method’s LOQ (limit of quantitation) for the Troc-norfentanyl and Troc-noracetylfentanyl products was determined to be ~10 ng/mL for both species. Even though the superiority in the detection of these species by HR-LC-MS over EI-GC-MS, the latter method proved to be important in the detection of the second product from the reaction, namely 2-phenylethyl chloride that is crucial in the determination of the original opioid. This observation highlights the importance of using complimentary analytical techniques in the analysis of a sample, whether biological or environmental in nature. The method herein serves as a complementary, qualitative confirmation for the presence of a fentanyl in collected urine, plasma and by extension other biological samples amenable to the common extraction procedures described for opioid analysis. More importantly, the method’s main strength comes from its ability to react with unknown fentanyls to yield products that can be not only detected by EI-GC-MS and HR-LC-MS but can then be used to retrospectively identify an unknown fentanyl.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reconstructing the backbone of the Saccharomycotina yeast phylogeny using genome-scale data

Understanding the phylogenetic relationships among the yeasts of the subphylum Saccharomycotina is a prerequisite for understanding the evolution of their metabolisms and ecological lifestyles. In the last two decades, the use of rDNA and multilocus data sets has greatly advanced our understanding of the yeast phylogeny, but many deep relationships remain unsupported. In contrast, phylogenomic analyses have involved relatively few taxa and lineages that were often selected with limited considerations for covering the breadth of yeast biodiversity. Here we used genome sequence data from 86 publicly available yeast genomes representing nine of the 11 known major lineages and 10 nonyeast fungal outgroups to generate a 1233-gene, 96-taxon data matrix. Species phylogenies reconstructed using two different methods (concatenation and coalescence) and two data matrices (amino acids or the first two codon positions) yielded identical and highly supported relationships between the nine major lineages. Aside from the lineage comprised by the family Pichiaceae, all other lineages were monophyletic. Most interrelationships among yeast species were robust across the two methods and data matrices. Furthermore, eight of the 93 internodes conflicted between analyses or data sets, including the placements of: the clade defined by species that have reassigned the CUG codon to encode serine, instead of leucine; the clade defined by a whole genome duplication; and the species Ascoidea rubescens . These phylogenomic analyses provide a robust roadmap for future comparative work across the yeast subphylum in the disciplines of taxonomy, molecular genetics, evolutionary biology, ecology, and biotechnology. To further this end, we have also provided a BLAST server to query the 86 Saccharomycotina genomes, which can be found at http://y1000plus.org/blast.

59 BASIC BIOLOGICAL SCIENCES↗

Daily water stable isotopes, transpiration, and matrix potential data for an aspen and engelmann stand in the East River Watershed (version 2)

We provide daily stable isotope (2H & 18O) ratios in soil water and xylem (plant stem) water, as well as the sap flow (transpiration) and the soil's matric potential at a forested site near Gothic, Colorado, in the East River catchment. We measured the stable isotopic composition of the transpiration and the daily transpiration flux sum of three aspen and three engelmann spruce. In both forest stands, we installed a soil profile and measured the soil matric potential at 15, 30, and 60 cm depth as well as the stable isotopes of soil pore water at 5, 10, 30, 60, and 90 cm depths. All isotope measurements were done in situ via vapor probes connected to a cavity ring down spectrometer (Picarro L1240i).We further report the daily meteorological data observed at billy barr near our study site. We also provide for each tree the relative share of root water uptake derived from the isotope measurements via a Bayesian mixing model (MixSIAR).The daily data is provided as a time series in "Iso_MP_Sap_DataDaily_ESSDiveUpload.csv" and the units are provided in "dd.csv"; the location of the instrumented trees and soil profiles are given as latitude and longitude coordinates saved as CSV and KMZ files; and a file-level metadata (flmd.csv) file that lists each file contained in the dataset with associated metadata.The data was gathered to investigate the short-term changes of the water sources (i.e., variation of root water uptake from different soil depths) of the studied subalpine trees.Update 07/16/2025: The relative and absolute plant water uptake depths were grouped to ensure that the MixSIAR model was applied with endmembers that differed in their d2H value by at least 3 permill and at least 1 permill for d18O. Whenever the difference between observed d2H values for two or more probes at neighboring depths was less than 3 permill, we used the average value for the source water endmember. For days at which probes that were not next to each other measurements did not differ at least 3 permill, the average of all probes between these two depths was used as the water source endmember representing the depth range between these two probes.

54 ENVIRONMENTAL SCIENCES↗

Do Cover Crops and Corn Residue Removal Affect Soil Thermal Properties?

Soil thermal properties govern the transport and storage of heat in the soil. How management practices such as crop residue removal and cover crop (CC) use affect these soil properties is not well understood. For example, CCs could provide physical cover and improve soil properties after main crop residue removal and thus ameliorate the negative effects of residue removal on soil thermal properties. We measured changes in soil thermal properties including soil thermal conductivity, thermal diffusivity, volumetric heat capacity, and related properties under corn (Zea mays L.) residue removal with and without winter cereal rye (Secale cereale L.) under a 6-yr irrigated no-till continuous corn experiment on a silt loam in south central Nebraska. Cover crops did not affect thermal properties, but corn residue removal reduced field thermal conductivity by 12 to 41% and volumetric heat capacity by 6 to 49% during the growing season for the 0- to 5-cm depth. Residue removal also reduced laboratory thermal conductivity by 19% at –0.03-MPa and by 28% at –1.5-MPa matric potential. Residue removal also reduced volumetric heat capacity in the laboratory by 23% at both matric potentials in the 0- to 10-cm depth. Neither residue removal nor CC affected thermal diffusivity. Thermal conductivity was more strongly correlated with soil water content than with bulk density and soil organic C. Altogether, CC had no effect on thermal properties, but corn residue removal could reduce the soil’s ability to conduct heat relative to no removal.

54 ENVIRONMENTAL SCIENCES↗

Contrast Matching Biopolymers: A SANS-Based Approach to Structural Characterization of Chitosan

Immobilizing enzymes in polysaccharide-based matrices has been shown to improve both their stability and their catalytic efficiency. Among available materials, chitosan was selected for its abundance, biocompatibility, and versatility in a range of applications. While the broader aim of this work is to study chitosan as a matrix for immobilizing carbonic anhydrase (CA) for CO₂ capture, this study focused on determining the contrast match point (CMP) of hydrogenated and deuterated chitosan in D₂O:H₂O mixtures to enable future structural investigations using small-angle neutron scattering (SANS). Previous work successfully synthesized deuterated chitosan from Rhizopus oryzae mycelia and assessed the degree of deuteration using Fourier-transform infrared spectroscopy (FTIR) and nuclear magnetic resonance (NMR). Building on this foundation, the current study determined the CMPs of both H-chitosan and D-chitosan by performing SANS measurements across a range of D₂O:H₂O solvent contrasts. The extracted CMPs for both forms correlated well with their respective calculated scattering length densities (SLDs), validating the experimental approach. These results establish a critical reference for selective contrast matching in future SANS studies of carbonic anhydrase immobilized in chitosan matrices, enabling detailed structural analysis of enzyme–matrix interactions.

Kosgallana, Chathurika J [ORNL] (ORCID:00000002851↗

Electron beam treatment for the removal of 1,4-dioxane in water and wastewater

Electron beam (e-beam) treatment uses accelerated electrons to form oxidizing and reducing radicals when applied to water without the use of external chemicals. In this study, electron beam treatment was used to degrade 1,4-dioxane in several water matrices. Removal improved in the progressively cleaner water matrices and removals as high as 94% to 99% were observed at a dose of 2.3 kGy in secondary effluent. 1,4-dioxane removal was confirmed to be primarily through hydroxyl radical oxidation. The calculated electrical energy per order was found to be 0.53, 0.26, and 0.08 kWh/m 3 /order for secondary effluent (Avg. total organic carbon (TOC) 9.25 mg/L), granular activated carbon effluent (TOC 3.46 mg/L), and ultrapure water, respectively, with a 70% generation and transfer efficiency applied.

1,4-dioxane↗

A systematic investigation of PET Radionuclide Specific Activity on Miniaturization of Radiochemistry

The PET radionuclides, 18F and 11C consist of very high radiation to mass amounts and should be easily adapted to new technologies such as chip chemistry with nanofluidics. However, environmental contamination with nonradioactive fluorine, carbon and other trace contaminants add sufficient mass, micrograms to milligrams, to prevent adapting PET radiochemistry to the nanochip technologies. In addition, the large volumes of material required for beam irradiation make it necessary to also remove the 18F and 11C from their chemical matrices. These steps add contaminants. The work described in this report was a systematic investigation of sources of these contaminants and methods to reduce these contaminants and the reaction volumes for radiochemical synthesis. Several methods were found to lower the contaminants and matrices to within a factor of 2 to 100 of those needed to fully implement chip technology but further improvements are needed.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗