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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A mesoscopic link-transmission-model able to track individual vehicles

Macroscopic traffic flow is a common choice for large-scale traffic simulations. These models do not provide individual-specific metrics as outputs. However, this treatment is necessary in agent-based-models, as in, for example, assigning routes based on personal characteristics. Here, in this paper, we propose an extension of the link-transmission-model, an efficient and yet accurate discretization of the Lighthill-Whitham-Richards (LWR) model, which allow vehicles to be tracked individually while keeping the main features of the underlying model. The extension comprises modifying the link and node models to ensure that the flow between links is always at discrete levels. Therefore, every unit of flow is associated with one individual vehicle moving from its current to its next link. An upper bound of the discretization error is provided. We show that the proposed model resembles its continuous counterpart on lane drop, merge, and diverge cases. In addition, we apply the model into three different networks to validate its applicability in large networks. Finally, we also confirm the parameter transferability between continuous and discrete models and that both can well reproduce field data.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Covariance operator estimation via adaptive thresholding

This paper studies sparse covariance operator estimation for nonstationary processes with sharply varying marginal variance and small correlation lengthscale. We introduce a covariance operator estimator that adaptively thresholds the sample covariance function using an estimate of the variance component. Building on recent results from empirical process theory, we derive an operator norm bound on the estimation error in terms of the sparsity level of the covariance and the expected supremum of a normalized process. Furthermore, our theory and numerical simulations demonstrate the advantage of adaptive threshold estimators over universal threshold and sample covariance estimators in nonstationary settings.

Al-Ghattas, Omar [University of Chicago, IL (Unite↗
DOE OSTI2020

ROM-Based Surrogate Systems Modeling of EBR-II

We report the System Analysis Module (SAM), developed and maintained by Argonne National Laboratory, is designed to provide whole-plant transient safety analysis capabilities for a number of advanced non-light water reactors, including sodium-cooled fast reactor (SFR), lead-cooled fast reactor (LFR), and molten salt reactor (MSR)/fluoride-salt-cooled high-temperature reactor (FHR) designs. SAM is primarily constructed as a systems-level analysis tool, with the potential to incorporate reduced order models from three-dimensional computational fluid dynamics (CFD) simulations to improve characterization of complex, multidimensional physics. It is recognized that the computational expense associated with CFD can be intractable for various engineering analyses, such as uncertainty quantification, inference, and design optimization. This paper explores the reducibility of a SAM model using recent advances in randomized linear algebra techniques, which attempt to find recurring patterns in the various realizations generated by a model after randomly perturbing all its input parameters. The reduction is described in terms of fewer degrees of freedom (DOFs), referred to as the active DOFs, for the model variables such as input model parameters and model responses. The results indicate that there is significant room for additional reduction that may be leveraged for additional computational gains when employing SAM for engineering-intensive analyses that require repeated model executions. Different from physics-based reduction approaches, the proposed approach allows one to estimate upper bounds on the reduction errors, which are rigorously developed in this work. Finally, different methods for surrogate model construction, such as regression and neural network-based training, are employed to correlate the input and output active DOFs, which are related back to the original variables using matrix-based linear transformations.

42 ENGINEERING↗
DOE OSTI2022

Online State Estimation for Time-Varying Systems

The paper investigates the problem of estimating the state of a time-varying system with a linear measurement model; in particular, the paper considers the case where the number of measurements available can be smaller than the number of states. In lieu of a batch linear least-squares (LS) approach well-suited for static networks, where a sufficient number of measurements could be collected to obtain a full-rank design matrix the paper proposes an online algorithm to estimate the possibly time-varying state by processing measurements as and when available. The design of the algorithm hinges on a generalized LS cost augmented with a proximal-point-type regularization. With the solution of the regularized LS problem available in closed-form, the online algorithm is written as a linear dynamical system where the state is updated based on the previous estimate and based on the new available measurements. Conditions under which the algorithmic steps are in fact a contractive mapping are shown, and bounds on the estimation error are derived for different noise models. Numerical simulations are provided to corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Probabilistic Voltage Sensitivity Analysis to Quantify Impact of High PV Penetration on Unbalanced Distribution System

From an operational and planning perspective, it is important to quantify the impact of increasing penetration of photovoltaics on the distribution system. Most existing impact assessment studies are scenario-based where derived results are scenario specific and not generalizable. Moreover, stochasticity in the temporal behavior of spatially distributed PVs requires a large number of scenarios that increase with the size of the network and the level of penetration. Therefore, we propose a new computationally efficient analytical framework of voltage sensitivity analysis that allows for stochastic analysis of voltage change due to random changes in PV generation. We first derive an analytical approximation for voltage change at any node of the network due to change in power at other nodes in an unbalanced distribution network. The quality of this approximation is reinforced via bounds on the approximation error. Then, we derive the probability distribution of voltage change at a certain node due to random changes in power injections/consumptions at multiple locations of the network. The accuracy of the proposed PVSA is illustrated using a modified version of the IEEE 37 bus test system. As a result, the proposed PVSA can serve as a powerful tool for proactive monitoring/control and ease the computational burden associated with perturbation based cybersecurity mechanisms.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Real-Time Distribution System State Estimation with Asynchronous Measurements

We report state estimation is a fundamental task in power systems. Although distribution systems are increasingly equipped with sensing devices and smart meters, measurements are typically reported at different rates and asynchronously; these aspects pose severe strains on workhorse state estimation algorithms, which are designed to process batches of data collected in a synchronous manner from all the measurement units. In this paper, we develop a novel state estimation algorithm to continuously update the estimate of the state based on measurements received in an asynchronous manner from measurement units. The synthesis of the algorithm hinges on a proximal-point type method, implemented in an online fashion, and capable of processing measurements received sequentially from sensors. A performance analysis is presented by providing bounds on the estimation error in terms of the mean and variance that hold at each iteration and asymptotically. The scheme is also compared with a more traditional Weighted Least Squares estimator that compensates for the lack of measurement data by using, as pseudo measurements, the measurement retrieved during a certain time window. Numerical simulations on the IEEE 37-bus feeder corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems

This paper focuses on a time-varying constrained nonconvex optimization problem, and considers the synthesis and analysis of online regularized primal-dual gradient methods to track a Karush-Kuhn-Tucker (KKT) trajectory. The proposed regularized primal-dual gradient method is implemented in a running fashion, in the sense that the underlying optimization problem changes during the execution of the algorithms. In order to study its performance, we first derive its continuous-time limit as a system of differential inclusions. We then study sufficient conditions for tracking a KKT trajectory, and also derive asymptotic bounds for the tracking error (as a function of the time-variability of a KKT trajectory). Further, we provide a set of sufficient conditions for the KKT trajectories not to bifurcate or merge, and also investigate the optimal choice of the parameters of the algorithm. Illustrative numerical results for a time-varying nonconvex problem are provided.

differential inclusion↗
DOE OSTI2026

QEC-fidelity

Code for paper "Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction" https://doi.org/10.48550/arXiv.2607.24968

Wu, Jing [Fermi National Accelerator Laboratory (F↗
DOE OSTI2021

EFT asymptotics: the growth of operator degeneracy

We establish formulae for the asymptotic growth (with respect to the scaling dimension) of the number of operators in effective field theory, or equivalently the number of S-matrix elements, in arbitrary spacetime dimensions and with generic field content. This we achieve by generalising a theorem due to Meinardus and applying it to Hilbert series---partition functions for the degeneracy of (subsets of) operators. Although our formulae are asymptotic, numerical experiments reveal remarkable agreement with exact results at very low orders in the EFT expansion, including for complicated phenomenological theories such as the standard model EFT. Our methods also reveal phase transition-like behaviour in Hilbert series. We discuss prospects for tightening the bounds and providing rigorous errors to the growth of operator degeneracy, and of extending the analytic study and utility of Hilbert series to EFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Covariance operator estimation: Sparsity, lengthscale, and ensemble Kalman filters

This paper investigates covariance operator estimation via thresholding. For Gaussian random fields with approximately sparse covariance operators, we establish non-asymptotic bounds on the estimation error in terms of the sparsity level of the covariance and the expected supremum of the field. We prove that thresholded estimators enjoy an exponential improvement in sample complexity compared with the standard sample covariance estimator if the field has a small correlation lengthscale. As an application of the theory, we study thresholded estimation of covariance operators within ensemble Kalman filters.

Covariance operator estimation↗
NASA NTRS1971

Noncommuting observables in quantum detection and estimation theory

In quantum detection theory, the optimum detection operators must commute; admitting simultaneous approximate measurement of noncommuting observables cannot yield a lower Bayes cost. In addition, the lower bounds on mean square errors of parameter estimates, predicted by the quantum mechanical Cramer-Rao inequality, cannot be reduced by such means.

Helstrom, C. W.↗
NASA NTRS1971

Noncommunting observables in quantum detection and estimation theory

In quantum detection theory the optimum detection operators must commute; admitting simultaneous approximate measurement of noncommuting observables cannot yield a lower Bayes cost. The lower bounds on mean square errors of parameter estimates predicted by the quantum-mechanical Cramer-Rao inequality can also not be reduced by such means.

Helstrom, C. W.↗
NASA NTRS1974

Simulation techniques for estimating error in the classification of normal patterns

Methods of efficiently generating and classifying samples with specified multivariate normal distributions were discussed. Conservative confidence tables for sample sizes are given for selective sampling. Simulation results are compared with classified training data. Techniques for comparing error and separability measure for two normal patterns are investigated and used to display the relationship between the error and the Chernoff bound.

Whitsitt, S. J.↗