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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Theoretical study of the CO 2 –O 2 van der Waals complex: potential energy surface and applications

A four-dimensional-potential energy surface (4D-PES) of the atmospherically relevant carbon dioxide–oxygen molecule (CO 2 –O 2 ) van der Waals complex is mapped using the ab initio explicitly correlated coupled cluster method with single, double, and perturbative triple excitations (UCCSD(T)-F12b), and extrapolation to the complete basis set (CBS) limit using the cc-pVTZ-F12/cc-pVQZ-F12 bases and the l –3 formula. An analytic representation of the 4D-PES was fitted using the method of interpolating moving least squares (IMLS). These calculations predict that the most stable configuration of CO 2 –O 2 complex corresponds to a planar slipped-parallel structure with a binding energy of V ~ –243 cm –1 . Another isomer is found on the PES, corresponding to a non-planar cross-shaped structure, with V ~ –218 cm –1 . The transition structure connecting the two minima is found at V ~ –211 cm –1 . We also performed comparisons with some CO 2 –X van der Waals complexes. Moreover, we provide a SAPT analysis of this molecular system. Then, we discuss the complexation induced shifts of CO 2 and O 2 . Afterwards, this new 4D-PES is employed to compute the second virial coefficient including temperature dependence. A comparison between quantities obtained in our calculations and those from experiments found close agreement attesting to the high quality of the PES and to the importance of considering a full description of the anisotropic potential for the derivation of thermophysical properties of CO 2 –O 2 mixtures.

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

Nuclear Data Adjustment for Nonlinear Applications in the OECD/NEA WPNCS SG14 Benchmark—A Bayesian Inverse UQ-Based Approach for Data Assimilation

The Organisation for Economic Co-operation and Development Working Party on Nuclear Criticality Safety has proposed a benchmark exercise to assess the performance of current nuclear data adjustment techniques applied to nonlinear applications and experiments with low correlation to applications. This work introduces Bayesian inverse uncertainty quantification (IUQ) employing scientific machine learning surrogate models as a method for nuclear data adjustments in this benchmark, and compares IUQ to the more traditional methods of generalized linear least squares (GLLS) and Monte Carlo Bayes (MOCABA). Posterior predictions from IUQ showed agreement with GLLS and MOCABA for linear applications. Here, when comparing GLLS, MOCABA, and IUQ posterior predictions to computed model responses using adjusted parameters, we observe that the GLLS predictions failed to replicate the computed response distributions for nonlinear applications, while MOCABA showed near agreement, and IUQ used the computed model responses directly. We also discuss observations on why experiments with low correlation to applications can be informative to nuclear data adjustments and identify some properties useful in selecting experiments for inclusion in nuclear data adjustment. Performance in this benchmark indicates potential for Bayesian IUQ in nuclear data adjustments.

Bayesian calibration↗
DOE OSTI2022

Dynamic Differential Image Circle Diameter Measurement Precision Assessment: Application to Burning Droplets

Dynamic measurement precision assessment has been achieved for a differential circle measurement application. Differential circle diameter measurement, in image analysis, typically requires fitting a circle model that optimizes for image distortions, defects or occlusions. The differential task occurs when precise measurements of diameter change are required given object size variation with time. An automated system was designed to provide diameter measurements and associated measurement precision of images of a fuel droplet undergoing combustion in zero gravity for the FLEX-2 dataset. An image gradient-based, least-squares boundary point fitting method to a circle or ellipse model is used for diameter measurement. The presence of soot aggregates poses significant challenges for diameter measurements when it occludes part of the droplet boundary. The precision of the diameter measurements depends upon the image quality. Using synthetic image simulations that model the soot behavior, we developed a model based on image quality measures that assesses the measurement precision for each individual diameter measurement. Thus, diameter measurements with precision assessments were made available for follow-up scientific analysis. As a result, the algorithm's success rate for measurable runs was 98%. In cases of limited occlusion, a measurement precision of ±0.2 pixels for the FLEX-2 dataset was achieved.

42 ENGINEERING↗
DOE OSTI2021

Spherical fitting for oscilloscope film trace reading

This report describes a spherical fitting algorithm that can be used for estimating the oscilloscope film trace coordinates. This algorithm was adopted from a least square algebraic spherical fitting algorithm developed by the author earlier for photovoltaic velocimetry applications. Preliminary assessment suggests that the algorithm may be used for optimizing the coordinates manually digitized by the user, or may be used as an uncertainty estimator for the user’s film reading uncertainties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Maximum Likelihood Estimation: Some Basics

The maximum likelihood estimation is a general estimation procedure. It is often compared to estimation procedures like the ordinary least squares regression or generalized method of moments, to name a few. We discuss some basics about the maximum likelihood estimation, its advantages and disadvantages, and provide an example application to a gamma distribution function.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Maximum Likelihood Estimation: Some Basics

The maximum likelihood estimation is a general estimation procedure. It is often compared to estimation procedures like the ordinary least squares regression or generalized method of moments, to name a few. We discuss some basics about the maximum likelihood estimation, its advantages and disadvantages, and provide an example application to a gamma distribution function.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers

We introduce a multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) method to simultaneously estimate multiple eigenvalues of a quantum Hamiltonian on early fault-tolerant quantum computers. Our theoretical analysis demonstrates that the algorithm exhibits Heisenberg-limited scaling in terms of circuit depth and total cost. Notably, the proposed quantum circuit utilizes just one ancilla qubit, and with appropriate initial state conditions, it achieves significantly shorter circuit depths compared to circuits based on quantum phase estimation (QPE). Numerical results suggest that compared to QPE, the circuit depth can be reduced by around two orders of magnitude under several settings for estimating ground-state and excited-state energies of certain quantum systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Nuclear Data Adjustment for Nonlinear Applications in the OECD/NEA WPNCS SG14 Benchmark -- A Bayesian Inverse UQ-based Approach for Data Assimilation

The Organization for Economic Cooperation and Development (OECD) Working Party on Nuclear Criticality Safety (WPNCS) proposed a benchmark exercise to assess the performance of current nuclear data adjustment techniques applied to nonlinear applications and experiments with low correlation to applications. This work introduces Bayesian Inverse Uncertainty Quantification (IUQ) as a method for nuclear data adjustments in this benchmark, and compares IUQ to the more traditional methods of Generalized Linear Least Squares (GLLS) and Monte Carlo Bayes (MOCABA). Posterior predictions from IUQ showed agreement with GLLS and MOCABA for linear applications. When comparing GLLS, MOCABA, and IUQ posterior predictions to computed model responses using adjusted parameters, we observe that GLLS predictions fail to replicate computed response distributions for nonlinear applications, while MOCABA shows near agreement, and IUQ uses computed model responses directly. We also discuss observations on why experiments with low correlation to applications can be informative to nuclear data adjustments and identify some properties useful in selecting experiments for inclusion in nuclear data adjustment. Performance in this benchmark indicates potential for Bayesian IUQ in nuclear data adjustments.

FOS: Computer and information sciences↗
DOE OSTI2020

Meshfree methods on manifolds for hydrodynamic flows on curved surfaces: A Generalized Moving Least-Squares (GMLS) approach

We utilize generalized moving least squares (GMLS) to develop meshfree techniques for discretizing hydrodynamic flow problems on manifolds. We use exterior calculus to formulate incompressible hydrodynamic equations in the Stokesian regime and handle the divergence-free constraints via a generalized vector potential. This provides less coordinate-centric descriptions and enables the development of efficient numerical methods and splitting schemes for the fourth-order governing equations in terms of a system of second-order elliptic operators. Using a Hodge decomposition, we develop methods for manifolds having spherical topology. We show the methods exhibit high-order convergence rates for solving hydrodynamic flows on curved surfaces. The methods also provide general high-order approximations for the metric, curvature, and other geometric quantities of the manifold and associated exterior calculus operators. The approaches also can be utilized to develop high-order solvers for other scalar-valued and vector-valued problems on manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection

Deep neural networks (DNNs) have achieved state-of-the-art performance across a variety of traditional machine learning tasks, e.g., speech recognition, image classification, and segmentation. The ability of DNNs to efficiently approximate high-dimensional functions has also motivated their use in scientific applications, e.g., to solve partial differential equations and to generate surrogate models. In this paper, we consider the supervised training of DNNs, which arises in many of the above applications. We focus on the central problem of optimizing the weights of the given DNN such that it accurately approximates the relation between observed input and target data. Devising effective solvers for this optimization problem is notoriously challenging due to the large number of weights, nonconvexity, data sparsity, and nontrivial choice of hyperparameters. To solve the optimization problem more efficiently, we propose the use of variable projection (VarPro), a method originally designed for separable nonlinear least-squares problems. Our main contribution is the Gauss--Newton VarPro method (GNvpro) that extends the reach of the VarPro idea to nonquadratic objective functions, most notably cross-entropy loss functions arising in classification. These extensions make GNvpro applicable to all training problems that involve a DNN whose last layer is an affine mapping, which is common in many state-of-the-art architectures. In our four numerical experiments from surrogate modeling, segmentation, and classification, GNvpro solves the optimization problem more efficiently than commonly used stochastic gradient descent (SGD) schemes. Finally, GNvpro finds solutions that generalize well, and in all but one example better than well-tuned SGD methods, to unseen data points.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Physics-Informed Deep Neural Network Method for Limited Observability State Estimation

The precise knowledge regarding the state of the power grid is important in order to ensure optimal and reliable grid operation. Specifically, knowing the state of the distribution grid becomes increasingly important as more renewable energy sources are connected directly into the distribution network, increasing the fluctuations of the injected power. In this paper, we consider the case when the distribution grid becomes partially observable, due to for example cyber attacks, and the state estimation problem is under-determined. We present a new methodology that leverages a deep neural network (DNN) to estimate the grid state. The standard DNN training method is modified to explicitly incorporate the physical information of the grid topology and line/shunt admittance. We show that our method leads to a superior accuracy of the estimation when compared to the case when no physical information is provided. Finally, we compare the performance of our method to the standard state estimation approach, which is based on the weighted least squares with pseudo-measurements, and show that our method performs significantly better with respect to the estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Regularizing least squares quantum state tomography with classical shadows

Classical shadows herald remarkable opportunities for resource-efficient quantum estimation. Although superficially disconnected from traditional inference methods, we show how classical shadows fit under a larger umbrella of least squares regularization, revealing tradeoffs with related methods.

Zhu, Zhihui [Ohio State University]↗
DOE OSTI2020

Online Parameter Estimation Methods for Adaptive Cruise Control Systems

Modeling Adaptive Cruise Control (ACC) vehicles enables the understanding of the impact of these vehicles on traffic flow. In this work, two online methods are used to provide real time system identification of ACC enabled vehicles. The first technique is a recursive least squares (RLS) approach, while the second method solves a nonlinear joint state and parameter estimation problem via particle filtering (PF). We provide a parameter identifiability analysis for both methods to analytically show that the model parameters are not identifiable using equilibrium driving. The accuracy and computational runtime of the online methods are compared to a commonly used offline simulation-based optimization (i.e., batch optimization) approach. The methods are tested on synthetic data as well as on empirical data collected directly from a 2019 model year ACC vehicle using data from sensors that are part of the stock ACC system. The online methods are scalable and provide comparable accuracy to the batch method. RLS runs in real time and is two orders of magnitude faster than the batch method for modest sized (e.g., 15 min) datasets. The particle filter also runs in real- time, and is also suitable in streaming applications in which the datasets can grow arbitrarily large.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Quasielastic least-squares reverse time migration of PS reflections

Conventional analysis of amplitude variation with offset for elastic PS reflections is based on analytical reflection coefficients in a layered medium, and wave-equation-based PS migration is mainly used to produce a structural image. To overcome this problem, we have developed a least-squares reverse time migration (LSRTM) method for elastic PS reflections based on a quasielastic wave equation. Here, the quasielastic wave equation can accurately model PS reflections with elastic amplitudes under the first-order Born approximation. Our LSRTM method inverts for perturbations of the S-wave velocity and density by minimizing the L 2 norm of the difference between recorded and predicted PS reflections modeled using a quasielastic wave equation. We refer to our new method as quasielastic LSRTM of PS reflections. Numerical tests on synthetic and field data indicate that our method can properly handle the amplitudes of elastic PS reflections and provides an accurate estimate of the perturbations of S-wave velocity and density. Extending the method to the 3D case is not straightforward and might require incorporating certain PS data processing techniques into the inversion itself.

58 GEOSCIENCES↗
DOE OSTI2022

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗