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 415 records · Page 23

Safe Tracking Control of an Uncertain Euler-Lagrange System with Full-State Constraints using Barrier Functions

This paper presents a novel, safe tracking control design method that learns the parameters of an uncertain Euler-Lagrange (EL) system online using adaptive learning laws. A barrier function (BF) is first used to transform the full-state constrained EL-dynamics into an equivalent unconstrained dynamics. An adaptive tracking controller is then developed along with the parameter update law in the transformed state space such that the states remain bounded for all time within a prescribed bound. A stability analysis is developed that considers the EL-dynamics’ uncertainty, yielding a semi-globally uniformly ultimately bounded (SGUUB) tracking error and the parameter estimation error. The controller design is validated in simulations using a two-link planar manipulator. The results show the proposed method’s ability to track the reference trajectory while remaining inside each of the predefined state bounds.

Robots↗

Closed-loop stability of linear quadratic optimal systems in the presence of modeling errors

The well-known stabilizing property of linear quadratic state feedback design is utilized to evaluate the robustness of a linear quadratic feedback design in the presence of modeling errors. Two general conditions are obtained for allowable modeling errors such that the resulting closed-loop system remains stable. One of these conditions is applied to obtain two more particular conditions which are readily applicable to practical situations where a designer has information on the bounds of modeling errors. Relations are established between the allowable parameter uncertainty and the weighting matrices of the quadratic performance index, thereby enabling the designer to select appropriate weighting matrices to attain a robust feedback design.

Toda, M.↗

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

Group-theoretic error mitigation enabled by classical shadows and symmetries

Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows , by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

Zhao, Andrew (ORCID:0000000202990277)↗

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↗

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.

Meyer, C. D., Jr.↗

Effect of model uncertainty on failure detection - The threshold selector

The performance of all failure detection, isolation, and accomodation (DIA) algorithms is influenced by the presence of model uncertainty. A unique framework is presented to incorporate a knowledge of modeling error in the analysis and design of failure detection systems. The tools being used are very similar to those in robust control theory. A concept is introduced called the threshold selector, which is a nonlinear inequality whose solution defines the set of detectable sensor failure signals. The threshold selector represents an innovative tool for analysis and synthesis of DIA algorithms. It identifies the optimal threshold to be used in innovations-based DIA algorithms. The optimal threshold is shown to be a function of the bound on modeling errors, the noise properties, the speed of DIA filters, and the classes of reference and failure signals. The size of the smallest detectable failure is also determined. The results are applied to a multivariable turbofan jet engine example, which demonstrates improvements compared to previous studies.

Emami-Naeini, Abbas↗

Computer search for binary cyclic UEP codes of odd length up to 65

Using an exhaustive computation, the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances at least 3 are found. For those codes that can only have upper bounds on their unequal error protection capabilities computed, an analytic method developed by Dynkin and Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.

Lin, Mao-Chao↗

Cabauw Experimental Results from the Project for Intercomparison of Land-Surface Parameterization Schemes

In the Project for Intercomparison of Land-Surface Parameterization Schemes phase 2a experiment, meteorological data for the year 1987 from Cabauw, the Netherlands, were used as inputs to 23 land-surface flux schemes designed for use in climate and weather models. Schemes were evaluated by comparing their outputs with long-term measurements of surface sensible heat fluxes into the atmosphere and the ground, and of upward longwave radiation and total net radiative fluxes, and also comparing them with latent heat fluxes derived from a surface energy balance. Tuning of schemes by use of the observed flux data was not permitted. On an annual basis, the predicted surface radiative temperature exhibits a range of 2 K across schemes, consistent with the range of about 10 W/m in predicted surface net radiation. Most modeled values of monthly net radiation differ from the observations by less than the estimated maximum monthly observational error (+/- 10 W/sq m). However, modeled radiative surface temperature appears to have a systematic positive bias in most schemes; this might be explained by an error in assumed emissivity and by models' neglect of canopy thermal heterogeneity. Annual means of sensible and latent heat fluxes, into which net radiation is partitioned, have ranges across schemes of 30 W/sq m and 25 W/sq m, respectively. Annual totals of evapotranspiration and runoff, into which the precipitation is partitioned, both have ranges of 315 mm. These ranges in annual heat and water fluxes were approximately halved upon exclusion of the three schemes that have no stomatal resistance under non-water-stressed conditions. Many schemes tend to underestimate latent heat flux and overestimate sensible heat flux in summer, with a reverse tendency in winter. For six schemes, root-mean-square deviations of predictions from monthly observations are less than the estimated upper bounds on observation errors (5 W/m for sensible beat flux and 10 W/m for latent heat flux). Actual runoff at the site is believed to be dominated by vertical drainage to ground water, but several schemes produced significant amounts of runoff as overland flow or interflow. There is a range across schemes of 184 mm (40% of total pore volume) in the simulated annual mean root-zone soil moisture. Unfortunately, no measurements of soil moisture were available for model evaluation. A theoretical analysis suggested that differences in boundary conditions used in various schemes are not sufficient to explain the large variance in soil moisture. However, many of the extreme values of soil moisture could be explained in terms of the particulars of experimental setup or excessive evapotranspiration.

Chen, Tian Hong↗

Conical-Domain Model for Estimating GPS Ionospheric Delays

The conical-domain model is a computational model, now undergoing development, for estimating ionospheric delays of Global Positioning System (GPS) signals. Relative to the standard ionospheric delay model described below, the conical-domain model offers improved accuracy. In the absence of selective availability, the ionosphere is the largest source of error for single-frequency users of GPS. Because ionospheric signal delays contribute to errors in GPS position and time measurements, satellite-based augmentation systems (SBASs) have been designed to estimate these delays and broadcast corrections. Several national and international SBASs are currently in various stages of development to enhance the integrity and accuracy of GPS measurements for airline navigation. In the Wide Area Augmentation System (WAAS) of the United States, slant ionospheric delay errors and confidence bounds are derived from estimates of vertical ionospheric delay modeled on a grid at regularly spaced intervals of latitude and longitude. The estimate of vertical delay at each ionospheric grid point (IGP) is calculated from a planar fit of neighboring slant delay measurements, projected to vertical using a standard, thin-shell model of the ionosphere. Interpolation on the WAAS grid enables estimation of the vertical delay at the ionospheric pierce point (IPP) corresponding to any arbitrary measurement of a user. (The IPP of a given user s measurement is the point where the GPS signal ray path intersects a reference ionospheric height.) The product of the interpolated value and the user s thin-shell obliquity factor provides an estimate of the user s ionospheric slant delay. Two types of error that restrict the accuracy of the thin-shell model are absent in the conical domain model: (1) error due to the implicit assumption that the electron density is independent of the azimuthal angle at the IPP and (2) error arising from the slant-to-vertical conversion. At low latitudes or at mid-latitudes under disturbed conditions, the accuracy of SBAS systems based upon the thin-shell model suffers due to the presence of complex ionospheric structure, high delay values, and large electron density gradients. Interpolation on the vertical delay grid serves as an additional source of delay error. The conical-domain model permits direct computation of the user s slant delay estimate without the intervening use of a vertical delay grid. The key is to restrict each fit of GPS measurements to a spatial domain encompassing signals from only one satellite. The conical domain model is so named because each fit involves a group of GPS receivers that all receive signals from the same GPS satellite (see figure); the receiver and satellite positions define a cone, the satellite position being the vertex. A user within a given cone evaluates the delay to the satellite directly, using (1) the IPP coordinates of the line of sight to the satellite and (2) broadcast fit parameters associated with the cone. The conical-domain model partly resembles the thin-shell model in that both models reduce an inherently four-dimensional problem to two dimensions. However, unlike the thin-shell model, the conical domain model does not involve any potentially erroneous simplifying assumptions about the structure of the ionosphere. In the conical domain model, the initially four-dimensional problem becomes truly two-dimensional in the sense that once a satellite location has been specified, any signal path emanating from a satellite can be identified by only two coordinates; for example, the IPP coordinates. As a consequence, a user s slant-delay estimate converges to the correct value in the limit that the receivers converge to the user s location (or, equivalently, in the limit that the measurement IPPs converge to the user s IPP).

Sparks, Lawrence↗

Achieving unequal error protection with convolutional codes

This paper examines the unequal error protection capabilities of convolutional codes. Both time-invariant and periodically time-varying convolutional encoders are examined. The effective free distance vector is defined and is shown to be useful in determining the unequal error protection (UEP) capabilities of convolutional codes. A modified transfer function is used to determine an upper bound on the bit error probabilities for individual input bit positions in a convolutional encoder. The bound is heavily dependent on the individual effective free distance of the input bit position. A bound relating two individual effective free distances is presented. The bound is a useful tool in determining the maximum possible disparity in individual effective free distances of encoders of specified rate and memory distribution. The unequal error protection capabilities of convolutional encoders of several rates and memory distributions are determined and discussed.

Mills, D. G.↗

Comparison of Aircraft Models and Integration Schemes for Interval Management in the TRACON

Reusable models of common elements for communication, computation, decision and control in air traffic management are necessary in order to enable simulation, analysis and assurance of emergent properties, such as safety and stability, for a given operational concept. Uncertainties due to faults, such as dropped messages, along with non-linearities and sensor noise are an integral part of these models, and impact emergent system behavior. Flight control algorithms designed using a linearized version of the flight mechanics will exhibit error due to model uncertainty, and may not be stable outside a neighborhood of the given point of linearization. Moreover, the communication mechanism by which the sensed state of an aircraft is fed back to a flight control system (such as an ADS-B message) impacts the overall system behavior; both due to sensor noise as well as dropped messages (vacant samples). Additionally simulation of the flight controller system can exhibit further numerical instability, due to selection of the integration scheme and approximations made in the flight dynamics. We examine the theoretical and numerical stability of a speed controller under the Euler and Runge-Kutta schemes of integration, for the Maintain phase for a Mid-Term (2035-2045) Interval Management (IM) Operational Concept for descent and landing operations. We model uncertainties in communication due to missed ADS-B messages by vacant samples in the integration schemes, and compare the emergent behavior of the system, in terms of stability, via the boundedness of the final system state. Any bound on the errors incurred by these uncertainties will play an essential part in a composable assurance argument required for real-time, flight-deck guidance and control systems,. Thus, we believe that the creation of reusable models, which possess property guarantees, such as safety and stability, is an innovative and essential requirement to assessing the emergent properties of novel airspace concepts of operation.

Neogi, Natasha↗

Bounding filters in the presence of inexactly known parameters.

Optimum bounding filters are derived for a specific version (steady state time-invariant with scalar observations) of the Kalman-Bucy filtering problem with inexactly known system parameters and for the Wiener filtering problem with inexactly known spectral densities. The designed filter obtains a bound on the actual error covariance which is not known, and it also prevents apparent divergence. Conditions are derived for the design of the optimum bounding filter within a permissible class of solutions; this turns out to be the min-max mean-square error filter for an extended class of solutions. The bounding filter can be of lower order than the original system, and a technique is devised for reducing the order of the filtering system and concurrently obtaining a figure of merit for its performance.

Nahi, N. E.↗

A Real-Time Optimization with Warm-Start of Multiperiod AC Optimal Power Flows

We present a real-time optimization strategy based on warm-start for solving a moving horizon of multi period AC optimal power flow (ACOPF) problems. In each horizon, ACOPFs are temporally interlinked via generator ramp constraints, and we assume that each horizon needs to be solved every few seconds or minutes. We introduce two approximate tracking schemes that closely follow a solution path consisting of strongly regular points. We present theoretical results bounding the tracking error by the square of the parameter changes between time periods. Experimental results for networks of sizes up to 9K buses show a fast computation time while maintaining a good solution quality, thus making our approach well suited for real-time circumstances.

moving horizon↗

A mathematical framework for ejecta cloud dynamics with application to source models and piezoelectric mass measurements

We present a mathematical framework for describing the dynamical evolution of an ejecta cloud generated by a generic ejecta source model. We consider a piezoelectric sensor fielded in the path of an ejecta cloud, for experimental configurations in which the ejecta are created at a singly shocked planar surface and fly ballistically through vacuum to the stationary sensor. To do so, we introduce the concept of a time- and velocity-dependent ejecta “areal mass function.” We derive expressions for the analytic (“true”) accumulated ejecta areal mass at the sensor and the measured (“inferred”) value obtained via the standard method for analyzing piezoelectric voltages. In this way, we derive an exact expression and upper bound for the error imposed upon a piezoelectric ejecta mass measurement (in a perfect system) by the assumption of instantaneous creation, which is commonly required for momentum diagnostic analyses. This error term is zero for truly instantaneous source models; otherwise, the standard piezoelectric analysis is guaranteed to overestimate the true mass. When combined with a piezoelectric dataset, this framework provides a unique solution for the ejecta particle velocity distribution, subject to the assumptions inherent in the data analysis. The framework also leads to strong boundary conditions that any ejecta source model must satisfy in order to be consistent with apparently global properties of piezoelectric measurements from a wide range of experiments. We demonstrate this methodology by applying it to the Richtmyer–Meshkov instability+self-similar velocity distribution ejecta source model currently under development at Los Alamos National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Ancilla-free continuous-variable SWAP test

We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the computational basis measurement is replaced by photon number-resolving measurement, and we calculate an upper bound on the error of the overlap estimate obtained from a finite Fock cutoff in the detector. As an example, we show that estimation of the overlap of pure, centered, single-mode Gaussian states of energy E and squeezed in opposite quadratures can be obtained to error ϵ using photon statistics below a Fock basis cutoff O(Elnϵ –1 ). This cutoff is greatly reduced to E + O(√ Elnϵ –1 ) when the states have rapidly decaying Fock tails, such as coherent states. We show how the ancilla-free CV SWAP test can be extended to many modes and applied to quantum algorithms such as variational compiling and entanglement spectroscopy in the CV setting. For the latter we also provide a new algorithm which does not have an analog in qubit systems. The ancilla-free CV SWAP test is implemented on Xanadu's 8-mode photonic processor in order to estimate the vacuum probability of a two-mode squeezed state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗