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

Preconditioned conjugate residual methods for the solution of spectral equations

Conjugate residual methods for the solution of spectral equations are described. An inexact finite-difference operator is introduced as a preconditioner in the iterative procedures. Application of these techniques is limited to problems for which the symmetric part of the coefficient matrix is positive definite. Although the spectral equation is a very ill-conditioned and full matrix problem, the computational effort of the present iterative methods for solving such a system is comparable to that for the sparse matrix equations obtained from the application of either finite-difference or finite-element methods to the same problems. Numerical experiments are shown for a self-adjoint elliptic partial differential equation with Dirichlet boundary conditions, and comparison with other solution procedures for spectral equations is presented.

Wong, Y. S.↗
NASA NTRS1987

Real time identification of large space structures

Identification of frequencies, damping ratios, and mode shapes of large space structures (LSSs) are examined in real time. Real time processing allows for quick updates of model processing after a reconfiguration of structural failure. Recursive lattice least squares (RLLS) was selected as the baseline algorithm for the identification. Simulation results on a one dimensional LSS demonstrated that it provides good estimates, was not ill-conditioned in the presence of under-excited modes, allowed activity by a supervisory control system which prevented damage to the LSS or excessive drift, and was capable of real-time processing for typical LSS models. A suboptimal version of RLLS, which is equivalent to simulated parallel processing, was derived. A NASTRAN model of the dual keel U.S. space station was used to demonstrate the input/identification algorithm package in a more realistic simulation. Because the first eight flexible modes were very close together, the identification was much more difficult than in the simple examples. Even so, the model was accurately identified in real time.

Voss, Janice E.↗
NASA NTRS1987

Approximate polynomial preconditioning applied to biharmonic equations on vector supercomputers

Applying a finite difference approximation to a biharmonic equation results in a very ill-conditioned system of equations. This paper examines the conjugate gradient method used in conjunction with the generalized and approximate polynomial preconditionings for solving such linear systems. An approximate polynomial preconditioning is introduced, and is shown to be more efficient than the generalized polynomial preconditionings. This new technique provides a simple but effective preconditioning polynomial, which is based on another coefficient matrix rather than the original matrix operator as commonly used.

Wong, Yau Shu↗
NASA NTRS1988

Research on output feedback control

A summary is presented of the main results obtained during the course of research on output feedback control. The term output feedback is used to denote a controller design approach which does not rely on an observer to estimate the states of the system. Thus, the order of the controller is fixed, and can even be zero order, which amounts to constant gain ouput feedback. The emphasis has been on optimal output feedback. That is, a fixed order controller is designed based on minimizing a suitably chosen quadratic performance index. A number of problem areas that arise in this context have been addressed. These include developing suitable methods for selecting an index of performance, both time domain and frequency domain methods for achieving robustness of the closed loop system, developing canonical forms to achieve a minimal parameterization for the controller, two time scale design formulations for ill-conditioned systems, and the development of convergent numerical algorithms for solving the output feedback problem.

Calise, Anthony J.↗
NASA NTRS1988

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 constrained 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.↗
NASA NTRS1988

Numerically stable algorithm for discrete-ordinate-method radiative transfer in multiple scattering and emitting layered media

The transfer of monochromatic radiation in a scattering, absorbing, and emitting plane-parallel medium with a specified bidirectional reflectivity at the lower boundary is considered. The equations and boundary conditions are summarized. The numerical implementation of the theory is discussed with attention given to the reliable and efficient computation of eigenvalues and eigenvectors. Ways of avoiding fatal overflows and ill-conditioning in the matrix inversion needed to determine the integration constants are also presented.

Stamnes, Knut↗
NASA NTRS1988

Recovery of excitation intensity dependence in pulsed, focused beams - Nonsaturated case

It is shown how the dependence of a nonsaturated excitation process on local, instantaneous intensity can be obtained from temporally and spatially unresolved data by inversion, even for a nonuniform intensity distribution in the probe volume. This treatment is in contrast with the usual approach in which effects of nonuniform excitation are either disregarded or simulated. For exponential intensity profiles, the solution is obtained in the form of an Abel inversion. The ill-conditioned nature of the problem is demonstrated, and extension to the study of intensity-dependent line shapes is made.

Ruyten, Wilhelmus M.↗
NASA NTRS1988

Applications of square-root information filtering and smoothing in spacecraft orbit determination

The JPL (Jet Propulsion Laboratory) Orbit Determination Software System is a set of computer programs developed for the primary purpose of determining the flight path of deep-space mission spacecraft in NASA's Planetary Program and highly elliptical orbiting spacecraft in Earth orbit. The filtering processes available within the JPL Orbit Determination Software are discussed, and several examples are presented. In particular, solutions obtained by the Square Root Information Filter (SRIF) using Bierman's Estimation Subroutine Library (ESL) are discussed and compared with the solutions obtained by the singular value decomposition (SVD) technique. It is concluded that the SRIF filtering and smoothing algorithms are efficient and numerically stable for well-conditioned systems. The use of Bierman's ESL simplifies the task of maintaining the orbit determination software by providing efficient, tested filtering tools. For solving a large well-conditioned system (rank higher than 120), SRIF is approximately four times faster than SVD; however, for solving an ill-conditioned system, SVD is recommended.

Wang, Tseng-Chan↗