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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2020

Verification of an improved equation-free projective integration method for neoclassical plasma-profile evolution in tokamak geometry

A brute-force, long-time gyrokinetic simulation of plasma profile evolution in magnetic fusion devices is not desirable due to large computational resource requirements and a possible accumulation of numerical error. The equation-free projective integration method of Keverekidis et al. [Commun. Math. Sci. 1(4), 715–762 (2003)] is one of the outstanding candidates in projecting micro-scale simulations to a longer timescale. However, its application to tokamak plasma has not been fruitful due to the appearance of spurious transient oscillations in the lifting process, which are present when the kinetic simulations are initialized with a simplified model distribution function and which make the kinetic simulations to deviate from the desired paths. In this work, a kinetically informed lifting algorithm is added to the equation-free projective integration method, which is then verified in the electrostatic gyrokinetic particle-in-cell code XGCa [R. Hager and C. S. Chang, Phys. Plasmas 23, 042503 (2016)] for a neoclassical ion heat transport problem with adiabatic electrons. This new lifting operator is demonstrated to control spurious transients, enabling an over four-times reduction in the overall computing time in the time-evolution of the ion temperature profile in an axisymmetric toroidal plasma. Further reduction in the computing time is found to be limited due to the stability properties of the linear least squares projective integrator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Comparison of Spectroscopic Techniques for Determining the Peroxide Value of 19 Classes of Naturally Aged, Plant-Based Edible Oils

The peroxide value of edible oils is a measure of the degree of oxidation, which directly relates to the freshness of the oil sample. Several studies previously reported in the literature have paired various spectroscopic techniques with multivariate analyses to rapidly determine peroxide values using field portable and process instrumentation; those efforts presented “best-case scenarios” with oils from narrowly defined training and test sets. The purpose of this paper is to evaluate the use of near- and mid-infrared absorption and Raman scattering spectroscopies on oil samples from different oil classes, including seasonal and vendor variations, to determine which measurement technique or combination thereof is best for predicting peroxide values. Following peroxide value assays of each oil class using an established titration-based method, global and global-subset calibration models were constructed from spectroscopic data collected on the 19 oil classes used in this study. Spectra from each optical technique were used to create partial least squares regression calibration models to predict the peroxide value of unknown oil samples. A global peroxide value model based on near-infrared (8 mm optical path length) oil measurements produced the lowest RMSEP (4.9), followed by 24 mm optical path length near infrared (5.1), Raman (6.9) and 50 µm optical path length mid-infrared (7.3). However, it was determined that the Raman RMSEP resulted from chance correlations. Global peroxide value models based on low-level fusion of the NIR (8 and 24 mm optical path length) data and all infrared data produced the same RMSEP of 5.1. Global subset models, based on any of the spectroscopies and olive oil training sets from any class (pure, extra light, extra virgin), all failed to extrapolate to the non-olive oils. However, the near-infrared global subset model built on extra virgin olive oil could extrapolate to test samples from other olive oil classes. This work demonstrates the difficulty of developing a truly global method for determining peroxide value of oils.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Foliar functional traits from imaging spectroscopy across biomes in eastern North America

Summary Foliar functional traits are widely used to characterize leaf and canopy properties that drive ecosystem processes and to infer physiological processes in Earth system models. Imaging spectroscopy provides great potential to map foliar traits to characterize continuous functional variation and diversity, but few studies have demonstrated consistent methods for mapping multiple traits across biomes. With airborne imaging spectroscopy data and field data from 19 sites, we developed trait models using partial least squares regression, and mapped 26 foliar traits in seven NEON (National Ecological Observatory Network) ecoregions (domains) including temperate and subtropical forests and grasslands of eastern North America. Model validation accuracy varied among traits (normalized root mean squared error, 9.1–19.4%; coefficient of determination, 0.28–0.82), with phenolic concentration, leaf mass per area and equivalent water thickness performing best across domains. Across all trait maps, 90% of vegetated pixels had reasonable values for one trait, and 28–81% provided high confidence for multiple traits concurrently. Maps of 26 traits and their uncertainties for eastern US NEON sites are available for download, and are being expanded to the western United States and tundra/boreal zone. These data enable better understanding of trait variations and relationships over large areas, calibration of ecosystem models, and assessment of continental‐scale functional diversity.

Wang, Zhihui↗
DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗
DOE OSTI2023

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗
DOE OSTI2025

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗
DOE OSTI2025

Spatial Signatures of Electron Correlation in Least-Squares Tensor Hypercontraction

Least Squares Tensor Hypercontraction (LS-THC) has received some attention in recent years as an approach to reduce the significant computational costs of wavefunc- tion based methods in quantum chemistry. However, previous work has demonstrated that the LS-THC factorization performs disproportionately worse in the description of wavefunction components (e.g. cluster amplitudes T 2 ) than Hamiltonian compo- nents (e.g. electron repulsion integrals (pq|rs)). This work develops novel theoretical methods to study the source of these errors in the context of the real-space T 2 kernel, and reports, for the first time, the existence of a “correlation feature” in the errors of the LS-THC representation of the “exchange-like” correlation energy EX and T 2 that is remarkably consistent across ten molecular species, three correlated wavefunctions, and four basis sets. This correlation feature portends the existence of a “pair-point kernel” missing in the usual LS-THC representation of the wavefunction, which critically depends upon pairs of grid points situated close to atoms and with inter-pair distances between one and two Bohr radii. These findings point the way for future LS-THC developments to address these shortcomings.

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

Notes on Regression Analysis for Radar Parameter Estimation

A fundamental task of radar, beyond merely detecting a target, is to estimate some parameters associated with it. For example, this might include range, direction, velocity, etc. In any case, multiple measurements, often noisy, need to be processed to yield a ‘best estimate’ of the parameter. A common mathematical method for doing so is called “Regression” analysis. The goal is to minimize the expected squared error in the estimate. Even when alternate algorithms are considered, the least squared-error regression analysis is the benchmark against which alternatives are compared.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Accelerated microwave-assisted synthesis and in situ X-ray scattering of tungsten-substituted vanadium dioxide (V 1-x W x O 2 )

Vanadium dioxide (VO 2 ) has been widely studied due to its metal-insulator phase transition at 68°C, below which it is a semiconducting monoclinic phase, P2 1 /c, and above it is a metallic tetragonal phase, P4 2 /mnm. Substituting vanadium with transition metals allows transition temperature tunability. An accelerated microwave-assisted synthesis for VO 2 and 5d tungsten substituted VO 2 presented herein decreased synthesis time by three orders of magnitude while maintaining phase purity, particle size, and transition character. Tungsten substitution amount was determined using inductively coupled plasma-optical emission spectroscopy. Differential scanning calorimetry, superconducting quantum interference device measurements, and in-situ heating and cooling experiments monitored through synchrotron x-ray diffraction (XRD) confirmed the transition temperature decreased with increased tungsten substitution. Scanning electron microscopy analyzed through the line-intercept method produced an average particle size of 3 – 5 μm. Average structure and local structure phase purity was determined through Rietveld analysis of synchrotron XRD and least-squares refinement of pair-distribution function data.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Robust Tensor Hypercontraction of the Particle–Particle Ladder Term in Equation-of-Motion Coupled Cluster Theory

One method of representing a high-rank tensor as a (hyper-)product of lower-rank tensors is the tensor hypercontraction (THC) method of Hohenstein et al. This strategy has been found to be useful for reducing the polynomial scaling of coupled-cluster methods by representation of a four-dimensional tensor of electron-repulsion integrals in terms of five two-dimensional matrices. Pierce et al. have already shown that the application of a robust form of THC to the particle–particle ladder (PPL) term reduces the cost of this term in couple-cluster singles and doubles (CCSD) from O(N 6 ) to O(N 5 ) with negligible errors in energy with respect to the density-fitted variant. In this work, we have implemented the least-squares variant of THC (LS-THC) which does not require a nonlinear tensor factorization, including the robust form (R-LS-THC), for the calculation of the excitation and electron attachment energies using equation-of-motion coupled cluster methods EOMEE-CCSD and EOMEA-CCSD, respectively. We have benchmarked the effect of the R-LS-THC-PPL approximation on excitation energies using the comprehensive QUEST database and the accuracy of electron attachment energies using the NAB22 database. Here, we find that errors on the order of 1 meV are achievable with a reduction in total calculation time of approximately 5x.

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

Spread Spectrum Time Domain Reflectometry and Steepest Descent Inversion to Measure Complex Impedance

In this paper, we present a method for estimating complex impedances using reflectometry and a modified steepest descent inversion algorithm. We simulate spread spectrum time domain reflectometry (SSTDR), which can measure complex impedances on energized systems for an experimental setup with resistive and capacitive loads. A parametric function, which includes both a misfit function and stabilizer function, is created. The misfit function is a least squares estimate of how close the model data matches observed data. The stabilizer function prevents the steepest descent algorithm from becoming unstable and diverging. Steepest descent iteratively identifies the model parameters that minimize the parametric function. We validate the algorithm by correctly identifying the model parameters (capacitance and resistance) associated with simulated SSTDR data, with added 3 dB white Gaussian noise. With the stabilizer function, the steepest descent algorithm estimates of the model parameters are bounded within a specified range. Furthermore, the errors for capacitance (220pF to 820pF) and resistance (50 Ω to 270 Ω) are < 10%, corresponding to a complex impedance magnitude |R +1/jωC| of 53 Ω to 510 Ω.

14 SOLAR ENERGY↗
DOE OSTI2022

Likelihood Maximization and Moment Matching in Low SNR Gaussian Mixture Models

We derive an asymptotic expansion for the log-likelihood of Gaussian mixture models (GMMs) with equal covariance matrices in the low signal-to-noise regime. The expansion reveals an intimate connection between two types of algorithms for parameter estimation: the method of moments and likelihood optimizing algorithms such as Expectation-Maximization (EM). We show that likelihood optimization in the low SNR regime reduces to a sequence of least squares optimization problems that match the moments of the estimate to the ground truth moments one by one. This connection is a stepping stone towards the analysis of EM and maximum likelihood estimation in a wide range of models. A motivating application for the study of low SNR mixture models is cryo-electron microscopy data, which can be modeled as a GMM with algebraic constraints imposed on the mixture centers. We discuss the application of our expansion to algebraically constrained GMMs, among other example models of interest. © 2022 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Moving Embedded Boundary Approach for the Compressible Navier-Stokes Equations in a Block-Structured Adaptive Refinement Framework

A computational technique has been developed to perform compressible flow simulations involving moving boundaries using an embedded boundary approach within the block-structured adaptive mesh refinement (SAMR) framework of AMReX [1], [91], [92]. We leverage the SAMR capability to obtain quantitatively accurate results whilst using robust, second-order finite volume schemes. A conservative, unsplit, cut-cell approach is utilized and a ghost-cell approach is developed for computing the flux on the moving, embedded boundary faces. A third-order least-squares formulation has been developed to compute the wall velocity gradients, and was found to significantly improve the performance of the solver in terms of the quantitative comparison of surface quantities such as the skin friction coefficient. Various test cases are performed to validate the method, and compared with analytical, experimental, and other numerical results in literature. Inviscid and viscous test cases are performed that span a wide regime of flow speeds - acoustic (harmonically pulsating sphere), smooth flows (expansion fan created by a receding piston) and flows with shocks (shock-cylinder interaction, shock-wedge interaction, pitching NACA 0012 airfoil and shock-cone interaction). A closed system with moving boundaries - an oscillating piston in a cylinder, showed that the percentage error in mass within the system decreases with refinement, demonstrating that the numerical scheme is conservative with grid refinement, but is not discretely conservative. Viscous test cases involve that of a horizontally moving cylinder at Re = 40, an inline oscillating cylinder at Re = 100, and a transversely oscillating cylinder at Re = 185. The judicious use of adaptive mesh refinement with appropriate refinement criteria to capture the regions of interest leads to well-resolved flow features, and good quantitative comparison is observed with the results available in literature.

adaptive refinement↗
DOE OSTI2022

Sensor selection and tool wear prediction with data‐driven models for precision machining

Abstract Estimation of tool wear in precision machining is vital in the traditional subtractive machining industry to reduce processing cost, improve manufacturing efficiency and product quality. In this vein, fusion of time and frequency‐domain features of commonly sensed signals can provide an early indication of tool wear and improve its prediction accuracy for prognostics and health management. This paper presents a data‐driven methodology and a complete tool chain for the inference of precision machining tool wear from fused machine measurements, such as cutting force, power, audio and vibration signals, and quantify the usefulness of each measurement. Indicators of tool wear are extracted from time‐domain signal statistics, frequency‐domain analysis, and time‐frequency domain analysis. Correlation coefficients between the extracted features (indicators) and the tool wear are used to select the most informative features. Principal Component Analysis and Partial Least‐Squares are used to reduce the dimensionality of the feature space. Regression models, including linear regression, support vector regression, Decision tree regression, neural network regression and Gaussian process regression, are used to predict the tool wear using data from a Haas milling machine performing spiral boss face milling. The performance of the regression models based on subsets of sensors validates the preliminary estimates about the saliency of the sensors. The experimental results show that the proposed methods can predict the machine tool wear precisely, with readily available sensor measurements. Neural network and Gaussian process regression were able to achieve good estimates of tool wear at different machine operating conditions. The most informative signal in predicting tool wear was shown to be the vibration signal. Time‐frequency domain features were the most informative features among the combination of features of three domains. In addition, using partial least squares components extracted from the original features of signals led to higher prediction accuracy.

Han, Seulki↗
DOE OSTI2020

Chemometric modeling of power conversion efficiency of organic dyes in dye sensitized solar cells for the future renewable energy

The present study reports chemometric modeling of power conversion efficiency (PCE) of dye sensitized solar cells (DSSCs) using the biggest available data set till date which comprises around 1200 dyes covering 7 chemical classes. To extract the best structural features required for higher PCE, we have developed multiple partial least squares (PLS) quantitative structure-property relationship (QSPR) models for the Triphenylamine, Phenothiazine, Indoline, Porphyrin, Coumarin, Carbazole and Diphenylamine chemical classes using descriptors derived from the best subset selection method followed by selection of best five models in each dataset based on the Mean Absolute Error (MAE) values. The models were validated both internally and externally followed by the consensus predictions employing “Intelligent Consensus Predictor” tool to examine whether the quality of predictions can be improved with the “intelligent” selection of multiple PLS models. The quality of predictions for the respective external sets showed that the consensus models (CM) are better than the individual models (IM) in most of the cases. From the insights of the developed models, we concluded that attributes like a packed structure toward higher conductivity of electrons, auxiliary donor fragment of aromatic tertiary amines, number of thiophenes inducing the bathochromic shift and augmenting the absorption, presence of additional electron donors, enhancement of electron-donating abilities, number of non-aromatic conjugated C(sp 2 ) which helps as conjugation extension units to broaden the absorption and highly conjugated $π$-systems exert positive contributions to the PCE. On the contrary, features negatively contributing to PCE are the followings: fragments which lower the tendency of localized $π–π*$ transition, fragments related to larger volume and surface area of dyes along with hydrophobicity resulting in poor adhesion, fragment RC = N causing dye hydrolysis, steric hindrance for π electronic mobility, fragments enhancing polarity, etc. Finally, the identified features from the best QSPR model of the coumarin dataset was employed in designing of ten more efficient coumarin dyes (predicted %PCE ranging from 8.93 to 10.62) than the existing ones.

14 SOLAR ENERGY↗