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

An Upper Bound on Orbital Debris Collision Probability When Only One Object has Position Uncertainty Information

Upper bounds on high speed satellite collision probability, P (sub c), have been investigated. Previous methods assume an individual position error covariance matrix is available for each object. The two matrices being combined into a single, relative position error covariance matrix. Components of the combined error covariance are then varied to obtain a maximum P (sub c). If error covariance information for only one of the two objects was available, either some default shape has been used or nothing could be done. An alternative is presented that uses the known covariance information along with a critical value of the missing covariance to obtain an approximate but useful P (sub c) upper bound. There are various avenues along which an upper bound on the high speed satellite collision probability has been pursued. Typically, for the collision plane representation of the high speed collision probability problem, the predicted miss position in the collision plane is assumed fixed. Then the shape (aspect ratio of ellipse), the size (scaling of standard deviations) or the orientation (rotation of ellipse principal axes) of the combined position error ellipse is varied to obtain a maximum P (sub c). Regardless as to the exact details of the approach, previously presented methods all assume that an individual position error covariance matrix is available for each object and the two are combined into a single, relative position error covariance matrix. This combined position error covariance matrix is then modified according to the chosen scheme to arrive at a maximum P (sub c). But what if error covariance information for one of the two objects is not available? When error covariance information for one of the objects is not available the analyst has commonly defaulted to the situation in which only the relative miss position and velocity are known without any corresponding state error covariance information. The various usual methods of finding a maximum P (sub c) do no good because the analyst defaults to no knowledge of the combined, relative position error covariance matrix. It is reasonable to think, given an assumption of no covariance information, an analyst might still attempt to determine the error covariance matrix that results in an upper bound on the P (sub c). Without some guidance on limits to the shape, size and orientation of the unknown covariance matrix, the limiting case is a degenerate ellipse lying along the relative miss vector in the collision plane. Unless the miss position is exceptionally large or the at-risk object is exceptionally small, this method results in a maximum P (sub c) too large to be of practical use. For example, assuming that the miss distance is equal to the current ISS alert volume along-track (+ or -) distance of 25 kilometers and that the at-risk area has a 70 meter radius. The maximum (degenerate ellipse) P (sub c) is about 0.00136. At 40 kilometers, the maximum P (sub c) would be 0.00085 which is still almost an order of magnitude larger than the ISS maneuver threshold of 0.0001. In fact, a miss distance of almost 340 kilometers is necessary to reduce the maximum P (sub c) associated with this degenerate ellipse to the ISS maneuver threshold value. Such a result is frequently of no practical value to the analyst. Some improvement may be made with respect to this problem by realizing that while the position error covariance matrix of one of the objects (usually the debris object) may not be known the position error covariance matrix of the other object (usually the asset) is almost always available. Making use of the position error covariance information for the one object provides an improvement in finding a maximum P (sub c) which, in some cases, may offer real utility. The equations to be used are presented and their use discussed.

Frisbee, Joseph H., Jr.↗
NASA NTRS1996

ILIAD Testing; and a Kalman Filter for 3-D Pose Estimation

This report presents the results of a two-part project. The first part presents results of performance assessment tests on an Internet Library Information Assembly Data Base (ILIAD). It was found that ILLAD performed best when queries were short (one-to-three keywords), and were made up of rare, unambiguous words. In such cases as many as 64% of the typically 25 returned documents were found to be relevant. It was also found that a query format that was not so rigid with respect to spelling errors and punctuation marks would be more user-friendly. The second part of the report shows the design of a Kalman Filter for estimating motion parameters of a three dimensional object from sequences of noisy data derived from two-dimensional pictures. Given six measured deviation values represendng X, Y, Z, pitch, yaw, and roll, twelve parameters were estimated comprising the six deviations and their time rate of change. Values for the state transiton matrix, the observation matrix, the system noise covariance matrix, and the observation noise covariance matrix were determined. A simple way of initilizing the error covariance matrix was pointed out.

Richardson, A. O.↗
NASA NTRS1977

Structured estimation - Sample size reduction for adaptive pattern classification

The Gaussian two-category classification problem with known category mean value vectors and identical but unknown category covariance matrices is considered. The weight vector depends on the unknown common covariance matrix, so the procedure is to estimate the covariance matrix in order to obtain an estimate of the optimum weight vector. The measure of performance for the adapted classifier is the output signal-to-interference noise ratio (SIR). A simple approximation for the expected SIR is gained by using the general sample covariance matrix estimator; this performance is both signal and true covariance matrix independent. An approximation is also found for the expected SIR obtained by using a Toeplitz form covariance matrix estimator; this performance is found to be dependent on both the signal and the true covariance matrix.

Morgera, S.↗
NASA NTRS1993

Application of the target decomposition theorem to a polarimetric random media model

With advances in polarimetric radar measurements of land surfaces, the need for understanding the underlying scattering mechanisms and dominant target features has become the focus of many studies. In particular, the maximum use of the polarimetric information to identify and/or separate parameters related to the surface features such as vegetation thickness, structure, water content, and soil surface characteristics will enhance the possibility of using polarimetric radars for monitoring the earth's surface from space. In this paper, Cloude's decomposition theorem is applied to a polarimetric random media model to simulate the radar measurements of vegetated canopies. The vegetated canopies are modeled as a three layer discrete random medium with leaves and branches in the first layer, tree trunks in the second layer, and a half space of homogeneous ground with rough interface as the bottom layer. The distorted born approximation (DBA) has been used to compute full Mueller matrix of the canopy, using canonical dielectric objects such as thin discs and cylinders as leaves, branches, and trunks, respectively. The Mueller matrix and the derived covariance matrix contain information on the second order statistics of radar signals at various polarizations from the canopy. To decompose the covariance matrix to its constituent targets, the eigenvalues and eigenvectors of the covariance matrix are computed in terms of the physical parameters of the canopy. In addition, each eigenvector explicitly shows the scattering mechanisms such as odd and even reflections in the canopy. Cloude's decomposition theorem is applied using the Pauli spin matrices as a basis and an expression for the degree of disorder or the entropy for the vegetated surface is found. Then, the physical parameters estimated from in situ measurements are used in the random media to obtain realistic covariance matrices. As a result, the sensitivity of the eigenvalue spectrums and the coefficients resulting from the target decomposition theorem to the physical parameters of the canopy are examined and the possible use of Cloude's theorem to estimate vegetation and soil parameters is discussed.

Saatchi, Sasan S.↗
NASA NTRS1986

Remote sensing of Earth Terrain

The Mueller matrix and polarization covariance matrix for polarimetric radar systems were studied. The clutter is modelled by a layer of random permittivity, described by a three dimensional correlation function, with variance, and horizontal and vertical correlation lengths. This model is applied, using the wave theory with Born approximations carried to the second order, to find the backscattering elements of the polarimetric matrices. It is found that 8 out of 16 elements of the Mueller matrix are identically zero, corresponding to a covariance matrix with four zero elements. Theoretical predictions are matched with experimental data for vegetation fields. A general mixing formula is derived for discrete scatterers immersed in a host medium. The inclusion particles are assumed to be ellipsoidal. The electric field inside the scatterers is determined by quasistatic analysis, assuming the diameter of the inclusion particles to be much smaller than the wavelength. The results are applicable to general multiphase mixtures.

Kong, J. A.↗
NASA NTRS1987

Theoretical models for polarimetric radar clutter

The Mueller matrix and polarization covariance matrix are described for polarimetric radar systems. The clutter is modeled by a layer of random permittivity, described by a three-dimensional correlation function, with variance, and horizontal and vertical correlation lengths. This model is applied, using the wave theory with Born approximations carried to the second order, to find the backscattering elements of the polarimetric matrices. It is found that 8 out of 16 elements of the Mueller matrix are identically zero, corresponding to a covariance matrix with four zero elements. Theoretical predictions are matched with experimental data for vegetation fields.

Borgeaud, M.↗
NASA NTRS1989

Analysis of modified SMI method for adaptive array weight control

An adaptive array is applied to the problem of receiving a desired signal in the presence of weak interference signals which need to be suppressed. A modification, suggested by Gupta, of the sample matrix inversion (SMI) algorithm controls the array weights. In the modified SMI algorithm, interference suppression is increased by subtracting a fraction F of the noise power from the diagonal elements of the estimated covariance matrix. Given the true covariance matrix and the desired signal direction, the modified algorithm is shown to maximize a well-defined, intuitive output power ratio criterion. Expressions are derived for the expected value and variance of the array weights and output powers as a function of the fraction F and the number of snapshots used in the covariance matrix estimate. These expressions are compared with computer simulation and good agreement is found. A trade-off is found to exist between the desired level of interference suppression and the number of snapshots required in order to achieve that level with some certainty. The removal of noise eigenvectors from the covariance matrix inverse is also discussed with respect to this application. Finally, the type and severity of errors which occur in the covariance matrix estimate are characterized through simulation.

Dilsavor, R. L.↗
NASA NTRS1980

UDU/T/ covariance factorization for Kalman filtering

There has been strong motivation to produce numerically stable formulations of the Kalman filter algorithms because it has long been known that the original discrete-time Kalman formulas are numerically unreliable. Numerical instability can be avoided by propagating certain factors of the estimate error covariance matrix rather than the covariance matrix itself. This paper documents filter algorithms that correspond to the covariance factorization P = UDU(T), where U is a unit upper triangular matrix and D is diagonal. Emphasis is on computational efficiency and numerical stability, since these properties are of key importance in real-time filter applications. The history of square-root and U-D covariance filters is reviewed. Simple examples are given to illustrate the numerical inadequacy of the Kalman covariance filter algorithms; these examples show how factorization techniques can give improved computational reliability.

Thornton, C. L.↗
NASA NTRS1985

A Kalman filter for a two-dimensional shallow-water model

A two-dimensional Kalman filter is described for data assimilation for making weather forecasts. The filter is regarded as superior to the optimal interpolation method because the filter determines the forecast error covariance matrix exactly instead of using an approximation. A generalized time step is defined which includes expressions for one time step of the forecast model, the error covariance matrix, the gain matrix, and the evolution of the covariance matrix. Subsequent time steps are achieved by quantifying the forecast variables or employing a linear extrapolation from a current variable set, assuming the forecast dynamics are linear. Calculations for the evolution of the error covariance matrix are banded, i.e., are performed only with the elements significantly different from zero. Experimental results are provided from an application of the filter to a shallow-water simulation covering a 6000 x 6000 km grid.

Parrish, D. F.↗
NASA NTRS1993

Polarimetric radar data decomposition and interpretation

Significant efforts have been made to decompose polarimetric radar data into several simple scattering components. The components which are selected because of their physical significance can be used to classify SAR (Synthetic Aperture Radar) image data. If particular components can be related to forest parameters, inversion procedures may be developed to estimate these parameters from the scattering components. Several methods have been used to decompose an averaged Stoke's matrix or covariance matrix into three components representing odd (surface), even (double-bounce) and diffuse (volume) scatterings. With these decomposition techniques, phenomena, such as canopy-ground interactions, randomness of orientation, and size of scatters can be examined from SAR data. In this study we applied the method recently reported by van Zyl (1992) to decompose averaged backscattering covariance matrices extracted from JPL SAR images over forest stands in Maine, USA. These stands are mostly mixed stands of coniferous and deciduous trees. Biomass data have been derived from field measurements of DBH and tree density using allometric equations. The interpretation of the decompositions and relationships with measured stand biomass are presented in this paper.

Sun, Guoqing↗
DOE OSTI2024

Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements

In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.

Lei, Jinlong↗
DOE OSTI2022

Comparison of the Baseline USL Calculation Methods for Loosely-Coupled and Novel Neutronic Systems [Slides]

Current work includes reconstructing 187-group ENDF B/VII.1 covariance matrix for comparison study to 44-group ENDF B/VII.1 matrix to determine how covariance matrix structures affect the USL calculations and investigating the exact domination mechanism of region-wise sensitivities in a loosely-coupled system. Future work will involve seeking to understand how bias distributions change with reactivity and how to calculate propagate distribution error into USL calculations, as well as how cross section perturbation studies can be extended to other types of calculations, such as shielding calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1976

Triangular covariance factorizations for

An improved computational form of the discrete Kalman filter is derived using an upper triangular factorization of the error covariance matrix. The covariance P is factored such that P = UDUT where U is unit upper triangular and D is diagonal. Recursions are developed for propagating the U-D covariance factors together with the corresponding state estimate. The resulting algorithm, referred to as the U-D filter, combines the superior numerical precision of square root filtering techniques with an efficiency comparable to that of Kalman's original formula. Moreover, this method is easily implemented and involves no more computer storage than the Kalman algorithm. These characteristics make the U-D method an attractive realtime filtering technique. A new covariance error analysis technique is obtained from an extension of the U-D filter equations. This evaluation method is flexible and efficient and may provide significantly improved numerical results. Cost comparisons show that for a large class of problems the U-D evaluation algorithm is noticeably less expensive than conventional error analysis methods.

Thornton, C. L.↗
NASA NTRS1981

Space shuttle launch era spacecraft injection errors and DSN initial acquisition

The initial acquisition of a spacecraft by the Deep Space Network (DSN) is a critical mission event. This results from the importance of rapidly evaluating the health and trajectory of a spacecraft in the event that immediate corrective action might be required. Further, the DSN initial acquisition is always complicated by the most extreme tracking rates of the mission. The DSN initial acquisition characteristics will change considerably in the upcoming space shuttle launch era. How given injection errors at spacecraft separation from the upper stage launch vehicle (carried into orbit by the space shuttle) impact the DSN initial acquisition, and how this information can be factored into injection accuracy requirements to be levied on the Space Transportation System (STS) is addressed. The approach developed begins with the DSN initial acquisition parameters, generates a covariance matrix, and maps this covariance matrix backward to the spacecraft injection, thereby greatly simplifying the task of levying accuracy requirements on the STS, by providing such requirements in a format both familiar and convenient to STS.

Khatib, A. R.↗
NASA NTRS1992

Polarization effects and multipolarization SAR

Imaging radar polarimeters are usually implemented using a Synthetic Aperture Radar (SAR) approach to give a high resolution image in two dimensions: range and azimuth. For each pixel in the image a polarimetric SAR gives sufficient information to characterize the polarimetric scattering properties of the imaged area (or target) as seen by the radar. Using a polarimetric SAR system as opposed to a single-polarization SAR system provides significantly more information about the target scattering mechanisms and allows better discrimination between different types of surfaces. In these notes a brief overview of SAR polarimetry is offered. The notes are intended as a text to accompany a lecture on SAR polarimetry as part of an AGARD-NATO course. Covered in the notes are the following: the polarization properties of electromagnetic waves; the concepts of radar scattering and measuring radar backscatter with a SAR; polarization synthesis; scattering matrix, Stokes matrix, and covariance matrix representations of polarimetric SAR data; polarization signature plots; design and calibration of polarimetric SAR systems; polarization filtering for target detection; fitting a simple model to polarimetric SAR measurements of naturally occurring features; and supervised classification of polarimetric SAR data.

Freeman, Anthony↗
DOE OSTI2020

Fast matrix algebra for Bayesian model calibration

In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2006

Adapting Covariance Propagation to Account for the Presence of Modeled and Unmodeled Maneuvers

This paper explores techniques that can be used to adapt the standard linearized propagation of an orbital covariance matrix to the case where there is a maneuver and an associated execution uncertainty. A Monte Carlo technique is used to construct a final orbital covariance matrix for a 'prop-burn-prop' process that takes into account initial state uncertainty and execution uncertainties in the maneuver magnitude. This final orbital covariance matrix is regarded as 'truth' and comparisons are made with three methods using modified linearized covariance propagation. The first method accounts for the maneuver by modeling its nominal effect within the state transition matrix but excludes the execution uncertainty by omitting a process noise matrix from the computation. The second method does not model the maneuver but includes a process noise matrix to account for the uncertainty in its magnitude. The third method, which is essentially a hybrid of the first two, includes the nominal portion of the maneuver via the state transition matrix and uses a process noise matrix to account for the magnitude uncertainty. The first method is unable to produce the final orbit covariance except in the case of zero maneuver uncertainty. The second method yields good accuracy for the final covariance matrix but fails to model the final orbital state accurately. Agreement between the simulated covariance data produced by this method and the Monte Carlo truth data fell within 0.5-2.5 percent over a range of maneuver sizes that span two orders of magnitude (0.1-20 m/s). The third method, which yields a combination of good accuracy in the computation of the final covariance matrix and correct accounting for the presence of the maneuver in the nominal orbit, is the best method for applications involving the computation of times of closest approach and the corresponding probability of collision, PC. However, applications for the two other methods exist and are briefly discussed. Although the process model ("prop-burn-prop") that was studied is very simple - point-mass gravitational effects due to the Earth combined with an impulsive delta-V in the velocity direction for the maneuver - generalizations to more complex scenarios, including high fidelity force models, finite duration maneuvers, and maneuver pointing errors, are straightforward and are discussed in the conclusion.

Schiff, Conrad↗