Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discretization error”

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 235 records · Page 13

Update and review of accuracy assessment techniques for remotely sensed data

Research performed in the accuracy assessment of remotely sensed data is updated and reviewed. The use of discrete multivariate analysis techniques for the assessment of error matrices, the use of computer simulation for assessing various sampling strategies, and an investigation of spatial autocorrelation techniques are examined.

Congalton, R. G.↗

Topics in spectral methods

After detailing the construction of spectral approximations to time-dependent mixed initial boundary value problems, a study is conducted of differential equations of the form 'partial derivative of u/partial derivative of t = Lu + f', where for each t, u(t) belongs to a Hilbert space such that u satisfies homogeneous boundary conditions. For the sake of simplicity, it is assumed that L is an unbounded, time-independent linear operator. Attention is given to Fourier methods of both Galerkin and pseudospectral method types, the Galerkin method, the pseudospectral Chebyshev and Legendre methods, the error equation, hyperbolic partial differentiation equations, and time discretization and iterative methods.

Gottlieb, D.↗

SAR data compression: Application, requirements, and designs

The feasibility of reducing data volume and data rate is evaluated for the Earth Observing System (EOS) Synthetic Aperture Radar (SAR). All elements of data stream from the sensor downlink data stream to electronic delivery of browse data products are explored. The factors influencing design of a data compression system are analyzed, including the signal data characteristics, the image quality requirements, and the throughput requirements. The conclusion is that little or no reduction can be achieved in the raw signal data using traditional data compression techniques (e.g., vector quantization, adaptive discrete cosine transform) due to the induced phase errors in the output image. However, after image formation, a number of techniques are effective for data compression.

Curlander, John C.↗

High-Order Semi-Discrete Central-Upwind Schemes for Multi-Dimensional Hamilton-Jacobi Equations

We present high-order semi-discrete central-upwind numerical schemes for approximating solutions of multi-dimensional Hamilton-Jacobi (HJ) equations. This scheme is based on the use of fifth-order central interpolants like those developed in [1], in fluxes presented in [3]. These interpolants use the weighted essentially nonoscillatory (WENO) approach to avoid spurious oscillations near singularities, and become "central-upwind" in the semi-discrete limit. This scheme provides numerical approximations whose error is as much as an order of magnitude smaller than those in previous WENO-based fifth-order methods [2, 1]. Thee results are discussed via examples in one, two and three dimensions. We also pregnant explicit N-dimensional formulas for the fluxes, discuss their monotonicity and tl!e connection between this method and that in [2].

Bryson, Steve↗

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗

A mathematical theory of learning control for linear discrete multivariable systems

When tracking control systems are used in repetitive operations such as robots in various manufacturing processes, the controller will make the same errors repeatedly. Here consideration is given to learning controllers that look at the tracking errors in each repetition of the process and adjust the control to decrease these errors in the next repetition. A general formalism is developed for learning control of discrete-time (time-varying or time-invariant) linear multivariable systems. Methods of specifying a desired trajectory (such that the trajectory can actually be performed by the discrete system) are discussed, and learning controllers are developed. Stability criteria are obtained which are relatively easy to use to insure convergence of the learning process, and proper gain settings are discussed in light of measurement noise and system uncertainties.

Phan, Minh↗

Spectrum measurements with laser velocimeters

The length of time or number of samples required for a laser velocimeter experiment to attain a specified variability error level is determined. The study is based on available techniques for estimating turbulence point spectra with a Poisson sampling signal formalism. The discretized lag product technique is found to be the most efficient spectral estimator. The variability error theory developed by Gaster and Roberts (1975) for an exact lag product algorithm provides a practical formula for the discretized lag product algorithm.

Mayo, W. T., Jr.↗

Error probabilities in optical PPM receivers with Gaussian mixture densities

A Gaussian mixture density arises when a discrete variable (e.g., a photodetector count variable) is added to a continuous Gaussian variable (e.g., thermal noise). Making use of some properties of photomultiplier Gaussian mixture distributions, some approximate error probability formulas can be derived. These appear as averages of M-ary orthogonal Gaussian error probabilities. The use of a pure Gaussian assumption is considered, and when properly defined, appears as an accurate upper bound to performance.

Gagliardi, R. M.↗

Stochastic process approximation for recursive estimation with guaranteed bound on the error covariance

An approach, is proposed for the design of approximate, fixed order, discrete time realizations of stochastic processes from the output covariance over a finite time interval, was proposed. No restrictive assumptions are imposed on the process; it can be nonstationary and lead to a high dimension realization. Classes of fixed order models are defined, having the joint covariance matrix of the combined vector of the outputs in the interval of definition greater or equal than the process covariance; (the difference matrix is nonnegative definite). The design is achieved by minimizing, in one of those classes, a measure of the approximation between the model and the process evaluated by the trace of the difference of the respective covariance matrices. Models belonging to these classes have the notable property that, under the same measurement system and estimator structure, the output estimation error covariance matrix computed on the model is an upper bound of the corresponding covariance on the real process. An application of the approach is illustrated by the modeling of random meteorological wind profiles from the statistical analysis of historical data.

Menga, G.↗

Relative-Error-Covariance Algorithms

Two algorithms compute error covariance of difference between optimal estimates, based on data acquired during overlapping or disjoint intervals, of state of discrete linear system. Provides quantitative measure of mutual consistency or inconsistency of estimates of states. Relative-error-covariance concept applied, to determine degree of correlation between trajectories calculated from two overlapping sets of measurements and construct real-time test of consistency of state estimates based upon recently acquired data.

Bierman, Gerald J.↗

Man-machine interactive system simplifies computer-aided circuit design

Langley interactive computerized circuit analysis capability /LICCA/ enables designer to draw electronic circuit diagrams on cathode ray tube screen. This information is submitted as input to user-selected circuit analysis program. LICCA accommodates binary logic circuits and circuits with discrete components, and monitors operator's instructions to detect errors.

Bavuso, S. J.↗

Input noise approximation in tracker modeling

The validity of approximating random Gaussian distributed inputs used in human response modeling by sums of discrete sine waves is studied. An ideal rectangular power density spectrum is simulated using both filtered Gaussian white noise and sums-of-discrete sine waves with three different input cutoff frequencies in the same compensatory tracking task. Resulting normalized tracking error and quality operator observations are used to investigate apparent discrepancies in human operator characteristics. Results show that discrete and continuous input tracking data compare favorable when the power in the crossover region is taken into account.

Torrey, P. F.↗

Finite Volume Methods: Foundation and Analysis

Finite volume methods are a class of discretization schemes that have proven highly successful in approximating the solution of a wide variety of conservation law systems. They are extensively used in fluid mechanics, porous media flow, meteorology, electromagnetics, models of biological processes, semi-conductor device simulation and many other engineering areas governed by conservative systems that can be written in integral control volume form. This article reviews elements of the foundation and analysis of modern finite volume methods. The primary advantages of these methods are numerical robustness through the obtention of discrete maximum (minimum) principles, applicability on very general unstructured meshes, and the intrinsic local conservation properties of the resulting schemes. Throughout this article, specific attention is given to scalar nonlinear hyperbolic conservation laws and the development of high order accurate schemes for discretizing them. A key tool in the design and analysis of finite volume schemes suitable for non-oscillatory discontinuity capturing is discrete maximum principle analysis. A number of building blocks used in the development of numerical schemes possessing local discrete maximum principles are reviewed in one and several space dimensions, e.g. monotone fluxes, E-fluxes, TVD discretization, non-oscillatory reconstruction, slope limiters, positive coefficient schemes, etc. When available, theoretical results concerning a priori and a posteriori error estimates are given. Further advanced topics are then considered such as high order time integration, discretization of diffusion terms and the extension to systems of nonlinear conservation laws.

Barth, Timothy↗

Accuracy of RT Code SORD for Realistic Atmospheric Profiles

We discuss accuracy of our recently developed RT code SORD using 2 benchmark scenarios published by the IPRT group in 2015. These scenarios define atmospheres with a complicate dependence of scattering and absorption properties over height (profile). Equal step, dh=1km, is assumed in the profiles. We developed subroutines that split such atmospheres into layers of the same optical thickness, d tau. We provide full text of the subroutines with comments in Appendix. The d tau is a step for vertical integration in the method of successive orders. Modification of the input profiles from "equal step over h" to "equal step over tau" changes input for RT simulations. This may cause errors at or above the acceptable level of the measurement uncertainty. We show errors of the RT code SORD for both intensity and polarization. In addition to that, using our discrete ordinates RT code IPOL, we discuss one more IPRT scenario, in which changes in height profile indeed cause unacceptable errors. Clear understanding of source and magnitude of these errors is important, e.g. for the AERONET retrieval algorithm. SORD is available from ftp://maiac.gsfc.nasa.gov/pub/skorkin/SORD_IP_16B/ or by email request from the first author.

polarization↗

Adaptive identification and control for manipulators without using joint accelerations

The authors present a new scheme for the adaptive control of mechanical manipulators along with proof of convergence. Difficulties encountered in the input-error type adaptive controller are remedied by combining an explicit identifier with discrete time updates of the parameter values along with a computed torque type control law. The new scheme requires no matrix inversion with its consequent drain on the computational power of the controller. A discussion is presented of the dynamic model of a manipulator, a computed torque adaptive scheme, an input error identifier, and a hybrid identifier.

Hsu, Ping↗

Hesitation in tracking induced by a concurrent manual task

When people are required to track with one hand and perform occasional discrete responses with the other hand, there is a strong possibility that errors will be induced in tracking attributable to the simultaneous action by the other. This problem was investigated by pairing pursuit tracking (right hand) with a handle movement response (left hand) guided by an auditory stimulus. Tracking is assumed to represent flight control and the left hand response to represent other aspects of aircraft system management. The general goal of this research is to identify the types of errors induced into tracking by the requirement of a secondary response with the other hand. An attempt is reported to determine if hesitations can be reduced further by combining tracking emphasis with a higher degree of practice. It is concluded that there is a tendency to freeze the tracking response when a discrete simultaneous response is required of the other hand. By contrast, practice seems to reduce hesitations while also improving left hand reaction time. Thus there appears to be a mode of control which permits tracking and discrete simultaneous responses to occur together.

Kelly, P. A.↗

Digital Material Assembly by Passive Means and Modular Isotropic Lattice Extruder System

A set of machines and related systems build structures by the additive assembly of discrete parts. These digital material assemblies constrain the constituent parts to a discrete set of possible positions and orientations. In doing so, the structures exhibit many of the properties inherent in digital communication such as error correction, fault tolerance and allow the assembly of precise structures with comparatively imprecise tools. Assembly of discrete cellular lattices by a Modular Isotropic Lattice Extruder System (MILES) is implemented by pulling strings of lattice elements through a forming die that enforces geometry constraints that lock the elements into a rigid structure that can then be pushed against and extruded out of the die as an assembled, loadbearing structure.

Carney, Matthew Eli↗

Digital Material Assembly by Passive Means and Modular Isotropic Lattice Extruder System

A set of machines and related systems build structures by the additive assembly of discrete parts. These digital material assemblies constrain the constituent parts to a discrete set of possible positions and orientations. In doing so, the structures exhibit many of the properties inherent in digital communication such as error correction, fault tolerance and allow the assembly of precise structures with comparatively imprecise tools. Assembly of discrete cellular lattices by a Modular Isotropic Lattice Extruder System (MILES) is implemented by pulling strings of lattice elements through a forming die that enforces geometry constraints that lock the elements into a rigid structure that can then be pushed against and extruded out of the die as an assembled, load bearing structure.

Carney, Matthew Eli↗