Search NASA⌕ Search

SEARCH · Search NASA

Results for “Ill-conditioning”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

Improvements in estimating proportions of objects from multispectral data

Methods for estimating proportions of objects and materials imaged within the instantaneous field of view of a multispectral sensor were developed further. Improvements in the basic proportion estimation algorithm were devised as well as improved alien object detection procedures. Also, a simplified signature set analysis scheme was introduced for determining the adequacy of signature set geometry for satisfactory proportion estimation. Averaging procedures used in conjunction with the mixtures algorithm were examined theoretically and applied to artificially generated multispectral data. A computationally simpler estimator was considered and found unsatisfactory. Experiments conducted to find a suitable procedure for setting the alien object threshold yielded little definitive result. Mixtures procedures were used on a limited amount of ERTS data to estimate wheat proportion in selected areas. Results were unsatisfactory, partly because of the ill-conditioned nature of the pure signature set.

Horwitz, H. M.↗
NASA NTRS1976

Structural optimization via a design space hierarchy

Mathematical programming techniques provide a general approach to automated structural design. An iterative method is proposed in which design is treated as a hierarchy of subproblems, one being locally constrained and the other being locally unconstrained. It is assumed that the design space is locally convex in the case of good initial designs and that the objective and constraint functions are continuous, with continuous first derivatives. A general design algorithm is outlined for finding a move direction which will decrease the value of the objective function while maintaining a feasible design. The case of one-dimensional search in a two-variable design space is discussed. Possible applications are discussed. A major feature of the proposed algorithm is its application to problems which are inherently ill-conditioned, such as design of structures for optimum geometry.

Vanderplaats, G. N.↗
NASA NTRS1977

Vectorization of linear discrete filtering algorithms

Linear filters, including the conventional Kalman filter and versions of square root filters devised by Potter and Carlson, are studied for potential application on streaming computers. The square root filters are known to maintain a positive definite covariance matrix in cases in which the Kalman filter diverges due to ill-conditioning of the matrix. Vectorization of the filters is discussed, and comparisons are made of the number of operations and storage locations required by each filter. The Carlson filter is shown to be the most efficient of the filters on the Control Data STAR-100 computer.

Schiess, J. R.↗
NASA NTRS1976

Additional comments on 'Multistage least-squares parameter estimation'

The purpose of this correspondence is to call attention to other solutions to the problem addressed in the above paper, that of adding or deleting parameters or measurements from a given linear model. The solution algorithms proposed in the article are numerically ill-conditioned and are less efficient, in terms of both computational and storage requirements, than the methods described here. Several numerically stable, compact, flexible, and efficient algorithms for analyzing the parameter estimation problem are described and others are referenced.

Bierman, G. J.↗
NASA NTRS1977

Orbit determination accuracies using satellite-to-satellite tracking

The uncertainty in relay satellite sate is a significant error source which cannot be ignored in the reduction of satellite-to-satellite tracking data. Based on simulations and real data reductions, it is numerically impractical to use simultaneous unconstrained solutions to determine both relay and user satellite epoch states. A Bayesian or least squares estimation technique with an a priori procedure is presented which permits the adjustment of relay satellite epoch state in the reduction of satellite-to-satellite tracking data without the numerical difficulties introduced by an ill-conditioned normal matrix.

Vonbun, F. O.↗
NASA NTRS1978

FASOR - A second generation shell of revolution code

An integrated computer program entitled Field Analysis of Shells of Revolution (FASOR) currently under development for NASA is described. When completed, this code will treat prebuckling, buckling, initial postbuckling and vibrations under axisymmetric static loads as well as linear response and bifurcation under asymmetric static loads. Although these modes of response are treated by existing programs, FASOR extends the class of problems treated to include general anisotropy and transverse shear deformations of stiffened laminated shells. At the same time, a primary goal is to develop a program which is free of the usual problems of modeling, numerical convergence and ill-conditioning, laborious problem setup, limitations on problem size and interpretation of output. The field method is briefly described, the shell differential equations are cast in a suitable form for solution by this method and essential aspects of the input format are presented. Numerical results are given for both unstiffened and stiffened anisotropic cylindrical shells and compared with previously published analytical solutions.

Cohen, G. A.↗
NASA NTRS1980

Reducing the error of geoid undulation computations by modifying Stokes' function

The truncation theory as it pertains to the calculation of geoid undulations based on Stokes' integral, but from limited gravity data, is reexamined. Specifically, the improved procedures of Molodenskii et al. are shown through numerical investigations to yield substantially smaller errors than the conventional method that is often applied in practice. In this improved method, as well as in a simpler alternative to the conventional approach, the Stokes' kernel is suitably modified in order to accelerate the rate of convergence of the error series. These modified methods, however, effect a reduction in the error only if a set of low-degree potential harmonic coefficients is utilized in the computation. Consider, for example, the situation in which gravity anomalies are given in a cap of radius 10 deg and the GEM 9 (20,20) potential field is used. Then, typically, the error in the computed undulation (aside from the spherical approximation and errors in the gravity anomaly data) according to the conventional truncation theory is 1.09 m; with Meissl's modification it reduces to 0.41m, while Molodenskii's improved method gives 0.45 m. A further alteration of Molodenskii's method is developed and yields an RMS error of 0.33 m. These values reflect the effect of the truncation, as well as the errors in the GEM 9 harmonic coefficients. The considerable improvement, suggested by these results, of the modified methods over the conventional procedure is verified with actual gravity anomaly data in two oceanic regions, where the GEOS-3 altimeter geoid serves as the basis for comparison. The optimal method of truncation, investigated by Colombo, is extremely ill-conditioned. It is shown that with no corresponding regularization, this procedure is inapplicable.

Jekeli, C.↗
NASA NTRS1980

A feasibility study of a 3-D finite element solution scheme for aeroengine duct acoustics

The advantage from development of a 3-D model of aeroengine duct acoustics is the ability to analyze axial and circumferential liner segmentation simultaneously. The feasibility of a 3-D duct acoustics model was investigated using Galerkin or least squares element formulations combined with Gaussian elimination, successive over-relaxation, or conjugate gradient solution algorithms on conventional scalar computers and on a vector machine. A least squares element formulation combined with a conjugate gradient solver on a CDC Star vector computer initially appeared to have great promise, but severe difficulties were encountered with matrix ill-conditioning. These difficulties in conditioning rendered this technique impractical for realistic problems.

Abrahamson, A. L.↗
NASA NTRS1981

Recent developments in quasi-Newton methods for structural analysis and synthesis

Unlike the Newton-Raphson method, quasi-Newton methods by virture of the updates and step length control procedures are globally convergent and hence better suited for the solution of nonlinear problems of structural analysis and synthesis. Extension of quasi-Newton algorithms to large scale problems has led to the development of sparse update algorithms and to economical strategies for evaluating sparse Hessians. Ill-conditioning problems have led to the development of self-scaled variable metric and conjugate gradient algorithms, as well as the use of the singular perturbation theory. This paper emphasizes the effectiveness of such quasi-Newton algorithms for nonlinear structural analysis and synthesis.

Kamat, M. P.↗
NASA NTRS1982

Analysis of Feedback Control Systems

BLOCK IT implements algorithm that obtains reduced-order feedback control equations for use in both time and frequency domain analysis. BLOCK IT computes real nonsingular similarity-transformation matrix-reduces real nonsymmetric matrix to block-diagonal form; each block is real quasi-upper triangular matrix. Algorithm works with defective and derogatory matrices. If program fails, algorithm generates data output used as guide for reformulation of mathematical equations that lead to ill-conditioned matrix not block-diagonalized.

Frisch, H. P.↗
NASA NTRS1981

Numerical analysis of spectral properties of coupled oscillator Schroedinger operators. I - Single and double well anharmonic oscillators

Several methods for computing many eigenvalues and eigenfunctions of a single anharmonic oscillator Schroedinger operator whose potential may have one or two minima are described. One of the methods requires the solution of an ill-conditioned generalized eigenvalue problem. This method has the virtue of using a bounded amount of work to achieve a given accuracy in both the single and double well regions. Rigorous bounds are given, and it is proved that the approximations converge faster than any inverse power of the size of the matrices needed to compute them. The results of computations for the g:phi(4):1 theory are presented. These results indicate that the methods actually converge exponentially fast.

Isaacson, D.↗
NASA NTRS1981

Spectral response from blackbody measurements

Far-infrared and submillimeter detector responsivity and spectral response measurements can be performed simultaneously by sweeping the temperature of a cooled blackbody. Such measurements yield n simultaneous linear equations for n blackbody temperatures. Matrix inversion solutions are observed to fail due to a matrix ill-conditioned for inversion. However, an unconditionally convergent iterative solution can be performed. Results for a gallium-doped germanium detector are described.

Moore, W. J.↗
NASA NTRS1982

Modified SUMT for structural synthesis

The concepts of the singular perturbation theory are employed to modify the SUMT (Sequential Unconstrained Minimization Technique) algorithm of Fiacco-McCormick (1968) in order to make it more robust and reliable. The algorithm, which uses a sequence of penalty parameters to convert a constrained problem into a sequence of unconstrained problems, suffers from the need to minimize an ill-conditioned penalty function. By using the modified SUMT algorithm on two different structural optimization problems, it is shown that the singular perturbation SUMT easily converges to accurate solutions.

Kamat, M. P.↗
NASA NTRS1984

Opening of an interface flaw in a layered elastic half-plane under compressive loading

A static analysis is given of the problem of an elastic layer perfectly bonded, except for a frictionless interface crack, to a dissimilar elastic half-plane. The free surface of the layer is loaded by a finite pressure distribution directly over the crack. The problem is formulated using the two dimensional linear elasticity equations. Using Fourier transforms, the governing equations are converted to a pair of coupled singular integral equations. The integral equations are reduced to a set of simultaneous algebraic equations by expanding the unknown functions in a series of Jacobi polynomials and then evaluating the singular Cauchy-type integrals. The resulting equations are found to be ill-conditioned and, consequently, are solved in the least-squares sense. Results from the analysis show that, under a normal pressure distribution on the free surface of the layer and depending on the combination of geometric and material parameters, the ends of the crack can open. The resulting stresses at the crack-tips are singular, implying that crack growth is possible. The extent of the opening and the crack-top stress intensity factors depend on the width of the pressure distribution zone, the layer thickness, and the relative material properties of the layer and half-plane.

Kennedy, J. M.↗
NASA NTRS1984

Two time scale stabilization of systems with output feedback

The problem of constant gain output feedback regulator design for linear systems with ill-conditioned dynamics is considered in the context of singular perturbation theory. A design approach is developed in which gains can be separately calculated to stabilize reduced-order slow and fast subsystem models. By employing the notion of combined control and observation spillover suppression, conditions are derived assuring that these gains will stabilize the full-order system, assuming sufficient frequency separation between the slow and fast subsystems. An LQ design procedure is described in which the spillover suppression conditions are satisfied by adjoining penalty functions to the subsystem performance indices. The theory is demonstrated in a controller design for a flexible space structure.

Moerder, D. D.↗
NASA NTRS1986

Modified Denavit-Hartenberg parameters for better location of joint axis systems in robot arms

The Denavit-Hartenberg parameters define the relative location of successive joint axis systems in a robot arm. A recent justifiable criticism is that one of these parameters becomes extremely large when two successive joints have near-parallel rotational axes. Geometrically, this parameter then locates a joint axis system at an excessive distance from the robot arm and, computationally, leads to an ill-conditioned transformation matrix. In this paper, a simple modification (which results from constraining a transverse vector between successive joint rotational axes to be normal to one of the rotational axes, instead of both) overcomes this criticism and favorably locates the joint axis system. An example is given for near-parallel rotational axes of the elbow and shoulder joints in a robot arm. The regular and modified parameters are extracted by an algebraic method with simulated measurement data. Unlike the modified parameters, extracted values of the regular parameters are very sensitive to measurement accuracy.

Barker, L. K.↗
NASA NTRS1986

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗
NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗