Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized least squared”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Robust inverse kinematics using damped least squares with dynamic weighting

This paper presents a general method for calculating the inverse kinematics with singularity and joint limit robustness for both redundant and non-redundant serial-link manipulators. Damped least squares inverse of the Jacobian is used with dynamic weighting matrices in approximating the solution. This reduces specific joint differential vectors. The algorithm gives an exact solution away from the singularities and joint limits, and an approximate solution at or near the singularities and/or joint limits. The procedure is here implemented for a six d.o.f. teleoperator and a well behaved slave manipulator resulted under teleoperational control.

Schinstock, D. E.↗
NASA NTRS1996

First-Order System Least Squares for the Stokes Equations, with Application to Linear Elasticity

Following our earlier work on general second-order scalar equations, here we develop a least-squares functional for the two- and three-dimensional Stokes equations, generalized slightly by allowing a pressure term in the continuity equation. By introducing a velocity flux variable and associated curl and trace equations, we are able to establish ellipticity in an H(exp 1) product norm appropriately weighted by the Reynolds number. This immediately yields optimal discretization error estimates for finite element spaces in this norm and optimal algebraic convergence estimates for multiplicative and additive multigrid methods applied to the resulting discrete systems. Both estimates are uniform in the Reynolds number. Moreover, our pressure-perturbed form of the generalized Stokes equations allows us to develop an analogous result for the Dirichlet problem for linear elasticity with estimates that are uniform in the Lame constants.

Cai, Z.↗
NASA NTRSDate not supplied

Active Thermography Based on Tensor Rank Decomposition

Principal Component Thermography applies Singular Value Decomposition (SVD) to post-process data that are derived from active thermographic inspections. SVD provides useful compression of the data and allows for better understanding of substructure and indications of potential damage. In the standard approach, SVD is applied to a certain reshaping of a three-dimensional data stack into a two-dimensional array. This work applies the CANDECOMP-PARAFAC (CP) tensor rank decomposition directly to the three-dimensional data to avoid the initial reshaping step in order to begin to develop an inspection method that can more accurately detect defects in non-homogeneous and anisotropic materials. Tests against simulated data that compare the CP decomposition method with traditional Principal Component Thermography based on SVD are described. Finally, the method of Proper Generalized Decomposition (PGD) is used to derive the CP decomposition, and its performance against other algorithms is also discussed.

Thermography↗
DOE OSTI2020

Unique contributions of chlorophyll and nitrogen to predict crop photosynthetic capacity from leaf spectroscopy

The photosynthetic capacity or the CO 2 -saturated photosynthetic rate (Vmax), chlorophyll, and nitrogen are closely linked leaf traits that determine C 4 crop photosynthesis and yield. Accurate, timely, rapid, and non-destructive approaches to predict leaf photosynthetic traits from hyperspectral reflectance are urgently needed for high-throughput crop monitoring to ensure food and bioenergy security. Therefore, this study thoroughly evaluated the state-of-the-art physically based radiative transfer models (RTMs), data-driven partial least squares regression (PLSR), and generalized PLSR (gPLSR) models to estimate leaf traits from leaf-clip hyperspectral reflectance, which was collected from maize (Zea mays L.) bioenergy plots with diverse genotypes, growth stages, treatments with nitrogen fertilizers, and ozone stresses in three growing seasons. The results show that leaf RTMs considering bidirectional effects can give accurate estimates of chlorophyll content (Pearson correlation r=0.95), while gPLSR enabled retrieval of leaf nitrogen concentration (r=0.85). Using PLSR with field measurements for training, the cross-validation indicates that V max can be well predicted from spectra (r=0.81). Here, the integration of chlorophyll content (strongly related to visible spectra) and nitrogen concentration (linked to shortwave infrared signals) can provide better predictions of V max (r=0.71) than only using either chlorophyll or nitrogen individually. This study highlights that leaf chlorophyll content and nitrogen concentration have key and unique contributions to V max prediction.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1993

Space transportation vehicle design evaluation using saturated designs

An important objective in the preliminary design and evaluation of space transportation vehicles is to find the best values of design variables that optimize the performance characteristic (e.g. dry weight). For a given configuration, the vehicle performance can be determined by the use of complex sizing and performance evaluation computer programs. These complex computer programs utilize iterative algorithms and they are generally too expensive and/or difficult to use directly in multidisciplinary design optimization. An alternative is to use response surface methodology (RSM) and obtain quadratic polynomial approximations to the functional relationships between performance characteristics and design variables. In RSM, these approximation models are then used to determine optimum design parameter values and for rapid sensitivity studies. Constructing a second-order model requires that 'n' design parameters be studied at least at 3 levels (values) so that the coefficients in the model can be estimated. There, 3(n) factorial experiments (point designs or observations) may be necessary. For small values of 'n' such as two or three, this design works well. However, when a large number of design parameters are under study, the number of design points required for a full-factorial design may become excessive. Fortunately, these quadratic polynomial approximations can be obtained by selecting an efficient design matrix using central composite designs (CCD) from design of experiments theory. Each unique point design from the CCD matrix is then conducted using computerized analysis tools (e.g. POST, CONSIZ, etc.). In the next step, least squares regression analysis is used to calculate the quadratic polynomial coefficients from the data. However, in some multidisciplinary applications involving a large number of design variables and several disciplines, the computerized performance synthesis programs may get too time consuming and expensive to run even with the use of efficient central composite designs. In such cases, it may be preferable to keep the number of design points to an absolute minimum and trade some model accuracy with cost. For this purpose, another class of experimental designs, called saturated D-optimal designs may be utilized for generating a matrix of vehicle designs. A design is called saturated when the number of design points is exactly equal to the number of terms in the model to be fitted. As a result, saturated designs require the absolute minimum number of design points ((n+1)(n+2)/s) to estimate the quadratic polynomial model coefficients. Saturated designs can be generated using the D-optimality criterion. A good saturated design should give rise to least squares estimates with minimum generalized variance.

Unal, Resit↗
NASA NTRS2008

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗
DOE OSTI2020

Data from Unique Contributions of Chlorophyll and Nitrogen to Predict Crop Photosynthetic Capacity from Leaf Spectroscopy

The photosynthetic capacity or the CO2-saturated photosynthetic rate (Vmax), chlorophyll, and nitrogen are closely linked leaf traits that determine C4 crop photosynthesis and yield. Accurate, timely, rapid, and non-destructive approaches to predict leaf photosynthetic traits from hyperspectral reflectance are urgently needed for high-throughput crop monitoring to ensure food and bioenergy security. Therefore, this study thoroughly evaluated the state-of-the-art physically based radiative transfer models (RTMs), data-driven partial least squares regression (PLSR), and generalized PLSR (gPLSR) models to estimate leaf traits from leaf-clip hyperspectral reflectance, which was collected from maize (Zea mays L.) bioenergy plots with diverse genotypes, growth stages, treatments with nitrogen fertilizers, and ozone stresses in three growing seasons. The results show that leaf RTMs considering bidirectional effects can give accurate estimates of chlorophyll content (Pearson correlation r=0.95), while gPLSR enabled retrieval of leaf nitrogen concentration (r=0.85). Using PLSR with field measurements for training, the cross-validation indicates that Vmax can be well predicted from spectra (r=0.81). The integration of chlorophyll content (strongly related to visible spectra) and nitrogen concentration (linked to shortwave infrared signals) can provide better predictions of Vmax (r=0.71) than only using either chlorophyll or nitrogen individually. This study highlights that leaf chlorophyll content and nitrogen concentration have key and unique contributions to Vmax prediction.

Biomass Analytics↗
DOE OSTI2022

Nuclear data covariances are critical input to determine upper sub-critical limits and to design experiments to increase it [Slides]

This presentation discusses how Upper Subcritical Limits (USL) are key parameters to determine operational limits in nuclear criticality safety evaluations. It also discusses an example of plutonium casting operation using tantalum at LANL PF-4. The Whisper tool at Los Alamos relies on many inputs, including covariance data, leading the presentation to ask if an existing benchmark data be used in Whisper to adjust nuclear data and covariances to justify a higher USL. If not, Whisper can be used to help design an optimal new benchmark experiment. The presentation also seeks to determine what the possible impacts are on USL and operational limits for plutonium casting. In conclusion, nuclear data covariances are used for by Whisper for: GSSL adjustment of nuclear data and covariances, identification of most similar existing benchmark experiments to application, simulation of Upper Subcritical Limit of application, and input to optimization techniques for designing most appropriate new benchmark experiment(s) to meet requirements. This requires a complete set of nuclear data covariances, benchmarks and k-effective sensitivity profiles (for both benchmarks and applications). The presentation concludes by asking if end users should trust results that depend on current covariance data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1979

Multiyear estimates for the LACIE sampling plans

An approach that may be useful in improving the estimates of the wheat acreages for the LACIE countries for each year by using the short-time series of estimates made in the sequence of consecutive years is presented. A simple 'synthesis' based method of variance component estimation is described. A general theorem concerning weighted least squares, referred to as the Aiken method, is proved.

Hartley, H. O.↗
NASA NTRS1994

Improved solution accuracy for TDRSS-based TOPEX/Poseidon orbit determination

Orbit determination results are obtained by the Goddard Space Flight Center (GSFC) Flight Dynamics Division (FDD) using a batch-least-squares estimator available in the Goddard Trajectory Determination System (GTDS) and an extended Kalman filter estimation system to process Tracking and Data Relay Satellite (TDRS) System (TDRSS) measurements. GTDS is the operational orbit determination system used by the FDD in support of the Ocean Topography Experiment (TOPEX)/Poseidon spacecraft navigation and health and safety operations. The extended Kalman filter was implemented in an orbit determination analysis prototype system, closely related to the Real-Time Orbit Determination System/Enhanced (RTOD/E) system. In addition, the Precision Orbit Determination (POD) team within the GSFC Space Geodesy Branch generated an independent set of high-accuracy trajectories to support the TOPEX/Poseidon scientific data. These latter solutions use the geodynamics (GEODYN) orbit determination system with laser ranging and Doppler Orbitography and Radiopositioning integrated by satellite (DORIS) tracking measurements. The TOPEX/Poseidon trajectories were estimated for November 7 through November 11, 1992, the timeframe under study. Independent assessments were made of the consistencies of solutions produced by the batch and sequential methods. The batch-least-squares solutions were assessed based on the solution residuals, while the sequential solutions were assessed based on primarily the estimated covariances. The batch-least-squares and sequential orbit solutions were compared with the definitive POD orbit solutions. The solution differences were generally less than 2 meters for the batch-least-squares and less than 13 meters for the sequential estimation solutions. After the sequential estimation solutions were processed with a smoother algorithm, position differences with POD orbit solutions of less than 7 meters were obtained. The differences among the POD, GTDS, and filter/smoother solutions can be traced to differences in modeling and tracking data types, which are being analyzed in detail.

Doll, C. E.↗
DOE OSTI2020

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

The magnetic field at the core-mantle boundary

Models of the geomagnetic field are, in general, produced from a least-squares fit of the coefficients in a truncated spherical harmonic expansion to the available data. Downward continuation of such models to the core-mantle boundary (CMB) is an unstable process: the results are found to be critically dependent on the choice of truncation level. Modern techniques allow this fundamental difficulty to be circumvented. The method of stochastic inversion is applied to modeling the geomagnetic field. Prior information is introduced by requiring that the spectrum of spherical harmonic coefficients to fall-off in a particular manner which is consistent with the Ohmic heating in the core having a finite lower bound. This results in models with finite errors in the radial field at the CMB. Curves of zero radial field can then be determined and integrals of the radial field over patches on the CMB bounded by these null-flux curves calculated. With the assumption of negligible magnetic diffusion in the core; frozen-flux hypothesis, these integrals are time-invariant.

Bloxham, J.↗
NASA NTRS1987

An interactive approach to surface-fitting complex geometries for flowfield applications

Numerical flowfield methods require a geometry subprogram which can calculate body coordinates, slopes, and radii of curvature for typical aircraft and spacecraft configurations. The objective of this paper is to develop a new surface-fitting technique which addresses two major problems with existing geometry packages: computer storage requirements and the time required of the user for the initial set-up of the geometry model. In the present method, coordinates of cross sections are fit in a least-squares sense using segments of general conic sections. After fitting each cross section, the next step is to blend the cross-sectional curve-fits in the longitudinal direction using general conics to fit specific meridional half-planes. For the initial setup of the geometry model, an interactive, completely menu-driven computer code has been developed to allow the user to make modifications to the initial fit for a given cross section or meridional cut. Graphic displays are provided to assist the user in the visualization of the effect of each modification. The completed model may be viewed from any angle using the code's three-dimensional graphics package. Geometry results for the modeling of the Space Shuttle and a proposed Aeroassist Flight Experiment (AFE) geometry are presented, in addition to calculated heat-transfer rates based on these models.

Dejarnette, Fred R.↗
NASA NTRS1985

Development and application of a unified balancing approach with multiple constraints

The development of a general analytic approach to constrained balancing that is consistent with past influence coefficient methods is described. The approach uses Lagrange multipliers to impose orbit and/or weight constraints; these constraints are combined with the least squares minimization process to provide a set of coupled equations that result in a single solution form for determining correction weights. Proper selection of constraints results in the capability to: (1) balance higher speeds without disturbing previously balanced modes, thru the use of modal trial weight sets; (2) balance off-critical speeds; and (3) balance decoupled modes by use of a single balance plane. If no constraints are imposed, this solution form reduces to the general weighted least squares influence coefficient method. A test facility used to examine the use of the general constrained balancing procedure and application of modal trial weight ratios is also described.

Zorzi, E. S.↗
NASA NTRS1993

Comparison of TOPEX/Poseidon orbit determination solutions obtained by the Goddard Space Flight Center Flight Dynamics Division and Precision Orbit Determination Teams

Orbit determination results are obtained by the Goddard Space Flight Center (GSFC) Flight Dynamics Division (FDD) using the Goddard Trajectory Determination System (GTDS) and a real-time extended Kalman filter estimation system to process Tracking Data and Relay Satellite (TDRS) System (TDRSS) measurements in support of the Ocean Topography Experiment (TOPEX)/Poseidon spacecraft navigation and health and safety operations. GTDS is the operational orbit determination system used by the FDD, and the extended Kalman fliter was implemented in an analysis prototype system, the Real-Time Orbit Determination System/Enhanced (RTOD/E). The Precision Orbit Determination (POD) team within the GSFC Space Geodesy Branch generates an independent set of high-accuracy trajectories to support the TOPEX/Poseidon scientific data. These latter solutions use the Geodynamics (GEODYN) orbit determination system with laser ranging tracking data. The TOPEX/Poseidon trajectories were estimated for the October 22 - November 1, 1992, timeframe, for which the latest preliminary POD results were available. Independent assessments were made of the consistencies of solutions produced by the batch and sequential methods. The batch cases were assessed using overlap comparisons, while the sequential cases were assessed with covariances and the first measurement residuals. The batch least-squares and forward-filtered RTOD/E orbit solutions were compared with the definitive POD orbit solutions. The solution differences were generally less than 10 meters (m) for the batch least squares and less than 18 m for the sequential estimation solutions. The differences among the POD, GTDS, and RTOD/E solutions can be traced to differences in modeling and tracking data types, which are being analyzed in detail.

Doll, C.↗
DOE OSTI2025

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗
NASA NTRS2012

Effects of Mesh Irregularities on Accuracy of Finite-Volume Discretization Schemes

The effects of mesh irregularities on accuracy of unstructured node-centered finite-volume discretizations are considered. The focus is on an edge-based approach that uses unweighted least-squares gradient reconstruction with a quadratic fit. For inviscid fluxes, the discretization is nominally third order accurate on general triangular meshes. For viscous fluxes, the scheme is an average-least-squares formulation that is nominally second order accurate and contrasted with a common Green-Gauss discretization scheme. Gradient errors, truncation errors, and discretization errors are separately studied according to a previously introduced comprehensive methodology. The methodology considers three classes of grids: isotropic grids in a rectangular geometry, anisotropic grids typical of adapted grids, and anisotropic grids over a curved surface typical of advancing layer grids. The meshes within the classes range from regular to extremely irregular including meshes with random perturbation of nodes. Recommendations are made concerning the discretization schemes that are expected to be least sensitive to mesh irregularities in applications to turbulent flows in complex geometries.

Diskin, Boris↗