Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linearization error”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Linearization errors in discrete goal-oriented error estimation

This paper is concerned with goal-oriented a posteriori error estimation for nonlinear functionals in the context of nonlinear variational problems solved with continuous Galerkin finite element discretizations. A two-level, or discrete, adjoint-based approach for error estimation is considered. The traditional method to derive an error estimate in this context requires linearizing both the nonlinear variational form and the nonlinear functional of interest which introduces linearization errors into the error estimate. In this paper, we investigate these linearization errors. In particular, we develop a novel discrete goal-oriented error estimate that accounts for traditionally neglected nonlinear terms at the expense of greater computational cost. We demonstrate how this error estimate can be used to drive mesh adaptivity. Here, we show that accounting for linearization errors in the error estimate can improve its effectivity for several nonlinear model problems and quantities of interest. We also demonstrate that an adaptive strategy based on the newly proposed estimate can lead to more accurate approximations of the nonlinear functional with fewer degrees of freedom when compared to uniform refinement and traditional adjoint-based approaches.

42 ENGINEERING↗
DOE OSTI2024

Geophysical and Environmental Monitoring Data, and Subsurface Flow Modelling Results for Chicken Bone Meadow, Mt. Snodgrass, Crested Butte, CO

This dataset includes geoelectrical monitoring data acquired between October 2021 and November 2022, soil moisture and temperature data, groundwater data obtained from borehole SNIB covering the period from June 2021 to September 2022, and hydrological modelling results. The data were acquired to investigate how variations in bedrock type and topography, and vegetation cover control subsurface flow dynamics. To provide insights into the subsurface flow dynamics and their controls, a monitoring transect was installed at the Chicken Bone Meadow, Mt. Snodgrass, Crested Butte, CO, measuring the spatio-temporal variations of soil moisture, soil and snow temperature, subsurface electrical resistivity variations, and groundwater dynamics. Field data are organized in a folder structure, with Electrical Resistivity Tomography (ERT) data being provided as one file per measurement, and data of the soil moisture and temperature sensors being provided as text files covering the entire monitoring period. The ‘Locations.csv’ file contains the location of all sensors, given in NAD83 – UTM Zone 13N. ERT monitoring data has been processed to filter data based on reciprocal errors (data with errors > 30% were removed), a linear error model was fitted to each survey, and to ensure a constant set of measurements for time-lapse inversion, filtered data were interpolated and assigned a 100% measurement error. Soil moisture and temperature data were acquired at 15 min intervals, and averaged to provide 1h data. Weather data and borehole data (groundwater depth, conductivity and temperature) were acquired at 30 min intervals, and are provided as daily measurements; all measurements are averaged, except of precipitation values, which are given as daily accumulation. The hydrological model was set up along the ERT monitoring transect, and net infiltration was used as surface boundary condition and derived from the weather data. Four different results are provided, (1) results for a parameterization using hydraulic permeability and porosity as derived from the ERT data through petrophysical relationships, and (2) three simplified model results, using 1 to 3 geological layers above the bedrock. Modelling was performed using PFLOTRAN, and for each model the PFLOTRAN input files are provided. The result files include weekly hydrological modelling results (e.g., saturation, velocities, pressures), as well as the model parameterization. The dataset additionally includes a file-level metadata (flmd.csv) file that lists each file contained in the dataset with associated metadata; and a data dictionary (dd.csv) file that contains column/row headers used throughout the files along with a definition, units, and data type.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Driving mode analysis—How uncertain functional inputs propagate to an output

Abstract Driving mode analysis elucidates how correlated features of uncertain functional inputs jointly propagate to produce uncertainty in the output of a computation. Uncertain input functions are decomposed into three terms: the mean functions, a zero‐mean driving mode, and zero‐mean residual. The random driving mode varies along a single direction, having fixed functional shape and random scale. It is uncorrelated with the residual, and under linear error propagation, it produces an output variance equal to that of the full input uncertainty. Finally, the driving mode best represents how input uncertainties propagate to the output because it minimizes expected squared Mahalanobis distance amongst competitors. These characteristics recommend interpretation of the driving mode as the single‐degree‐of‐freedom component of input uncertainty that drives output uncertainty. We derive the functional driving mode, show its superiority to other seemingly sensible definitions, and demonstrate the utility of driving mode analysis in an application. The application is the simulation of neutron transport in criticality experiments. The uncertain input functions are nuclear data that describe how Pu reacts to bombardment by neutrons. Visualization of the driving mode helps scientists understand what aspects of correlated functional uncertainty have effects that either reinforce or cancel one another in propagating to the output of the simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Uncertainty Error Modeling for Non-Linear State Estimation With Unsynchronized SCADA and µPMU Measurements

Distribution systems of the future smart grid require enhancements to the reliability of distribution system state estimation (DSSE) in the face of low measurement redundancy, unsynchronized measurements, and dynamic load profiles. Micro phasor measurement units (µPMUs) facilitate co-synchronized measurements with high granularity, albeit at an often prohibitively expensive installation cost. Supervisory control and data acquisition (SCADA) measurements can supplement µPMU data, although they are received at a slower sampling rate. Further complicating matters is the uncertainty associated with load dynamics and unsynchronized measurements–not only are the SCADA and µPMU measurements not synchronized with each other, but the SCADA measurements themselves are received at different time intervals with respect to one another. This paper proposes a non-linear state estimation framework which models dynamic load uncertainty error by updating the variances of the unsynchronized measurements, leading to a time-varying system of weights in the weighted least squares state estimator. Case studies are performed on the 33-Bus Distribution System in MATPOWER, using Ornstein–Uhlenbeck stochastic processes to simulate dynamic load conditions.

Cooper, Austin↗
DOE OSTI2025

Machine Learning-Based Process Control for Injection Molding of Recycled Polypropylene

The increased interest in artificial intelligence in manufacturing has driven the adoption of machine learning to optimize processes and improve efficiency. A key challenge in injection molding is the variability of recycled materials, which affects part quality and processing stability. This study presents a novel closed-loop process control approach for injection molding, leveraging machine learning to adaptively predict processing inputs and quality outcomes. The methodology was tested on five blends of recycled polypropylene (rPP), using artificial neural networks (ANNs), linear regression, and polynomial regression to model the relationships between material properties and process parameters. The dataset was split 80/20 into training and testing sets. The ANN model was implemented using TensorFlow and Keras, with six hidden layers of 32 neurons per layer, ReLU activation, and an Adam optimizer. Empirical tuning and early stopping were used to optimize performance and prevent overfitting. Predictions were evaluated based on mean absolute error (MAE), mean squared error (MSE), and percentage error. The results showed that yield stress, ultimate elongation, and part weight were accurately predicted within a 5% error for linear and polynomial regression models and within a 10% error for the ANN. However, modulus predictions were less reliable, with errors of ~11% for ANN and linear regression and ~40% for polynomial regression, reflecting the inherent variability of this property in rPP blends. Predictions of processing inputs had errors ranging from 3% to 25%, depending on the model and response variable. No single modeling approach was consistently superior across all responses, highlighting the complexity of the relationship between material properties, process parameters, and quality metrics. Overall, the work demonstrates that closed-loop process control, powered by machine learning, can effectively predict key quality parameters in injection molding of recycled materials. The proposed approach can improve process stability and material utilization, facilitating increased adoption of sustainable materials.

Krantz, Joshua↗
DOE OSTI2026

A variational framework for residual-based adaptivity in neural PDE solvers and operator learning

Residual-based adaptive strategies are widely used in scientific machine learning yet remain largely heuristic. We introduce a variational framework that formalizes these methods through convex transformations of the residual, where different transformations correspond to distinct objective functionals. For instance, exponential weights target uniform error minimization, while linear weights recover quadratic error minimization. This perspective reveals adaptive weighting as a means of selecting sampling distributions that optimize a primal objective, directly linking discretization choices to error metrics. This principled approach yields three key benefits: it enables systematic design of adaptive schemes, reduces discretization error by lowering estimator variance, and enhances learning dynamics by improving gradient signal-to-noise ratio. Extending the framework to operator learning, we demonstrate substantial performance gains across diverse optimizers and architectures. Our results provide a theoretical perspective for residual-based adaptivity and establish a foundation for principled discretization and training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗
DOE OSTI2024

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗
DOE OSTI2024

A simulation study of the ability to detect power distribution perturbations in the texas A&M TRIGA reactor with self-powered neutron detectors

Given the variety of ways that nuclear reactor core power may be perturbed, reactor operators and developers are keen on understanding the accuracy and convergence time during which perturbations in reactor power distribution may be synthesized (i.e., inferred) from an array of in-core radiation detectors. A simulation study was conducted as described herein using a highly detailed model of the Texas A&M Training, Research, Isotopes, General Atomics Reactor, in which an array of self-powered neutron detectors (SPNDs) was considered for input to the power synthesis methodology. The core power synthesis is conducted using a point-based iterative method with an iterative loop built in to ensure working equation consistency. The forward problem of SPND response to simulated perturbations in reactor power was solved for Gaussian peak-type perturbations in the reactor power distribution. These perturbations varied in variance, amplitude, and core location to assess their impact on synthesis error and to determine the number of iterations required for convergence. A relation between the unique resolvability limit and perturbation width was identified such that the maximum synthesis error increased rapidly when the peak width went beneath this limit (a width approximating half the reactor’s fuel pin-to-pin pitch); this resolvability limit is specific to the SPND configuration and fuel segmentation considered herein. The synthesis error increased linearly with perturbation peak amplitude, whereas the convergence time increased nonlinearly. Perturbations located closer to the center of the core were synthesized more accurately, albeit with a higher number of required iterations. These findings provide a qualitative and quantitative understanding of the accuracy and speed at which different types of spatial power perturbations can be resolved in light-water reactors.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Training models using forces computed by stochastic electronic structure methods

Abstract Quantum Monte Carlo (QMC) can play a very important role in generating accurate data needed for constructing potential energy surfaces. We argue that QMC has advantages in terms of a smaller systematic bias and an ability to cover phase space more completely. The stochastic noise can ease the training of the machine learning model. We discuss how stochastic errors affect the generation of effective models by analyzing the errors within a linear least squares procedure, finding that there is an advantage to having many relatively imprecise data points for constructing models. We then analyze the effect of noise on a model of many-body silicon finding that noise in some situations improves the resulting model. We then study the effect of QMC noise on two machine learning models of dense hydrogen used in a recent study of its phase diagram. The noise enables us to estimate the errors in the model. We conclude with a discussion of future research problems.

Ceperley, David M. (ORCID:0000000150826271)↗
DOE OSTI2025

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Local primordial non-Gaussianity from the large-scale clustering of photometric DESI luminous red galaxies

ABSTRACT We use angular clustering of luminous red galaxies from the Dark Energy Spectroscopic Instrument (DESI) imaging surveys to constrain the local primordial non-Gaussianity parameter fNL. Our sample comprises over 12 million targets, covering 14 000 deg2 of the sky, with redshifts in the range 0.2 < z < 1.35. We identify Galactic extinction, survey depth, and astronomical seeing as the primary sources of systematic error, and employ linear regression and artificial neural networks to alleviate non-cosmological excess clustering on large scales. Our methods are tested against simulations with and without fNL and systematics, showing superior performance of the neural network treatment. The neural network with a set of nine imaging property maps passes our systematic null test criteria, and is chosen as the fiducial treatment. Assuming the universality relation, we find $f_{\rm NL} = 34^{+24(+50)}_{-44(-73)}$ at 68 per cent (95 per cent) confidence. We apply a series of robustness tests (e.g. cuts on imaging, declination, or scales used) that show consistency in the obtained constraints. We study how the regression method biases the measured angular power spectrum and degrades the fNL constraining power. The use of the nine maps more than doubles the uncertainty compared to using only the three primary maps in the regression. Our results thus motivate the development of more efficient methods that avoid overcorrection, protect large-scale clustering information, and preserve constraining power. Additionally, our results encourage further studies of fNL with DESI spectroscopic samples, where the inclusion of 3D clustering modes should help separate imaging systematics and lessen the degradation in the fNL uncertainty.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Measuring and unbiasing the BAO shift in the Ly α forest with AbacusSummit

ABSTRACT The Dark Energy Spectroscopic Instrument (DESI) places sub- per cent constraints on measurements of the Baryon Acoustic Oscillation (BAO) scaling parameters from the Ly $\alpha$ forest. However, no systematic error budget stemming from non-linearities in the three-dimensional clustering of the Ly $\alpha$ forest is included in the DESI-Ly $\alpha$ analysis. In this work, we measure the size of the shift of the BAO peak using large Ly $\alpha$ forest mocks produced on the N-body simulation suite AbacusSummit, which adopt the Fluctuating–Gunn–Peterson Approximation (FGPA). Specifically, we measure the Ly $\alpha$ autocorrelation and the Ly $\alpha$-quasar cross-correlation functions. To mitigate the noise, we adopt a linear control variates technique, reducing the error bars by a factor of up to $\sim \sqrt{50}$ on large scales. From the autocorrelation, we detect a small positive shift in radial direction of $\Delta \alpha _{\parallel }= 0.35~{{\ \rm per\ cent}}$ at the 3$\sigma$ level and virtually no shift in the transverse direction, $\alpha _\perp$. From the cross-correlation, we see a similar shift to $\Delta \alpha _\parallel$, albeit with larger error bars, and a small negative shift, $\Delta \alpha _{\perp }=\sim$0.25 per cent, at the 2$\sigma$ level. We also make a connection with the Ly $\alpha$ forest effective field theory (EFT) framework and find that the one-loop EFT power spectrum yields unbiased measurements of the BAO shift parameters in radial and transverse direction for Ly $\alpha$ auto- and the Ly $\alpha$-quasar cross-correlation measurements. When using the one-loop EFT framework, we find that we can recover the BAO parameters without a shift, which has important implications for future Ly $\alpha$ forest analyses based on EFT. This work paves the way for novel full-shape analyses of the currently observing DESI and future surveys such as the PFS, WEAVE-QSO, and 4MOST.

Hadzhiyska, Boryana↗
DOE OSTI2025

Greedy emulators for nuclear two-body scattering

Applications of reduced basis method emulators are increasing in low-energy nuclear physics because they enable fast and accurate sampling of high-fidelity calculations, enabling robust uncertainty quantification. Here, in this paper, we develop, implement, and test two model-driven emulators based on the (Petrov-)Galerkin projection using the prototypical test case of two-body scattering with the Minnesota potential and a more realistic local chiral potential. The high-fidelity scattering equations are solved with the matrix Numerov method, a reformulation of the popular Numerov recurrence relation for solving special second-order differential equations as a linear system of coupled equations. A novel error estimator based on reduced-space residuals is applied to an active learning approach (a greedy algorithm) to choosing training samples (“snapshots”) for the emulator and contrasted with a proper orthogonal decomposition (POD) approach. Both approaches allow for computationally efficient offline-online decompositions, but the greedy approach requires many fewer snapshot calculations. These developments set the groundwork for emulating scattering observables based on chiral nucleon-nucleon and three-nucleon interactions and optical models, where computational speed-ups are necessary for Bayesian uncertainty quantification. Our emulators and error estimators are widely applicable to linear systems.

Bayesian methods↗
DOE OSTI2025

Uncertainty-Guided Prediction Horizon of Phase-Resolved Ocean Wave Forecasting Under Data Sparsity: Experimental and Numerical Evaluation

Accurate short-term wave forecasting is critical for the safe and efficient operation of marine structures that rely on real-time, phase-resolved ocean wave information for control and monitoring purposes (e.g., digital twins). These systems often depend on environmental sensors (e.g., waverider buoys, wave-sensing LIDAR). Challenges arise when upstream sensor data are missing, sparse, or phase-shifted due to drift. This study investigates the performance of two machine learning models, time-series dense encoder (TiDE) and long short-term memory (LSTM), for forecasting phase-resolved ocean surface elevations under varying degrees of data degradation. We introduce the τ-trimming algorithm, which adapts the prediction horizon based on uncertainty thresholds derived from historical forecasts. Numerical wave tank (NWT) and wave basin experiments are used to benchmark model performance under short- and long-term data masking, spatially coarse sensor grids, and upstream phase shifts. Results show under a 50% probability of upstream data loss, the τ-trimmed TiDE model achieves a 46% reduction in error at the most upstream target, compared to 22% for LSTM. Furthermore, phase misalignment in upstream data introduces a near-linear increase in forecast error. Under moderate model settings, a ±3 s misalignment increases the mean absolute error by approximately 0.5 m, while the same error is accumulated at ±4 s using the more conservative approach. These findings inform the design of resilient, uncertainty-aware wave forecasting systems suited for realistic offshore sensing environments.

42 ENGINEERING↗
DOE OSTI2025

Earth-Centered, Earth-Fixed Inertial Navigation System & Error-State Kalman Filter Reference Manual

This is a self-contained reference document that derives the equations necessary to build a combined inertial navigation system and error-state Kalman filter. Coordinate transform, linear time invariant system, inertial sensing, and error-state Kalman filtering theory is built up from first principles. This theory is then leveraged to derive the system equations for two combined inertial navigation system and error-state Kalman filters: (1) a 15-state system modeling white-noise-integrating accelerometer and gyroscope biases, and (2) a 39-state system modeling static and first-order Gauss-Markov accelerometer and gyroscope biases, scale factor errors, and cross-axis sensitivity errors.

42 ENGINEERING↗