Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error bound”

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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Filtering adaptive output feedback control for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics

This article synthesizes a filtering adaptive output feedback controller for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics. The multivariable nonlinear systems under consideration have both matched and mismatched uncertainties, which satisfy the semiglobal Lipschitz condition. The unmodeled dynamics are bounded-input bounded-output stable. By adopting an estimation/cancellation strategy, a piecewise constant adaptive law drives the estimation error to zero at every time instant, which yields the adaptive parameters; a disturbance rejection control law is designed to compensate the nonlinear uncertainties within the bandwidth of low-pass filters. The matched uncertainties are cancelled directly by adopting their opposite in the control signal, while a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. A feedforward control law is designed to track a given command. Since the virtual reference system defines the best performance that can be achieved by the closed-loop system, the uniform performance bounds are derived for the states and control signals via comparison. Both numerical and practical examples are provided to illustrate the effectiveness of the proposed filtering adaptive output feedback control architecture, comparisons with the model reference adaptive control demonstrates the superiority of the proposed control method.

filtering adaptive control, mismatched uncertainit↗
DOE OSTI2024

Investigation of Ethane Dehydrogenation and Hydrogenolysis on Pt(111), Pt(211), and Pt(100): Bayesian Quantification and Correction of DFT-Based Enthalpic and Entropic Uncertainties

Computational investigations of heterogeneously catalyzed reactions using density functional theory (DFT) are often inaccurate, largely due to uncertainties in the choice of DFT functional (enthalpic uncertainty) and approximations for modeling adsorbate movement along the catalyst surface (entropic uncertainty). This work illustrates that both uncertainties are significant in the investigation of ethane dehydrogenation (EDH) and hydrogenolysis on Pt catalysts by considering the complete deconstruction of ethane on Pt(111), Pt(211), and Pt(100) using microkinetic modeling (MKM). Hence, this work uses both noncalibrated and Bayesian-calibrated MKMs to quantify and correct inaccuracies in macroscopic properties due to both uncertainties. A Bayesian approach to the correction of entropic errors was introduced using a “Modified Fermi Function (MFF)” to calibrate between the two bounds of entropy represented by the harmonic oscillator (HO) and free translator (FT) approximations. Regardless of enthalpic and entropic uncertainties, all three surfaces are capable of ethane activation; however, Pt(211) was found to be the most active and is largely responsible for methane production. Next, Pt(111) is largely responsible for acetylene production, and Pt(100) has the highest ethylene selectivity but is most susceptible to coking. By comparison of different calibrated models, the FT entropy approximation was found to better describe EDH under typical experimental conditions. Statistical evidence was found to support Pt(111) as the active site for EDH, assuming that one single site is responsible for the chemistry. On the three surfaces, competing second dehydrogenations to CH 2 CH 2 and CH 3 CH were observed as well as isomerization of CH 3 CH back to CH 2 CH 2 and deeper dehydrogenation of CH 3 CH. In conclusion, C–C cleavage was found to largely proceed via the CH 3 C intermediate on Pt(100) and Pt(111), while on Pt(211), it was via both CHC and CH 3 C.

Bayesian model selection↗
DOE OSTI2021

NENCI-2021. I. A large benchmark database of non-equilibrium non-covalent interactions emphasizing close intermolecular contacts

In this work, we present NENCI-2021, a benchmark database of ~8000 Non-Equilibirum Non-Covalent Interaction energies for a large and diverse selection of intermolecular complexes of biological and chemical relevance. To meet the growing demand for large and high-quality quantum mechanical data in the chemical sciences, NENCI-2021 starts with the 101 molecular dimers in the widely used S66 and S101 databases and extends the scope of these works by (i) including 40 cation–π and anion–π complexes, a fundamentally important class of non-covalent interactions that are found throughout nature and pose a substantial challenge to theory, and (ii) systematically sampling all 141 intermolecular potential energy surfaces (PESs) by simultaneously varying the intermolecular distance and intermolecular angle in each dimer. Designed with an emphasis on close contacts, the complexes in NENCI-2021 were generated by sampling seven intermolecular distances along each PES (ranging from 0.7× to 1.1× the equilibrium separation) and nine intermolecular angles per distance (five for each ion–π complex), yielding an extensive database of 7763 benchmark intermolecular interaction energies (E int ) obtained at the coupled-cluster with singles, doubles, and perturbative triples/complete basis set [CCSD(T)/CBS] level of theory. The E int values in NENCI-2021 span a total of 225.3 kcal/mol, ranging from -38.5 to +186.8 kcal/mol, with a mean (median) E int value of -1.06 kcal/mol (-2.39 kcal/mol). In addition, a wide range of intermolecular atom-pair distances are also present in NENCI-2021, where close intermolecular contacts involving atoms that are located within the so-called van der Waals envelope are prevalent—these interactions, in particular, pose an enormous challenge for molecular modeling and are observed in many important chemical and biological systems. A detailed symmetry-adapted perturbation theory (SAPT)- based energy decomposition analysis also confirms the diverse and comprehensive nature of the intermolecular binding motifs present in NENCI-2021, which now includes a significant number of primarily induction-bound dimers (e.g., cation–π complexes). NENCI-2021 thus spans all regions of the SAPT ternary diagram, thereby warranting a new four-category classification scheme that includes complexes primarily bound by electrostatics (3499), induction (700), dispersion (1372), or mixtures thereof (2192). A critical error analysis performed on a representative set of intermolecular complexes in NENCI-2021 demonstrates that the E int values provided herein have an average error of ±0.1 kcal/mol, even for complexes with strongly repulsive E int values, and maximum errors of ±0.2–0.3 kcal/mol (i.e., ~±1.0 kJ/mol) for the most challenging cases. For these reasons, we expect that NENCI-2021 will play an important role in the testing, training, and development of next-generation classical and polarizable force fields, density functional theory approximations, wavefunction theory methods, and machine learning based intra- and inter-molecular potentials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Evaluating the location capabilities of a regional infrasonic network in Utah, US, using both ray tracing-derived and empirical-derived celerity-range and backazimuth models

SUMMARY More realistic models for infrasound signal propagation across a region can be used to improve the precision and accuracy of spatial and temporal source localization estimates. Motivated by incomplete infrasound event bulletins in the Western US, the location capabilities of a regional infrasonic network of stations located between 84–458 km from the Utah Test and Training Range, Utah, USA, is assessed using a series of near-surface explosive events with complementary ground truth (GT) information. Signal arrival times and backazimuth estimates are determined with an automatic F-statistic based signal detector and manually refined by an analyst. This study represents the first application of three distinct celerity-range and backazimuth models to an extensive suite of realistic signal detections for event location purposes. A singular celerity and backazimuth deviation model was previously constructed using ray tracing analysis based on an extensive archive of historical atmospheric specifications and is applied within this study to test location capabilities. Similarly, a set of multivariate, season and location specific models for celerity and backazimuth are compared to an empirical model that depends on the observations across the infrasound network and the GT events, which accounts for atmospheric propagation variations from source to receiver. Discrepancies between observed and predicted signal celerities result in locations with poor accuracy. Application of the empirical model improves both spatial localization precision and accuracy; all but one location estimates retain the true GT location within the 90 per cent confidence bounds. Average mislocation of the events is 15.49 km and average 90 per cent error ellipse areas are 4141 km2. The empirical model additionally reduces origin time residuals; origin time residuals from the other location models are in excess of 160 s while residuals produced with the empirical model are within 30 s of the true origin time. We demonstrate that event location accuracy is driven by a combination of signal propagation model and the azimuthal gap of detecting stations. A direct relationship between mislocation, error ellipse area and increased station azimuthal gaps indicate that for sparse networks, detection backazimuths may drive location biases over traveltime estimates.

58 GEOSCIENCES↗
DOE OSTI2023

Zero-truncated Poisson regression for sparse multiway count data corrupted by false zeros

Abstract We propose a novel statistical inference methodology for multiway count data that is corrupted by false zeros that are indistinguishable from true zero counts. Our approach consists of zero-truncating the Poisson distribution to neglect all zero values. This simple truncated approach dispenses with the need to distinguish between true and false zero counts and reduces the amount of data to be processed. Inference is accomplished via tensor completion that imposes low-rank tensor structure on the Poisson parameter space. Our main result shows that an $N$-way rank-$R$ parametric tensor $\boldsymbol{\mathscr{M}}\in (0,\infty )^{I\times \cdots \times I}$ generating Poisson observations can be accurately estimated by zero-truncated Poisson regression from approximately $IR^2\log _2^2(I)$ non-zero counts under the nonnegative canonical polyadic decomposition. Our result also quantifies the error made by zero-truncating the Poisson distribution when the parameter is uniformly bounded from below. Therefore, under a low-rank multiparameter model, we propose an implementable approach guaranteed to achieve accurate regression in under-determined scenarios with substantial corruption by false zeros. Several numerical experiments are presented to explore the theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Application of machine learning to estimate fireball characteristics and their uncertainty from infrared spectral data

Experiments or events involving high explosives (HE) can be monitored remotely by infrared (IR) sensors to gather information about the configuration or materials involved in the device. Researchers at the Air Force Institute of Technology (AFIT) developed a phenomenological model for HE fireball spectra in the IR range that allows for parameters to be extracted from Fourier transform infrared (FTIR) data. This model includes parameters tied to physical characteristics of the fireball: temperature, size, soot, and gas concentrations. Previous works have sought to recover these parameters by the fitting of either whole spectra or select wavenumber bands to this phenomenological model. Difficulties arise due to the complex relationships between the parameters to be fit. Uncertainty quantification of the estimated fireball parameters is also problematic since HE experiments do not have any ground truth information on the parameters. It is suggested that artificial neural network (ANN) based approaches may be well suited to this problem, because of their ability to capture complex and highly nonlinear relationships. As such, this work seeks to explore the efficacy of deep artificial neural networks (DNNs) for this problem of parameter recovery from spectra and to also investigate the uncertainty of recovering the fireball parameters from FTIR data. Networks are designed using the hyperparameter optimization tool Hyperopt and trained/tested on artificial data generated using the phenomenological model developed by AFIT. The results of applying the network to the artificial data set are compared to a physics-based band approach that uses a selected number of bands based on their physical properties. Information on the uncertainty of estimating parameters from remotely sensed experimental data is obtained by treating the accuracy of the DNN model on artificial data as an upper bound and by examining the impact of emissivity due to soot on parameter estimation error; the results for artificial data are likely to be optimistic as compared to recovering parameters from experimental data.

42 ENGINEERING↗
NASA NTRS1972

Possible variation of the gravitational constant over the elements.

We re-examine the theory and data of the Kreuzer experiment to measure the relative difference in the gravitational constant between two elements. Significant errors appear in the statistical analysis of Kreuzer which vitiate his conclusions. The upper bound for the relative difference of F and Br from his experimental data correctly becomes .02, about 10 times the limit already set on the general variation of the gravitational constant over the elements by direct use of a Cavendish balance.

Gilvarry, J. J.↗
NASA NTRS1993

Hubble Space Telescope characterized by using phase-retrieval algorithms

We describe several results characterizing the Hubble Space Telescope from measured point spread functions by using phase-retrieval algorithms. The Cramer-Rao lower bounds show that point spread functions taken well out of focus result in smaller errors when aberrations are estimated and that, for those images, photon noise is not a limiting factor. Reconstruction experiments with both simulated and real data show that the calculation of wave-front propagation by the retrieval algorithms must be performed with a multiple-plane propagation rather than a simple fast Fourier transform to ensure the high accuracy required. Pupil reconstruction was performed and indicates a misalignment of the optical axis of a camera relay telescope relative to the main telescope. After we accounted for measured spherical aberration in the relay telescope, our estimate of the conic constant of the primary mirror of the HST was - 1.0144.

Fienup, J. R.↗
NASA NTRS1993

Plans to improve the experimental limit in the comparison of the east-west and west-east one-way light propagation times on the rotating earth

The preceding paper describes the results so far (interrupted in the Spring of 1989 because of lack of funds) of an experiment comparing the one-way light propagation times on the surface of the rotating Earth. For the 20 Km path length component in the East-West direction the predicted difference between the opposite sense propagation times would be 160 ps, if the approximately 360 Km/s surface speed of the Earth gives effective light speeds of 3 x 10(exp 8) m/s +/- 360 m/s. This could lead to a prediction of the difference between the clock transport and the light pulse synchronization methods described in the preceding paper: delta(T) = 0.5 (160) = 80 ps. The current upper bound of approximately 100 ps for delta(T) is limited by poorly understood systematic errors. The most important seems to be intensity-dependent time delays in the remote light pulse avalanche photo-diode detector. This will be replaced by a continuously operating circular scan streak camera having single photon sensitivity and a time resolution of approximately 5 ps. (This camera has recently been developed by the Xian Institute of Optics and Precision Mechanics in the P.R.C.). Better isolation from shocks and vibration for the Sigma-Tau hydrogen maser during transport will be provided. It is hoped that delta(T) is less than 20 ps can be achieved.

Alley, C. O.↗
NASA NTRS2010

Performance Bounds on Two Concatenated, Interleaved Codes

A method has been developed of computing bounds on the performance of a code comprised of two linear binary codes generated by two encoders serially concatenated through an interleaver. Originally intended for use in evaluating the performances of some codes proposed for deep-space communication links, the method can also be used in evaluating the performances of short-block-length codes in other applications. The method applies, more specifically, to a communication system in which following processes take place: At the transmitter, the original binary information that one seeks to transmit is first processed by an encoder into an outer code (Co) characterized by, among other things, a pair of numbers (n,k), where n (n > k)is the total number of code bits associated with k information bits and n k bits are used for correcting or at least detecting errors. Next, the outer code is processed through either a block or a convolutional interleaver. In the block interleaver, the words of the outer code are processed in blocks of I words. In the convolutional interleaver, the interleaving operation is performed bit-wise in N rows with delays that are multiples of B bits. The output of the interleaver is processed through a second encoder to obtain an inner code (Ci) characterized by (ni,ki). The output of the inner code is transmitted over an additive-white-Gaussian- noise channel characterized by a symbol signal-to-noise ratio (SNR) Es/No and a bit SNR Eb/No. At the receiver, an inner decoder generates estimates of bits. Depending on whether a block or a convolutional interleaver is used at the transmitter, the sequence of estimated bits is processed through a block or a convolutional de-interleaver, respectively, to obtain estimates of code words. Then the estimates of the code words are processed through an outer decoder, which generates estimates of the original information along with flags indicating which estimates are presumed to be correct and which are found to be erroneous. From the perspective of the present method, the topic of major interest is the performance of the communication system as quantified in the word-error rate and the undetected-error rate as functions of the SNRs and the total latency of the interleaver and inner code. The method is embodied in equations that describe bounds on these functions. Throughout the derivation of the equations that embody the method, it is assumed that the decoder for the outer code corrects any error pattern of t or fewer errors, detects any error pattern of s or fewer errors, may detect some error patterns of more than s errors, and does not correct any patterns of more than t errors. Because a mathematically complete description of the equations that embody the method and of the derivation of the equations would greatly exceed the space available for this article, it must suffice to summarize by reporting that the derivation includes consideration of several complex issues, including relationships between latency and memory requirements for block and convolutional codes, burst error statistics, enumeration of error-event intersections, and effects of different interleaving depths. In a demonstration, the method was used to calculate bounds on the performances of several communication systems, each based on serial concatenation of a (63,56) expurgated Hamming code with a convolutional inner code through a convolutional interleaver. The bounds calculated by use of the method were compared with results of numerical simulations of performances of the systems to show the regions where the bounds are tight (see figure).

Moision, Bruce↗
DOE OSTI2024

Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

This paper analyzes a popular computational framework to solve infinite-dimensional Bayesian inverse problems, discretizing the prior and the forward model in a finite-dimensional weighted inner product space. We demonstrate the benefit of working on a weighted space by establishing operator-norm bounds for finite element and graph-based discretizations of Matérn-type priors and deconvolution forward models. For linear-Gaussian inverse problems, we develop a general theory to characterize the error in the approximation to the posterior. We also embed the computational framework into ensemble Kalman methods and MAP estimators for nonlinear inverse problems. Furthermore, our operator-norm bounds for prior discretizations guarantee the scalability and accuracy of these algorithms under mesh refinement.

Bayesian inverse problem↗
DOE OSTI2025

A moment-conserving discontinuous Galerkin representation of the relativistic Maxwellian distribution

Kinetic simulations of relativistic gases and plasmas are critical for understanding diverse astrophysical and terrestrial systems, but the accurate construction of the relativistic Maxwellian, the Maxwell–Jüttner distribution, on a discrete simulation grid is challenging. Difficulties arise from the finite velocity bounds of the domain, which may not capture the entire distribution function, as well as errors introduced by projecting the function onto a discrete grid. Here, we present a novel scheme for iteratively correcting the moments of the projected distribution applicable to all grid-based discretizations of the relativistic kinetic equation. In addition, we describe how to compute the needed nonlinear quantities, such as Lorentz boost factors, in a discontinuous Galerkin scheme through a combination of numerical quadrature and weak operations. The resulting method accurately captures the distribution function and ensures that the moments match the desired values to machine precision.

astrophysical plasmas↗
NASA NTRS1995

Uncertainties for two-dimensional models of solar rotation from helioseismic eigenfrequency splitting

Observed solar p-mode frequency splittings can be used to estimate angular velocity as a function of position in the solar interior. Formal uncertainties of such estimates depend on the method of estimation (e.g., least-squares), the distribution of errors in the observations, and the parameterization imposed on the angular velocity. We obtain lower bounds on the uncertainties that do not depend on the method of estimation; the bounds depend on an assumed parameterization, but the fact that they are lower bounds for the 'true' uncertainty does not. Ninety-five percent confidence intervals for estimates of the angular velocity from 1986 Big Bear Solar Observatory (BBSO) data, based on a 3659 element tensor-product cubic-spline parameterization, are everywhere wider than 120 nHz, and exceed 60,000 nHz near the core. When compared with estimates of the solar rotation, these bounds reveal that useful inferences based on pointwise estimates of the angular velocity using 1986 BBSO splitting data are not feasible over most of the Sun's volume. The discouraging size of the uncertainties is due principally to the fact that helioseismic measurements are insensitive to changes in the angular velocity at individual points, so estimates of point values based on splittings are extremely uncertain. Functionals that measure distributed 'smooth' properties are, in general, better constrained than estimates of the rotation at a point. For example, the uncertainties in estimated differences of average rotation between adjacent blocks of about 0.001 solar volumes across the base of the convective zone are much smaller, and one of several estimated differences we compute appears significant at the 95% level.

Genovese, Christopher R.↗
NASA NTRS2008

High-Order Energy Stable WENO Schemes

A new third-order Energy Stable Weighted Essentially NonOscillatory (ESWENO) finite difference scheme for scalar and vector linear hyperbolic equations with piecewise continuous initial conditions is developed. The new scheme is proven to be stable in the energy norm for both continuous and discontinuous solutions. In contrast to the existing high-resolution shock-capturing schemes, no assumption that the reconstruction should be total variation bounded (TVB) is explicitly required to prove stability of the new scheme. A rigorous truncation error analysis is presented showing that the accuracy of the 3rd-order ESWENO scheme is drastically improved if the tuning parameters of the weight functions satisfy certain criteria. Numerical results show that the new ESWENO scheme is stable and significantly outperforms the conventional third-order WENO finite difference scheme of Jiang and Shu in terms of accuracy, while providing essentially nonoscillatory solutions near strong discontinuities.

Yamaleev, Nail K.↗
NASA NTRS2013

Radio Science Measurements with Suppressed Carrier

Radio Science started when it became apparent with early Solar missions that occultations by planetary atmospheres would affect the quality of radio communications. Since then the atmospheric properties and other aspects of planetary science, solar science, and fundamental physics were studied by scientists. Radio Science data was always extracted from a received pure residual carrier (without data modulation). For some missions, it is very desirable to obtain Radio Science data from a suppressed carrier modulation. In this paper we propose a method to extract Radio Science data when a coded suppressed carrier modulation is used in deep space communications. Type of modulation can be BPSK, QPSK, OQPSK, MPSK or even GMSK. However we concentrate mostly on BPSK modulation. The proposed method for suppressed carrier simply tries to wipe out data that acts as an interference for Radio Science measurements. In order to measure the estimation errors in amplitude and phase of the Radio Science data we use Cramer-Rao bound (CRB). The CRB for the suppressed carrier modulation with non-ideal data wiping is then compared with residual carrier modulation under the same noise condition. The method of derivation of CRB for non-ideal data wiping is an innovative method that presented here. Some numerical results are provided for coded system.

Cramer-Rao bound↗
NASA NTRS2012

Achievable Precision for Optical Ranging Systems

Achievable RMS errors in estimating the phase, frequency, and intensity of a direct-detected intensity-modulated optical pulse train are presented. For each parameter, the Cramer-Rao-Bound (CRB) is derived and the performance of the Maximum Likelihood estimator is illustrated. Approximations to the CRBs are provided, enabling an intuitive understanding of estimator behavior as a function of the signaling parameters. The results are compared to achievable RMS errors in estimating the same parameters from a sinusoidal waveform in additive white Gaussian noise. This establishes a framework for a performance comparison of radio frequency (RF) and optical science. Comparisons are made using parameters for state-of-the-art deep-space RF and optical links. Degradations to the achievable errors due to clock phase noise and detector jitter are illustrated.

estimation theory↗
NASA NTRS1988

dc-free coset codes

A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where dc-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as those of linear block codes with only slight modifications. A special class of dc-free coset block codes are derived from BCH codes with specified bounds on minimum distance, disparity, and run length. The codes have low disparity levels (a small running digital sum) and good error-correcting capabilities.

Deng, Robert H.↗