Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error bounds”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Distributionally Safe Path Planning: Wasserstein Safe RRT

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

42 ENGINEERING↗
NASA NTRS1995

Equalization and detection for digital communication over nonlinear bandlimited satellite communication channels

This dissertation evaluates receiver-based methods for mitigating the effects due to nonlinear bandlimited signal distortion present in high data rate satellite channels. The effects of the nonlinear bandlimited distortion is illustrated for digitally modulated signals. A lucid development of the low-pass Volterra discrete time model for a nonlinear communication channel is presented. In addition, finite-state machine models are explicitly developed for a nonlinear bandlimited satellite channel. A nonlinear fixed equalizer based on Volterra series has previously been studied for compensation of noiseless signal distortion due to a nonlinear satellite channel. This dissertation studies adaptive Volterra equalizers on a downlink-limited nonlinear bandlimited satellite channel. We employ as figure of merits performance in the mean-square error and probability of error senses. In addition, a receiver consisting of a fractionally-spaced equalizer (FSE) followed by a Volterra equalizer (FSE-Volterra) is found to give improvement beyond that gained by the Volterra equalizer. Significant probability of error performance improvement is found for multilevel modulation schemes. Also, it is found that probability of error improvement is more significant for modulation schemes, constant amplitude and multilevel, which require higher signal to noise ratios (i.e., higher modulation orders) for reliable operation. The maximum likelihood sequence detection (MLSD) receiver for a nonlinear satellite channel, a bank of matched filters followed by a Viterbi detector, serves as a probability of error lower bound for the Volterra and FSE-Volterra equalizers. However, this receiver has not been evaluated for a specific satellite channel. In this work, an MLSD receiver is evaluated for a specific downlink-limited satellite channel. Because of the bank of matched filters, the MLSD receiver may be high in complexity. Consequently, the probability of error performance of a more practical suboptimal MLSD receiver, requiring only a single receive filter, is evaluated.

Gutierrez, Alberto, Jr.↗
DOE OSTI2020

A cancellation problem in hybrid particle-in-cell schemes due to finite particle size

The quasi-neutral hybrid particle-in-cell algorithm with kinetic ions and fluid electrons is a popular model to study multi-scale problems in laboratory, space, and astrophysical plasmas. Here, it is shown that the different spatial discretizations of ions as finite-spatial-size particles and electrons as a grid-based fluid can lead to significant numerical wave dispersion errors in the long wavelength limit (kd i «1, where k is the wavenumber and di is the ion skin-depth). The problem occurs when high-order particle-grid interpolations, or grid-based smoothing, spreads the electric field experienced by the ions across multiple spatial cells and leads to inexact cancellation of electric field terms in the total (ion + electron) momentum equation. Practical requirements on the mesh spacing Δx/d i are suggested to bound these errors from above. The accuracy impact of not respecting these resolution constraints is shown for a non-linear shock problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1987

Order reduction in linear state estimation under performance constraints

The design and analysis of minimal-order state estimators for possibly time-varying linear systems, under constraints on the maximal allowable mean-square error, are considered. A global lower bound on the optimal error is derived, along with a lower bound on the minimal estimator order, needed for meeting the performance constraint. The ideal reduced-order estimator which satisfies the lower bound is derived, along with conditions for its realizability. When the ideal estimator is not realizable, its structure forms a suboptimal estimator, which maintains, in some sense, a local optimality property and is called the pseudoideal estimator. The mean-square error of the pseudoideal estimator defines upper bounds on the optimal error and on the estimator order needed for meeting the performance constraint. The lower and the upper bounds on the order define a reduced search set for the design problem. When the distance between the ideal and the pseudoideal estimators is sufficiently small in a certain numerical sense, the pseudoideal estimator may be considered optimal for practical purposes.

Baram, Yoram↗
DOE OSTI2024

Dynamical simulation via quantum machine learning with provable generalization

Much attention has been paid to dynamical simulation and quantum machine learning (QML) independently as applications for quantum advantage, while the possibility of using QML to enhance dynamical simulations has not been thoroughly investigated. Here we develop a framework for using QML methods to simulate quantum dynamics on near-term quantum hardware. We use generalization bounds, which bound the error a machine learning model makes on unseen data, to rigorously analyze the training data requirements of an algorithm within this framework. Our algorithm is thus resource efficient in terms of qubit and data requirements. Furthermore, our preliminary numerics for the XY model exhibit efficient scaling with problem size, and we simulate 20 times longer than Trotterization on IBMQ-Bogota. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Multilevel Conditional Disturbance Rejection Control for Satellite Attitude Tracking

Recently, the conditional disturbance rejection controller (CDRC) was proposed to improve control performance by leveraging disturbances that have beneficial effects on the system. However, it only considers disturbances acting on the state variable directly influenced by them. Although fast convergence of this state can be achieved with the CDRC, it may unintentionally affect the convergence of the output (i.e., the primary state). Here, in this article, a multilevel CDRC is proposed to enhance satellite attitude control performance by accounting for the effect of disturbances on both attitude (output) and angular velocity. The extended state observer is employed to estimate the lumped disturbance, including the modeling errors and external disturbances. Then, a backstepping-based controller with the multilevel disturbance rejection law (ML-DRL) is designed for attitude tracking. The ML-DRL is developed to improve the control performance by using a disturbance with a damping effect on both attitude and velocity. Faster convergence of attitude and velocity can be achieved by conditionally compensating for the disturbance. The stability of the proposed control method is analyzed by demonstrating that the errors are bounded as time tends to infinity. The attitude control performance of the proposed method is evaluated through numerical examples conducted using the MATLAB/Simulink Multibody tool.

Active disturbance rejection control (ADRC)↗
DOE OSTI2025

What to Support When You’re Compressing

Over the last nearly 20 years, lossy compression has become an essential aspect of HPC applications’ data pipelines, allowing them to overcome limitations in storage capacity and bandwidth and, in some cases, increase computational throughput and capacity. However, with the adoption of lossy compression comes the requirement to assess and control the impact lossy compression has on scientific outcomes. In this work, we take a major step forward in describing the state of practice and by characterizing workloads. We examine applications’ needs and compressors’ capabilities across 9 different supercomputing application domains. We present 24 takeaways that provide best practices for applications, operational impacts for facilities achieving compressed data, and gaps in application needs not addressed by production compressors that point towards opportunities for future compression research.

Error-Bounded Lossy Compression↗
DOE OSTI2022

Update on Covariance Data Testing Strategy at LANL [Slides]

LANL is working towards an ENDF/B-VIII.0-based Covariance Library, with several key goals and work processes outlined. This includes processing through NJOY’s ERRORR module, identifying and correcting mathematical and physical deficiencies, communicating across pipeline from evaluator to end user, understanding use cases and interpreting results, and releasing to customers. Their testing approach includes interaction, processing, checks (mathematical properties, constraints, and physical bounds), and error propagation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

A computer program to calculate zeroes, extrema, and interval integrals for the associated Legendre functions

A computer program is described for the calculation of the zeroes of the associated Legendre functions, Pnm, and their derivatives, for the calculation of the extrema of Pnm and also the integral between pairs of successive zeroes. The program has been run for all n,m from (0,0) to (20,20) and selected cases beyond that for n up to 40. Up to (20,20), the program (written in double precision) retains nearly full accuracy, and indications are that up to (40,40) there is still sufficient precision (4-5 decimal digits for a 54-bit mantissa) for estimation of various bounds and errors involved in geopotential modelling, the purpose for which the program was written.

Payne, M. H.↗
NASA NTRS1974

A study to determine the usefulness of interval analysis in solving problems in celestial mechanics

This investigation was undertaken to determine the usefulness of interval analysis to numerical integration and matrix inversion techniques and to combine these results to determine the value of interval analysis in bounding computational errors in the two-body problem. Conclusions were that interval analysis may be worthwhile in certain small scale isolated problems, but its usefulness in any large scale problem is doubtful.

Walling, D.↗
NASA NTRS1979

Coding for optical channels with photon-counting

The problem of coding for Pierce's recent model for optical communications is studied. It was concluded that for any positive rate rho (measured in nats per photon), the best code of length n has an error probability bounded by an exponentially decaying function of n. Explicit practical schemes are shown for rho less than or = to 1; and evidence is given that rho approximating 1 may be the practical limit for optical communication.

Mceliece, R. J.↗
NASA NTRS1981

Trellis phase codes for power-bandwith efficient satellite communications

Support work on improved power and spectrum utilization on digital satellite channels was performed. Specific attention is given to the class of signalling schemes known as continuous phase modulation (CPM). The specific work described in this report addresses: analytical bounds on error probability for multi-h phase codes, power and bandwidth characterization of 4-ary multi-h codes, and initial results of channel simulation to assess the impact of band limiting filters and nonlinear amplifiers on CPM performance.

Wilson, S. G.↗