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 901 records · Page 50

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Preparation of many-body states for quantum simulation

While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum states on a lattice in real space. In particular, the present algorithm is able to prepare general pure and mixed many-particle states of any number of particles. It relies on a procedure for converting from a second-quantized state to its first-quantized counterpart. The algorithm is efficient in that it operates in time that is polynomial in all the essential descriptors of the system, the number of particles, the resolution of the lattice, and the inverse of the maximum final error. This scaling holds under the assumption that the wave function to be prepared is bounded or its indefinite integral is known and that the Fock operator of the system is efficiently simulatable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhancing quantum clocks and sensors with randomization and decoherence

This letter shows how incoherent dynamics can lead to metrological advantages in quantum sensing. The results rely on the fact that incoherent dynamics lead to an additive contribution to the quantum Fisher information about time. Such an additive contribution can reduce the error of optimal estimation protocols, as implied by the quantum Cramér–Rao bound. I characterize regimes in which the estimation of a time interval or a frequency is enhanced by decoherence, thereby identifying cases in which incoherent dynamics serve as a metrological resource. The decoherence processes that yield enhanced precision of quantum sensors can be engineered by randomized Hamiltonian dynamics. I illustrate the results with protocols that display improved sensing of time intervals or global fields by qubit and photonic sensors. Enhanced precision of time intervals is achieved with Hamiltonians that include randomized global parameters. Enhanced precision in field estimation is obtained by randomized sensing times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimating Surface Radiation Fluxes in the Arctic from TOVS Brightness Temperatures

A new method for estimating downwelling shortwave and longwave radiation fluxes in the Arctic from TOVS brightness temperatures has been developed. The method employs a neural network to bypass computationally intensive inverse and for-ward radiative transfer calculations, Results from two drifting ice camps (CEAREX, LeadEx) and from one coastal station show that downwelling fluxes can be estimated with r.m.s. errors of 20 W/sq m for longwave radiation and 35 W/sq m for shortwave radiation. Mean errors are less than 4 W/sq m and are well within the bounds required for many climate process studies.

Schweiger, A. J.↗

Spacecraft Thermal and Optical Modeling Impacts on Estimation of the GRAIL Lunar Gravity Field

We summarize work performed involving thermo-optical modeling of the two Gravity Recovery And Interior Laboratory (GRAIL) spacecraft. We derived several reconciled spacecraft thermo-optical models having varying detail. We used the simplest in calculating SRP acceleration, and used the most detailed to calculate acceleration due to thermal re-radiation. For the latter, we used both the output of pre-launch finite-element-based thermal simulations and downlinked temperature sensor telemetry. The estimation process to recover the lunar gravity field utilizes both a nominal thermal re-radiation accleration history and an apriori error model derived from that plus an off-nominal history, which bounds parameter uncertainties as informed by sensitivity studies.

thermal modeling↗

Poster error probability in the Mu-11 Sequential Ranging System

An expression is derived for the posterior error probability in the Mu-2 Sequential Ranging System. An algorithm is developed which closely bounds the exact answer and can be implemented in the machine software. A computer simulation is provided to illustrate the improved level of confidence in a ranging acquisition using this figure of merit as compared to that using only the prior probabilities. In a simulation of 20,000 acquisitions with an experimentally determined threshold setting, the algorithm detected 90% of the actual errors and made false indication of errors on 0.2% of the acquisitions.

Coyle, C. W.↗

Distribution-Agnostic Stochastic Optimal Power Flow for Distribution Grids

This paper outlines a data-driven, distributionally robust approach to solve chance-constrained AC optimal power flow problems in distribution networks. Uncertain forecasts for loads and power generated by photovoltaic (PV) systems are considered, with the goal of minimizing PV curtailment while meeting power flow and voltage regulation constraints. A data- driven approach is utilized to develop a distributionally robust conservative convex approximation of the chance-constraints; particularly, the mean and covariance matrix of the forecast errors are updated online, and leveraged to enforce voltage regulation with predetermined probability via Chebyshev-based bounds. By combining an accurate linear approximation of the AC power flow equations with the distributionally robust chance constraint reformulation, the resulting optimization problem becomes convex and computationally tractable.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On the time growth of the error of the DG method for advective problems

Abstract In this paper we derive a priori $L^{\infty }(L^{2})$ and L2(L2) error estimates for a linear advection–reaction equation with inlet and outlet boundary conditions. The goal is to derive error estimates for the discontinuous Galerkin method that do not blow up exponentially with respect to time, unlike the usual case when Gronwall’s inequality is used. While this is possible in special cases, such as divergence-free advection fields, we take a more general approach using exponential scaling of the exact and discrete solutions. Here we use a special scaling function, which corresponds to time taken along individual pathlines of the flow. For advection fields, where the time that massless particles carried by the flow spend inside the spatial domain is uniformly bounded from above by some $\widehat{T}$, we derive $\mathcal{O}$(hp+1/2) error estimates where the constant factor depends only on $\widehat{T}$, but not on the final time T. This can be interpreted as applying Gronwall’s inequality in the error analysis along individual pathlines (Lagrangian setting), instead of physical time (Eulerian setting).

Mathematics↗

Improved Regional and TeleseismicP-Wave Travel-Time Prediction and Event Location Using a Global 3D Velocity Model

A global validation dataset of 116 seismic events and 20,977 associated Pn and P arrivals is used to assess travel-time prediction and event location accuracy for the global-scale, 3D, P-wave velocity model called LLNL-G3Dv3 (Simmons et al., 2012). Strong regional trends that are observed for ak135 travel-time residuals are largely removed when LLNL-G3Dv3 is used for prediction. The 25th–75th quantile spread of travel-time residuals is reduced by 30%–40% at teleseismic distances, and the spread is reduced by ~60% at regional distances (<16°). Epicenter error decreases when more data are used to constrain event locations until more than ~40 arrivals times are used. At which point, epicenter error reduction tends to plateau. Median epicenter errors for the ak135 and LLNL-G3Dv3 models plateau at ~8:0 and ~5:5 km, respectively, for teleseismic P datasets. Median epicenter errors for the ak135 and LLNL-G3Dv3 models plateau at ~12:0 and ~4:0 km, respectively, for regional Pn datasets. We demonstrate that spatially correlated travel-time residual errors for the ak135 model lead to increasing epicenter error when ~40 to ~100 Pn arrivals are used to constrain the location. The effect of correlated error is mitigated by LLNL-G3Dv3, for which epicenter error steadily decreases to ~4 km when 100 Pn arrivals are used. The median area of 0.95 epicenter probability bounds for ak135 and LLNL-G3Dv3 are 1811 and 758 km 2 , respectively. The ak135 ellipses are inflated to achieve the desired rate of true events occurring inside the probability region, whereas LLNLG3Dv3 error ellipses based on empirical residual distributions cover the true location at the expected rate because location bias is minimal.

58 GEOSCIENCES↗

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗

Trajectory Specification for High-Capacity Air Traffic Control

In the current air traffic management system, the fundamental limitation on airspace capacity is the cognitive ability of human air traffic controllers to maintain safe separation with high reliability. The doubling or tripling of airspace capacity that will be needed over the next couple of decades will require that tactical separation be at least partially automated. Standardized conflict-free four-dimensional trajectory assignment will be needed to accomplish that objective. A trajectory specification format based on the Extensible Markup Language is proposed for that purpose. This format can be used to downlink a trajectory request, which can then be checked on the ground for conflicts and approved or modified, if necessary, then uplinked as the assigned trajectory. The horizontal path is specified as a series of geodetic waypoints connected by great circles, and the great-circle segments are connected by turns of specified radius. Vertical profiles for climb and descent are specified as low-order polynomial functions of along-track position, which is itself specified as a function of time. Flight technical error tolerances in the along-track, cross-track, and vertical axes define a bounding space around the reference trajectory, and conformance will guarantee the required separation for a period of time known as the conflict time horizon. An important safety benefit of this regimen is that the traffic will be able to fly free of conflicts for at least several minutes even if all ground systems and the entire communication infrastructure fail. Periodic updates in the along-track axis will adjust for errors in the predicted along-track winds.

Paielli, Russell A.↗

Diagnostics of Mixed-State Topological Order and Breakdown of Quantum Memory

Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed states describing corrupted memories. Here we provide an intrinsic characterization of the breakdown of topological quantum memory, which both gives a bound on the performance of decoding algorithms and provides examples of topologically distinct mixed states. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order, and serve as a definition for topological order in error-corrupted mixed states. We consider the topological contribution to entanglement negativity and two other metrics based on quantum relative entropy and coherent information. In the concrete example of the two-dimensional (2D) Toric code with local bit-flip and phase errors, we map three quantities to observables in 2D classical spin models and analytically show they all undergo a transition at the same error threshold. This threshold is an upper bound on that achieved in any decoding algorithm and is indeed saturated by that in the optimal decoding algorithm for the Toric code. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A trust-region algorithm for the optimization of PSA processes using reduced-order modeling

The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA); the applications range from bulk separations to trace contaminant removal. PSA processes are based on solid-gas equilibrium and operate under periodic transient conditions [1]. Bed models for these processes are therefore defined by coupled nonlinear partial differential and algebraic equations (PDAEs) distributed in space and time with periodic boundary conditions that connect the processing steps together and high nonlinearities arising from non-isothermal effects and nonlinear adsorption isotherms. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current nonlinear programming algorithms. Model reduction is a powerful methodology that permits systematic generation of cost-efficient low-order representations of large-scale systems that result from discretization of such PDAEs. In particular, low-dimensional approximations can be obtained from reduced order modeling (ROM) techniques based on proper orthogonal decomposition (POD) and can be used as surrogate models in the optimization problems. In this approach, a representative ensemble of solutions of the dynamic PDAE system is constructed by solving a higher-order discretization of the model using the method of lines, followed by the application of Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes). These modes are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDAE system. This approach leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally efficient [2]. The ROM methodology has been successfully applied to a 2-bed 4-step PSA process used for separating a hydrogen-methane mixture in [3]. The reduced order model developed was successfully used to optimize this process to maximize hydrogen recovery within a trust-region. We extend this approach in this work to develop a rigorous trust-region algorithm for ROM-based optimization of PSA processes. The trust-region update rules and sufficient decrease condition for the objective is used to determine the size of the trust-region. Based on the decrease in the objective function and error in the ROM, a ROM updation strategy is designed [4, 5]. The inequalities and bounds are handled in the algorithm using exact penalty formulation, and a non-smooth trust-region algorithm by Conn et al. [6] is used to handle non-differentiability. To ensure that the first order consistency condition is met and the optimum obtained from ROM-based optimization corresponds to the optimum of the original problem, a scaling function, such as one proposed by Alexandrov et al. [7], is incorporated in the objective function. Such error control mechanism is also capable of handling numerical inconsistencies such as unphysical oscillations in the state variable profiles. The proposed methodology is applied to optimize a PSA process to concentrate CO{sub 2} from a nitrogen-carbon dioxide mixture. As in [3], separate ROMs are developed for each operating step with different POD modes for each state variable. Numerical results will be presented for optimization case studies which involve maximizing CO{sub 2} recovery, feed throughput or minimizing overall power consumption.

97 MATHEMATICS AND COMPUTING↗

Error analysis of bent ray radio occultation measurments

There are two types of experimental measurement errors of the Doppler data associated with the radio occultation, random and systematic. Random errors are due to thermal noise in the transmission channel, and the phase lock loop, and quantization error in the digital circuitry. These are called noise type errors. The systematic errors are due to geometric uncertainty and equipment phase instability. Considered is the amount of uncertainty, due to random measurement errors, in the refractivity profiles reconstructed by this type of indirect sensing experiment. A class of refractivity profiles is defined which approximately fit the set of measured data. Bounds are placed on the extent of this class of solution profiles. To accomplish this, the sensivity of the reconstructed refractivity profiles to errors in the measured quantity and the statistics of the errors in the measurement are examined.

Saintgermain, R. L.↗

Free distance bounds for convolutional codes

The best asymptotic bounds presently known on free distance for convolutional codes are presented from a unified point of view. Upper and lower bounds for both time-varying and fixed codes are obtained. A comparison is made between bounds for nonsystematic and systematic codes which shows that more free distance is available with nonsystematic codes. This result is important when selecting codes for use with sequential or maximum-likelihood (Viterbi) decoding since the probability of decoding error is closely related to the free distance of the code. An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.

Costello, D. J., Jr.↗

An Upper Bound on High Speed Satellite Collision Probability When Only One Object has Position Uncertainty Information

Upper bounds on high speed satellite collision probability, PC †, have been investigated. Previous methods assume an individual position error covariance matrix is available for each object. The two matrices being combined into a single, relative position error covariance matrix. Components of the combined error covariance are then varied to obtain a maximum PC. If error covariance information for only one of the two objects was available, either some default shape has been used or nothing could be done. An alternative is presented that uses the known covariance information along with a critical value of the missing covariance to obtain an approximate but potentially useful Pc upper bound.

Frisbee, Joseph H., Jr.↗