Search NASA⌕ Search

SEARCH · Search NASA

Results for “extended least squares”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Application of automated iterative target detection for standoff hyperspectral imaging

The utility of hyperspectral imaging (HSI) has been well established for a wide array of applications but has generated a need for automated screening of high volumes of large HSI cubes. We report two important automated algorithms for more efficient standoff processing: atmospheric correction and target detection. The atmospheric correction method is based on a fast asymmetric least squares approach that is applied on a pixel-by-pixel basis. Here, the correction can be applied to entire images without manually identifying regions of interest and utilizes only in-scene information, no ancillary modeling of the atmosphere is required. An iterative target detection approach is also introduced which demonstrates faster speeds relative to moving window approaches. The target detection algorithm classifies each pixel as true target detections, near target detections, clutter, and no-calls. The algorithms were tested on forty images of twenty-two solid mineral targets placed at a 14-meter standoff distance allowing general observations on expected detection performance for a variety of minerals. In addition to identifying anomalous pixels, the inclusion of “no-calls” reduced the number of false detections significantly.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Application of Partial Least Squares Approaches to Pyroprocessing ER Data

Multivariate approaches show promise for application to process monitoring for safeguards of pyroprocessing. Past MPACT work explored the application of Principal Component Analysis (PCA) to detect off-normal conditions in pyroprocessing electrorefiner (ER) data from in the Hot Fuel Examination Facility (HFEF) at Idaho National Laboratory (INL) known as the Scalable Pyrochemical Recycling testbed (SPyRe) ER. PCA, however, does not consider the output variables. In FY24, multivariate analysis was extended from PCA to Partial Least Squares (PLS) analysis. PLS maximizes the variance between both the input signals and output variables. In the case of this work, PLS was applied in two different manners: Predictive PLS and Discriminant PLS. Predictive PLS maximizes the covariance between the process variables of the ER and the measured U concentration from in-situ voltammetry. Discriminant PLS maximizes the covariance between the process variables and a set of training process “states” such as known off-normal conditions. By projecting into the latent variable space in PLS, the process variables can be regressed onto the outputs and predictions can be made for new data sets. In this work, by applying predictive PLS, a penalized non-linear PLS approach was able to make predictions of concentration based on test and training data and detect when operations were off-normal. However, the predictive PLS does not classify the signals to which off-normal operations are attributable. Discriminant PLS can be used to classify off-normal operations but is inadequate to properly classify specific off-normal classes like power supply faults when the Discriminant PLS model is only specifically trained to detect that off-normal class. When all faults are trained against the observation data, all three operational classes are accurately classified and distinguished. Thus, future application of latent variable techniques should not select any given method, but should use a mixture of PCA, Predictive PLS, and Discriminant PLS.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
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

XRF-XFS-XAS-Auto v1.0 - Beta release

This software allows to analyze XRF maps, XFS spectra and XAS spectra collected at the Advanced Light Source's Beamline 10.3.2. Features include: 1) XRF maps: - process XRF maps, all elemental maps are saved as bmp automatically and labeled with the incident energy used, the scale bar is also labeled and can be controlled. - XRF elemental correlation plots, save the correlation plots automatically - Extract single or multiple transects in XRF maps on one or several regions of interest, each transect profile is numbered and saved in a corresponding folder, along with the corresponding maps showing transect location. 2) XFS spectra - save in log10 scale the XFS spectra, either a single or multiple files all at once. The files are saved as .bmp. - XFS spectra are labeled according to tabulated fluorescence emission lines. 3) XAS spectra - allows to plot individual scalers in the raw data. - allows calibration of the spectra using an Io internal glitch present in all spectra and performing 1st derivative. - Least-square linear combination fitting of XANES or extended XANES spectra using a database of standards using 1, 2 or 3 components maximum. It also provides the 5 top combinations and provide the user for the possibility of saving the 2nd, 3rd, 4th and 5th best combinations in addition to the best one. The processed spectra (pre-edge background substracted, post-edge normalized), the fits and residuals are automatically saved. A table of the component, with fit% and SSN is provided and saved automatically as well.

Fakra, Sirine↗
DOE OSTI2023

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗
DOE OSTI2021

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Extended Galerkin Neural Network Approximation of Singular Variational Problems with Error Control

We present extended Galerkin neural networks, a variational framework for approximating general boundary value problems (BVPs) with error control. The main contributions of this work are (1) a rigorous theory guiding the construction of new weighted least squares variational formulations suitable for use in neural network approximation of general BVPs, and (2) an “extended” feedforward network architecture which incorporates and is even capable of learning singular solution structures, thus greatly improving approximability of singular solutions. Furthermore, numerical results are presented for several problems, including steady Stokes flow around reentrant corners and in convex corners with Moffatt eddies in order to demonstrate efficacy of the method.

a posteriori error estimate↗
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 OSTI2026

Improved Accuracy in Semi-Experimental Structure Determination by Resolving Problems Associated with Rotation of Principal Inertial Axes of Isotopologues: Structures of 1,3-Oxazole ( c -C 3 H 3 NO)

The rotational spectrum of the normal isotopologue of 1,3-oxazole (c-C 3 H 3 NO) was observed from 43 to 750 GHz. Over 3900 transitions for the ground vibrational state are measured, assigned, and least-squares fit to sextic centrifugally distorted-rotor Hamiltonians. The measured frequencies and resulting spectroscopic constants from this extended spectral range, combined with previous measurements of the nuclear quadrupole coupling constants, will facilitate astronomical searches for oxazole across the majority of the range of modern radiotelescopes. Spectra for a set of 30 oxazole isotopologues, which include multiple isotopic substitutions of each atom, are used to determine the first semi-experimental equilibrium ($r$$^{SE}_{e}$) structure and semi-experimental substitution structure ($r$$^{SE}_{e}$), each using CCSD(T) computed values for the vibration–rotation interaction and electron-mass corrections. The large number of isotopologues, including 21 isotopologues observed for the first time, and the redundant substitutions of each atom provide sufficient spectroscopic information to determine the $r$$^{SE}_{e}$ structure with the expected high level of accuracy and precision (0.0001 or 0.0002 Å in bond distances and 0.013 to 0.025° in bond angles). In the course of this study, we analyzed a known issue for some $r$$^{SE}_{e}$ structure determinations of near-oblate asymmetric tops in which inclusion of individual isotopologues degrades the structure determination. We demonstrate that this problem primarily arises from the difference in the values of the computed vibration–rotation interaction corrections as evaluated at the computed re geometry vs the $r$$^{SE}_{e}$ geometry of the “real” molecule. Our solution to this problem substantially improves the $r$$^{SE}_{e}$ structure of oxazole and likely can be generalized to many other molecules.

Chemical structure↗
DOE OSTI2021

Fragility of the nematic spin liquid induced by diagonal couplings in the square-lattice SU(3) model

Here, we present a large-scale density matrix renormalization group (DMRG) study of the spin-1 SU(3) bilinear-biquadratic model on the square lattice, which was suggested to host a nematic spin liquid state in recent DMRG calculations. We report that this spin liquid appears to strongly compete with a three-sublattice magnetic order. To further study the competition between the two states, and the reason of the emergent nematic spin liquid, we included an additional next-nearest-neighbor SU(3) symmetric interactions along one of the two plaquette diagonal directions. This allows to tune the square-lattice model to the triangular-lattice model. By computing spin correlation functions and various order parameters, we find that the three-sublattice order may develop at infinitesimal additional new coupling, at least within the precision of our study. Compared with the previous findings that the nematic spin liquid is stable in extended parameter regions with additional couplings that respect the lattice symmetries of the square lattice, we argue that here the diagonal couplings, which frustrate the bipartite-lattice structure, rapidly suppress the two-sublattice fluctuations and the three-sublattice order thus wins. This numerical result is consistent with the conjecture that the nematic spin liquid emerges from the competition between two- and three-sublattice fluctuations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
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 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 OSTI2023

A leaf-level spectral library to support high-throughput plant phenotyping: predictive accuracy and model transfer

Abstract Leaf-level hyperspectral reflectance has become an effective tool for high-throughput phenotyping of plant leaf traits due to its rapid, low-cost, multi-sensing, and non-destructive nature. However, collecting samples for model calibration can still be expensive, and models show poor transferability among different datasets. This study had three specific objectives: first, to assemble a large library of leaf hyperspectral data (n=2460) from maize and sorghum; second, to evaluate two machine-learning approaches to estimate nine leaf properties (chlorophyll, thickness, water content, nitrogen, phosphorus, potassium, calcium, magnesium, and sulfur); and third, to investigate the usefulness of this spectral library for predicting external datasets (n=445) including soybean and camelina using extra-weighted spiking. Internal cross-validation showed satisfactory performance of the spectral library to estimate all nine traits (mean R2=0.688), with partial least-squares regression outperforming deep neural network models. Models calibrated solely using the spectral library showed degraded performance on external datasets (mean R2=0.159 for camelina, 0.337 for soybean). Models improved significantly when a small portion of external samples (n=20) was added to the library via extra-weighted spiking (mean R2=0.574 for camelina, 0.536 for soybean). The leaf-level spectral library greatly benefits plant physiological and biochemical phenotyping, whilst extra-weight spiking improves model transferability and extends its utility.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Deciphering the Scattering of Mechanically Driven Polymers Using Deep Learning

Here, we present a deep learning approach for analyzing two-dimensional scattering data of semiflexible polymers under external forces. In our framework, scattering functions are compressed into a three-dimensional latent space using a Variational Autoencoder (VAE), and two converter networks establish a bidirectional mapping between the polymer parameters (bending modulus, stretching force, and steady shear) and the scattering functions. The training data are generated using off-lattice Monte Carlo simulations to avoid the orientational bias inherent in lattice models, ensuring robust sampling of polymer conformations. The feasibility of this bidirectional mapping is demonstrated by the organized distribution of polymer parameters in the latent space. By integrating the converter networks with the VAE, we obtain a generator that produces scattering functions from given polymer parameters and an inferrer that directly extracts polymer parameters from scattering data. While the generator can be utilized in a traditional least-squares fitting procedure, the inferrer produces comparable results in a single pass and operates 3 orders of magnitude faster. This approach offers a scalable automated tool for polymer scattering analysis and provides a promising foundation for extending the method to other scattering models, experimental validation, and the study of time-dependent scattering data.

Ding, Lijie [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2026

ReMU: regional minimal updating for model-based derivative-free optimization

Derivative-free optimization (DFO) problems are optimization problems where derivative information is unavailable or extremely difficult to obtain. Model-based DFO solvers have been applied extensively in scientific computing. Powell's NEWUOA (2004) [Powell, The NEWUOA software for unconstrained optimization without derivatives, in Large-Scale Nonlinear Optimization, Nonconvex Optimization and its Applications Vol. 83, G. Di Pillo and M. Roma, eds., Springer, 2006, pp. 255–297] and Wild's POUNDerS (2014) [Wild, Solving derivative-free nonlinear least squares problems with POUNDERS, in Advances and Trends in Optimization with Engineering Applications, T. Terlaky, M.F. Anjos, and S. Ahmed, eds., SIAM, 2017, pp. 529–540] explore the numerical power of the minimal norm Hessian (MNH) model for DFO and contributed to the open discussion on building better models with fewer data to achieve faster numerical convergence. Another decade later, we propose the regional minimal updating (ReMU) models, and extend the previous models into a broader class, including the H 2 norm models [Xie and Yuan, Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms, IMA J. Numer. Anal. 46 (2025), pp. 21–50]. This paper shows motivation behind ReMU models, computational details, theoretical and numerical results on particular extreme points and the barycentre of ReMU's weight coefficient region, and the associated KKT matrix error and distance. Novel metrics, such as the truncated Newton step error, are proposed to numerically understand the new models' properties. A new algorithmic strategy, based on iteratively adjusting the ReMU model type, is also proposed, and shows numerical advantages by combining and switching between the barycentric model and the classic least Frobenius norm model in an online fashion.

derivative-free trust-region methods↗
DOE OSTI2022

Artificial intelligence based analysis of nanoindentation load–displacement data using a genetic algorithm

In this work, we developed an automated tool, Nanoindentation Neo package for the analysis of nanoindentation load–displacement curves using a Genetic Algorithm (GA) applied to the Oliver-Pharr method (Oliver et al.,1992). For some materials, such as polycrystalline isotropic graphites, Least Squares Fitting (LSF) of the unload curve can produce unrealistic fit parameters. These graphites exhibit sharply peaked unloading curves not easily fit using the LSF, which tends to overestimate the indenter tip geometry parameter. To tackle this problem, we extended our general materials characterization tool Neo for EXAFS analysis (Terry et al., 2021) to fit nanoindentation data. Nanoindentation Neo automatically processes and analyzes nanoindentation data with minimal user input while producing meaningful fit parameters. GA, a robust metaheuristic method, begins with a population of temporary solutions using model parameters called chromosomes; from these we evaluate a fitness value for each solution, and select the best solutions to mix with random solutions producing the next generation. A mutation operator then modifies existing solutions by random perturbations, and the optimal solution is selected. We tested the GA method using Silica and Al reference standards. We fit samples of graphite and a high entropy alloy (HEA) consisting of BCC and FCC phases.

42 ENGINEERING↗
DOE OSTI2023

Open-Shell Tensor Hypercontraction

The extension of least-squares tensor hypercontracted second- and third-order Møller–Plesset perturbation theory (LS-THC-MP2 and LS-THC-MP3) to open-shell systems is an important development due to the scaling reduction afforded by THC and the ubiquity of molecular ions, radicals, and other open-shell reactive species. The complexity of wavefunction-based quantum-chemical methods such as Møller–Plesset and coupled cluster theory is reflected in the steep scaling of the computational costs with the molecular size. The least-squares tensor hypercontraction (LS-THC) method is an efficient, single-step factorization for the two-electron integral tensor but can also be used to factorize the double excitation amplitudes, leading to significant scaling reduction. Herein we extend this promising method to open-shell variants of LS-THC-MP2 and -MP3 by using diagrammatic techniques and explicit spin summation. The accuracy of the resulting methods for open-shell species is benchmarked on standard test systems such as regular alkanes as well as realistic systems involving bond breaking, radical stabilization, and other effects. We find that open-shell LS-THC-MPn methods exhibit errors highly comparable to those produced by closed-shell LS-THC-MPn and are highly insensitive to particular chemical interactions, geometries, or even moderate spin contamination.

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

Accelerating gradient descent and Adam via fractional gradients

Here we propose a class of novel fractional-order optimization algorithms. We define a fractional-order gradient via the Caputo fractional derivatives that generalizes integer-order gradient. We refer it to as the Caputo fractional-based gradient, and develop an efficient implementation to compute it. A general class of fractional-order optimization methods is then obtained by replacing integer-order gradients with the Caputo fractional-based gradients. To give concrete algorithms, we consider gradient descent (GD) and Adam, and extend them to the Caputo fractional GD (CfGD) and the Caputo fractional Adam (CfAdam). We demonstrate the superiority of CfGD and CfAdam on several large scale optimization problems that arise from scientific machine learning applications, such as ill-conditioned least squares problem on real-world data and the training of neural networks involving non-convex objective functions. Numerical examples show that both CfGD and CfAdam result in acceleration over GD and Adam, respectively. We also derive error bounds of CfGD for quadratic functions, which further indicate that CfGD could mitigate the dependence on the condition number in the rate of convergence and results in significant acceleration over GD.

97 MATHEMATICS AND COMPUTING↗