Search NASA⌕ Search

SEARCH · Search NASA

Results for “least squares solution”

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

Identification of High-Frequency Transverse Acoustic Modes in Multi-Nozzle Can Combustors

Abstract High frequency thermoacoustic instabilities are problematic for lean-premixed gas turbines. Identifying which acoustic mode is being excited is important, in that it provides insight into potential mitigation measures and mechanical stress/life. However, the frequency spacing between modes becomes quite close for high frequency instabilities in a can combustor. This makes it difficult to distinguish between the modes (e.g., the first transverse mode vs. a higher order axial/mixed mode) based upon frequency calculations alone, which inevitably have uncertainties in boundary conditions, temperature profiles, and combustion response. This paper presents a methodology to simultaneously identify the acoustic mode shapes in the axial and azimuthal directions from acoustic pressure measurements. Multiple high temperature pressure transducers, located at distinct axial and azimuthal positions, are flush mounted in the combustor wall. The measured pressure oscillations from each sensor are then used to reconstruct the pressure distributions by using a least squares method in conjunction with a solution of a three dimensional wave equation. In order to validate the methodology, finite element method (FEM) calculations with estimated post-flame temperature is used to provide the candidate frequencies and corresponding mode shapes. The results demonstrate the reconstructed mode shapes and standing/spinning character of transverse waves, as well as the associated frequencies, both of which are consistent with the FEM predictions. Nodal line location was also extracted from the experimental data during the instabilities in the pressure data.

Kim, J.↗
DOE OSTI2021

Measuring Nd(III) Solution Concentration in the Presence of Interfering Er(III) and Cu(II) Ions: A Partial Least Squares Analysis of Ultraviolet–Visible Spectra

Optical spectroscopy is a powerful characterization tool with applications ranging from fundamental studies to real-time process monitoring. However, it can be difficult to apply to complex samples that contain interfering analytes which are common in processing streams. Multivariate (chemometric) analysis has been examined for providing selectivity and accuracy to the analysis of optical spectra and expanding its potential applications. Here we will discuss chemometric modeling with an in-depth comparison to more simplistic analysis approaches and outline how chemometric modeling works while exploring the limits on modeling accuracy. Understanding the limitations of the chemometric model can provide better analytical assessment regarding the accuracy and precision of the analytical result. This will be explored in the context of UV–Vis absorbance of neodymium (Nd 3+ ) in the presence of interferents, erbium (Er 3+ ) and copper (Cu 2+ ) under conditions simulating the liquid–liquid extraction approach used to recycle plutonium (Pu) and uranium (U) in used nuclear fuel worldwide. Finally, the selected chemometric model, partial least squares regression, accurately quantifies Nd 3+ with a low percentage error in the presence of interfering analytes and even under conditions that the training set does not describe.

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

Error Estimates of Residual Minimization Using Neural Networks for Linear PDES

We propose an abstract framework for analyzing the convergence of least-squares methods based on residual minimization when feasible solutions are neural networks. With the norm relations and compactness arguments, we derive error estimates for both continuous and discrete formulations of residual minimization in strong and weak forms. The formulations cover recently developed physicsinformed neural networks based on strong and variational formulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantifying neptunium oxidation states in nitric acid through spectroelectrochemistry and chemometrics

Controlled-potential in situ thin-layer spectropotentiometry was leveraged to generate visible/near-infrared (VIS/NIR) absorption spectral data sets for the development of chemometric models to quantify Np(III/IV/V/VI) oxidation states in HNO 3 . This technology would be valuable in laboratory studies and when monitoring process solutions to guide feed adjustments for radiochemical separations—the performance of which depends on oxidation state. This approach successfully isolated and stabilized Np species in pure (~99%) oxidation states without compromising solution optical properties. Multivariate curve resolution–alternating least squares models were evaluated to resolve spectral and component concentrations from a scan that sequentially produced Np(VI), Np(V), Np(IV), and Np(III) spectra with mixtures of two valences at a time. Although it provided a useful approximation, the method was not able to quantitively resolve each component likely because of rotational ambiguity. Additionally, partial least squares regression models were built from artificial and electrochemically generated VIS/NIR spectral training sets to study the effect of interionic interactions on spectral characteristics. Models built with true Bi-chemical mixtures of coexisting Np oxidation states and spectra generated from additive combinations of pure end points had similar prediction performance. This methodology can be used to directly quantify Np concentration and the ratio of Np oxidation states and other actinides in remote settings such as hot cells.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2026

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗
DOE OSTI2020

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗
DOE OSTI2022

A mixed, unified forward/inverse framework for earthquake problems: fault implementation and coseismic slip estimate

SUMMARY We introduce a new finite-element (FE) based computational framework to solve forward and inverse elastic deformation problems for earthquake faulting via the adjoint method. Based on two advanced computational libraries, FEniCS and hIPPYlib for the forward and inverse problems, respectively, this framework is flexible, transparent and easily extensible. We represent a fault discontinuity through a mixed FE elasticity formulation, which approximates the stress with higher order accuracy and exposes the prescribed slip explicitly in the variational form without using conventional split node and decomposition discrete approaches. This also allows the first order optimality condition, that is the vanishing of the gradient, to be expressed in continuous form, which leads to consistent discretizations of all field variables, including the slip. We show comparisons with the standard, pure displacement formulation and a model containing an in-plane mode II crack, whose slip is prescribed via the split node technique. We demonstrate the potential of this new computational framework by performing a linear coseismic slip inversion through adjoint-based optimization methods, without requiring computation of elastic Green’s functions. Specifically, we consider a penalized least squares formulation, which in a Bayesian setting—under the assumption of Gaussian noise and prior—reflects the negative log of the posterior distribution. The comparison of the inversion results with a standard, linear inverse theory approach based on Okada’s solutions shows analogous results. Preliminary uncertainties are estimated via eigenvalue analysis of the Hessian of the penalized least squares objective function. Our implementation is fully open-source and Jupyter notebooks to reproduce our results are provided. The extension to a fully Bayesian framework for detailed uncertainty quantification and non-linear inversions, including for heterogeneous media earthquake problems, will be analysed in a forthcoming paper.

58 GEOSCIENCES↗
DOE OSTI2023

Learning Distribution Grid Topologies: A Tutorial

Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. Here this tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Multivariate Curve Resolution (MCR) using Principal Components Inputs and Rigorous Equality and Inequality Constraints

This MATLAB pseudocode perform multivariate curve resolution (MCR) using PCA scores & loadings of data as inputs. It employs rigorous least squares equality and inequality constraints for all elements in the solution factor matrices. It also can be used to perform nonnegative matrix factorization. SAND2020-12650 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Van Benthem, Mark↗
DOE OSTI2023

A fast two-stage algorithm for non-negative matrix factorization in smoothly varying data

This article reports the study of algorithms for non-negative matrix factorization (NMF) in various applications involving smoothly varying data such as time or temperature series diffraction data on a dense grid of points. Utilizing the continual nature of the data, a fast two-stage algorithm is developed for highly efficient and accurate NMF. In the first stage, an alternating non-negative least-squares framework is used in combination with the active set method with a warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. Furthermore, the results demonstrate the advantage of the algorithm in finding high-precision solutions.

interior point method↗
DOE OSTI2024

BioXTAS RAW 2 : new developments for a free open-source program for small-angle scattering data reduction and analysis

BioXTAS RAW is a free open-source program for reduction, analysis and modelling of biological small-angle scattering data. Here, the new developments in RAW version 2 are described. These include improved data reduction using pyFAI ; updated automated Guinier fitting and D max finding algorithms; automated series ( e.g. size-exclusion chromatography coupled small-angle X-ray scattering or SEC-SAXS) buffer- and sample-region finding algorithms; linear and integral baseline correction for series; deconvolution of series data using regularized alternating least squares ( REGALS ); creation of electron-density reconstructions using electron density via solution scattering ( DENSS ); a comparison window showing residuals, ratios and statistical comparisons between profiles; and generation of PDF reports with summary plots and tables for all analysis. Furthermore, there is now a RAW API, which can be used without the graphical user interface (GUI), providing full access to all of the functionality found in the GUI. In addition to these new capabilities, RAW has undergone significant technical updates, such as adding Python 3 compatibility, and has entirely new documentation available both online and in the program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗
DOE OSTI2025

Remote quantification of Cm(III) and HNO 3 by fluorescence spectroscopy and chemometrics

A unique approach to remotely quantify Cm(III) (0–100 µg mL −1 ) in HNO 3 (1–12 M) using steady-state laser fluorescence spectroscopy and multivariate regression models was developed. Photoluminescence is amenable to remote measurements using fiber-optic cables and is sensitive to numerous lanthanide and actinide species. In-line measurements can provide feedback to support complex processing in harsh environments (e.g., hot cells) to help guide and optimize radiochemical separations. In this work, Cm(III) spectra were acquired remotely in a glove box as a function of HNO 3 concentration to better understand spectral characteristics and evaluate the utility of multivariate regression models in this system. Furthermore, the Cm(III) fluorescence peak shape, width, position, and intensity changed significantly as a function of HNO 3 concentration, likely because of the displacement of emission quenching inner-sphere water molecules and complexation with nitrate ions. Despite significant covariance and nonlinearity in the data, a D-optimal design strategy successfully minimized training set sample size and was used to build effective partial least squares regression models for Cm(III) and HNO 3 concentrations without a priori knowledge of solution conditions. Chemometrics for modeling complex fluorescence spectra are promising and may find widespread applicability for online analysis in numerous chemical systems found in the nuclear field.

Actinide↗
DOE OSTI2022

Iterative subspace algorithms for finite-temperature solution of Dyson equation

One-particle Green’s functions obtained from the self-consistent solution of the Dyson equation can be employed in the evaluation of spectroscopic and thermodynamic properties for both molecules and solids. However, typical acceleration techniques used in the traditional quantum chemistry self-consistent algorithms cannot be easily deployed for the Green’s function methods because of a non-convex grand potential functional and a non-idempotent density matrix. Moreover, the optimization problem can become more challenging due to the inclusion of correlation effects, changing chemical potential, and fluctuations of the number of particles. In this paper, we study acceleration techniques to target the self-consistent solution of the Dyson equation directly. We use the direct inversion in the iterative subspace (DIIS), the least-squared commutator in the iterative subspace (LCIIS), and the Krylov space accelerated inexact Newton method (KAIN). We observe that the definition of the residual has a significant impact on the convergence of the iterative procedure. Based on the Dyson equation, we generalize the concept of the commutator residual used in DIIS and LCIIS and compare it with the difference residual used in DIIS and KAIN. The commutator residuals outperform the difference residuals for all considered molecular and solid systems within both GW and GF2. For a number of bond-breaking problems, we found that an easily obtained high-temperature solution with effectively suppressed correlations is a very effective starting point for reaching convergence of the problematic low-temperature solutions through a sequential reduction of temperature during calculations.

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

Simultaneous determination of electrical conductivity and thickness of nonmagnetic metallic foils using two-sided multifrequency eddy current techniques

Here, in this paper, we describe a simple method for performing multifrequency eddy current characterization of free-standing uniform-thickness metallic foils using a forked inductive coil arrangement. The method involves measuring the mutual inductance between two coils when a foil is present between the coils, and when it is not present; the ratio of these mutual inductances is compared with an analytical solution, and foil conductivity, thickness, and sheet resistance are simultaneously estimated using numerical inversion and least-squares fitting. This method was used to characterize 34 non-ferrous metallic samples with thicknesses between 50 and 640 μm and with conductivities between 0.8 × 10 7 and 5.8 × 10 7 S/m. The estimated thicknesses from eddy current characterization agreed well with those measured using confocal optical techniques; the two approaches agreed to within 1 μm for samples that were thinner than 200 μm, and to within 0.5% for samples that had a thickness of 200 μm or greater. The estimated conductivities from eddy current characterization were in close agreement with expected values, given knowledge of the materials used. A particular strength of this approach is that the instrumentation needed is broadly available in research and development laboratories and the associated fixturing is easy to manufacture and assemble. A calibration procedure is described that can be used to reduce errors from geometric uncertainties. This calibration requires a sample that has only a known conductivity or thickness; both do not need to be known. The method described herein is likely extensible to conductivities and thickness well outside the ranges measured as part of this work.

47 OTHER INSTRUMENTATION↗
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 OSTI2025

A self-consistent electrostatic electrified shallow water model for charged liquid surface dynamics

The dynamics of an electrified liquid surface are investigated using a shallow water model that is self-consistently coupled with an electrostatic solver. To account for the spatiotemporal variation of a curved liquid surface, the electric field on curved surfaces is calculated by solving a two-dimensional electrostatic equation using the weighted least squares (WLSQ) interpolation method. First, the WLSQ implementation is verified with analytical theory obtained from a Laplace solution assuming a half-cylinder liquid surface profile. Then, the coupled electrified shallow water model is used to study the instability of liquid surface perturbation as a function of the potential drop between an electrode and conducting liquid, surface tension, and gravity. We present a linear dispersion theory of liquid surface instability for long-wavelength perturbations, including the effects of liquid viscosity. Furthermore, the effects of multiple sinusoidal surface perturbations on the electrified liquid surface instability are investigated.

Capillary waves↗