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 757 records · Page 42

State estimation with small nonlinearities

A variety of techniques is available for estimating the states of nonlinear dynamic systems from noisy data. The differences among several of these procedures in the presence of small dynamic and observational nonlinearities are investigated. Four discrete estimation algorithms are analyzed. The first is a strictly least square estimator, while the others are recursive algorithms similar to the Kalman filter used for estimating the states of linear systems. A group of analytic expressions is developed for the mean and covariance of the error in each of these estimators so that they may be compared without lengthy Monte Carlo simulations. The covariance expressions show that, to first order, all the estimators have the same covariance. Expressions for the means show that each estimator has a different bias. Several examples are carried out demonstrating that the relative magnitudes of the bias errors in the various estimators can be a strong function of such parameters as initial covariances and number of data points. Under some circumstances, more complicated algorithms can have larger biases than smaller ones.

Conrad, B.↗

Establishment of a rotor model basis

Radial-dimension computations in the RSRA's blade-element model are modified for both the acquisition of extensive baseline data and for real-time simulation use. The baseline data, which are for the evaluation of model changes, use very small increments and are of high quality. The modifications to the real-time simulation model are for accuracy improvement, especially when a minimal number of blade segments is required for real-time synchronization. An accurate technique for handling tip loss in discrete blade models is developed. The mathematical consistency and convergence properties of summation algorithms for blade forces and moments are examined and generalized integration coefficients are applied to equal-annuli midpoint spacing. Rotor conditions identified as 'constrained' and 'balanced' are used and the propagation of error is analyzed.

Mcfarland, R. E.↗

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.↗

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗

Machine learning a molecular Hamiltonian for predicting electron dynamics

We develop a computational method to learn a molecular Hamiltonian matrix from matrix-valued time series of the electron density. As we demonstrate for three small molecules, the resulting Hamiltonians can be used for electron density evolution, producing highly accurate results even when propagating 1,000 time steps beyond the training data. As a more rigorous test, we use the learned Hamiltonians to simulate electron dynamics in the presence of an applied electric field, extrapolating to a problem that is beyond the field-free training data. We find that the resulting electron dynamics predicted by our learned Hamiltonian are in close quantitative agreement with the ground truth. Our method relies on combining a reduced-dimensional, linear statistical model of the Hamiltonian with a time-discretization of the quantum Liouville equation within time-dependent Hartree Fock theory. In conclusion, we train the model using a least-squares solver, avoiding numerous, CPU-intensive optimization steps. For both field-free and field-on problems, we quantify training and propagation errors, highlighting areas for future development.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗

Advanced Multilevel Monte Carlo Methods

This article reviews the application of some advanced Monte Carlo techniques in the context of multilevel Monte Carlo (MLMC). MLMC is a strategy employed to compute expectations, which can be biassed in some sense, for instance, by using the discretization of an associated probability law. The MLMC approach works with a hierarchy of biassed approximations, which become progressively more accurate and more expensive. Additionally, using a telescoping representation of the most accurate approximation, the method is able to reduce the computational cost for a given level of error versus i.i.d. sampling from this latter approximation. All of these ideas originated for cases where exact sampling from couples in the hierarchy is possible. This article considers the case where such exact sampling is not currently possible. We consider some Markov chain Monte Carlo and sequential Monte Carlo methods, which have been introduced in the literature, and we describe different strategies that facilitate the application of MLMC within these methods.

97 MATHEMATICS AND COMPUTING↗

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↗

Evaluating Methods for Measuring Grid Frequency in Low-Inertia Power Systems: Preprint

Accurate measurement of grid frequency is a critical component of reliable grid control. Traditionally, methods such as phase locked loops (PLLs) and discrete Fourier transforms (DFTs) have been used in inverters and phasor measurement units (PMUs) to measure frequency. However, as the percentage of inverter-based resources (IBRs) such as solar and wind has increased, these conventional frequency measurement methods are proving unable to guarantee reliable control in some cases. One challenge is measuring frequency during transient events, where there is a disruption in the steady state sinusoidal voltage. During these events, the underlying frequency of the grid may barely change, but measurement methods report a large spike in frequency due to the disrupted waveform. New methods must balance between suppressing spikes in frequency during faults, and providing fast, accurate, measurements in all other grid operation conditions, especially during events with high rate-of-change-of frequency (ROCOF), which are more prevalent in high-IBR power systems. This paper first surveys frequency measurement methods that have been proposed to reduce measurement errors during transient events. Then, both conventional and more novel frequency measurement methods are tested against an IEEE standard and industry recommendations, and their performance is evaluated for events simulated in PSCAD. Results quantify the trade-offs in performance during different grid conditions and lead to suggestions for the most appropriate frequency and ROCOF measurement methods for low inertia grids.

frequency↗

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.↗