Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random Matrix”

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 829 records · Page 46

Magnetic interactions in γ-Fe{sub 2}O{sub 3}@SiO{sub 2} nanocomposites

Structural and magnetic properties of γ-Fe{sub 2}O{sub 3} nanoparticles of 4 nm diameter, dispersed into silica SiO{sub 2} matrix with a wide range value of volume fraction (0.05 to 1), were investigated. Produced γ-Fe{sub 2}O{sub 3}@SiO{sub 2} nanocomposites consist of an assembly of very small single domain magnetic object (<10 nm) with a random distribution of both inter-particle distance and direction of particle magnetic moment. We focused on the determination of a magnetic percolation threshold, defined as the magnetic particles concentration value above which the magnetic properties of isolated particles vanished in favor of a magnetic collective behavior induced by magnetic interactions. A percolation threshold value of 0.63 was obtained by a local probe technique such as {sup 57}Fe Mössbauer spectrometry and confirmed by global magnetic measurements through zero-field cooled, field-cooled, and ac susceptibility data. Below this threshold, dynamic ac magnetization measurements show a thermally activated Arrhenius dependence of the blocking temperature of superparamagnetic nanoparticles and above this critical value, one observes a slowing down of their dynamic properties, which lead toward the establishment of a spin-glass like state.

36 MATERIALS SCIENCE↗

Polarimetric clutter modeling: Theory and application

The two-layer anisotropic random medium model is used to investigate fully polarimetric scattering properties of earth terrain media. The polarization covariance matrices for the untilted and tilted uniaxial random medium are evaluated using the strong fluctuation theory and distorted Born approximation. In order to account for the azimuthal randomness in the growth direction of leaves in tree and grass fields, an averaging scheme over the azimuthal direction is also applied. It is found that characteristics of terrain clutter can be identified through the analysis of each element of the covariance matrix. Theoretical results are illustrated by the comparison with experimental data provided by MIT Lincoln Laboratory for tree and grass fields.

Kong, J. A.↗

FTTN: Feature-Targeted Testing for Numerical Properties of NVIDIA & AMD Matrix Accelerators

While NVIDIA has been the dominant provider of GPUs for HPC and ML, now AMD has several offerings of GPUs. This encourages programmers to try out AMD GPUs for new codes and also port existing codes over. Unfortunately, without understanding the floating-point differences between these GPU types, software development or porting can introduce bugs—and currently such an understanding is lacking. The magnitude of this open question becomes clear if one imagines the the number of floating-point precision choices (FP16, FP32, etc.), floating-point formats (standard floats, brain-float, etc.), and execution units available (elementary units, matrix/tensor cores, etc.) Questions such as rounding modes and subnormal support are also important. Most of these answers are unknown today or are hard to access. We provide the first testing-guided approach that answers a significant number of these questions. We also devise tests to reveal internal information (e.g., extra bits kept) to make sure that our findings are reliable. Many of our tests employ systematically generated random-programs, others apply fast-math flags and some involve fused multiplyadd. Especially for tensor/matrix cores, the tests have nontrivial logic that we present Our testing approach is reusable for the plethora of GPUs yet to be introduced. Our findings include up to 7 ulps of difference between NVIDIA and AMD for sin and cos at FP32 precision and 3 ulp at FP64. In our study of matrix cores (NVIDIA) and tensor cores (AMD), we have extensively characterized rounding modes (truncation versus round-to-nearest), the number of extra internal bits kept (whether 3 bits are kept or not), subnormal support for inputs and outputs across four different floating-point formats and across NVIDIA A100 and AMD MI250X GPUs. We believe that this wealth of data becoming available for the first time may help avoid significant porting bugs when migrating code across these platforms.

Li, Xinyi↗

Standard, Random, and Optimum Array conversions from Two-Pole resistance data

We present an array evaluation of standard and nonstandard arrays over a hydrogeological target. We develop the arrays by linearly combining data from the pole-pole (or 2-pole) array. The first test shows that reconstructed resistances for the standard Schlumberger and dipoledipole arrays are equivalent or superior to the measured arrays in terms of noise, especially at large geometric factors. The inverse models for the standard arrays also confirm what others have presented in terms of target resolvability, namely the dipole-dipole array has the highest resolution. In the second test, we reconstruct random electrode combinations from the 2-pole data segregated into inner, outer, and overlapping dipoles. The resistance data and inverse models from these randomized arrays show those with inner dipoles to be superior in terms of noise and resolution and that overlapping dipoles can cause model instability and low resolution. Finally, we use the 2-pole data to create an optimized array that maximizes the model resolution matrix for a given electrode geometry. The optimized array produces the highest resolution and target detail. Thus, the tests demonstrate that high quality data and high model resolution can be achieved by acquiring field data from the pole-pole array.

58 GEOSCIENCES↗

Learning Memento archive routing with Character-based Artificial Neural Networks

This white paper describes a series of tests that were performed to determine if a neural network could learn patterns from a service that maintains a cache of routing decisions for the discovery of version information for discrete web-at-large URLs. Labeled training data was derived from a log file that records the by-archive availability of Memento availability for a given URL. Training data sets were generated from this log file on a by-archive basis (thus making it a binary classification problem). Each training data set consisted of equal numbers of hit and miss URLs, selected at random. The URLs were converted to a normalized numeric representation where each integer in a URL training vector represents a character in that URL. The corresponding label indicates whether or not Mementos were available for that URL in the selected archive. The training data matrix and the label vector became input to a neural network. A number of neural network architectures and network hyperparameters were explored, however the log entries themselves were used as-is, without any feature engineering, beyond the aforementioned normalization.

97 MATHEMATICS AND COMPUTING↗

Polarimetric signatures of a layer of random nonspherical discrete scatterers overlying a homogeneous half-space based on first- and second-order vector radiative transfer theory

Complete polarimetric signatures of a layer of random, nonspherical discrete scatterers overlying a homogeneous half space are studied with the first- and second-order solutions of the vector radiative transfer theory. Some of the salient features of the numerical results are as follows: (1) the inclusion of the nondiagonal extinction matrix in the vector radiative transfer theory accounts for an appreciable phase difference between vv and hh polarizations, particularly for aligned scatterers; (2) the ensemble-averaged scattered Stokes vector is generally partially polarized, with the degree of polarization less than unity; (3) there generally exists a pedestal in the copolarization return when plotted as a function of ellipticity and orientation angles, which may be due to heterogeneity of scattering objects and/or multiple scattering effects; and (4) multiple scattering effects generally enhance the pedestal in copolarization return, decrease the degree of polarization, affect phase difference, and also enhance the depolarization return.

Tsang, Leung↗

Unsupervised segmentation of polarimetric SAR data using the covariance matrix

An unsupervised selection of polarimetric features useful for the segmentation and analysis of polarimetric synthetic aperture radar (SAR) data is presented. The technique is based on multidimensional clustering of the parameters composing the polarimetric covariance matrix of the data. Clustering is performed on the logarithm of these quantities. Once the polarimetric cluster centers have been determined, segmentation of the polarimetric data into regions is performed using a maximum likelihood polarimetric classifier. Segmentation maps are further improved using a Markov random field to describe the statistics of the regions and computing the maximum of the product of the local conditional densities. Examples with real polarimetric SAR imagery are given to illustrate the potential of this method.

Rignot, Eric↗

Extended Kalman Filter Performance on the Artemis-1 Mission

The Artemis Program is NASA’s campaign to explore the Moon and beyond. Artemis-1, the uncrewed exoLEO test flight of the Orion spacecraft, was completed in 2022. There were four navigation Extended Kalman Filters (EKFs) that are part of the Orion navigation system. The Atmospheric Extended Kalman Filter (ATMEKF) estimates the vehicle position, velocity, and attitude (referred to as the vehicle state) during the ascent and entry phases of flight. Once Orion is outside of Earths atmosphere, the Earth Orbit Extended Kalman Filter (EOEKF) and CisLunar Extended Kalman Filter (CLEKF) estimate the translational states, depending on the phase of flight, while the Attitude Extended Kalman Filter (ATTEKF) estimates the rotational state of the vehicle. The Kalman filters propagate the vehicle state forward in time using a combination of dynamics models and the output data from the Inertial Measurement Unit (IMU). The filters update the vehicle states and associated uncertainties, in the form of the covariance matrix, using pseudorange measurements from GPS (in ATMEKF/EOEKF), optical navigation measurements of the Earth or Moon (in CLEKF), and star tracker measurements (in ATTEKF). Simultaneously, the Kalman filters estimate error sources in the sensors, which are included in the state vectors as Exponentially Correlated Random Variables (ECRVs). This paper will summarize the performance of these filters during the Artemis-1 mission.

Artemis-1↗

Exploiting data representation for fault tolerance

Incorrect computer hardware behavior may corrupt intermediate computations in numerical algorithms, possibly resulting in incorrect answers. Prior work models misbehaving hardware by randomly flipping bits in memory. We start by accepting this premise, and present an analytic model for the error introduced by a bit flip in an IEEE 754 floating-point number. We then relate this finding to the linear algebra concepts of normalization and matrix equilibration. In particular, we present a case study illustrating that normalizing both vector inputs of a dot product minimizes the probability of a single bit flip causing a large error in the dot product's result. Moreover, the absolute error is either less than one or very large, which allows detection of large errors. Then, we apply this to the GMRES iterative solver. We count all possible errors that can be introduced through faults in arithmetic in the computationally intensive orthogonalization phase of GMRES, and show that when the matrix is equilibrated, the absolute error is bounded above by one.

97 MATHEMATICS AND COMPUTING↗

Tough, processable semi-interpenetrating polymer networks from monomer reactants

A high temperature semi-interpenetrating polymer network (semi-IPN) was developed which had significantly improved processability, damage tolerance, and mechanical performance, when compared to the commercial Thermid materials. This simultaneous semi-IPN was prepared by mixing the monomer precursors of Thermid AL-600 (a thermoset) and NR-150B2 (a thermoplastic) and allowing the monomers to react randomly upon heating. This reaction occurs at a rate which decreases the flow and broadens the processing window. Upon heating at a higher temperature, there is an increase in flow. Because of the improved flow properties, broadened processing window and enhanced toughness, high strength polymer matrix composites, adhesives and molded articles can now be prepared from the acetylene end-capped polyimides which were previously inherently brittle and difficult to process.

Pater, Ruth H.↗

An Algorithm for Characterization of Fiber Aggregation in Composite Microstructures

Composite structures are susceptible to localized flaws, or variability, that drive global failure. To capture this variance, a multiscale model needs to be introduced that not only accurately represents the statistical nature of the composite microstructure but is also efficient. At the microscale, fiber aggregation creates local stress concentrations, where failure is likely to occur sooner than expected. A method of rapid microstructure generation, in conjunction with cluster characterization, is examined to develop accurate reproductions of 2D composite cross-sections. Parameterization of shape and size of fiber clusters is used to characterize representative volume elements. The discrete element method is used to generate pseudo-microstructures. The clustering parameters from the pseudo- and actual microstructure arrangements (obtained from micrographs) can be compared to determine the validity of the representative volume element generated with the discrete element method. Results show a promising approach to evaluating randomness of fiber distributions and how to accurately recreate microstructures for strength analysis.

Carbon fiber↗

Nuclear data uncertainty propagation and modeling uncertainty impact evaluation in neutronics core simulation

Uncertainty analysis is a critical requirement in reactor simulation as it is used to quantify the reliability of best-estimate calculation. A comprehensive uncertainty analysis should characterize all sources of uncertainties in a computationally-feasible and scientifically-defendable manner. Here we employ a well-established reduced order modeling (ROM) based uncertainty quantification methodology to propagate uncertainties throughout neutronic calculations. ROM relies on recent advances in randomized data mining techniques applied to large data streams. In our proposed implementation, the nuclear data uncertainties are first propagated from multi-group level through lattice physics calculation to generate few-group parameter uncertainties, described using a vector of mean values and a covariance matrix. Employing an ROM-based compression of the covariance matrix, the few-group uncertainties are then propagated through downstream core simulation in a computationally efficient manner. This straightforward approach, albeit efficient as compared to brute force forward and/or adjoint-based methods, often employs a number of assumptions that have been unquestioned in the literature of neutronic uncertainty analysis. This manuscript argues that these assumptions could introduce another source of uncertainty referred to as modeling uncertainties, whose magnitude needs to be quantified in tandem with nuclear data uncertainties. Thus, our primary goal is to explore the interactions between these two uncertainty sources in order to assess whether modeling uncertainties have an impact on parameter uncertainties. To explore this endeavor, the impact of a number of modeling assumptions on core attributes uncertainties is quantified. The study employs a CANDU reactor model, with Serpent and NEWT as lattice physics solvers and NESTLE-C as core simulator. The modeling assumptions investigated include those related with the uncertainty propagation method employed, e.g., deterministic vs. stochastic, the few-group energy structure employed to represent the cross-sections, the resonance treatment in lattice physics calculation, the reference values for the cross-section, and the number of samples employed to render ROM compression. Results indicate that some of the modeling assumptions could have a non-negligible impact on the core responses propagated uncertainties, highlighting the need for a more comprehensive approach to combine parameter and modeling uncertainties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A random search algorithm for laboratory computers

The small laboratory computer is ideal for experimental control and data acquisition. Postexperimental data processing is often performed on large computers because of the availability of sophisticated programs, but costs and data compatibility are negative factors. Parameter optimization can be accomplished on the small computer, offering ease of programming, data compatibility, and low cost. A previously proposed random-search algorithm ('random creep') was found to be very slow in convergence. A method is proposed (the 'random leap' algorithm) which starts in a global search mode and automatically adjusts step size to speed convergence. A FORTRAN executive program for the random-leap algorithm is presented which calls a user-supplied function subroutine. An example of a function subroutine is given which calculates maximum-likelihood estimates of receiver operating-characteristic parameters from binary response data. Other applications in parameter estimation, generalized least squares, and matrix inversion are discussed.

Curry, R. E.↗

A Simple Stochastic Model for Generating Broken Cloud Optical Depth and Top Height Fields

A simple and fast algorithm for generating two correlated stochastic twodimensional (2D) cloud fields is described. The algorithm is illustrated with two broken cumulus cloud fields: cloud optical depth and cloud top height retrieved from Moderate Resolution Imaging Spectrometer (MODIS). Only two 2D fields are required as an input. The algorithm output is statistical realizations of these two fields with approximately the same correlation and joint distribution functions as the original ones. The major assumption of the algorithm is statistical isotropy of the fields. In contrast to fractals and the Fourier filtering methods frequently used for stochastic cloud modeling, the proposed method is based on spectral models of homogeneous random fields. For keeping the same probability density function as the (first) original field, the method of inverse distribution function is used. When the spatial distribution of the first field has been generated, a realization of the correlated second field is simulated using a conditional distribution matrix. This paper is served as a theoretical justification to the publicly available software that has been recently released by the authors and can be freely downloaded from http://i3rc.gsfc.nasa.gov/Public codes clouds.htm. Though 2D rather than full 3D, stochastic realizations of two correlated cloud fields that mimic statistics of given fields have proved to be very useful to study 3D radiative transfer features of broken cumulus clouds for better understanding of shortwave radiation and interpretation of the remote sensing retrievals.

Prigarin, Sergei M.↗

Uncertainty quantification in (α,n) neutron source calculations for an oxide matrix

Here we present a methodology to propagate nuclear data covariance information in neutron source calculations from (α,n) reactions. The approach is applied to estimate the uncertainty in the neutron generation rates for uranium oxide fuel types due to uncertainties on 1) 17,18 O( α,n) reaction cross sections and 2) uranium and oxygen stopping power cross sections. The procedure to generate reaction cross section covariance information is based on the Bayesian fitting method implemented in the R-matrix SAMMY code. The evaluation methodology uses the Reich-Moore approximation to fit the 17,18 O(α,n) reaction cross-sections in order to derive a set of resonance parameters and a related covariance matrix that is then used to calculate the energydependent cross section covariance matrix. The stopping power cross sections and related covariance information for uranium and oxygen were obtained by the fit of stopping power data in the -energy range of 1 keV up to 12 MeV. Cross section perturbation factors based on the covariance information relative to the evaluated 17,18 O( α,n) reaction cross sections, as well as uranium and oxygen stopping power cross sections, were used to generate a varied set of nuclear data libraries used in SOURCES4C and ORIGEN for inventory and source term calculations. The set of randomly perturbed output (α,n) source responses, provide the mean values and standard deviations of the calculated responses reflecting the uncertainties in nuclear data used in the calculations. Lastly, the results and related uncertainties are compared with experiment thick target (α,n) yields for uranium oxide.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Effectiveness of basic display augmentation in vehicular control by visual field cues

The paper investigates the effectiveness of different basic display augmentation concepts - fixed reticle, velocity vector, and predicted future vehicle path - for RPVs controlled by a vehicle-mounted TV camera. The task is lateral manual control of a low flying RPV along a straight reference line in the presence of random side gusts. The man-machine system and the visual interface are modeled as a linear time-invariant system. Minimization of a quadratic performance criterion is assumed to underlie the control strategy of a well-trained human operator. The solution for the optimal feedback matrix enables the explicit computation of the variances of lateral deviation and directional error of the vehicle and of the control force that are used as performance measures.

Grunwald, A. J.↗

Beta-to-alpha transformation in polycrystalline SiC. II - Interfacial energetics

A phenomenological analysis of the energetics of the beta-to-alpha transformation in polycrystalline SiC is presented. It is found that the extreme anisotropy of the interfacial energy between alpha- and beta-SiC can account for the rapid growth of composite grains into the beta matrix during conventional sintering or hot-pressing processes. The composite grains consist of alpha-SiC plates 'sandwiched' between well-oriented and recrystallized beta-SiC 'envelopes'. The interfaces involving the 111 plane type of beta and (0001) of alpha have much lower energies than random beta/alpha interfaces.

Mitchell, T. E.↗

Accuracy/Computation Performance of a New Trilateration Scheme for GPS-Style Localization

We recently introduced a new geometric trilateration (GT) method for GPS-style positioning. Preliminary singlepoint analysis using simplistic error assumptions indicates that the new scheme delivers almost indistinguishable localization accuracy as the traditional Newton-Raphson (NR) approach. Also, the same computation procedure can be used to perform high-accuracy relative positioning between a reference vehicle and an arbitrary number of target vehicles. This scheme has the potential to enable a) new mission concepts in collaborative science, b) in-situ navigation services for human Mars missions, and c) lower cost and faster acquisition of GPS signals for consumer-grade GPS products. The new GT scheme differs from the NR scheme as follows: 1. The new scheme is derived from Pythagoras Theorem, whereas the NR method is based on the principle of linear regression. 2. The NR method uses the absolute locations (xi, yi, zi)’s of the GPS satellites as input to each step of the localization computation. The GT method uses the Directional Cosines Ui’s from Earth’s center to the GPS satellite Si. 3. Both the NR method and the GT method iterate to converge to a localized solution. In each iteration step, multiple matrix operations are performed. The NR method constructs a different matrix in each iterative step, thus requires performing a new set of matrix operations in each step. The GT scheme uses the same matrix in each iteration, thus requiring computing the matrix operations only once for all subsequent iterations. In this paper, we perform an in-depth comparison between the GT scheme and the NR method in terms of a) GPS localization accuracy in the GPS operation environment, b) its sensitivity with respect to systematic errors and random errors, and c) computation load required to converge to a localization solution.

Lee, Charles↗