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 523 records · Page 29

VLSI Architectures for Computing DFT's

Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.

Truong, T. K.↗

Learning control for slewing of a flexible panel

This paper studies the applicability of a discrete-time learning control method to the slewing control of a large flexible panel. Among the issues discussed are feasibility of the desired trajectories and their specification schemes, learning control by linear feedback, limitation of the actuator device output, and robustness to parameter changes or modeling errors associated with the chosen learning control design. To demonstrate the effectiveness of learning control, the system is designed with a proportional controller of the base angle only. Then application of the learning control is shown to make the system learn quickly to achieve the desired slewing without residual vibration at the end of the maneuver. Simulation results are reported and discussed.

Phan, M.↗

Adjoints and Low-rank Covariance Representation

Quantitative measures of the uncertainty of Earth System estimates can be as important as the estimates themselves. Second moments of estimation errors are described by the covariance matrix, whose direct calculation is impractical when the number of degrees of freedom of the system state is large. Ensemble and reduced-state approaches to prediction and data assimilation replace full estimation error covariance matrices by low-rank approximations. The appropriateness of such approximations depends on the spectrum of the full error covariance matrix, whose calculation is also often impractical. Here we examine the situation where the error covariance is a linear transformation of a forcing error covariance. We use operator norms and adjoints to relate the appropriateness of low-rank representations to the conditioning of this transformation. The analysis is used to investigate low-rank representations of the steady-state response to random forcing of an idealized discrete-time dynamical system.

Tippett, Michael K.↗

Subpixel translation-registration of random fields

The author examines both theoretically and through a simulation study the feasibility of identifying the location within a large reference gray-level array of a smaller sensed array to an accuracy finer than one pixel. It is assumed that the sensed image before discretization into pixels consists of a translated, but not rotated, section of the reference image with some superposed noise. The theoretical and empirical results show that when the noise has standard deviation no larger than that of a realistic reference field, the upper quartile of the registration error is on the order of 0.25-0.5 pixels.

Slud, Eric V.↗

Developing a Radar Signal Simulator for the Community Radiative Transfer Model

Active radar instruments provide vertically resolved clouds and precipitation measurements that cannot be provided by the passive instruments. These active measurements are not conventionally assimilated into the data assimilation systems because of the lack of fast forward radiative transfer models and also difficulties in the error modelling of the measurements. This paper describes the development, evaluation, and sensitivity analysis for a forward radar model implemented in the Community Radiative Transfer Model (CRTM). The scattering properties required by the forward model are provided by the hydrometeor lookup tables that were generated using the discrete dipole approximation. The model is able to calculate both the reflectivity and the attenuated reflectivity for any given radar instrument at any given zenith angles as long as CRTM instrument specific coefficients are available. The evaluation using CloudSat measurements shows a very good agreement between the simulations and measurements as long as the input profiles of hydrometeors are consistent with the measured reflectivity profiles. Major sources contributing to the differences between the measured and simulated reflectivities are input hydrometeor profiles, scattering lookup tables, lack of melting layer in the forward model, CRTM scattering solvers, and attenuation calculations. In addition to the forward model, both Tangent Linear and Adjoint of the model are also implemented and tested within CRTM. These components may be required by some data assimilation systems for the assimilation of radar measurements.

radar↗

Performance of a finite phase state bit-synchronization loop with and without sequential filters

A discrete phase state bit-synchronization loop is proposed for synchronization and detection of a binary nonreturn-to-zero (NRZ) process. The general loop model is developed for 11 and 17 phase states with optional sequential loop filter. Loop performance is considered in terms of the phase error density function, rms phase error, and mean time to bit slippage. It is shown that satisfactory loop performance can be achieved at -3 dB SNR through use of sequential loop filters.

Ransom, J. J.↗

Frequency domain measurement systems

Stable frequency sources and signal processing blocks were characterized by their noise spectra, both discrete and random, in the frequency domain. Conventional measures are outlined, and systems for performing the measurements are described. Broad coverage of system configurations which were found useful is given. Their functioning and areas of application are discussed briefly. Particular attention is given to some of the potential error sources in the measurement procedures, system configurations, double-balanced-mixer-phase-detectors, and application of measuring instruments.

Eischer, M. C.↗

A spectral formalism for computing three-dimensional deformations due to surface loads. 1: Theory

We outline a complete spectral formalism for computing high spatial resolution three-dimensional deformations arising from the surface mass loading of a spherically symmetric planet. The main advantages of the formalism are that all surface mass loads are always described using a consistent mathematical representation and that calculations of deformation fields for various spatial resolutions can be performed by simpley altering the spherical harmonic degree truncation level of the procedure. The latter may be important when incorporating improved observational constraints on a particular surface mass load, when considering potential errors in the computed field associated with mass loading having a spatial scale unresolved by the observational constraints, or when treating a number of global surface mass loads constrained with different spatial resolutions. The advantages do not extend to traditional 'Green's function' approaches which involve surface element discretizations of the global mass loads. Another advantage of the spectral formalism, over the Green's function approach, is that a posteriori analyses of the computed deformation fields are easily performed. In developing the spectral formalism, we consider specific cases where the Earth's mantle is assumed to respond as an elastic, slightly anelastic, or linear viscoelastic medium. In the case of an elastic or slightly anelastic mantle rheology the spectral response equations incorporate frequency dependent Love numbers. The formalism can therefore be used, for example, to compute the potentially resonant deformational response associated with the free core nutation and Chandler wobble eigenfunctions. For completeness, the spectral response equations include both body forces, as arise from the gravitational attraction of the Sun and the Moon, and surface mass loads. In either case, and for both elastic and anelastic mantle rheologies, we outline a pseudo-spectral technique for computing the ocean adjustment associated with the total gravitational perturbation induced by the external forcing. Three-dimensional deformations computed using the usual Love number approach are generally referenced to an origin at the center of mass of the undeformed planet. We derive a spectral technique for transforming the results to an origin located at the center of mass of the deformed planet.

Mitrovica, J. X.↗

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗

Trial maneuver generation and selection in the paladin tactical decision generation system

To date, increased levels of maneuverability and controllability in aircraft have been postulated as tactically advantageous, but little research has studied maneuvers or tactics that make use of these capabilities. In order to help fill this void, a real-time tactical decision generation system for air combat engagements, Paladin, has been developed. Paladin models an air combat engagement as a series of discrete decisions. A detailed description of Paladin's decision making process is presented. This includes the sources of data used, methods of generating reasonable maneuvers for the Paladin aircraft, and selection criteria for choosing the 'best' maneuver. Simulation results are presented that show Paladin to be relatively insensitive to errors introduced into the decision process by estimation of future positional and geometric data.

Chappell, Alan R.↗

Trial maneuver generation and selection in the Paladin tactical decision generation system

To date, increased levels of maneuverability and controllability in aircraft have been postulated as tactically advantageous, but little research has studied maneuvers or tactics that make use of these capabilities. In order to help fill this void, a real-time tactical decision generation system for air combat engagements, Paladin, has been developed. Paladin models an air combat engagement as a series of discrete decisions. A detailed description of Paladin's decision making process is presented. This includes the sources of data used, methods of generating reasonable maneuvers for the Paladin aircraft, and selection criteria for choosing the 'best' maneuver. Simulation results are presented that show Paladin to be relatively insensitive to errors introduced into the decision process by estimation of future positional and geometric data.

Chappell, Alan R.↗

Low-dissipation and -dispersion Runge-Kutta schemes for computational acoustics

In this paper, we investigate accurate and efficient time advancing methods for computational acoustics, where non-dissipative and non-dispersive properties are of critical importance. Our analysis pertains to the application of Runge-Kutta methods to high-order finite difference discretization. In many CFD applications multi-stage Runge-Kutta schemes have often been favored for their low storage requirements and relatively large stability limits. For computing acoustic waves, however, the stability consideration alone is not sufficient, since the Runge-Kutta schemes entail both dissipation and dispersion errors. The time step is now limited by the tolerable dissipation and dispersion errors in the computation. In the present paper, it is shown that if the traditional Runge-Kutta schemes are used for time advancing in acoustic problems, time steps greatly smaller than that allowed by the stability limit are necessary. Low-Dissipation and -Dispersion Runge-Kutta (LDDRE) schemes are proposed, based on an optimization that minimizes the dissipation and dispersion errors for wave propagation. Order optimizations of both single-step and two-step alternating schemes are considered. The proposed LDDRK schemes are remarkably more efficient than the classical Runge-Kutta schemes for acoustic computations. Moreover, low storage implementations of the optimized schemes are discussed. Special issues of implementing numerical boundary conditions in the LDDRK schemes are also addressed.

Hu, F. Q.↗

Application of low dissipation and dispersion Runge-Kutta schemes to benchmark problems in computational aeroacoustics

We investigate accurate and efficient time advancing methods for computational aeroacoustics, where non-dissipative and non-dispersive properties are of critical importance. Our analysis pertains to the application of Runge-Kutta methods to high-order finite difference discretization. In many CFD applications, multi-stage Runge-Kutta schemes have often been favored for their low storage requirements and relatively large stability limits. For computing acoustic waves, however, the stability consideration alone is not sufficient, since the Runge-Kutta schemes entail both dissipation and dispersion errors. The time step is now limited by the tolerable dissipation and dispersion errors in the computation. In the present paper, it is shown that if the traditional Runge-Kutta schemes are used for time advancing in acoustic problems, time steps greatly smaller than that allowed by the stability limit are necessary. Low Dissipation and Dispersion Runge-Kutta (LDDRK) schemes are proposed, based on an optimization that minimizes the dissipation and dispersion errors for wave propagation. Optimizations of both single-step and two-step alternating schemes are considered. The proposed LDDRK schemes are remarkably more efficient than the classical Runge-Kutta schemes for acoustic computations. Numerical results of each Category of the Benchmark Problems are presented. Moreover, low storage implementations of the optimized schemes are discussed. Special issues of implementing numerical boundary conditions in the LDDRK schemes are also addressed.

Hu, F. Q.↗

Trial Maneuver Generation and Selection in the Paladin Tactical Decision Generation System

To date, increased levels of maneuverability and controllability in aircraft have been postulated as tactically advantageous, but little research has studied maneuvers or tactics that make use of these capabilities. In order to help fill this void, a real time tactical decision generation system for air combat engagements, Paladin, has been developed. Paladin models an air combat engagement as a series of discrete decisions. A detailed description of Paladin's decision making process is presented. This includes the sources of data used, methods of generating reasonable maneuvers for the Paladin aircraft, and selection criteria for choosing the "best" maneuver. Simulation results are presented that show Paladin to be relatively insensitive to errors introduced into the decision process by estimation of future positional and geometric data.

Chappell, Alan R.↗

Satellite communication performance evaluation: Computational techniques based on moments

Computational techniques that efficiently compute bit error probabilities when only moments of the various interference random variables are available are presented. The approach taken is a generalization of the well known Gauss-Quadrature rules used for numerically evaluating single or multiple integrals. In what follows, basic algorithms are developed. Some of its properties and generalizations are shown and its many potential applications are described. Some typical interference scenarios for which the results are particularly applicable include: intentional jamming, adjacent and cochannel interferences; radar pulses (RFI); multipath; and intersymbol interference. While the examples presented stress evaluation of bit error probilities in uncoded digital communication systems, the moment techniques can also be applied to the evaluation of other parameters, such as computational cutoff rate under both normal and mismatched receiver cases in coded systems. Another important application is the determination of the probability distributions of the output of a discrete time dynamical system. This type of model occurs widely in control systems, queueing systems, and synchronization systems (e.g., discrete phase locked loops).

Omura, J. K.↗

Numerical analysis of discrete fractional integrodifferential structural dampers

This paper develops solution algorithms enabling the handling of the dynamic response of nonlinear structures contained discretely attached dampers modeled by fractional integrodifferential operators of the Grunwald-Liouville-Riemann type. The development consists of two levels of formulation, namely: (1) numerical approximations of fractional operators and, (2) the establishment of global level implicit schemes enabling the solution to nonlinear structural formulations. To generalize the overall results, error estimates are derived for the fractional operator approximation algorithm. These enable an ongoing optimization of solution efficiency for a given error tolerance. To benchmark the scheme, the results of several numerical experiments are presented. These illustrate the numerical characteristics of the overall formulation.

Padovan, Joseph↗

Apollo 15 green glass - Compositional distribution and petrogenesis

We have characterized a comprehensive suite of individual green-glass beads from Apollo 15 soil to determine interelement behavior and to constrain petrogenetic relationships. We analyzed 365 particles for trace elements by instrumental neutron activation analysis and analyzed 52 of them, selected to cover the compositional ranges observed for trace elements, for major elements by electron microprobe analysis. We confirm the observation of Delano (1979) that the beads comprise discrete compositional groups, although two of the groups he defined are further split on the basis of trace-element compositions. Each of the resulting seven groups has distinct average rare-earth abundances. The coherence between major- and trace-element data was masked in previous studies by imprecision, correlated error, and nonrepresentative sampling of the different groups. Most of the compositional characteristics of the green glasses can be explained by a model for batch equilibrium melting of a nearly homogeneous, ultramafic source region, when the complicating effects of high pressure and low oxygen fugacity are taken into account. The previously puzzling behavior of Ni and Co as apparently incompatible elements may arise from partial reduction of those elements to the zero oxidation state, resulting in low mineral/melt partition coefficients. The model also offers explanations for why the green glasses form boomerang-shaped trends on many two-element variation diagrams and why certain compositions (Groups A and D) are more abundant than glasses with other compositions.

Steele, Alison M.↗

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

We present the first fifth order, semi-discrete central upwind method for approximating solutions of multi-dimensional Hamilton-Jacobi equations. Unlike most of the commonly used high order upwind schemes, our scheme is formulated as a Godunov-type scheme. The scheme is based on the fluxes of Kurganov-Tadmor and Kurganov-Tadmor-Petrova, and is derived for an arbitrary number of space dimensions. A theorem establishing the monotonicity of these fluxes is provided. The spacial discretization is based on a weighted essentially non-oscillatory reconstruction of the derivative. The accuracy and stability properties of our scheme are demonstrated in a variety of examples. A comparison between our method and other fifth-order schemes for Hamilton-Jacobi equations shows that our method exhibits smaller errors without any increase in the complexity of the computations.

Bryson, Steve↗