Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Covariance 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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

A numerical comparison of discrete Kalman filtering algorithms - An orbit determination case study

An improved Kalman filter algorithm based on a modified Givens matrix triangularization technique is proposed for solving a nonstationary discrete-time linear filtering problem. The proposed U-D covariance factorization filter uses orthogonal transformation technique; measurement and time updating of the U-D factors involve separate application of Gentleman's fast square-root-free Givens rotations. Numerical stability and accuracy of the algorithm are compared with those of the conventional and stabilized Kalman filters and the Potter-Schmidt square-root filter, by applying these techniques to a realistic planetary navigation problem (orbit determination for the Saturn approach phase of the Mariner Jupiter-Saturn Mission, 1977). The new algorithm is shown to combine the numerical precision of square root filtering with the efficiency of the original Kalman algorithm.

Thornton, C. L.↗
NASA NTRS1987

Thomas precession, Wigner rotations and gauge transformations

The exact Lorentz kinematics of the Thomas precession is discussed in terms of Wigner's O(3)-like little group which describes rotations in the Lorentz frame in which the particle is at rest. A Lorentz-covariant form for the Thomas factor is derived. It is shown that this factor is a Lorentz-boosted rotation matrix, which becomes a gauge transformation in the infinite-momentum or zero-mass limit.

Han, D.↗
NASA NTRS2011

Efficient Kriging Algorithms

More efficient versions of an interpolation method, called kriging, have been introduced in order to reduce its traditionally high computational cost. Written in C++, these approaches were tested on both synthetic and real data. Kriging is a best unbiased linear estimator and suitable for interpolation of scattered data points. Kriging has long been used in the geostatistic and mining communities, but is now being researched for use in the image fusion of remotely sensed data. This allows a combination of data from various locations to be used to fill in any missing data from any single location. To arrive at the faster algorithms, sparse SYMMLQ iterative solver, covariance tapering, Fast Multipole Methods (FMM), and nearest neighbor searching techniques were used. These implementations were used when the coefficient matrix in the linear system is symmetric, but not necessarily positive-definite.

Memarsadeghi, Nargess↗
NASA NTRS1987

Remote sensing of earth terrain

A systematic approach for the identification of terrain media such as vegetation canopy, forest, and snow covered fields is developed using the optimum polarimetric classifier. The covariance matrices for the various terrain cover are computed from theoretical models of random medium by evaluating the full polarimetric scattering matrix elements. The optimal classification scheme makes use of a quadratic distance measure and is applied to classify a vegetation canopy consisting of both trees and grass. Experimentally measured data are used to validate the classification scheme. Theoretical probability of classification error using the full polarimetric matrix are compared with classification based on single features including the phase difference between the VV and HH polarization returns. It is shown that the full polarimetric results are optimal and provide better classification performance than single feature measurements.

Kong, J. A.↗
DOE OSTI2025

Quantum chaos, integrability, and late times in the Krylov basis

Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by random matrix theory (RMT). We propose and develop a complementary version of this conjecture: quantum chaotic systems display a Lanczos spectrum whose local means and covariances are well described by RMT. To support this proposal, we first demonstrate its validity in examples of chaotic and integrable systems. We then show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffice to produce the full long-time behavior of general survival probabilities including the spectral form factor, as well as the spread complexity. In addition, for initial states with continuous overlap with energy eigenstates, we analytically find the long-time averages of the probabilities of Krylov basis elements in terms of the mean Lanczos spectrum. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos. Lastly, we clarify the relation between spread complexity and the universality classes of RMT by exploring various values of the Dyson index and Poisson distributed spectra.

Combinatorics↗
DOE OSTI2025

Complete definition of 𝑁 →Δ transition generalized parton distributions

We revisit the definition of the leading-twist chiral-even generalized parton distributions (GPDs) for 𝑁 →Δ baryon transitions. We identify and address deficiencies in previous definitions of the transition GPDs inspired by the transition form factors of the vector and axial vector currents. Through systematic analysis of all possible covariant structures, respecting discrete symmetries and the baryon spinor equations of motion, we derive complete sets of independent structures for the transition matrix elements of the vector and axial vector partonic operators. They contain additional structures proportional to the light-cone vector, corresponding to transition GPDs of vanishing first moment, which were not included in previous parametrizations. Their presence is confirmed independently by the light-front multipole expansion and the cross-channel SO(3) partial-wave analysis of the transition matrix elements. Our analysis provides a complete definition of the 𝑁 →Δ transition GPDs for use in theoretical and phenomenological studies.

baryons↗
DOE OSTI2026

Semi-inclusive deep-inelastic scattering on a polarized spin-1 target. I. Cross section and spin observables

We develop the theoretical framework for semi-inclusive deep-inelastic scattering on a polarized spin-1 target and apply it to scattering on the polarized deuteron with spectator nucleon tagging. In Part I (this article) we present the general form of the semi-inclusive cross section and polarization observables for the spin-1 target. A relativistically covariant formulation in terms of four-vectors and invariant polarization parameters is employed. The target polarization is described by a spin density matrix with vector and tensor polarization. The spin and azimuthal angle dependence of the semi-inclusive cross section is derived and parametrized in terms of invariant structure functions. To validate the result, the structure functions are expressed as photon-target helicity amplitudes with known symmetry properties. The expressions presented here are kinematic (no assumptions about particle production dynamics) and valid in all regions of the deep-inelastic final state (current and target fragmentation regions). In Part II (following article), we consider deep-inelastic scattering on the polarized deuteron with spectator nucleon tagging as a special case of target fragmentation. The semi-inclusive structure functions are computed by separating nuclear and hadronic structure, and the polarization observables are explored as functions of the tagged nucleon momentum.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Does the Z boson have a lighter cousin?

In the quenched electroweak theory on the lattice I construct a set of physical states which overlap the physical photon and Z boson states. This is done by employing eigenstates of the covariant lattice Laplacian, in addition to the Higgs and lattice link variables, to construct gauge invariant vector boson creation operators. Diagonalizing the transfer matrix in the subspace of Hilbert space spanned by this set yields a massless photon and massive Z particle, as expected. But in the numerical data there is evidence for more vector bosons in the spectrum, albeit with considerable uncertainty in their masses, with the lowest finite mass particle in the range of 3–4 GeV. Published by the American Physical Society 2025

Greensite, Jeff (ORCID:0000000317209436)↗
DOE OSTI2024

Shape restricted additive hazards models: Monotone, unimodal, and U‐shape hazard functions

We consider estimation of the semiparametric additive hazards model with an unspecified baseline hazard function where the effect of a continuous covariate has a specific shape but otherwise unspecified. Such estimation is particularly useful for a unimodal hazard function, where the hazard is monotone increasing and monotone decreasing with an unknown mode. A popular approach of the proportional hazards model is limited in such setting due to the complicated structure of the partial likelihood. Our model defines a quadratic loss function, and its simple structure allows a global Hessian matrix that does not involve parameters. Thus, once the global Hessian matrix is computed, a standard quadratic programming method can be applicable by profiling all possible locations of the mode. However, the quadratic programming method may be inefficient to handle a large global Hessian matrix in the profiling algorithm due to a large dimensionality, where the dimension of the global Hessian matrix and number of hypothetical modes are the same order as the sample size. We propose the quadratic pool adjacent violators algorithm to reduce computational costs. The proposed algorithm is extended to the model with a time‐dependent covariate with monotone or U‐shape hazard function. In simulation studies, our proposed method improves computational speed compared to the quadratic programming method, with bias and mean square error reductions. We analyze data from a recent cardiovascular study.

Mathematical & Computational Biology↗
NASA NTRS2003

NASA GPM GV Science Requirements

An important scientific objective of the NASA portion of the GPM Mission is to generate quantitatively-based error characterization information along with the rainrate retrievals emanating from the GPM constellation of satellites. These data must serve four main purposes: (1) they must be of sufficient quality, uniformity, and timeliness to govern the observation weighting schemes used in the data assimilation modules of numerical weather prediction models; (2) they must extend over that portion of the globe accessible by the GPM core satellite to which the NASA GV program is focused - (approx.65 degree inclination); (3) they must have sufficient specificity to enable detection of physically-formulated microphysical and meteorological weaknesses in the standard physical level 2 rainrate algorithms to be used in the GPM Precipitation Processing System (PPS), i.e., algorithms which will have evolved from the TRMM standard physical level 2 algorithms; and (4) they must support the use of physical error modeling as a primary validation tool and as the eventual replacement of the conventional GV approach of statistically intercomparing surface rainrates fiom ground and satellite measurements. This approach to ground validation research represents a paradigm shift vis-&-vis the program developed for the TRMM mission, which conducted ground validation largely as a statistical intercomparison process between raingauge-derived or radar-derived rainrates and the TRMM satellite rainrate retrievals -- long after the original satellite retrievals were archived. This approach has been able to quantify averaged rainrate differences between the satellite algorithms and the ground instruments, but has not been able to explain causes of algorithm failures or produce error information directly compatible with the cost functions of data assimilation schemes. These schemes require periodic and near-realtime bias uncertainty (i.e., global space-time distributed conditional accuracy of the retrieved rainrates) and local error covariance structure (i.e., global space-time distributed error correlation information for the local 4-dimensional space-time domain -- or in simpler terms, the matrix form of precision error). This can only be accomplished by establishing a network of high quality-heavily instrumented supersites selectively distributed at a few oceanic, continental, and coastal sites. Economics and pragmatics dictate that the network must be made up of a relatively small number of sites (6-8) created through international cooperation. This presentation will address some of the details of the methodology behind the error characterization approach, some proposed solutions for expanding site-developed error properties to regional scales, a data processing and communications concept that would enable rapid implementation of algorithm improvement by the algorithm developers, and the likely available options for developing the supersite network.

Smith, E.↗
NASA NTRS1992

Correlation, Cost Risk, and Geometry

The geometric viewpoint identifies the choice of a correlation matrix for the simulation of cost risk with the pairwise choice of data vectors corresponding to the parameters used to obtain cost risk. The correlation coefficient is the cosine of the angle between the data vectors after translation to an origin at the mean and normalization for magnitude. Thus correlation is equivalent to expressing the data in terms of a non orthogonal basis. To understand the many resulting phenomena requires the use of the tensor concept of raising the index to transform the measured and observed covariant components into contravariant components before vector addition can be applied. The geometric viewpoint also demonstrates that correlation and covariance are geometric properties, as opposed to purely statistical properties, of the variates. Thus, variates from different distributions may be correlated, as desired, after selection from independent distributions. By determining the principal components of the correlation matrix, variates with the desired mean, magnitude, and correlation can be generated through linear transforms which include the eigenvalues and the eigenvectors of the correlation matrix. The conversion of the data to a non orthogonal basis uses a compound linear transformation which distorts or stretches the data space. Hence, the correlated data does not have the same properties as the uncorrelated data used to generate it. This phenomena is responsible for seemingly strange observations such as the fact that the marginal distributions of the correlated data can be quite different from the distributions used to generate the data. The joint effect of statistical distributions and correlation remains a fertile area for further research. In terms of application to cost estimating, the geometric approach demonstrates that the estimator must have data and must understand that data in order to properly choose the correlation matrix appropriate for a given estimate. There is a general feeling by employers and managers that the field of cost requires little technical or mathematical background. Contrary to that opinion, this paper demonstrates that a background in mathematics equivalent to that needed for typical engineering and scientific disciplines at the masters or doctorate level is appropriate within the field of cost risk.

Dean, Edwin B.↗
NASA NTRS1990

Performance analysis of structured gradient algorithm

The structured gradient algorithm uses a structured estimate of the array correlation matrix (ACM) to estimate the gradient required for the constrained least-mean-square (LMS) algorithm. This structure reflects the structure of the exact array correlation matrix for an equispaced linear array and is obtained by spatial averaging of the elements of the noisy correlation matrix. In its standard form the LMS algorithm does not exploit the structure of the array correlation matrix. The gradient is estimated by multiplying the array output with the receiver outputs. An analysis of the two algorithms is presented to show that the covariance of the gradient estimated by the structured method is less sensitive to the look direction signal than that estimated by the standard method. The effect of the number of elements on the signal sensitivity of the two algorithms is studied.

Godara, Lal C.↗
NASA NTRS1986

Origin of gauge invariance in string theory

A first quantization of the space-time embedding Chi exp mu and the world-sheet metric rho of the open bosonic string. The world-sheet metric rho decouples from S-matrix elements in 26 dimensions. This formulation of the theory naturally includes 26-dimensional gauge transformations. The gauge invariance of S-matrix elements is a direct consequence of the decoupling of rho. Second quantization leads to a string field Phi(Chi exp mu, rho) with a gauge-covariant equation of motion.

Horowitz, G. T.↗
NASA NTRS1987

Model reduction for discrete bilinear systems

A model reduction method for discrete bilinear systems is developed which matches q sets of Volterra and covariance parameters. These parameters are shown to represent both deterministic and stochastic attributes of the discrete bilinear system. A reduced order model which matches these q sets of parameters is defined to be a q-Volterra covariance equivalent realization (q-Volterra COVER). An algorithm is presented which constructs a class of q-Volterra COVERs parameterized by solutions to a Hermitian, quadratic, matrix equation. The algorithm is applied to a bilinear model of a robot manipulator.

King, A. M.↗
NASA NTRS1990

Random field estimation approach to robot dynamics

The difference equations of Kalman filtering and smoothing recursively factor and invert the covariance of the output of a linear state-space system driven by a white-noise process. Here it is shown that similar recursive techniques factor and invert the inertia matrix of a multibody robot system. The random field models are based on the assumption that all of the inertial (D'Alembert) forces in the system are represented by a spatially distributed white-noise model. They are easier to describe than the models based on classical mechanics, which typically require extensive derivation and manipulation of equations of motion for complex mechanical systems. With the spatially random models, more primitive locally specified computations result in a global collective system behavior equivalent to that obtained with deterministic models. The primary goal of applying random field estimation is to provide a concise analytical foundation for solving robot control and motion planning problems.

Rodriguez, Guillermo↗
DOE OSTI2020

Towards real-time monitoring: data assimilated time-lapse full waveform inversion for seismic velocity and uncertainty estimation

SUMMARY Rapid development of time-lapse seismic monitoring instrumentations has made it possible to collect dense time-lapse data for tomographically retrieving time-lapse (even continuous) images of subsurface changes. While traditional time-lapse full waveform inversion (TLFWI) algorithms are designed for sparse time-lapse surveys, they lack of effective temporal constraint on time-lapse data, and, more importantly, lack of the uncertainty estimation of the TLFWI results that is critical for further interpretation. Here, we propose a new data assimilation TLFWI method, using hierarchical matrix powered extended Kalman filter (HiEKF) to quantify the image uncertainty. Compared to existing Kalman filter algorithms, HiEKF allows to store and update a data-sparse representation of the cross-covariance matrices and propagate model errors without expensive operations involving covariance matrices. Hence, HiEKF is computationally efficient and applicable to 3-D TLFWI problems. Then, we reformulate TLFWI in the framework of HiEKF (termed hereafter as TLFWI-HiEKF) to predict time-lapse images of subsurface spatiotemporal velocity changes and simultaneously quantify the uncertainty of the inverted velocity changes over time. We demonstrate the validity and applicability of TLFWI–HiEKF with two realistic CO2 monitoring models derived from Frio-II and Cranfield CO2 injection sites, respectively. In both 2-D and 3-D examples, the inverted high-resolution time-lapse velocity results clearly reveal a continuous velocity reduction due to the injection of CO2. Moreover, the accuracy of the model is increasing over time by assimilating more time-lapse data while the standard deviation is decreasing over lapsed time. We expect TLFWI-HiEKF to be equipped with real-time seismic monitoring systems for continuously imaging the distribution of subsurface gas and fluids in the future large-scale CO2 sequestration experiments and reservoir management.

58 GEOSCIENCES↗
NASA NTRS2002

The Goddard VLBI SINEX Files

The Goddard VLBI group generates SINEX files for individual 24-hr sessions and multiyear TRF solutions. Each 24-hr file includes the reduced normal matrix for the station positions, EOP, and EOP rates. A global Terrestrial Reference Frame (TRF) SINEX file has the reduced normal matrix for station positions and velocities but no EOP parameters. Both types of normal matrix are free from any datum constraints and are designed for combination solutions that will later apply the necessary datum constraints. The SINEX files also contain blocks that provide the constraints and covariance of well-defined 24-hr or global TRF solutions. These blocks are not yet part of the SINEX 2.0 specification. For the TRF solutions the Goddard VLBI group also generates the corresponding EOP time series. SINEX files and EOP time series are distributed through the IVS. The algorithms for generating the various blocks and the proper use of such SINEX files will be discussed.

Ma, Chopo↗
NASA NTRS2016

Coupled Inertial Navigation and Flush Air Data Sensing Algorithm for Atmosphere Estimation

This paper describes an algorithm for atmospheric state estimation based on a coupling between inertial navigation and flush air data-sensing pressure measurements. The navigation state is used in the atmospheric estimation algorithm along with the pressure measurements and a model of the surface pressure distribution to estimate the atmosphere using a nonlinear weighted least-squares algorithm. The approach uses a high-fidelity model of atmosphere stored in table-lookup form, along with simplified models propagated along the trajectory within the algorithm to aid the solution. Thus, the method is a reduced-order Kalman filter in which the inertial states are taken from the navigation solution and atmospheric states are estimated in the filter. The algorithm is applied to data from the Mars Science Laboratory entry, descent, and landing from August 2012. Reasonable estimates of the atmosphere are produced by the algorithm. The observability of winds along the trajectory are examined using an index based on the observability Gramian and the pressure measurement sensitivity matrix. The results indicate that bank reversals are responsible for adding information content. The algorithm is applied to the design of the pressure measurement system for the Mars 2020 mission. A linear covariance analysis is performed to assess estimator performance. The results indicate that the new estimator produces more precise estimates of atmospheric states than existing algorithms.

Karlgaard, Christopher D.↗