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

Updates to the Regional Seismic Travel Time (RSTT) Model: 2. Path-dependent Travel-time Uncertainty

Abstract The regional seismic travel time (RSTT) model and software were developed to improve travel-time prediction accuracy by accounting for three-dimensional crust and upper mantle structure. Travel-time uncertainty estimates are used in the process of associating seismic phases to events and to accurately calculate location uncertainty bounds (i.e. event location error ellipses). We improve on the current distance-dependent uncertainty parameterization for RSTT using a random effects model to estimate slowness (inverse velocity) uncertainty as a mean squared error for each model parameter. The random effects model separates the error between observed slowness and model predicted slowness into bias and random components. The path-specific travel-time uncertainty is calculated by integrating these mean squared errors along a seismic-phase ray path. We demonstrate that event location error ellipses computed for a 90% coverage ellipse metric (used by the Comprehensive Nuclear-Test-Ban Treaty Organization International Data Centre (IDC)), and using the path-specific travel-time uncertainty approach, are more representative (median 82.5% ellipse percentage) of true location error than error ellipses computed using distance-dependent travel-time uncertainties (median 70.1%). We also demonstrate measurable improvement in location uncertainties using the RSTT method compared to the current station correction approach used at the IDC (median 74.3% coverage ellipse).

58 GEOSCIENCES↗
DOE OSTI2014

Low depth quantum circuits for Ising models

A scheme for measuring complex temperature partition functions of Ising models is introduced. Two applications of this scheme are presented. First, through appropriate Wick rotations, those amplitudes can be analytically continued to yield estimates for partition functions of Ising models. Bounds on the estimated error are provided through a central-limit theorem whose validity extends beyond the present context; it holds for example for estimations of the Jones polynomial. The kind of state preparations and measurements involved in this application can be made independent of the system size or the parameters of the system being simulated. Second, the scheme allows to accurately estimate non-trivial invariants of links. Another result concerns the computational power of estimations of partition functions for real temperature classical ferromagnetic Ising models. We provide conditions under which estimating such partition functions allows to reconstruct scattering amplitudes of quantum circuits, making the problem BQP-hard. We also show fidelity overlaps for ground states of quantum Hamiltonians, which serve as a witness to quantum phase transitions, can be estimated from classical Ising model partition functions. Finally, we discuss how accurate corner magnetisation measurements on thermal states of two-dimensional Ising models lead to fully polynomial random approximation schemes (FPRAS) for the partition function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2016

Hybrid framework for the simulation of stochastic chemical kinetics

Stochasticity plays a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be modelled as Markov processes, typically simulated using the Gillespie Stochastic Simulation Algorithm (SSA) [25]. While easy to implement and exact, the computational cost of using the Gillespie SSA to simulate such systems can become prohibitive as the frequency of reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation when all reactants are abundant, the approximation breaks down when one or more species exist only in small concentrations and the fluctuations arising from the discrete nature of the reactions become significant. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as simulating non-equilibrium systems such as cell-cycle models in which a single species can cycle between abundance and scarcity. In this paper, a hybrid jump-diffusion model for simulating well-mixed stochastic kinetics is derived. It acts as a bridge between the Gillespie SSA and the chemical Langevin equation. For low reactant reactions the underlying behaviour is purely discrete, while purely diffusive when the concentrations of all species are large, with the two different behaviours coexisting in the intermediate region. A bound on the weak error in the classical large volume scaling limit is obtained, and three different numerical discretisations of the jump-diffusion model are described. The benefits of such a formalism are illustrated using computational examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2015

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2015

RUNAWAY M DWARF CANDIDATES FROM THE SLOAN DIGITAL SKY SURVEY

We present a sample of 20 runaway M dwarf candidates (RdMs) within 1 kpc of the Sun whose Galactocentric (GC) velocities exceed 400 km s{sup −1}. The candidates were selected from the Sloan Digital Sky Survey (SDSS) DR7 M Dwarf Catalog of West et al. Our RdMs have SDSS+USNO-B proper motions that are consistent with those recorded in the PPMXL, LSPM, and combined Wide-field Infrared Survey Explorer +SDSS+Two-micron All-sky Survey catalogs. Sixteen RdMs are classified as dwarfs, while the remaining four RdMs are subdwarfs. We model the Galactic potential using a bulge-disk-halo profile. Our fastest RdM, with a GC velocity of 658.5 ± 236.9 km s{sup −1}, is a possible hypervelocity candidate, as it is unbound in 77% of our simulations. About half of our RdMs have kinematics that are consistent with ejection from the Galactic center. Seven of our RdMs have kinematics consistent with an ejection scenario from M31 or M32 to within 2 σ , although our distance-limited survey makes such a realization unlikely. No more than four of our RdMs may have originated from the Leo stream. We propose that to within measurement errors, most of our bound RdMs are likely disk runaways or halo objects, and may have been accelerated through a series of multi-body interactions within the Galactic disk or possibly supernovae explosions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

A MAGNIFIED GLANCE INTO THE DARK SECTOR: PROBING COSMOLOGICAL MODELS WITH STRONG LENSING IN A1689

In this paper we constrain four alternative models to the late cosmic acceleration in the universe: Chevallier–Polarski–Linder (CPL), interacting dark energy (IDE), Ricci holographic dark energy (HDE), and modified polytropic Cardassian (MPC). Strong lensing (SL) images of background galaxies produced by the galaxy cluster Abell 1689 are used to test these models. To perform this analysis we modify the LENSTOOL lens modeling code. The value added by this probe is compared with other complementary probes: Type Ia supernovae (SN Ia), baryon acoustic oscillations (BAO), and cosmic microwave background (CMB). We found that the CPL constraints obtained for the SL data are consistent with those estimated using the other probes. The IDE constraints are consistent with the complementary bounds only if large errors in the SL measurements are considered. The Ricci HDE and MPC constraints are weak, but they are similar to the BAO, SN Ia, and CMB estimations. We also compute the figure of merit as a tool to quantify the goodness of fit of the data. Our results suggest that the SL method provides statistically significant constraints on the CPL parameters but is weak for those of the other models. Finally, we show that the use of the SL measurements in galaxy clusters is a promising and powerful technique to constrain cosmological models. The advantage of this method is that cosmological parameters are estimated by modeling the SL features for each underlying cosmology. These estimations could be further improved by SL constraints coming from other galaxy clusters.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

The CTA aims at the Inert Doublet Model

We show that the Cherenkov Telescope Array (CTA) can realistically challenge the Inert Doublet Model, one of the simplest and best known models of dark matter. Specifically, the CTA may exclude its heavy regime up to dark matter masses of 800 GeV and probe a large fraction of the remaining viable parameter space at even higher masses. Two features of the Inert Doublet Model make it particularly suitable for CTA searches. First, the dark matter mass (in the heavy regime) must be larger than 500 GeV. Second, the dark matter annihilation cross section, σ v, is always larger than the thermal one, reaching values as high as 10{sup −25} cm{sup 3}s{sup −1}. This higher value of σv is the result of the unavoidable coannihilation effects that determine the relic density via thermal freeze-out in the early Universe. We find that with 100 hours of Galactic Center exposure, CTA's expected limit widely surpasses, even after the inclusion of systematic errors, current and projected bounds from Fermi-LAT and HESS on this model.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

On Analytics of File Transfer Rates over Dedicated Wide-Area Connections

File transfers between the decentralized storage sites over dedicated wide-area connections are becoming increasingly important in high-performance computing and big data scenarios. Designing such scientific workflows for large file transfers is extremely challenging as they depend on the file, I/O, host, and local- and wide-area network subsystems, and their interactions. To gain insights into file-transfer rate profiles, we develop polynomial, bagging, and boosting regression models for Lustre and XFS file transfer measurements, which are collected using XDD over a suite of 10 Gbps connections with 0-366 ms round trip times (RTTs). In addition to overall trends and analytics, these regressions also provide file-transfer rate estimates for RTTs and number of parallel flows at which measurements might not have been collected. They show that bagging and boosting techniques provide closer data fits than the polynomial regression. We develop probabilistic bounds on the generalization error of these methods, which combined with the cross-validation error establish that former two are more accurate estimators than the polynomial regression. In addition, we present a method to efficiently determine the number of parallel flows to achieve a peak file-transfer rate using fewer than full sweep measurements; in our measurements, the peak is achieved in 96% of cases with 15-25% of measurements of a full sweep.

Sen, Satyabrata↗
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↗