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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
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.↗
NASA NTRS1985

Convex Interpolating Splines of Arbitrary Degree

Shape preserving approximations are constructed by interpolating the data with polynomial splines of arbitrary degree. A regularity condition is formulated on the data which insures the existence of such a shape preserving spline, an algorithm is presented for its construction, and the uniform norm of the error is bound which results when the algorithm is used to produce an approximation to a given f epsilon Ca,b.

Neuman, E.↗
NASA NTRS1986

Stability regions for multiloop LQ-regulated systems with state estimators

This note investigates the closed-loop stability of linear, time-invariant systems controlled by linear-quadratic-Gaussian (LQG) type controllers, when the actuators have nonlinearities. The nonlinearities N(sigma) are assumed to violate the standard LQ robustness condition either for values of sigma away from sigma = 0, or in a neighborhood of sigma = 0. The cases with an exponentially stable state estimator, and an estimator with ultimately bounded estimation error are considered, and expressions are obtained for the regions of attraction and ultimate boundedness.

Joshi, S. M.↗
NASA NTRS1987

Simple robust control laws for robot manipulators. Part 1: Non-adaptive case

A new class of exponentially stabilizing control laws for joint level control of robot arms is introduced. It has been recently recognized that the nonlinear dynamics associated with robotic manipulators have certain inherent passivity properties. More specifically, the derivation of the robotic dynamic equations from the Hamilton's principle gives rise to natural Lyapunov functions for control design based on total energy considerations. Through a slight modification of the energy Lyapunov function and the use of a convenient lemma to handle third order terms in the Lyapunov function derivatives, closed loop exponential stability for both the set point and tracking control problem is demonstrated. The exponential convergence property also leads to robustness with respect to frictions, bounded modeling errors and instrument noise. In one new design, the nonlinear terms are decoupled from real-time measurements which completely removes the requirement for on-line computation of nonlinear terms in the controller implementation. In general, the new class of control laws offers alternatives to the more conventional computed torque method, providing tradeoffs between robustness, computation and convergence properties. Furthermore, these control laws have the unique feature that they can be adapted in a very simple fashion to achieve asymptotically stable adaptive control.

Wen, J. T.↗