Search NASA⌕ Search

SEARCH · Search NASA

Results for “computable error estimate”

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 433 records · Page 24

Supervised learning and the finite-temperature string method for computing committor functions and reaction rates

A central object in the computational studies of rare events is the committor function. Though costly to compute, the committor function encodes complete mechanistic information of the processes involving rare events, including reaction rates and transition-state ensembles. Under the framework of transition path theory, Rotskoff et al. [Proceedings of the 2nd Mathematical and Scientific Machine Learning Conference, Proceedings of Machine Learning Research (PLMR, 2022), Vol. 145, pp. 757–780] proposes an algorithm where a feedback loop couples a neural network that models the committor function with importance sampling, mainly umbrella sampling, which collects data needed for adaptive training. Here, in this work, we show additional modifications are needed to improve the accuracy of the algorithm. The first modification adds elements of supervised learning, which allows the neural network to improve its prediction by fitting to sample-mean estimates of committor values obtained from short molecular dynamics trajectories. The second modification replaces the committor-based umbrella sampling with the finite-temperature string (FTS) method, which enables homogeneous sampling in regions where transition pathways are located. We test our modifications on low-dimensional systems with non-convex potential energy where reference solutions can be found via analytical or finite element methods, and show how combining supervised learning and the FTS method yields accurate computation of committor functions and reaction rates. We also provide an error analysis for algorithms that use the FTS method, using which reaction rates can be accurately estimated during training with a small number of samples. The methods are then applied to a molecular system in which no reference solution is known, where accurate computations of committor functions and reaction rates can still be obtained.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Utilizing Flight Data to Update Aeroelastic Stability Estimates

Stability analysis of high performance aircraft must account for errors in the system model. A method for computing flutter margins that incorporates flight data has been developed using robust stability theory. This paper considers applying this method to update flutter margins during a post-flight or on-line analysis. Areas of modeling uncertainty that arise when using flight data with this method are investigated. The amount of conservatism in the resulting flutter margins depends on the flight data sets used to update the model. Post-flight updates of flutter margins for an F/A-18 are presented along with a simulation of on-line updates during a flight test.

Lind, Rick↗

Surrogate Modeling and Optimization of a Combustor with an Interdigitated Flushwall Injector

Design and Analysis of Computer Experiments (DACE) methods are applied and used to perform surrogate modeling and optimization of a simplified combustor flowpath with an interdigitated flushwall injector. The objectives of the optimization are the thrust potential and combustion efficiency, which are evaluated across a range of flight Mach numbers, duct heights, spanwise spacings, and injection angles. The focus of this work is to highlight the application of a sequential learning approach, in order to learn about the responses of the objective functions over the design space and to identify local regions of interest for further analysis. This approach is contrasted to a previous effort where only a single sampling set was used to fit surrogate models and perform optimization. The optimal solutions resulting from the previous and present approaches are different, due to surrogate model-guided local refinement of the design space allowed by the sequential learning method. The values of the global error estimates between the previous and present approaches are comparable, but the sequential method proved more computationally cost-effective. Further refinement in the optimal regions might be needed to improve predictive capability of surrogate models and to obtain the optimal solutions sets.

Rajiv R Shenoy↗

Detection of presence of chemical precursors

Methods and systems for determining if one or more target molecules are present in a gas, by exposing a functionalized carbon nanostructure (CNS) to the gas and measuring an electrical parameter value EPV(n) associated with each of N CNS sub-arrays. In a first embodiment, a most-probable concentration value C(opt) is estimated, and an error value, depending upon differences between the measured values EPV(n) and corresponding values EPV(n;C(opt)) is computed. If the error value is less than a first error threshold value, the system interprets this as indicating that the target molecule is present in a concentration C.apprxeq.C(opt). A second embodiment uses extensive statistical and vector space analysis to estimate target molecule concentration.

Li, Jing↗

An error estimation driven adaptive tetrahedral workflow for full engineering models

Tetrahedral finite element workflows have the potential to drastically reduce time to solution for computational solid mechanics simulations when compared to traditional hexahedral finite element analogues. A recently developed, higher-order composite tetrahedral element has shown promise in the space of incompressible computational plasticity. Mesh adaptivity has the potential to increase solution accuracy and increase solution robustness. In this work, we demonstrate an initial strategy to perform conformal mesh adaptivity for this higher-order composite tetrahedral element using well-established mesh modification operations for linear tetrahedra. We propose potential extensions to improve this initial strategy in terms of robustness and accuracy.

42 ENGINEERING↗

Two novel automatic frequency tracking loops

Two automatic-frequency-control (AFC) loops are introduced and analyzed in detail. The algorithms are generalizations of the well known cross-product AFC loop with improved performance. The first estimator uses running overlapping discrete Fourier transforms to create a discriminator curve proportional to the frequency estimation error, whereas the second one preprocesses the received data and then uses an extended Kalman filter to estimate the input frequency. The algorithms are tested by computer simulations in a highly dynamic environment at low carrier/noise ratio (CNR). The algorithms are suboptimum tracking schemes with a larger frequency-error variance compared to an optimum strategy, but they offer simplicity of mechanization and a CNR with a very low operating threshold.

Aguirre, Sergio↗

Optimum Full Information, Unlimited Complexity, Invariant and Minimax Clock Skew and Offset Estimators for IEEE 1588

This paper presents the problem of clock skew and offset estimation for the IEEE 1588 precision time protocol. Built on the classical two-way message exchange scheme, IEEE 1588 is a prominent synchronization protocol for packet switched networks. Because of the presence of random queuing delays in a packet switched network, the joint recovery of clock skew and offset from the received packet timestamps can be viewed as a statistical estimation problem. Recently, assuming perfect clock skew information, minimax optimum clock offset estimators were developed for IEEE 1588. Building on this work, we first develop joint optimum invariant clock skew and offset estimators for IEEE 1588 for known queuing delay statistics and unlimited computational complexity. We then show the developed estimators are minimax optimum, i.e., these estimators minimize the maximum skew normalized mean square estimation error over all possible values of the unknown parameters. Minimax optimum estimators that utilize information from past timestamps to improve accuracy are also introduced. The developed optimum estimators provide useful fundamental limits for evaluating the performance of clock skew and offset estimation schemes. These performance limits can aid system designers to develop algorithms with the desired computational complexity that achieve performance close to the performance of the optimum estimators. If a designer finds an approach with a complexity they find acceptable and which provides performance close to the optimum performance, they can use it and know they have near optimum performance. This is precisely the approach used in communications when comparing to capacity.

Cellular networks↗

Image-Guided Localization Accuracy of Stereoscopic Planar and Volumetric Imaging Methods for Stereotactic Radiation Surgery and Stereotactic Body Radiation Therapy: A Phantom Study

Purpose: To evaluate the positioning accuracies of two image-guided localization systems, ExacTrac and On-Board Imager (OBI), in a stereotactic treatment unit. Methods and Materials: An anthropomorphic pelvis phantom with eight internal metal markers (BBs) was used. The center of one BB was set as plan isocenter. The phantom was set up on a treatment table with various initial setup errors. Then, the errors were corrected using each of the investigated systems. The residual errors were measured with respect to the radiation isocenter using orthogonal portal images with field size 3 x 3 cm{sup 2}. The angular localization discrepancies of the two systems and the correction accuracy of the robotic couch were also studied. A pair of pre- and post-cone beam computed tomography (CBCT) images was acquired for each angular correction. Then, the correction errors were estimated by using the internal BBs through fiducial marker-based registrations. Results: The isocenter localization errors ({mu} {+-}{sigma}) in the left/right, posterior/anterior, and superior/inferior directions were, respectively, -0.2 {+-} 0.2 mm, -0.8 {+-} 0.2 mm, and -0.8 {+-} 0.4 mm for ExacTrac, and 0.5 {+-} 0.7 mm, 0.6 {+-} 0.5 mm, and 0.0 {+-} 0.5 mm for OBI CBCT. The registration angular discrepancy was 0.1 {+-} 0.2{sup o} between the two systems, and the maximum angle correction error of the robotic couch was 0.2{sup o} about all axes. Conclusion: Both the ExacTrac and the OBI CBCT systems showed approximately 1 mm isocenter localization accuracies. The angular discrepancy of two systems was minimal, and the robotic couch angle correction was accurate. These positioning uncertainties should be taken as a lower bound because the results were based on a rigid dosimetry phantom.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Planck 2015 results: IV. Low Frequency Instrument beams and window functions

This article presents the characterization of the in-flight beams, the beam window functions, and the associated uncertainties for the Planck Low Frequency Instrument (LFI). The structure of the paper is similar to that presented in the 2013 Planck release; the main differences concern the beam normalization and the delivery of the window functions to be used for polarization analysis. The in-flight assessment of the LFI main beams relies on measurements performed during observations of Jupiter. By stacking data from seven Jupiter transits, the main beam profiles are measured down to -25 dB at 30 and 44 GHz, and down to -30 dB at 70 GHz. It has been confirmed that the agreement between the simulated beams and the measured beams is better than 1% at each LFI frequency band (within the 20 dB contour from the peak, the rms values are 0.1% at 30 and 70 GHz; 0.2% at 44 GHz). Simulated polarized beams are used for the computation of the effective beam window functions. The error budget for the window functions is estimated from both main beam and sidelobe contributions, and accounts for the radiometer band shapes. The total uncertainties in the effective beam window functions are 0.7% and 1% at 30 and 44 GHz, respectively (at ℓ ≈ 600); and 0.5% at 70 GHz (at ℓ ≈ 1000).

79 ASTRONOMY AND ASTROPHYSICS↗

Learn-as-you-go acceleration of cosmological parameter estimates

Cosmological analyses can be accelerated by approximating slow calculations using a training set, which is either precomputed or generated dynamically. However, this approach is only safe if the approximations are well understood and controlled. This paper surveys issues associated with the use of machine-learning based emulation strategies for accelerating cosmological parameter estimation. We describe a learn-as-you-go algorithm that is implemented in the Cosmo++ code and (1) trains the emulator while simultaneously estimating posterior probabilities; (2) identifies unreliable estimates, computing the exact numerical likelihoods if necessary; and (3) progressively learns and updates the error model as the calculation progresses. We explicitly describe and model the emulation error and show how this can be propagated into the posterior probabilities. We apply these techniques to the Planck likelihood and the calculation of ΛCDM posterior probabilities. The computation is significantly accelerated without a pre-defined training set and uncertainties in the posterior probabilities are subdominant to statistical fluctuations. We have obtained a speedup factor of 6.5 for Metropolis-Hastings and 3.5 for nested sampling. Finally, we discuss the general requirements for a credible error model and show how to update them on-the-fly.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum error mitigation by hidden inverses protocol in superconducting quantum devices

We present a method to improve the convergence of variational algorithms based on hidden inverses (HIs) to mitigate coherent errors. In the context of error mitigation, this means replacing the hardware implementation of certain Hermitian gates with their inverses. Doing so results in noise cancellation and a more resilient quantum circuit. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm to find the H 2 ground-state energy. When implemented on superconducting hardware we find that the mitigation scheme effectively reduces the energy fluctuations in the parameter learning path in VQE, reducing the number of iterations for a converged value. We also provide a detailed numerical simulation of VQE performance under different noise models and explore how HIs and randomized compiling affect the underlying loss landscape of the learning problem. These simulations help explain our experimental hardware outcomes, helping to connect lower-level gate performance to application-specific behavior in contrast to metrics like fidelity which often do not provide an intuitive insight into observed high level performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Convergence of Probability Densities Using Approximate Models for Forward and Inverse Problems in Uncertainty Quantification

Here, we analyze the convergence of probability density functions utilizing approximate models for both forward and inverse problems. We consider the standard forward uncertainty quantification problem where an assumed probability density on parameters is propagated through the approximate model to produce a probability density, often called a push-forward probability density, on a set of quantities of interest (QoI). The inverse problem considered in this paper seeks to update an initial probability density assumed on model input parameters such that the subsequent push-forward of this updated density through the parameter-to-QoI map matches a given probability density on the QoI. We prove that the densities obtained from solving the forward and inverse problems, using approximate models, converge to the true densities as the approximate models converge to the true models. Numerical results are presented to demonstrate convergence rates of densities for sparse grid approximations of parameter-to-QoI maps and standard spatial and temporal discretizations of PDEs and ODEs.

97 MATHEMATICS AND COMPUTING↗

Residual a posteriori error estimation of a mimetic/virtual element method

A posteriori error estimation and adaptivity are very useful in the context of the mimetic finite difference method due to the flexibility of the meshes to which this family of numerical schemes can be applied. Nevertheless, developing error estimators for mimetic methods is not a straightforward task due to the lack of knowledge of the basis functions. This issue is tackled by the virtual element method recently introduced in [4], which can be interpreted as a Galerkin reformulation of the mimetic finite difference method. In the new virtual element setting, we develop a residual based a posteriori error estimator that immediately applies to its mimetic counterpart. For such estimator we prove the reliability and we show the numerical performance when it is combined with an adaptive strategy for the mesh refinement. For the lowest-regular approximation we also developed an hp-adaptive strategy based on the comparison between the numerical solution on a base mesh and on a reference mesh.

a posteriori error estimation↗

Large space system control technology status and accomplishments

In the area of antenna modeling and control, preliminary structural models were defined for two representative parabolic reflectors. A control system design evolved for attitude control of the reflectors. The controller design was based on a lumped control concept where the control hardware (sensor and actuators) was mounted at the base of the antenna. In the area of distributed control, static shape control techniques were worked out to establish a prescribed vehicle shape. The corresponding estimation process for determination of vehicle shape from selected sensor measurements was also developed. A model order reduction study was conducted to find the best preflight dynamical models for on board controller design. The problems caused by truncation of the vehicle dynamics required to minimize on board computations were investigated. Estimator designs were developed for on board detection of large structure model errors.

Rodriguez, G.↗

Formulations and applications of large structure actuator and sensor placements

A new approach based on the steady-state solutions of the optimal control and estimation problems is presented to study respectively the actuator and sensor locations for large flexible structures. A simple and computer-implementable formulation for minimizing the steady state optimal cost function and the state estimation error inherent in the estimation process is given. In conjunction with the new approach, two criteria are established relating the actuator and the sensor placement optimalities respectively to the minimums of the optimal cost function and the state estimation error. To illustrate the concepts of this paper, we present the results of some numerical and analytical studies on the actuator and the sensor locations of several simple flexible beam modes.

Juang, J.-N.↗