Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix decomposition”

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 415 records · Page 23

Conducting nanotubes or nanostructures based composites, method of making them and applications

An electromagnetic interference (EMI) shielding material includes a matrix of a dielectric or partially conducting polymer, such as foamed polystyrene, with carbon nanotubes or other nanostructures dispersed therein in sufficient concentration to make the material electrically conducting. The composite is formed by dispersing the nanotube material in a solvent in which the dielectric or partially conducting polymer is soluble and mixing the resulting suspension with the dielectric or partially conducting polymer. A foaming agent can be added to produce a lightweight foamed material. An organometallic compound can be added to enhance the conductivity further by decomposition into a metal phase.

Gupta, Mool C.↗

Dynamic Analysis of Reynolds Number Effects on Trailing Edge Transonic Vortex Shedding and Its Impact on Turbine Blade Aerodynamic Performance

Time-resolved, high-speed self-aligned focusing schlieren images were acquired in the NASA Glenn Research Center Transonic Turbine Blade Cascade facility to help understand the aerodynamic behavior of high-pressure, thick trailing edge turbine blades. The trailing edge thickness of 9% of axial chord tested represents simulated ceramic matrix composite fabrication constraints, which was verified previously to possess a high-loss flow regime at high inlet turbulence conditions over a narrow range of Reynolds numbers and at a fixed design exit Mach number of 0.74. Our high-speed images, which were acquired at 10 distinct Reynolds numbers, show a significant increase in energy from flow oscillations due to transonic vortex shedding at Reynolds numbers corresponding to the high loss conditions. For those conditions, strong acoustic waves turn into shock waves. Spectral Proper Orthogonal Decomposition of the high-speed images shows acoustic waves from trailing edge vortex shedding at all conditions, with increased spectral energy at the high-loss conditions and slightly increasing frequency (about 6%) as a function of Reynolds number. Analysis of potential feedback timing is performed using velocity fields from a previous LES simulation, considering different feedback mechanisms. Most noteworthy is the acoustic/shock-boundary layer interaction mechanism on the suction surface at the blade geometric throat, which likely plays an important role in realistic curved blade passages.

Trailing Edge↗

Decomposition-aggregation stability analysis

This report presents the development and description of the decomposition aggregation approach to stability investigations of high dimension mathematical models of dynamic systems. The high dimension vector differential equation describing a large dynamic system is decomposed into a number of lower dimension vector differential equations which represent interconnected subsystems. Then a method is described by which the stability properties of each subsystem are aggregated into a single vector Liapunov function, representing the aggregate system model, consisting of subsystem Liapunov functions as components. A linear vector differential inequality is then formed in terms of the vector Liapunov function. The matrix of the model, which reflects the stability properties of the subsystems and the nature of their interconnections, is analyzed to conclude over-all system stability characteristics. The technique is applied in detail to investigate the stability characteristics of a dynamic model of a hypothetical spinning Skylab.

Siljak, D. D.↗

Hot Hydrogen Testing of W-coated dUN Kernels for Nuclear Thermal Propulsion

Tungsten-coated kernels of uranium nitride (UN) are a possible reactor fuel component for nuclear thermal propulsion. Hot hydrogen testing of such kernels (approx. 250μm diameter, coating thickness 5μm) has been performed at temperatures from 1800°C to 2300°C for 30min each, using depleted uranium nitride (dUN). In addition to direct observations and mass loss measurements, the samples were analyzed by XRD and SEM/EDS after each run. Decomposition of dUN and the formation of molten uranium happened at all temperatures tested with reaction rates increasing with temperature, despite the tungsten coating. At 2300°C, the kernels disintegrated and molten uranium seeped through the wall and bottom of the tungsten crucible employed. These hot hydrogen tests allowed to test the integrity of the tungsten coating and addressed the operating limits of the loose tungsten-coated dUN kernels. Improved results are expected upon consolidation of the tungsten-coated dUN kernels in a Mo-W alloy matrix.

nuclear fuels↗

Mitigation of spatial nonstationarity with vision transformers

Spatial nonstationarity, the location variance of features’ statistical distributions, is ubiquitous in many natural settings. For example, in geological reservoirs rock matrix porosity varies vertically due to geomechanical compaction trends, in mineral deposits grades vary due to sedimentation and concentration processes, in hydrology rainfall varies due to the atmosphere and topography interactions, and in metallurgy crystalline structures vary due to differential cooling. Conventional geostatistical modeling workflows rely on the assumption of stationarity to be able to model spatial features for geostatistical inference. Nevertheless, this is often not a realistic assumption when dealing with nonstationary spatial data and this has motivated a variety of nonstationary spatial modeling workflows such as trend and residual decomposition, cosimulation with secondary features, and spatial segmentation and independent modeling over stationary subdomains. The advent of deep learning technologies has enabled new workflows for modeling spatial relationships. However, there is a paucity of demonstrated best practice and general guidance on mitigation of spatial nonstationarity with deep learning in the geospatial context. We demonstrate the impact of two common types of geostatistical spatial nonstationarity on deep learning model prediction performance and propose the mitigation of such impacts using self-attention (vision transformer) models. We demonstrate the utility of vision transformers for the mitigation of nonstationarity with relative errors as low as 10%, exceeding the performance of alternative deep learning methods such as convolutional neural networks. We establish best practice by demonstrating the ability of self-attention networks for modeling large-scale spatial relationships in the presence of commonly observed geospatial nonstationarity.

58 GEOSCIENCES↗

Measurement of spin-density matrix elements in Δ ++ (1232) photoproduction

We measure the spin-density matrix elements (SDMEs) of the Δ ++ (1232) in the photoproduction reaction γp → π - Δ ++ (1232) with the GlueX experiment in Hall D at Jefferson Lab. The measurement uses a linearly–polarized photon beam with energies from 8.2 to 8.8 GeV and the statistical precision of the SDMEs exceeds the previous measurement by three orders of magnitude for the momentum transfer squared region below 1.4 GeV2. The data are sensitive to the previously undetermined relative sign between couplings in existing Regge-exchange models. Linear combinations of the extracted SDMEs allow for a decomposition into natural and unnatural–exchange amplitudes. We find that the unnatural exchange plays an important role in the low momentum transfer region.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination

Post-training model compression can reduce the inference costs of deep neural networks, but uncompressed training still consumes enormous hardware resources and energy. To enable low-energy training on edge devices, it is highly desirable to directly train a compact neural network from scratch with a low memory cost. Low-rank tensor decomposition is an effective approach to reduce the memory and computing costs of large neural networks. However, directly training low-rank tensorized neural networks is a very challenging task because it is hard to determine a proper tensor rank a priori, and the tensor rank controls both model complexity and accuracy. Here, this paper presents a novel end-to-end framework for low-rank tensorized training. We first develop a Bayesian model that supports various low-rank tensor formats (e.g., CANDECOMP/PARAFAC, Tucker, tensor-train, and tensor-train matrix) and reduces neural network parameters with automatic rank determination during training. Then we develop a customized Bayesian solver to train large-scale tensorized neural networks. Our training methods shows orders-of-magnitude parameter reduction and little accuracy loss (or even better accuracy) in the experiments. On a very large deep learning recommendation system with over 4.2 ×10 9 model parameters, our method can reduce the parameter number to 1.6 ×10 5 automatically in the training process (i.e., by 2.6 ×10 4 times) while achieving almost the same accuracy. Code is available at https://github.com/colehawkins/bayesian-tensor-rank-determination.

compact neural networks↗

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗

Carbon Fiber Reinforced Epoxy Vitrimer: Robust Mechanical Performance and Facile Hydrothermal Decomposition in Pure Water

Conventional carbon fiber reinforced thermosetting polymers (CFRPs) are neither recyclable nor repairable due to their crosslinked network. The rapid growing CFRP market raises a serious concern of the waste management. In this work, a viable method to develop a readily recyclable CFRP based on epoxy vitrimer is introduced. First, a self-catalytic epoxy prepolymer with built-in hydroxy and tertiary amine groups is designed, which upon reaction with an anhydride formed a catalyst-free epoxy vitrimer. The epoxy prepolymer is synthesized from a diamine and an excess of bisphenol A epoxy resin. The hydroxyls and tertiary amines of the epoxy prepolymer efficiently catalyze both curing and the dynamic transesterification of the crosslinked polymer without the need of a catalyst. Then, the epoxy vitrimer is used as the matrix resin to prepare CFRP. The resulting CFRP exhibited a tensile strength as high as 356 MPa. More interestingly, the matrix of the CFRP is efficiently degraded in pure water at above 160 °C. This is because the built-in tertiary amines catalyze the hydrolysis of the ester bonds of the crosslinked network. The simple method developed in this work provides a framework for the development of recyclable CFRP.

Liu, Tuan↗

Accuracy and speed in computing the Chebyshev collocation derivative

We studied several algorithms for computing the Chebyshev spectral derivative and compare their roundoff error. For a large number of collocation points, the elements of the Chebyshev differentiation matrix, if constructed in the usual way, are not computed accurately. A subtle cause is is found to account for the poor accuracy when computing the derivative by the matrix-vector multiplication method. Methods for accurately computing the elements of the matrix are presented, and we find that if the entities of the matrix are computed accurately, the roundoff error of the matrix-vector multiplication is as small as that of the transform-recursion algorithm. Results of CPU time usage are shown for several different algorithms for computing the derivative by the Chebyshev collocation method for a wide variety of two-dimensional grid sizes on both an IBM and a Cray 2 computer. We found that which algorithm is fastest on a particular machine depends not only on the grid size, but also on small details of the computer hardware as well. For most practical grid sizes used in computation, the even-odd decomposition algorithm is found to be faster than the transform-recursion method.

Don, Wai-Sun↗

An Infrared Spectroscopic and Density Functional Theoretical Investigation of the Reaction Products of Laser-Ablated Scandium and Titanium Atoms with Nitric Oxide

Laser-ablated Sc and Ti atoms have been reacted with NO during condensation in excess argon. Matrix infrared spectra show that the major products are the side bonded Sc[NO] species and the inserted NScO and NTiO molecules based on isotopic substitution (15NI6O and 15N18O) and DIFT calculations of isotopic frequencies, which provide a match for two modes in three isotopic modifications for each molecule. The NScO and NTiO molecules are nitride/oxides with M-O stretching modes only 46-88/cm below the diatomic metal oxides but M-N stretching modes 314-442/cm lower than the diatomic metal nitride molecules. The ScN, ScO, TiN, and TiO molecules are observed as decomposition products. Evidence is also presented for the nitrosyls ScNO and TiNO, the Sc[NO]+ cation, and the NTiO- anion.

Bauschlicher, Charles W., Jr.↗

Decomposition Algorithm for Global Reachability Analysis on a Time-Varying Graph with an Application to Planetary Exploration

Hot air (Montgolfiere) balloons represent a promising vehicle system for possible future exploration of planets and moons with thick atmospheres such as Venus and Titan. To go to a desired location, this vehicle can primarily use the horizontal wind that varies with altitude, with a small help of its own actuation. A main challenge is how to plan such trajectory in a highly nonlinear and time-varying wind field. This paper poses this trajectory planning as a graph search on the space-time grid and addresses its computational aspects. When capturing various time scales involved in the wind field over the duration of long exploration mission, the size of the graph becomes excessively large. We show that the adjacency matrix of the graph is block-triangular, and by exploiting this structure, we decompose the large planning problem into several smaller subproblems, whose memory requirement stays almost constant as the problem size grows. The approach is demonstrated on a global reachability analysis of a possible Titan mission scenario.

Dijkstra's algorithm↗

A 28 nm multiply-accumulate ASIC architecture for on-chip data compression in MHz frame rate X-ray and electron pixel detectors

Modern X-ray detector systems urgently require compact, efficient, and fast data compression schemes to handle the transmission of big data from pixel arrays, enabling frame rates in the MHz regime. Here, in this work, a data compression ASIC that implements a streaming fixed-length lossy compression scheme is introduced and analyzed, proving the feasibility and benefits of on-chip compression. The compression scheme utilizes a vector matrix product logic, which performs a number of floating-point multiplications, additions, and accumulations. The logic is verified, synthesized, and shown to fit in the area resource available for the X-ray detector under study, which comprises 192 × 168 pixels each of 12-bit width, and having a total area of 20 mm× 20 mm, about 2 mm× 20 mm of which are available for the digital logic. Several system architectures, precisions, and compression ratios ranging from 100 to 250 were analyzed to pave the way for on-chip fixed-length compression (e.g., principal component analysis, singular value decomposition) and data reduction (e.g., azimuthal integration) for X-ray and electron detectors.

Data compression↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

Molecular dipole moment learning via rotationally equivariant derivative kernels in molecular-orbital-based machine learning

This study extends the accurate and transferable molecular-orbital-based machine learning (MOB-ML) approach to modeling the contribution of electron correlation to dipole moments at the cost of Hartree–Fock computations. A MOB pairwise decomposition of the correlation part of the dipole moment is applied, and these pair dipole moments could be further regressed as a universal function of MOs. The dipole MOB features consist of the energy MOB features and their responses to electric fields. An interpretable and rotationally equivariant derivative kernel for Gaussian process regression (GPR) is introduced to learn the dipole moment more efficiently. The proposed problem setup, feature design, and ML algorithm are shown to provide highly accurate models for both dipole moments and energies on water and 14 small molecules. To demonstrate the ability of MOB-ML to function as generalized density-matrix functionals for molecular dipole moments and energies of organic molecules, we further apply the proposed MOB-ML approach to train and test the molecules from the QM9 dataset. The application of local scalable GPR with Gaussian mixture model unsupervised clustering GPR scales up MOB-ML to a large-data regime while retaining the prediction accuracy. In addition, compared with the literature results, MOB-ML provides the best test mean absolute errors of 4.21 mD and 0.045 kcal/mol for dipole moment and energy models, respectively, when training on 110 000 QM9 molecules. The excellent transferability of the resulting QM9 models is also illustrated by the accurate predictions for four different series of peptides.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Thermal field reconstruction and compressive sensing using proper orthogonal decomposition

Model order reduction allows critical information about sensor placement and experiment design to be distilled from raw fluid mechanics simulation data. In many cases, sensed information in conjunction with reduced order models can also be used to regenerate full field variables. In this paper, a proper orthogonal decomposition (POD) inferencing method is extended to the modeling and compressive sensing of temperature, a scalar field variable. The method is applied to a simulated, critically stable, incompressible flow over a heated cylinder (Re = 1000) with Prandtl number varying between 0.001 and 50. The model is trained on pressure and temperature data from simulations. Field reconstructions are then generated using data from selected sensors and the POD model. Finally, the reconstruction error is evaluated across all Prandtl numbers for different numbers of retained modes and sensors. The predicted trend of increasing reconstruction accuracy with decreasing Prandtl number is confirmed and a Prandtl number/sensor count error matrix is presented.

Matulis, John↗

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗

Matrix Approach to Accelerate Spin-Up of CLM5

Numerical models have been developed to investigate and understand responses of biogeochemical cycle to global changes. Steady state, when a system is in dynamic equilibrium, is generally required to initialize these model simulations. However, the spin-up process that is used to achieve steady state pose a great burden to computational resources, limiting the efficiency of global modeling analysis on biogeochemical cycles. This study introduces a new Semi-Analytical Spin-Up (SASU) to tackle this grand challenge. We applied SASU to Community Land Model version 5 and examined its computational efficiency and accuracy. At the Brazil site, SASU is computationally 7 times more efficient than (or saved up to 86% computational cost in comparison with) the traditional native dynamics (ND) spin-up to reach the same steady state. Globally, SASU is computationally 8 times more efficient than the accelerated decomposition spin-up and 50 times more efficient than ND. In summary, SASU achieves the highest computational efficiency for spin-up on site and globally in comparison with other spin-up methods. It is generalizable to wide biogeochemical models and thus makes computationally costly studies (e.g., parameter perturbation ensemble analysis and data assimilation) possible for a better understanding of biogeochemical cycle under climate change.

54 ENVIRONMENTAL SCIENCES↗