SEARCH · Engineering Papers

Results for “nonlinear least squares problems”

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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1994

The Accuracy of Parameter Estimation in System Identification of Noisy Aircraft Load Measurement

This thesis focuses on the subject of the accuracy of parameter estimation and system identification techniques. Motivated by a complicated load measurement from NASA Dryden Flight Research Center, advanced system identification techniques are needed. The objective of this problem is to accurately predict the load experienced by the aircraft wing structure during flight determined from a set of calibrated load and gage response relationship. We can then model the problem as a black box input-output system identification from which the system parameter has to be estimated. Traditional LS (Least Square) techniques and the issues of noisy data and model accuracy are addressed. A statistical bound reflecting the change in residual is derived in order to understand the effects of the perturbations on the data. Due to the intrinsic nature of the LS problem, LS solution faces the dilemma of the trade off between model accuracy and noise sensitivity. A method of conflicting performance indices is presented, thus allowing us to improve the noise sensitivity while at the same time configuring the degredation of the model accuracy. SVD techniques for data reduction are studied and the equivalence of the Correspondence Analysis (CA) and Total Least Squares Criteria are proved. We also looked at nonlinear LS problems with NASA F-111 data set as an example. Conventional methods are neither easily applicable nor suitable for the specific load problem since the exact model of the system is unknown. Neural Network (NN) does not require prior information on the model of the system. This robustness motivated us to apply the NN techniques on our load problem. Simulation results for the NN methods used in both the single load and the 'warning signal' problems are both useful and encouraging. The performance of the NN (for single load estimate) is better than the LS approach, whereas no conventional approach was tried for the 'warning signals' problems. The NN design methodology is also presented. The use of SVD, CA and Collinearity Index methods are used to reduce the number of neurons in a layer.

Kong, Jeffrey↗

NASA NTRS1984

Objective scatterometer wind ambiguity removal using smoothness and dynamical constraints

In the present investigation, a variational analysis method (VAM) is used to remove the ambiguity of the Seasat-A Satellite Scatterometer (SASS) winds. At each SASS data point, two, three, or four wind vectors (termed ambiguities) are retrieved. It is pointed out that the VAM is basically a least squares method for fitting data. The problem may be nonlinear. The best fit to the data and constraints is obtained on the basis of a minimization of the objective function. The VAM was tested and tuned at 12 h GMT Sept. 10, 1978. Attention is given to a case study involving an intense cyclone centered south of Japan at 138 deg E.

Hoffman, R. N.↗

NASA NTRS1982

Least-squares sequential parameter and state estimation for large space structures

This paper presents the formulation of simultaneous state and parameter estimation problems for flexible structures in terms of least-squares minimization problems. The approach combines an on-line order determination algorithm, with least-squares algorithms for finding estimates of modal approximation functions, modal amplitudes, and modal parameters. The approach combines previous results on separable nonlinear least squares estimation with a regression analysis formulation of the state estimation problem. The technique makes use of sequential Householder transformations. This allows for sequential accumulation of matrices required during the identification process. The technique is used to identify the modal prameters of a flexible beam.

Thau, F. E.↗

NASA NTRS1987

Vortex breakdown simulation based on a nonlinear inviscid model

It is shown that the inviscid equations governing steady axisymmetric flow with swirl, admit solutions with closed streamlines. Results are obtained using two different numerical algorithms. The first is based on a multigrid method for nonlinear eigenvalue problems, while the second is based on a least squares formulation.

Hafez, M. M.↗

NASA NTRS1990

Efficient Implementation of Minimal Polynomial and Reduced Rank Extrapolation Methods

The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two effective techniques that have been used in accelerating the convergence of vector sequences, such as those that are obtained from iterative solution of linear and nonlinear systems of equation. Their definitions involve some linear least squares problems, and this causes difficulties in their numerical implementation. Timewise efficient and numerically stable implementations for MPE and RRE are developed. A computer program written in FORTRAN 77 is also appended and applied to some model problems.

Sidi, Avram↗

NASA NTRS1988

Parameter estimation in nonlinear distributed systems - Approximation theory and convergence results

An abstract approximation framework and convergence theory is described for Galerkin approximations applied to inverse problems involving nonlinear distributed parameter systems. Parameter estimation problems are considered and formulated as the minimization of a least-squares-like performance index over a compact admissible parameter set subject to state constraints given by an inhomogeneous nonlinear distributed system. The theory applies to systems whose dynamics can be described by either time-independent or nonstationary strongly maximal monotonic operators defined on a reflexive Banach space which is densely and continuously embedded in a Hilbert space. It is demonstrated that if readily verifiable conditions on the system's dependence on the unknown parameters are satisfied, and the usual Galerkin approximation assumption holds, then solutions to the approximating problems exist and approximate a solution to the original infinite-dimensional identification problem.

Banks, H. T.↗

NASA NTRS1974

Least squares adjustment with relatively large observation errors, inaccurate initial approximations, or both

Least squares adjustment problems are considered in which the condition equations are nonlinear in both the observations and the adjustment parameters ('unknowns'). A solution algorithm is presented which takes into account the second (as well as the first) order derivatives in the adjustment residuals (observation errors) and the corrections to the initially available approximations to the adjustment parameters. The inclusion of second-order terms in the adjustment residuals is necessary whenever the adjustment residuals themselves cannot be regarded as negligible as compared to the adjustment parameters, i.e., whenever the linearized condition equations would no longer be practically equivalent to the rigorous ones. The consideration of second-order terms in the parameter corrections is completely independent of the second-order terms in the adjustment residuals.

Eichhorn, H.↗

NASA NTRS1985

On a variational approach to some parameter estimation problems

Examples (1-D seismic, large flexible structures, bioturbation, nonlinear population dispersal) in which a variation setting can provide a convenient framework for convergence and stability arguments in parameter estimation problems are considered. Some of these examples are 1-D seismic, large flexible structures, bioturbation, and nonlinear population dispersal. Arguments for convergence and stability via a variational approach of least squares formulations of parameter estimation problems for partial differential equations is one aspect of the problem considered.

Banks, H. T.↗

NASA NTRS1985

On a variational approach to some parameter estimation problems

Banks, H. T.↗

DOE OSTI2024

A Data-Driven Approach for High-Impedance Fault Localization in Distribution Systems [SWR-24-13]

This software provides a data-driven approach for efficiently identifying high impedance faults (HIFs) in distribution systems. To tackle the nonlinearity of the voltage current trajectory of HIFs, we first formulate linear least squares problems to approximate the trajectory with piecewise functions. Then we collect the function features of all segments as inputs and use the support vector machine approach to efficiently identify HIFs at different locations.

Zhou, Yuqi↗

DOE OSTI2020

Online Parameter Estimation Methods for Adaptive Cruise Control Systems

Modeling Adaptive Cruise Control (ACC) vehicles enables the understanding of the impact of these vehicles on traffic flow. In this work, two online methods are used to provide real time system identification of ACC enabled vehicles. The first technique is a recursive least squares (RLS) approach, while the second method solves a nonlinear joint state and parameter estimation problem via particle filtering (PF). We provide a parameter identifiability analysis for both methods to analytically show that the model parameters are not identifiable using equilibrium driving. The accuracy and computational runtime of the online methods are compared to a commonly used offline simulation-based optimization (i.e., batch optimization) approach. The methods are tested on synthetic data as well as on empirical data collected directly from a 2019 model year ACC vehicle using data from sensors that are part of the stock ACC system. The online methods are scalable and provide comparable accuracy to the batch method. RLS runs in real time and is two orders of magnitude faster than the batch method for modest sized (e.g., 15 min) datasets. The particle filter also runs in real- time, and is also suitable in streaming applications in which the datasets can grow arbitrarily large.

33 ADVANCED PROPULSION SYSTEMS↗

NASA NTRS1992

Reconstruction of internal density distributions in porous bodies from laser ultrasonic data

It is presently shown that, for density-reconstruction problems in which information about the inhomogeneity is known a priori, the nonlinear least-squares algorithm yields satisfactory results on the basis of limited projection data. The back-projection algorithm, which obviates assumptions about the objective function to be reconstructed, does not recover the boundary of the inhomogeneity when the number of projections is limited and ray-bending is ignored.

Lu, Yichi↗

NASA NTRS2021

A Functional Interpolation Approach to Compute Period Orbits in the Circular Restricted Three-body Problem

In this paper, we develop a method to solve for periodic orbits, i.e., Lyapunov and Halo orbits, using a functional interpolation scheme called the Theory of Func- tional Connections (TFC). Using this technique, a periodic constraint is analyti- cally embedded into the TFC constrained expression. By doing this, the system of differential equations governing the three-body problem is transformed into an unconstrained optimization problem where simple numerical schemes can be used to find a solution, e.g., nonlinear least-squares is used. This allows for a simpler numerical implementation with comparable accuracy and speed to the traditional differential corrector method.

Mortari, Daniele↗

NASA NTRS2005

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

DOE OSTI2022

Comparing Calibration Algorithms for the Rapid Characterization of Pretreated Corn Stover Using Near-Infrared Spectroscopy

Rapid characterization of biomass composition is a key enabling technology for biorefineries—the ability to measure the chemical composition of biomass materials entering the biorefinery as well as the composition of key process intermediate streams would allow real-time process control and the development of robust models to predict process performance. The utility of near-infrared (NIR) spectroscopy for rapid characterization requires multivariate algorithms for building calibration models. The most prevalent algorithm used for building calibration models using NIR spectra is the linear modeling algorithm Partial Least Squares Regression (PLS). Nonlinear regression algorithms (which are typically more computationally intensive than linear modeling approaches) have gained popularity in recent years due to their ability to solve a wide variety of classification and regression problems and the dramatic increase in available computational resources. In this work, we demonstrate that a calibration model can predict the composition of corn stover process intermediate samples pretreated with three different treatments—hot water (HW), dilute acid (DA), and deacetylation followed by dilute acid (DDA). We quantitatively compare three different algorithms for building prediction models based on near-infrared spectroscopy—partial least squares (PLS), support vector machines (SVM), and random forests (RF). We demonstrate the utility of improving model performance by accounting for instrument performance variability using repeated measurements of standard materials (e.g., the “repeatability file” strategy) and investigate its performance with nonlinear regression techniques, and we discuss methods for quantifying the uncertainties of specific predictions among the three methods.

09 BIOMASS FUELS↗

NASA NTRS1997

Application of the Two-Step Filter to Process Ranging Measurements for Relative Navigation in an Elliptical Orbit

This estimator breaks a nonlinear estimation problem into a set of over determined 'first step' states which are linear in the observations and 'second step' states which are ultimately the states of interest. Linear estimation methods are applied to filter the observations and produce the optimal first step state estimate. The 'second step' states are obtained through iterative nonlinear parameter estimation considering the first step states as observations. It has been shown that this process exactly minimizes the least squares cost function for static problems and provides a better solution than the iterated extended Kalman filter (EKF) for dynamic problems. The two step filter is applied in this paper to process range and range rate measurements between the two spacecraft. Details of the application of the two step estimator to this problem will be given, highlighting the use of a test for ill-conditioned covariance estimates that can result from the first order covariance propagation. A comparison will be made between the performance of the two step filter and the IEKF.

Garrison, James L.↗

NASA NTRS2006

Multiple concurrent recursive least squares identification with application to on-line spacecraft mass-property identification

The present invention is a method for identifying unknown parameters in a system having a set of governing equations describing its behavior that cannot be put into regression form with the unknown parameters linearly represented. In this method, the vector of unknown parameters is segmented into a plurality of groups where each individual group of unknown parameters may be isolated linearly by manipulation of said equations. Multiple concurrent and independent recursive least squares identification of each said group run, treating other unknown parameters appearing in their regression equation as if they were known perfectly, with said values provided by recursive least squares estimation from the other groups, thereby enabling the use of fast, compact, efficient linear algorithms to solve problems that would otherwise require nonlinear solution approaches. This invention is presented with application to identification of mass and thruster properties for a thruster-controlled spacecraft.

Wilson, Edward↗

NASA NTRS1990

Constrained optimization using design of experiment surfaces

An algorithm for solving constrained optimization problems is presented. First, design of experiment techniques are used to survey the design space. After evaluating the objective and constraint functions, as specified by Taguchi orthogonal arrays, analytical models of these functions are generated using a least-squares regression analysis. Next, a nonlinear programming package is used to optimize the analytical model. Based on the optimization information, the design space is reduced so as to close in around the minimum, and the entire procedure is repeated until convergence. An important feature of the algorithm is that function gradients are not required; therefore, for problems in which gradients would have to be estimated using finite-differences the number of function evaluations required for the optimization is significantly reduced, when compared with traditional nonlinear programming techniques. In addition, there is no requirement that the gradients must be smooth and continuous.

Bolt, Marvin Vance↗