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 55 records · Page 3

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↗

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

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

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

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

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

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

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

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↗

Flexible rotor balancing by the influence coefficient method. Part 1: Evaluation of the exact point-speed and least squares procedures

The practical aspects of balancing real, flexible rotors were investigated through inclusion of rotor out-of-roundness data at the measurement probe locations. The computer program was demonstrated to be fully capable of handling out-of-roundness data in the investigation. Testing was performed predominantly with a machine having a 41-inch long, 126-pound rotor. This rotor was operated over a speed range encompassing three rotor-bearing system critical speeds. Both balancing procedures were evaluated for several different conditions of initial rotor unbalance. Safe (and slow) passage through all the critical speeds was obtained after two or three balancing runs in most cases. The Least Squares procedure was found to be generally equivalent in capability to the Exact Point-Speed procedure for the configurations studies. (U)

Tessarzik, J. M.↗

PolyFit: A C++ code for Polynomial Curve Fit with Calculation of Error Bars

In radiobiology, many dose-response results are modeled using the so-called linear-quadratic (LQ)model, which means that results are modeled as a function of dose Das 𝑅(𝐷)=𝛽0+𝛽1𝐷+𝛽2𝐷2. The coefficients 𝛽0, 𝛽1and 𝛽2are obtained from fitting a series of data points (𝑥𝑖, 𝑦𝑖), which is usually done using a least-square method. The LQ and more generally the polynomial fit capability is implemented in many software that analyzes data. However, there are some instances where the fitting needs to be done programmatically. Furthermore, depending on the software used, some features may not be implemented. In this mini-review, I discuss the basis of polynomial fitting, including the calculation of errors on the coefficients and results, use of weighting and fixing the intercept value (the coefficient 𝛽0). A simple C++ code to perform the polynomial curve fitting is also provided. This code should be useful not only in radiobiology but in other fields of science as well.

Ianik Plante↗

PolyFit: A C++ code for Polynomial Curve Fit with Calculation of Error Bars

In radiobiology, many dose-response results are modeled using the so-called linear-quadratic(LQ)model, which means that results are modeled as a function of dose Das 𝑅(𝐷)=𝛽0+𝛽1𝐷+𝛽2𝐷2. The coefficients 𝛽0, 𝛽1and 𝛽2are obtained from fitting a series of data points (𝑥𝑖,𝑦𝑖), which is usually done using a least-square method. The LQ and more generally the polynomial fit capability is implemented in many software that analyzes data. However, it is often convenient to do the fitting programmatically, especially when a large number of datasets should be analyzed. Furthermore, depending on the software used, some features may not be implemented. In this mini-review, I discuss the basis of polynomial fitting, including the calculation of errors on the coefficients and results, use of weighting and fixing the intercept value (the coefficient 𝛽0). A simple C++ code to perform the polynomial curve fitting is also provided. This code should be useful not only in radiobiology but in other fields of science as well.

Ianik Plante↗

A simple suboptimal least-squares algorithm for attitude determination with multiple sensors

Three-axis attitude determination is equivalent to finding a coordinate transformation matrix which transforms a set of reference vectors fixed in inertial space to a set of measurement vectors fixed in the spacecraft. The attitude determination problem can be expressed as a constrained optimization problem. The constraint is that a coordinate transformation matrix must be proper, real, and orthogonal. A transformation matrix can be thought of as optimal in the least-squares sense if it maps the measurement vectors to the reference vectors with minimal 2-norm errors and meets the above constraint. This constrained optimization problem is known as Wahba's problem. Several algorithms which solve Wahba's problem exactly have been developed and used. These algorithms, while steadily improving, are all rather complicated. Furthermore, they involve such numerically unstable or sensitive operations as matrix determinant, matrix adjoint, and Newton-Raphson iterations. This paper describes an algorithm which minimizes Wahba's loss function, but without the constraint. When the constraint is ignored, the problem can be solved by a straightforward, numerically stable least-squares algorithm such as QR decomposition. Even though the algorithm does not explicitly take the constraint into account, it still yields a nearly orthogonal matrix for most practical cases; orthogonality only becomes corrupted when the sensor measurements are very noisy, on the same order of magnitude as the attitude rotations. The algorithm can be simplified if the attitude rotations are small enough so that the approximation sin(theta) approximately equals theta holds. We then compare the computational requirements for several well-known algorithms. For the general large-angle case, the QR least-squares algorithm is competitive with all other know algorithms and faster than most. If attitude rotations are small, the least-squares algorithm can be modified to run faster, and this modified algorithm is faster than all but a similarly specialized version of the QUEST algorithm. We also introduce a novel measurement averaging technique which reduces the n-measurement case to the two measurement case for our particular application, a star tracker and earth sensor mounted on an earth-pointed geosynchronous communications satellite. Using this technique, many n-measurement problems reduce to less than or equal to 3 measurements; this reduces the amount of required calculation without significant degradation in accuracy. Finally, we present the results of some tests which compare the least-squares algorithm with the QUEST and FOAM algorithms in the two-measurement case. For our example case, all three algorithms performed with similar accuracy.

Brozenec, Thomas F.↗

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

Computer Processing Of Tunable-Diode-Laser Spectra

Tunable-diode-laser spectrometer measuring transmission spectrum of gas operates under control of computer, which also processes measurement data. Measurements in three channels processed into spectra. Computer controls current supplied to tunable diode laser, stepping it through small increments of wavelength while processing spectral measurements at each step. Program includes library of routines for general manipulation and plotting of spectra, least-squares fitting of direct-transmission and harmonic-absorption spectra, and deconvolution for determination of laser linewidth and for removal of instrumental broadening of spectral lines.

May, Randy D.↗

Improved LMS algorithm for adaptive beamforming

Two adaptive algorithms which make use of all the available samples to estimate the required gradient are proposed and studied. The first algorithm is referred to as the recursive LMS (least mean squares) and is applicable to a general array. The second algorithm is referred to as the improved LMS algorithm and exploits the Toeplitz structure of the ACM (array correlation matrix); it can be used only for an equispaced linear array.

Godara, Lal C.↗

New Algorithms for Estimating Spacecraft Position Using Scanning Techniques for Deep Space Network Antennas

As more and more nonlinear estimation techniques become available, our interest is in finding out what performance improvement, if any, they can provide for practical nonlinear problems that have been traditionally solved using linear methods. In this paper we examine the problem of estimating spacecraft position using conical scan (conscan) for NASA's Deep Space Network antennas. We show that for additive disturbances on antenna power measurement, the problem can be transformed into a linear one, and we present a general solution to this problem, with the least square solution reported in literature as a special case. We also show that for additive disturbances on antenna position, the problem is a truly nonlinear one, and we present two approximate solutions based on linearization and Unscented Transformation respectively, and one 'exact' solution based on Markov Chain Monte Carlo (MCMC) method. Simulations show that, with the amount of data collected in practice, linear methods perform almost the same as MCMC methods. It is only when we artificially reduce the amount of collected data and increase the level of noise that nonlinear methods show significantly better accuracy than that achieved by linear methods, at the expense of more computation.

Metropolis-Hastings (MH)↗

Generalized Linear Covariance Analysis

This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

Navagation↗