Search NASA⌕ Search

SEARCH · Search NASA

Results for “Least”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2019

Weighted Least-Squares Cell-Average Gradient Construction Methods for the VULCAN-CFD Second-Order Accurate Unstructured-Grid Cell-Centered Finite-Volume Solver

The ability to solve the equations governing the hypersonic turbulent flow of a real gas on unstructured grids using a spatially-elliptic, 2nd-order accurate, cell-centered, finite-volume method has been recently implemented in the VULCAN-CFD code. The construction of cell-average gradients using a weighted linear least-squares method and the use of these gradients in the construction of the inviscid fluxes is the focus of this paper. A comparison of least-squares stencil construction methodologies is presented and approaches to augment the number of cells participating in the stencil while preserving accuracy are explored. Due to our interest in hypersonic flow, a robust multidimensional cell-average gradient limiter procedure that is consistent with the stencil used to construct the cell-average gradients is described and investigated. Canonical problems are computed to illustrate the challenges and investigate the accuracy, robustness and convergence behavior of the cell-average gradient methods on unstructured cell-centered finite-volume grids. Finally, thermally perfect, chemically frozen, Mach 8 turbulent flow of air around a blunt wedge is computed to demonstrate the robustness and convergence behavior of the new method for constructing stencils of use in a weighted linear least-squares gradient method for a hypersonic flow.

White, Jeffery A.↗
NASA NTRS2019

Efficient and Robust Weighted Least-Squares Cell-Average Gradient Construction Methods for the Simulation of Scramjet Flows

The ability to solve the equations governing the hypersonic turbulent flow of a real gas on unstructured grids using a spatially-elliptic, 2nd-order accurate, cell-centered, finite-volume method has been recently implemented in the VULCAN-CFD code. The construction of cell-average gradients using a weighted linear least-squares method and the use of these gradients in the construction of the inviscid fluxes is the focus of this paper. A comparison of least-squares stencil construction methodologies is presented and approaches designed to minimize the number of cells used to augment/stabilize the least-squares stencil while preserving accuracy are explored. Due to our interest in hypersonic flow, a robust multidimensional cell-average gradient limiter procedure that is consistent with the stencil used to construct the cellaverage gradients is described. Canonical problems are computed to illustrate the challenges and investigate the accuracy, robustness and convergence behavior of the cell-average gradient methods on unstructured cell-centered finite-volume grids. Finally, thermally perfect, chemically frozen, Mach 7.8 turbulent flow of air through a scramjet engine flowpath is computed and compared with experimental data to demonstrate the robustness, accuracy and convergence behavior of the preferred gradient method for a realistic 3-D geometry on a non-hex-dominant grid.

White, Jeffery A.↗
DOE OSTI2020

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms

One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.

derivative-free optimization↗
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 OSTI2024

On the connection between least squares, regularization, and classical shadows

Classical shadows (CS) offer a resource-efficient means to estimate quantum observables, circumventing the need for exhaustive state tomography. Here, we clarify and explore the connection between CS techniques and least squares (LS) and regularized least squares (RLS) methods commonly used in machine learning and data analysis. By formal identification of LS and RLS ``shadows'' completely analogous to those in CS---namely, point estimators calculated from the empirical frequencies of single measurements---we show that both RLS and CS can be viewed as regularizers for the underdetermined regime, replacing the pseudoinverse with invertible alternatives. Through numerical simulations, we evaluate RLS and CS from three distinct angles: the tradeoff in bias and variance, mismatch between the expected and actual measurement distributions, and the interplay between the number of measurements and number of shots per measurement. Compared to CS, RLS attains lower variance at the expense of bias, is robust to distribution mismatch, and is more sensitive to the number of shots for a fixed number of state copies---differences that can be understood from the distinct approaches taken to regularization. Conceptually, our integration of LS, RLS, and CS under a unifying ``shadow'' umbrella aids in advancing the overall picture of CS techniques, while practically our results highlight the tradeoffs intrinsic to these measurement approaches, illuminating the circumstances under which either RLS or CS would be preferred, such as unverified randomness for the former or unbiased estimation for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Corresponding Standard Reference Material Data used in Partial Least Squares Regression Models for Sugar Composition Estimates in Biomass in: Economic Impact of Yield and Composition Variation in Bioenergy Crops: Populus trichocarpa

Corresponding Standard Reference Material Data used in Partial Least Squares Regression Models for Sugar Composition Estimates in Biomass in: Economic Impact of Yield and Composition Variation in Bioenergy Crops: Populus trichocarpa (for corresponding manuscript: DOI: 10.1002/bbb.2148) PDF Files: Images of 1H NMR spectra for neutralized 2-stage acid hydrolysates of 4 NIST Standard Reference Material biomass samples (Monterey Pine 8493, Sugarcane Bagasse 8491, Wheat Straw 8494, and Eastern Cottonwood/Poplar 8492) and 2 Center for Bioenergy Innovation reference biomass samples (Poplar - Populus trichocarpa and Switchgrass - Panicum Virgatum). Suppression of the water peak was achieved using a NOESY-1D with presaturation, a recycle delay of 5 s, and a total of 64 scans. Spectra were acquired at 298 K and processed with automatic phase correction, baseline correction, and chemical shift referencing to TSP-d4. Images show all 1H data from 10 to 1ppm with inset spectra of region of interest (4.0 to 3.1 ppm). Text Files: Spectra for neutralized 2-stage acid hydrolysates of 4 NIST Standard Reference Material biomass samples (Monterey Pine 8493, Sugarcane Bagasse 8491, Wheat Straw 8494, and Eastern Cottonwood/Poplar 8492) and 2 Center for Bioenergy Innovation reference biomass samples (Poplar - Populus trichocarpa and Switchgrass - Panicum Virgatum) were converted into text files for plotting. Files contain 8192 points of raw spectral data from 12.23 to -2.78 ppm. The text file contains 4 columns of data and includes: Point number, Intensity, Hz, and ppm. Xcel Spreadsheet: HPLC measured monomeric sugar concentrations and bucketed 1H NMR data used to build monomeric sugar composition prediction models. Sugar composition in biomass determined from HPLC analyses are given in mg sugar/mg of biomass. Spectral bucketing was performed using Bruker’s AMIX software. Spectra were divided into 0.005 ppm buckets in the region of 3.10– 4.15 ppm for a total of 210 buckets. Headers for the bucketed data are the chemical shift in ppm of the center of the bucket. Bucketed data was used to build partial least squares models for subsequent predictions in The Unscrambler v. 10.5(CAMO A/S, Trondheim, Norway). The formation of methanol during hydrolysis interferes with the quantitative NMR analysis of sugars, so the methanol peak centered at 3.37 ppm and spanning four buckets (3.2925 – 3.2775 ppm) was set to zero for all spectra.

09 BIOMASS FUELS↗
NASA NTRS1972

The least squares process of MEDIA for computing DRVID calibration polynomials

A process is described and evaluated for computing a least squares polynomial approximation of data points in which the optimum degree of the polynomial is automatically determined. An iterative smoothing technique is used to replace every point with the value taken on by a moving least squares polynomial computed from a subset of points centered at the point to be replaced. The optimum degree of the resulting polynomial approximation is determined by analyzing the finite differences of each successive set of smoothed points. To evaluate the process, both artificially constructed data and actual Mariner Mars 1971 (MM'71) tracking data are used. This process was incorporated into a transmission media calibration computer program (MEDIA), which calibrates radiometric data to overcome the effects on the tracking signal of charged particle media. MEDIA was used in support of MM'71.

Leavitt, R. K.↗
NASA NTRS1978

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗
NASA NTRS1979

Solution of a few nonlinear problems in aerodynamics by the finite elements and functional least squares methods

The numerical simulation of the transonic flows of idealized fluids and of incompressible viscous fluids, by the nonlinear least squares methods is presented. The nonlinear equations, the boundary conditions, and the various constraints controlling the two types of flow are described. The standard iterative methods for solving a quasi elliptical nonlinear equation with partial derivatives are reviewed with emphasis placed on two examples: the fixed point method applied to the Gelder functional in the case of compressible subsonic flows and the Newton method used in the technique of decomposition of the lifting potential. The new abstract least squares method is discussed. It consists of substituting the nonlinear equation by a problem of minimization in a H to the minus 1 type Sobolev functional space.

Periaux, J.↗
NASA NTRS1980

On the method of least squares

A method for fitting models to observed data by least squares when the data appear nonlinearly in the equations of condition, where there are nonlinear constraints among model parameters, and where the observations may be correlated, is described. The method is independent of the form in which the equations of condition are expressed, and is a generalization of the classical technique. The method is nearly as simple to apply in practice as the classical method of least squares.

Jefferys, W. H.↗
NASA NTRS1981

Remarks on nonstandard least-squares problems

It is shown that after treating a least-squares problem in the standard fashion, the imposition of stochastic restrictions on certain parameters can be accomplished essentially by inverting a matrix of an order no larger than the total number of restricted parameters, and that generally there is an explicit term for correcting the unrestricted to the restricted solution. In addition, any known type of nonstandard least-squares adjustment problem can be reduced to an equivalent standard linear problem, that is, one in which there is exactly one observation per condition equation and in which the observations are not correlated.

Eichhorn, H.↗
NASA NTRS1983

A new algorithm for constrained nonlinear least-squares problems, part 1

A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.

Hanson, R. J.↗
NASA NTRS1985

On the accuracy of least squares methods in the presence of corner singularities

Elliptic problems with corner singularities are discussed. Finite element approximations based on variational principles of the least squares type tend to display poor convergence properties in such contexts. Moreover, mesh refinement or the use of special singular elements do not appreciably improve matters. It is shown that if the least squares formulation is done in appropriately weighted space, then optimal convergence results in unweighted spaces like L(2).

Cox, C. L.↗
NASA NTRS1986

Constrained hierarchical least square nonlinear equation solvers

The current paper develops a constrained hierarchical least square nonlinear equation solver. The procedure can handle the response behavior of systems which possess indefinite tangent stiffness characteristics. Due to the generality of the scheme, this can be achieved at various hierarchical application levels. For instance, in the case of finite element simulations, various combinations of either degree of freedom, nodal, elemental, substructural, and global level iterations are possible. Overall, this enables a solution methodology which is highly stable and storage efficient. To demonstrate the capability of the constrained hierarchical least square methodology, benchmarking examples are presented which treat structure exhibiting highly nonlinear pre- and postbuckling behavior wherein several indefinite stiffness transitions occur.

Padovan, J.↗