Iterative methods for solving nonlinear least squares problems
Iterative methods for solving nonlinear least squares problems
SEARCH · Search NASA
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.
Iterative methods for solving nonlinear least squares problems
Mathematical and numerical least squares solution of linear equations, using Householder algorithm
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.
Methods are given for computing the covariance matrix for the solution vector of an equality-constrained least squares problem. The methods are matched to the solution algorithms given in the book, 'Solving Least Squares Problems.'
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.
Algorithms and original data matrix approaches compared for linear least squares problem
A systematic pointing error model is used to calibrate antennas in the Deep Space Network. The least squares problem is described and analyzed along with the solution methods used to determine the model's parameters. Specifically studied are the rank degeneracy problems resulting from beam pointing error measurement sets that incorporate inadequate sky coverage. A least squares parameter subset selection method is described and its applicability to the systematic error modeling process is demonstrated on Voyager 2 measurement distribution.
A new algorithm for solving nonlinear least-squares and nonlinear equation problems is proposed which is based on approximating the nonlinear functions using the quadratic-tensor model by Schnabel and Frank. The algorithm uses a trust region defined by a box containing the current values of the unknowns. The algorithm is found to be effective for problems with linear constraints and dense Jacobian matrices.
Approximation optimal trajectories - selection of estimation variables in least squares program, and computer program application
A modified matrix product is explained, and it is shown that this product defiles a group whose inverse is called the incomplete inverse. It was proven that the incomplete inverse of an augmented normal matrix includes all the quantities associated with the least squares solution. An answer is provided to the problem that occurs when the data residuals are too large and when insufficient data to justify augmenting the model are available.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Least squares gradient method for boundary value and optimization problems found in flight mechanics and astrodynamics
A partial differential equation model of a cantilevered beam with a tip mass at its free end is used to study damping in a composite. Four separate damping mechanisms consisting of air damping, strain rate damping, spatial hysteresis and time hysteresis are considered experimentally. Dynamic tests were performed to produce time histories. The time history data is then used along with an approximate model to form a sequence of least squares problems. The solution of the least squares problem yields the estimated damping coefficients. The resulting experimentally determined analytical model is compared with the time histories via numerical simulation of the dynamic response. The procedure suggested here is compared with a standard modal damping ratio model commonly used in experimental modal analysis.
A partial differential equation model of a cantilevered beam with a tip mass at its free end is used to study damping in a composite. Four separate damping mechanisms consisting of air damping, strain rate damping, spatial hysteresis and time hysteresis are considered experimentally. Dynamic tests were performed to produce time histories. The time history data is then used along with an approximate model to form a sequence of least squares problems. The solution of the least squares problem yields the estimated damping coefficients. The resulting experimentally determined analytical model is compared with the time histories via numerical simulation of the dynamic response. The procedure suggested here is compared with a standard modal damping ratio model commonly used in experimental modal analysis.
The author develops a computational approach to multivariable frequency domain identification, based on 2-norm minimization. In particular, a Gauss-Newton (GN) iteration is developed to minimize the 2-norm of the error between frequency domain data and a matrix fraction transfer function estimate. To improve the global performance of the optimization algorithm, the GN iteration is initialized using the solution to a particular sequentially reweighted least squares problem, denoted as the SK iteration. The least squares problems which arise from both the SK and GN iterations are shown to involve sparse matrices with identical block structure. A sparse matrix QR factorization method is developed to exploit the special block structure, and to efficiently compute the least squares solution. A numerical example involving the identification of a multiple-input multiple-output (MIMO) plant having 286 unknown parameters is given to illustrate the effectiveness of the algorithm.
In this article, a parallel algorithm which applies Givens rotations to selectively annihilate k(k + 1)/2 nonzero elements from two k x n(k not more than n) upper trapezoidal submatrices is described. The new algorithm is suitable for implementation on either a pair of directly connected local-memory processors or two clusters of multiple tightly-coupled processors. Analyses show that in both cases the proposed algorithms achieve optimal speed-up by balancing the work load distribution and masking interprocessor or intercluster communication by computation if k is much small than n. In the context of solving large scale least squares problems, this submatrix merging step is repetitively needed during the entire computation and, furthermore, there are usually many pairs of such submatrices to be merged with each submatrix stored in the memory of a processor or a cluster of processors. The proposed algorithm can be applied to each pair of submatrices concurrently, and thus parallelizes an important step in solving the least squares problems.
The general problem of gyro calibration can be stated as the estimation of the scale factors, misalignments, and drift-rate biases of the gyro using the on-orbit sensor measurements. These gyro parameters have been traditionally treated as temperature-independent in the operational flight dynamics ground systems at NASA Goddard Space Flight Center (GSFC), a scenario which has been successfully applied in the gyro calibration of a large number of missions. A significant departure from this is the Microwave Anisotropy Probe (MAP) mission where, due to the high thermal variations expected during the mission phase, it is necessary to model the scale factors as functions of temperature. This paper addresses the issue of gyro calibration for the MAP gyro model using a manufacturer-supplied model of the variation of scale factors with temperature. The problem is formulated as a least squares problem and solved using the Levenberg-Marquardt algorithm in the MATLAB(R) library function NLSQ. The algorithm was tested on simulated data with Gaussian noise for the quaternions as well as the gyro rates and was found to consistently converge close to the true values. Significant improvement in accuracy was noticed due to the estimation of the temperature-dependent scale factors as against constant scale factors.