Search NASA⌕ Search

SEARCH · Search NASA

Results for “LEAST SQUARES METHOD”

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

Data-Driven Forgetting and Discount Factors for Vehicle Speed Forecasting in Ecological Adaptive Cruise Control

Abstract This paper investigates temporal correlations in human driving behavior using real-world driving to improve speed forecasting accuracy. These correlations can point to a measurement weighting function with two parameters: a forgetting factor for past speed measurements that the vehicle itself drove with, and a discount factor for the speeds of vehicles ahead based on information from vehicle-to-vehicle communication. The developed weighting approach is applied to a vehicle speed predictor using polynomial regression, a prediction method well-known in the literature. The performance of the developed approach is then assessed in both real-world and simulated traffic scenarios for accuracy and robustness. The new weighting method is applied to an ecological adaptive cruise control system, and its influence is analyzed on the prediction accuracy and the performance of the ecological adaptive cruise control in an electric vehicle powertrain model. The results show that the new prediction method improves energy saving from the eco-driving by up to 4.7% compared to a baseline least-square-based polynomial regression. This is a 10% improvement over the constant speed/acceleration model, a conventional speed predictor.

Automation & Control Systems↗
DOE OSTI2021

Joint effects of climate, tree size, and year on annual tree growth derived from tree–ring records of ten globally distributed forests

Tree rings provide an invaluable long-term record for understanding how climate and other drivers shape tree growth and forest productivity. However, conventional tree-ring analysis methods were not designed to simultaneously test effects of climate, tree size, and other drivers on individual growth. This has limited the potential to test ecologically relevant hypotheses on tree growth sensitivity to environmental drivers and their interactions with tree size. Here, we develop and apply a new method to simultaneously model nonlinear effects of primary climate drivers, reconstructed tree diameter at breast height (DBH), and calendar year in generalized least squares models that account for the temporal autocorrelation inherent to each individual tree's growth. We analyze data from 3811 trees representing 40 species at 10 globally distributed sites, showing that precipitation, temperature, DBH, and calendar year have additively, and often interactively, influenced annual growth over the past 120 years. Growth responses were predominantly positive to precipitation (usually over ≥3-month seasonal windows) and negative to temperature (usually maximum temperature, over ≤3-month seasonal windows), with concave-down responses in 63% of relationships. Climate sensitivity commonly varied with DBH (45% of cases tested), with larger trees usually more sensitive. Trends in ring width at small DBH were linked to the light environment under which trees established, but basal area or biomass increments consistently reached maxima at intermediate DBH. Accounting for climate and DBH, growth rate declined over time for 92% of species in secondary or disturbed stands, whereas growth trends were mixed in older forests. These trends were largely attributable to stand dynamics as cohorts and stands age, which remain challenging to disentangle from global change drivers. By providing a parsimonious approach for characterizing multiple interacting drivers of tree growth, our method reveals a more complete picture of the factors influencing growth than has previously been possible.

generalized least squares (GLS)↗
DOE OSTI2022

Simultaneous quantification of uranium( VI ), samarium, nitric acid, and temperature with combined ensemble learning, laser fluorescence, and Raman scattering for real-time monitoring

In this work, laser-induced fluorescence spectroscopy (LIFS), Raman spectroscopy, and a stacked regression ensemble was developed for near real-time quantification of uranium(VI) (1–100 μg mL –1 ), samarium (0–200 μg mL –1 ) and nitric acid (0.1–4 M) with varying temperature (20 °C–45 °C). LIFS applications range from fundamental lab-scale studies to real-time process monitoring at industrial levels, such as nuclear reprocessing applications, provided the phenomena affecting the fluorescence spectrum are accounted for (e.g., absorption, quenching, complexation). Multiple chemometric models were examined and compared to a more traditional multivariate regression approach called partial least squares (PLS). Results obtained on synthetic samples selected using D-optimal experimental design indicated that a stacked regression method, which included ridge regression, random forest, PLS, and an eXtreme gradient boost algorithm, successfully measured uranium(VI) concentrations directly in nitric acid without measuring luminescence lifetimes or standard addition. The top model resulted in percent root-mean-square error of prediction values of 5.2, 1.9, 3.0, and 2.3% for U(VI), Sm 3+ , HNO 3 , and temperature, respectively. The approach may be useful for quantifying fluorescent fission products (e.g., Sm 3+ ) to provide information on burnup of irradiated nuclear fuel. This novel framework reinforces the applicability of LIFS for real-time applications in nuclear fuel cycle applications.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Gradient-informed Hamiltonian Monte Carlo for multicomponent CALPHAD model optimization and uncertainty quantification

CALPHAD model parameter optimization is inherently challenging due to non-smooth objective functions, high-dimensional parameter spaces, and the need for uncertainty quantification (UQ). Traditional weighted nonlinear least squares approaches are computationally efficient but local, whereas black-box global optimizers and ensemble Markov Chain Monte Carlo (MCMC) methods provide broader exploration at substantial computational cost. The objective of this work is to combine the global exploration capability of gradient-informed Hamiltonian Monte Carlo – specifically the No-U-Turn Sampler (NUTS) – with local deterministic refinement using BFGS to efficiently optimize multicomponent CALPHAD models with minimal manual intervention. Analytic gradients are computed via the Jansson derivative framework. The methodology is demonstrated on the Cr—Fe binary system and extended to the Cr—Fe—Ni ternary system with 32 degrees of freedom. For Cr—Fe, NUTS achieves comparable or superior optimality relative to ensemble MCMC while requiring over an order-of-magnitude fewer likelihood evaluations. Parameter uncertainties are quantified through NUTS sampling and propagated to thermodynamic observables using local expansion, demonstrating a novel modular approach that combines binary and ternary parameter subsets without requiring global relaxation. These results establish gradient-informed exploration as a scalable strategy for multicomponent CALPHAD optimization and provide a practical route towards efficient higher-order database development with quantified uncertainty.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Computationally Efficient Learning of Large Scale Dynamical Systems: A Koopman Theoretic Approach

In recent years there has been a considerable drive towards data-driven analysis, discovery and control of dynamical systems. To this end, operator theoretic methods, namely, Koopman operator methods have gained a lot of interest. In general, the Koopman operator is obtained as a solution to a least-squares problem, and as such, the Koopman operator can be expressed as a closed-form solution that involves the computation of Moore-Penrose inverse of a matrix. For high dimensional systems and also if the size of the obtained data-set is large, the computation of the Moore-Penrose inverse becomes computationally challenging. In this paper, we provide an algorithm for computing the Koopman operator for high dimensional systems in a time-efficient manner. We further demonstrate the efficacy of the proposed approach on two different systems, namely a network of coupled oscillators (with state-space dimension up to 2500) and IEEE 68 bus system (with state-space dimension 204 and up to 24,000 time-points).

Sinha, Subhrajit↗
DOE OSTI2022

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗
DOE OSTI2021

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Explainable multi-fidelity Bayesian neural network for distribution system state estimation

Distribution System State Estimation (DSSE) is frequently constrained by limited real-time measurements, the uncertainties introduced by distributed energy resources, and the presence of bad data. To address them, this paper proposes an enhanced Multi-Fidelity Bayesian Neural Network (MFBNN) DSSE approach. A low-fidelity layer based on a Deep Neural Network (DNN) is first pre-trained on pseudo-measurement data to learn fundamental state features. Subsequently, a high-fidelity Bayesian Neural Network (BNN) layer leverages limited but high-quality real-time measurements to refine these features, thereby achieving accurate DSSE. Additionally, the deep SHapley Additive exPlanation (SHAP) is developed to quantify the influence of measurement data on DSSE through dual perspectives of global feature importance and local nodal contributions, establishing a hierarchical explainability framework for machine learning-based DSSE. Comparative studies conducted on the IEEE 13-bus system and a real-world 2135-node system from Dominion Energy demonstrate that the proposed method excels in estimation accuracy, even under situations of high noise levels, bad data, and missing data. Further comparisons with Weighted Least Squares (WLS) and other machine learning-based DSSE approaches verify that the proposed framework offers higher accuracy, improved interpretability, and enhanced robustness.

Bad data↗
DOE OSTI2026

Delayed Neutron Precursor Group Parameter and Spectra Generation from Fast Fission of 235U in SCALE

Delayed neutron precursor (DNP) group data are important for modeling reactor dynamics. Although the data for individual DNPs have been developed over time, the DNP group data present in the Evaluated Nuclear Data Files (ENDF) have not been updated in the past 20 years. In this work, we use SCALE to recreate the Godiva experiment that was used to generate the original DNP group structure for fast fission of 235U. However, each DNP is modeled using up-to-date data, and the results are then converted into a newly updated group structure. This conversion uses an iterative linear least squares solver to minimize chi-squared. The approaches used in this work also enable energy spectrum generation and uncertainty tracking. The method used in this paper for fast 235U fission DNP group structure updating can be applied to different energies and fissile nuclides. Demonstration of the uncertainty tracking in reactor kinetics and dynamics simulations is shown using point reactor kinetics simulations. Results show that there are data discrepancies between the International Atomic Energy Agency database and data used in ORIGEN, which are currently being fixed. Results also show that the proposed method for group spectra generation performs well.

Seifert, Luke [University of Illinois]↗
DOE OSTI2024

Process damping identification using Bayesian learning and time domain simulation

Process damping can provide improved machining productivity by increasing the stability limit at low spindle speeds. However, existing methods for identifying process damping models experimentally require specialized setups and/or multiple cutting tests. While the phenomenon is well known, the modeling challenges limit pre-process parameter selection that leverages the potential increases in material removal rates. This paper proposes a physics-informed Bayesian method that can identify the cutting force and process damping models from a limited set of test cuts without requiring direct measurements of cutting force or vibration. The method uses time domain simulation to incorporate process damping and provide a basis for test selection. Here, new strategies for efficient sampling and dimensionality reduction are applied to lower computation time and minimize the effect of model error. The proposed method is demonstrated and the identified cutting and damping force coefficients are compared to values obtained using machining tests and least-squares fitting.

42 ENGINEERING↗
DOE OSTI2022

Model Choice Metrics to Optimize Profile-QSAR Performance

Predicting molecular activity against protein targets is difficult because of the paucity of experimental data. Approaches like multitask modeling and collaborative filtering seek to improve model accuracy by leveraging results from multiple targets, but are limited because different compounds are measured with different assays, leading to sparse data matrices. Profile-QSAR (pQSAR) 2.0 addresses this problem by fitting a series of partial least squares models for each target, using as features the predictions from single-task models on the remaining targets. Here, this method has been shown to produce better results than single task and multitask models. However, the factors determining the success of pQSAR 2.0 have as yet not been characterized. In this paper we examine the experimental conditions that lead to better pQSAR models. We limit the amount of data available to the method by retraining with decreasing amounts of data and explore the model’s ability to generalize to compounds that have never been assayed. Finally, we look at the properties of training data needed to demonstrate pQSAR improvement.

Biological and medical sciences, Computer science↗
DOE OSTI2023

A Fourth-Order Embedded Boundary Finite Volume Method for the Unsteady Stokes Equations with Complex Geometries

A fourth-order finite volume embedded boundary (EB) method is presented for the unsteady Stokes equations. The algorithm represents complex geometries on a Cartesian grid using EB, employing a technique to mitigate the ``small cut-cell"" problem without mesh modifications, cell merging, or state redistribution. Spatial discretizations are based on a weighted least-squares technique that has been extended to fourth-order operators and boundary conditions, including an approximate projection to enforce the divergence-free constraint. Solutions are advanced in time using a fourth-order additive implicit-explicit Runge-Kutta method, with the viscous and source terms treated implicitly and explicitly, respectively. Formal accuracy of the method is demonstrated with several grid convergence studies, and results are shown for an application with a complex bio-inspired material. In conclusion, the developed method achieves fourth-order accuracy and is stable despite the pervasive small cells arising from complex geometries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗
DOE OSTI2026

Efficient data-driven regression for reduced-order modeling of spatial pattern formation

We present an efficient data-driven regression approach for constructing reduced-order models (ROMs) of reaction-diffusion systems exhibiting pattern formation. The ROMs are learned non-intrusively from available training data of physically accurate numerical simulations. The method can be applied to general nonlinear systems through the use of polynomial model form, while not requiring knowledge of the underlying physical model, governing equations, or numerical solvers. The process of learning ROMs is posed as a low-cost least-squares problem in a reduced-order subspace identified via Proper Orthogonal Decomposition (POD). Numerical experiments on classical pattern-forming systems–including the Schnakenberg and Mimura–Tsujikawa models–demonstrate that higher-order surrogate models significantly improve prediction accuracy while maintaining low computational cost. The proposed method provides a flexible, non-intrusive model reduction framework, well suited for the analysis of complex spatio-temporal pattern formation phenomena.

Data-driven modeling↗
DOE OSTI2025

Projection-based multifidelity linear regression for data-scarce applications

Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. Here, the proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2% – 12% improvement in median accuracy and a higher R 2 score relative to single-fidelity methods at comparable computational cost.

data augmentation↗
DOE OSTI2021

Fast and Non-Destructive Determination of Water Content in Ionic Liquids at Varying Temperatures by Raman Spectroscopy and Multivariate Regression Analysis

Imidazolium acetate ionic liquids (ILs) have been utilized as promising solvents in many applications that involve varying water content and temperature. These experimental variables affect the anion-cation intermolecular interactions, which in turn influence the performance of the ILs in these applications. Here, this paper shows Raman spectroscopy can be used as an operando method to measure water content in IL solvents when simultaneous temperature changes may occur. The Raman spectra of 1-alkyl-3-methylimidazolium acetate ILs (alkyl chain length n = 2, 4, 6, 8) with varying water content (from 0.028 to 0.899 water mole fraction) and temperature (from 78.1 K to 423.1 K) were measured. Increasing the water content or decreasing the temperature of the tested ILs weakens the anion-cation intermolecular interactions. The water content of these ILs can be quantified even in conditions when the temperature is changing using Raman spectroscopy combined with multivariate regression analysis, including principal component regression (PCR), partial-least-squares regression (PLSR), and artificial neural networks (ANNs). The ANN model combined with partial-least-squares (PLS) achieves the highest prediction accuracy of water content in ILs at varying temperatures (RMSECV = 0.017, R 2 CV = 99.1%, RMSEP = 0.019, R 2 P = 98.8%, RPD = 8.93). Raman spectroscopy provides a potential fast non-destructive operando method to monitor the water content of ILs even in applications when the temperature may be simultaneously altered; this information can lead to the optimized use of these ILs in many applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Dynamic calibration of differential equations using machine learning, with application to turbulence models

We present a methodology for calibration of parametric ordinary and partial differential equation models, using off-the-shelf software for back-propagation in Neural Networks (NN). As a prototypical example, we consider calibration of a Reynolds-averaged Navier-Stokes (RANS) turbulence closure model, against ground truth data from direct numerical simulations (DNS) of two different turbulent flows. Numerical time integration is represented as a custom NN, where only the RANS model parameters are trainable. A loss function is defined to quantify the mismatch between the NN prediction and the ground truth over a predefined, finite time integration window. This loss function is then minimized using a gradient descent method utilizing the back-propagation algorithm. Furthermore, this dynamic approach to training is to be contrasted with a static approach, wherein a least square regression estimate for parameters is obtained in the limit of an infinitesimal time integration window. In a first test of static and dynamic approaches against ground truth data generated by the model, the former proves to be significantly faster and more accurate than the latter at recovering the parameters. When both calibration approaches are tested against DNS data, for which it is known that the model cannot achieve a perfect fit, the static approach yields a good prediction only for short times, while the dynamic approach results in physical and stable predictions over the entire integration window. After optimization of the dynamic approach for time step, spatial resolution, stability, and physics-based constraints, we obtain a 50% improvement of outcomes over those obtained from the existing, manually calibrated set of parameters, demonstrating the merits of this systematic and automated procedure.

97 MATHEMATICS AND COMPUTING↗