Discrete Goal-Oriented Error Estimation and Mesh Adaptation for Finite Deformation Elastoplasticity
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Statistical analysis of steady-state catalytic kinetic data is often limited by data sparsity due to the slow pace at which the data is collected. Data sparsity and limitations in statistical analysis make it difficult to differentiate between mechanistic models and catalytic sites. A Bayesian inference tool is reported for catalysis researchers to estimate error in the determination of reaction orders from steady state microreactor data. The benefits of a Bayesian inference approach are discussed, as an alternative to the more common frequentist approach. The approach incorporates prior knowledge of the system and the data collected to form an error estimate on reaction orders. We investigated the effects of three distinct data treatments—individual fitting of trials, pooled analysis, and constrained regression methods—on the precision and uncertainty of reaction order determinations. To assess the robustness of our findings, we conducted sensitivity analyses to evaluate the influence of Bayesian parameters on uncertainty estimation. Additionally, we utilized synthetic data to illustrate how data quality impacts the precision of uncertainty assessments. We show Bayesian analysis can obtain a more precise estimation of error with a sparse data set than a frequentist analysis. Finally, this work provides strong evidence that the adoption of Bayesian analysis of kinetic data may help researchers make more precise arguments as to the strength of their evidence for a particular mechanistic hypothesis, or in comparing across different catalysts.
A new methodology for adaptive sliding mode control (ASMC) has been widely used to improve the control performance in various systems. This method exhibits several advantages, including low sliding mode control (SMC) chattering, no knowledge of the system disturbance bound, and no overestimation of the control gain. Despite its advantages, this method can be hampered by the spike phenomenon, slow control gain convergence, and difficulty in achieving optimal performance under varying disturbances. Consequently, this article proposes a spike-free ASMC method with a disturbance observer (DOB) to address these problems. Previous ASMC methods have been analyzed via simulations to verify the aforementioned problems. Here, this analysis highlights the need for disturbance compensation and improvements in the SMC gain adaptation law. Therefore, a DOB is designed to mitigate the spike phenomenon by compensating for disturbances. Subsequently, an SMC gain adaptation law based on disturbance error estimation is designed to eliminate the spike phenomenon completely. The proposed adaptation law makes the SMC gain to converge to a slightly higher value than the disturbance estimation error. Consequently, the proposed method not only eliminates the spike phenomenon, but also ensures optimal performance under varying disturbances. The performance of the proposed method is experimen tally validated through a comparative study.
Laser powder bed fusion (LPBF) Additive manufacturing (AM) has attracted interest as an agile method of building production metal parts to reduce design-build-test cycle times for systems. However, predicting part performance is difficult due to inherent process variabilities. This makes qualification challenging. Computational process models have attempted to address some of these challenges, including mesoscale, full physics models and reduced fidelity conduction models. The goal of this work is credible multi-fidelity modeling of the LPBF process by investigating methods for estimating the error between models of two different fidelities. Two methods of error estimation are investigated, adjoint-based error estimation and Bayesian calibration. Adjoint-based error estimation is found to effectively bounding the error between the two models, but with very conservative bounds, making predictions highly uncertain. Bayesian parameter calibration applied to conduction model heat source parameters is found to effectively bound the observed error between the models for melt pool morphology quantities of interest. However, the calibrations do not effectively bound the error in heat distribution.
A computer-implemented method of preventing computationally explosive calculations. The method includes obtaining, by a processor of the computer, measured data of one of a physical process or a physical object; performing hierarchical numerical modeling of a physical process inclusive of an Earth model containing at least one of (a) infrastructure in the ground and (b) a formation feature in the ground, wherein predicted data is generated; comparing the measured data to the predicted data to calculate an estimated error; analyzing the estimated error via an inversion process to update the at least one of the Earth model and infrastructure model so as to reduce the estimated error and to determine a final composite Earth model of at least one of the infrastructure and the feature; and using the final composite Earth model to characterize at least one of the process and the physical object.
In this work, a Bayesian model calibration framework is presented that utilizes goal-oriented a-posterior error estimates in quantities of interest (QoIs) for classes of high-fidelity models characterized by PDEs. It is shown that for a large class of computational models, it is possible to develop a computationally inexpensive procedure for calibrating parameters of high-fidelity models of physical events when the parameters of low-fidelity (surrogate) models are known with acceptable accuracy. The main ingredients in the proposed model calibration scheme are goal-oriented a-posteriori estimates of error in QoIs computed using a so-called lower fidelity model compared to those of an uncalibrated higher fidelity model. The estimates of error in QoIs are used to define likelihood functions in Bayesian inversion analysis. A standard Bayesian approach is employed to compute the posterior distribution of model parameters of high-fidelity models. As applications, parameters in a quasi-linear second-order elliptic boundary-value problem (BVP) are calibrated using a second-order linear elliptic BVP. In a second application, parameters of a tumor growth model involving nonlinear time-dependent PDEs are calibrated using a lower fidelity linear tumor growth model with known parameter values.
This report compares the performance of three Circular Error Probable (CEP) estimators: the Grubbs-Patnaik estimator, a new, non-iterative, radial-integration estimator, and a median estimator. It also compares the performance of two Spherical Error Probable (SEP) estimators. The performance of each estimator is assessed in terms of bias, uncertainty, robustness, and computational complexity. Robustness is evaluated with respect to outliers, variations in the underlying statistical distribution characterizing munition impact positions, and impact-position measurement errors. The performance assessments indicate the radial-integration and Grubbs-Patnaik estimators perform nearly identically providing the statistical distribution of impact-position coordinates is jointly normal with zero means. In that case, both estimators outperform the median estimator by about 2% relative to the true CEP in terms of estimator uncertainty. The bias performance of the radial-integration and median estimators is close to zero for jointly normal impacts, however, the Grubbs-Patnaik estimator can be significantly biased for jointly normal impacts with non-zero means. When the statistical distribution characterizing impact positions is known, but not jointly normal, the radial-integration estimator is superior. In this case, the median estimator also outperforms the Grubbs-Patnaik estimator but is not quite as good as the radial-integration estimator. If the statistical distribution characterizing impacts is unknown and not jointly normal, or if distribution parameters are difficult or impractical to estimate, or if test data is corrupted with outliers, then the median estimator dramatically outperforms the other estimators, especially in terms of estimation bias. Unexpectedly, measurement noise did not significantly degrade the performance of any of the estimators, except for cases with signal to noise ratios less than five. Although the Grubbs-Patnaik estimator has remained the gold standard for CEP estimation for over half a century, the performance assessments indicate the new, non-iterative, radial-integration estimator and the median estimator offer significant advantages and, in most practical real-world conditions, are superior estimators. These estimators are also useful for SEP estimation whereas the Grubbs-Patnaik estimator does not extend to three dimensions.
We consider the influence of noise parameters of a 3D lidar and external background radiation on the error in estimating the relief signatures of distant objects from 2D field intensity distributions of the reflected radiation. A physical and mathematical model is developed to analyse the effect of noise. The dependence of the error in estimating the relief signatures at various signal-to-noise ratios is investigated taking into account the parameters of real multi-element photodetectors (MEPDs). The obtained results indicate the possibility of evaluating relief signatures of distant objects with high accuracy based on standard MEPDs simultaneously for a large number of points on the object’s surface with a signal-to-noise ratio of more than 4. (paper)
Traffic congestion is a serious problem in the US, and traffic signal control is one of the effective solutions to congestion. Previous research on model predictive control (MPC)-based traffic signal control showed substantial benefits over conventional methods. This study focused on implementing MPC over a large-scale network with complex intersections and the impact of cycle length, network size, and imperfect state estimation on performances. This study implemented a virtual phase link (VPL)-based model predictive control method which used the number of vehicles in each VPL as input state variables and was suitable for National Electrical Manufacturing Association (NEMA) ring-barrier control. To test the impact of network size, the performance of distributed MPC (36 intersections in the network are divided into five subnetworks) was compared with that of MPC over the full network for a set of cycle lengths. To test the impact of imperfect state estimation, we synthetically infused estimation error and developed two scenarios, MPC-error and MPC-error narrow, which had higher and lower estimation errors, respectively. The performance of these MPC methods was compared with that of the existing time-of-day (TOD) method and an offline method that used Webster's method for split and MULTIBAND for cycle length and offset optimization. Trajectory and linkwise signal performance measures were collected from the simulation to evaluate performance. The distributed MPC method with perfect state estimation had the lowest delay and highest energy efficiency of all the methods. The performance of MPC decreased as the prediction inaccuracy increased. MPC-error had 7% and 11% more delay than MPC-error narrow in the morning and evening peaks, respectively. Overall, simulation results suggest that even with imperfect state estimation, MPC methods will outperform offline methods significantly.
This paper presents a practical methodology for propagating and processing uncertainties associated with random measurement and estimation errors (that vary from test-to-test) and systematic measurement and estimation errors (uncertain but similar from test-to-test) in inputs and outputs of replicate tests to characterize response variability of stochastically varying test units. Also treated are test condition control variability from test-to-test and sampling uncertainty due to limited numbers of replicate tests. These aleatory variabilities and epistemic uncertainties result in uncertainty on computed statistics of output response quantities. The methodology was developed in the context of processing experimental data for “real-space” (RS) model validation comparisons against model-predicted statistics and uncertainty thereof. The methodology is flexible and sufficient for many types of experimental and data uncertainty, offering the most extensive data uncertainty quantification (UQ) treatment of any model validation method the authors are aware of. It handles both interval and probabilistic uncertainty descriptions and can be performed with relatively little computational cost through use of simple and effective dimension- and order-adaptive polynomial response surfaces in a Monte Carlo (MC) uncertainty propagation approach. A key feature of the progressively upgraded response surfaces is that they enable estimation of propagation error contributed by the surrogate model. Sensitivity analysis of the relative contributions of the various uncertainty sources to the total uncertainty of statistical estimates is also presented. Finally, the methodologies are demonstrated on real experimental validation data involving all the mentioned sources and types of error and uncertainty in five replicate tests of pressure vessels heated and pressurized to failure. Simple spreadsheet procedures are used for all processing operations.
A new adaptive rational interpolation method is proposed to obtain the wideband frequency response of a resonant cavity simulated with the method of moments (MoM). This interpolation method uses both the Loewner matrix to construct a rational expression for the solution vector of MoM’s matrix system and an error estimator generated by the solution vectors and their derivatives. This error estimator is implemented in the adaptive procedure to gain a minimum set of frequencies and solution vectors required in the interpolation. The resulting set of frequencies and solution vectors is applied to interpolate other system variables, such as shielding effectiveness and input impedance. Here numerical results of a slotted cylindrical cavity supporting high-quality factor resonances are presented, showing that the new rational interpolation method is accurate and efficient in interpolating the complicated resonant response of the solution vector functions.
Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.
Measuring the moisture content in flowing biomass is critical to processes such as liquid biofuel conversion, such as biogasoline, biodiesel, bio jet kerosene, etc. However, biomass tends to flow in aggregates, which results in significant inhomogeneities in the amount of biomass flowing in front of a sensor at a given time, and there can be significant overlap in the material properties of dry vs wet biomass, leading to poor signal-to-noise ratio. We present a technique for identifying biomass moisture content using a series of acoustic pitch-catch measurements to quantify the sound speed and acoustic amplitude through the biomass, in conjunction with classical machine learning techniques, including Naive Bayes, Random Forest, and K-Nearest Neighbors classification. We amplify the differences between the acoustic measurements in different moisture levels by collecting a series of pulse-echo measurements, which we sort in order of ascending sound speed. We test the accuracy of the technique on experimentally-prepared batches of corn stover biomass with specified moisture levels and measure the average error in the estimated moisture level as a function of the number of pitch-catch measurements used. We observe average estimation errors as low as 6.7% by increasing the number of measurements and optimizing the hyperparameters. This work presents a novel method determining moisture content in flowing biomass with inhomogeneous flow. Additionally, this technique has application in optimizing biomass conversion processes, as well as other fields including, paper production, natural fiber processing, and mineral extraction.
Coordinated cyber attacks tamper with measurement data to disrupt the situational awareness of active distribution systems. Various sensors report measurements asynchronously at different rates, which introduces challenges during state estimation. In addition, this forces cyber intruders to exert greater effort to compromise multiple communication channels and launch coordinated attacks. Therefore, multi-channel and asynchronous measurements could be harnessed to develop more secure cyber defense strategies. In this paper, a prediction-correction-based multi-rate observer is designed to exploit the value of asynchronous measurements for the detection of coordinated false data injection (FDI) attacks. First, a time-function-dependent prediction-correction strategy is proposed to adjust the sampling interval for each sensor’s measurement. Then, an observer is designed based on the trade-off between estimation error and the optimal period of the most recent sampling instant, with the convergence of estimation error with the maximum permitted sampling interval. Moreover, the conditions for exponential stability are developed using the Lyapunov–Krasovskii functional technique. Next, a coordinated FDI attack detection strategy is developed based on the dual nonlinear minimization problem. The proposed attack detection and secure state estimation strategies are tested on the IEEE 13-node system. Simulation results show that these schemes are effective in enhancing attack detection based on asynchronous measurements or compromised data.
Reduced Order Models (ROMs) form essential tools across engineering domains by virtue of their function as surrogates for computationally intensive digital twinning simulators. Although purely data-driven methods are available for ROM construction, schemes that allow to retain a portion of the physics tend to enhance the interpretability and generalization of ROMs. However, physics-based techniques can adversely scale when dealing with nonlinear systems that feature parametric dependencies. This study introduces a generative physics-based ROM that is suited for nonlinear systems with parametric dependencies and is additionally able to provide numerical error bounds associated with the respective estimates. A main contribution of this work is the conditioning of these parametric ROMs to features that can be derived from monitoring measurements, feasibly in an online fashion. This is contrary to most existing ROM schemes, which remain restricted to the prescription of the physics-based, and usually a priori unknown, system parameters. Our work utilizes conditional Variational Autoencoders to continuously map the required reduction bases to a feature vector extracted from limited output measurements, while additionally allowing for a probabilistic assessment of the ROM-estimated Quantities of Interest. An auxiliary task using a neural network-based parametrization of suitable probability distributions is introduced to re-establish the link with physical model parameters. We verify the proposed scheme on a series of simulated case studies incorporating effects of geometric and material nonlinearity under parametric dependencies related to system properties and input load characteristics.
To support the operation of modern distribution systems, operators require real-time visibility into system states. Due to a lack of measurements and unbalanced operation, the state estimation in distribution systems is challenging as compared to transmission systems. This paper proposes the utilization of a Multiple Iteration - Extended Kalman Filter based approach for the distribution system state estimation. This modified version of the baseline extended Kalman filter iterates over the update step multiple times thereby reducing the estimation error. The proposed algorithm along with the auxiliary algorithms such as bad data detection is integrated into a co-simulation environment. Case studies show that the proposed state estimation method can result in a lesser estimation error as compared to the baseline approach.
In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.