Search NASA⌕ Search

SEARCH · Search NASA

Results for “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

On estimating gravity anomalies: A comparison of least squares collocation with least squares techniques

The least squares collocation algorithm for estimating gravity anomalies from geodetic data is shown to be an application of the well known regression equations which provide the mean and covariance of a random vector (gravity anomalies) given a realization of a correlated random vector (geodetic data). It is also shown that the collocation solution for gravity anomalies is equivalent to the conventional least-squares-Stokes' function solution when the conventional solution utilizes properly weighted zero a priori estimates. The mathematical and physical assumptions underlying the least squares collocation estimator are described, and its numerical properties are compared with the numerical properties of the conventional least squares estimator.

Argentiero, P.↗

Foundations for estimation by the method of least squares

Least squares estimation is discussed from the point of view of a statistician. Much of the emphasis is on problems encountered in application and, more specifically, on questions involving assumptions: what assumptions are needed, when are they needed, what happens if they are not valid, and if they are invalid, how that fact can be detected.

Hauck, W. W., Jr.↗

On estimating gravity anomalies - A comparison of least squares collocation with conventional least squares techniques

The least squares collocation algorithm for estimating gravity anomalies from geodetic data is shown to be an application of the well known regression equations which provide the mean and covariance of a random vector (gravity anomalies) given a realization of a correlated random vector (geodetic data). It is also shown that the collocation solution for gravity anomalies is equivalent to the conventional least-squares-Stokes' function solution when the conventional solution utilizes properly weighted zero a priori estimates. The mathematical and physical assumptions underlying the least squares collocation estimator are described.

Argentiero, P.↗

Confocal Raman imaging of skin sections containing hair follicles using classical least squares regression and multivariate curve resolution – alternating least squares

Confocal Raman microscopy (CRM) is applied ex vivo for imaging of the spatial distribution of different skin components in skin sections containing hair follicles. For multivariate data analysis, different methods are used in order to spectrally decompose the reference spectra of the skin components (dermis, viable epidermis, stratum corneum and hair). Classical least squares regression (CLS) and multivariate curve resolution–alternating least squares (MCR-ALS) are chosen as suitable methods. In comparison to other optical methods, the advantage of CRM is molecular specificity and dispensability of labelling dyes, which is e.g. necessary in fluorescence microscopy. Therefore, a useful future application of CRM in combination with multivariate data analysis lies in the analysis of penetration routes of topically applied substances, such as cosmetic formulations or drugs into the skin, which is particularly interesting in and around hair follicles. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Domain Decomposition Algorithms for First-Order System Least Squares Methods

Least squares methods based on first-order systems have been recently proposed and analyzed for second-order elliptic equations and systems. They produce symmetric and positive definite discrete systems by using standard finite element spaces, which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these first-order least squares methods are studied. Some representative overlapping and substructuring algorithms are considered in their additive and multiplicative variants. The theoretical and numerical results obtained show that the classical convergence bounds (on the iteration operator) for standard Galerkin discretizations are also valid for least squares methods.

Pavarino, Luca F.↗

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]↗

Sensitivity analysis on chaotic dynamical systems by Non-Intrusive Least Squares Shadowing (NILSS)

This paper develops the Non-Intrusive Least Squares Shadowing (NILSS) method, which computes the sensitivity for long-time averaged objectives in chaotic dynamical systems. In NILSS, we represent a tangent solution by a linear combination of one inhomogeneous tangent solution and several homogeneous tangent solutions. Next, we solve a least squares problem using this representation; thus, the resulting solution can be used for computing sensitivities. NILSS is easy to implement with existing solvers. In addition, for chaotic systems with many degrees of freedom but few unstable modes, NILSS has a low computational cost. NILSS is applied to two chaotic PDE systems: the Lorenz 63 system and a CFD simulation of flow over a backward-facing step. In both cases, the sensitivities computed by NILSS reflect the trends in the long-time averaged objectives of dynamical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stratospheric NO2 and H2O mixing ratio profiles from high resolution infrared solar spectra using nonlinear least squares

Nonlinear least squares spectral curve fitting has been used to derive vertical mixing ratio profiles for NO2 and H2O above 16 km from high resolution (0.2/cm) solar spectra collected during sunset with a balloon borne interferometer. The NO2 profile shows a sharp peak of 8 ppbv at 32 km falling rapidly to less than 0.5 ppbv at 17 km. The H2O profile shows a broad peak of 6.5 ppmv at 30 km falling to less than 4 ppmv at 17 km.

Niple, E.↗

Application of linear least squares to the analysis of Auger electron spectroscopy depth profiles of plutonium oxides [Application of linear least squares to the analysis of AES depth profiles of plutonium oxides]

In this paper, the application of the linear least squares (LLS) methodology allows for quantitative determination of variation in material composition with depth. LLS fits were applied to decompose and enhance the interpretation of spectra obtained by Auger electron spectroscopy during depth profiles of oxidized plutonium surfaces. By means of the LLS algorithm, chemical state assignments of the Pu P 1 VV/O 45 VV, O KLL, and C KLL Auger transitions were determined and the existence of a subsurface oxycarbide layer was identified, with confirmation of the oxide and metal components provided from comparison to previous measurements of standard samples.

36 MATERIALS SCIENCE↗

Least-Squares Curve-Fitting Program

Least Squares Curve Fitting program, AKLSQF, easily and efficiently computes polynomial providing least-squares best fit to uniformly spaced data. Enables user to specify tolerable least-squares error in fit or degree of polynomial. AKLSQF returns polynomial and actual least-squares-fit error incurred in operation. Data supplied to routine either by direct keyboard entry or via file. Written for an IBM PC X/AT or compatible using Microsoft's Quick Basic compiler.

Kantak, Anil V.↗

Spatial Signatures of Electron Correlation in Least-Squares Tensor Hypercontraction

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

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A best-practice guide to predicting plant traits from leaf-level hyperspectral data using partial least squares regression

Partial least squares regression (PLSR) modelling is a statistical technique for correlating datasets, and involves the fitting of a linear regression between two matrices. One application of PLSR enables leaf traits to be estimated from hyperspectral optical reflectance data, facilitating rapid, high-throughput, non-destructive plant phenotyping. This technique is of interest and importance in a wide range of contexts including crop breeding and ecosystem monitoring. The lack of a consensus in the literature on how to perform PLSR means that interpreting model results can be challenging, applying existing models to novel datasets can be impossible, and unknown or undisclosed assumptions can lead to incorrect or spurious predictions. We address this lack of consensus by proposing best practices for using PLSR to predict plant traits from leaf-level hyperspectral data, including a discussion of when PLSR is applicable, and recommendations for data collection. Further, we provide a tutorial to demonstrate how to develop a PLSR model, in the form of an R script accompanying this manuscript. This practical guide will assist all those interpreting and using PLSR models to predict leaf traits from spectral data, and advocates for a unified approach to using PLSR for predicting traits from spectra in the plant sciences.

54 ENVIRONMENTAL SCIENCES↗

On the method of least squares. II

A least squares method proposed previously for solving a general class of problems is expanded in two ways. First, covariance matrices related to the solution are calculated and their interpretation is given. Second, improved methods of solving the normal equations related to those of Marquardt (1963) and Fletcher and Powell (1963) are developed for this approach. These methods may converge in cases where Newton's method diverges or converges slowly.

Jefferys, W. H.↗