SEARCH · Engineering Papers

Results for “linear systems”

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 847 records · Page 47

All sources NASA NTRS DOE OSTI

NASA NTRS1973

Introduction to computer image processing

Theoretical backgrounds and digital techniques for a class of image processing problems are presented. Image formation in the context of linear system theory, image evaluation, noise characteristics, mathematical operations on image and their implementation are discussed. Various techniques for image restoration and image enhancement are presented. Methods for object extraction and the problem of pictorial pattern recognition and classification are discussed.

Moik, J. G.↗

NASA NTRS1973

Method of accounting for instrumental distortions during observation of signals

A method is proposed for accounting for instrumental distortions in linear systems with known dynamic characteristics.

Kazlauskas, K. A.↗

NASA NTRS1974

Parallel tridiagonal equation solvers

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Stone, H. S.↗

NASA NTRS1974

Robust design of dynamic observers

The two (identity) observer realizations z = Mz + Ky and z = transpose of Az + transpose of K(y - transpose of Cz), respectively called the open loop and closed loop realizations, for the linear system x = Ax, y = Cx are analyzed with respect to the requirement of robustness; i.e., the requirement that the observer continue to regulate the error x - z satisfactorily despite small variations in the observer parameters from the projected design values. The results show that the open loop realization is never robust, that robustness requires a closed loop implementation, and that the closed loop realization is robust with respect to small perturbations in the gains transpose of K if and only if the observer can be built to contain an exact replica of the unstable and underdamped dynamics of the system being observed. These results clarify the stringent accuracy requirements on both models and hardware that must be met before an observer can be considered for use in a control system.

Bhattacharyya, S. P.↗

NASA NTRS1974

On the application of deterministic optimization methods to stochastic control problems

A technique is presented by which deterministic optimization techniques, for example, the maximum principle of Pontriagin, can be applied to stochastic optimal control problems formulated around linear systems with Gaussian noises and general cost criteria. Using this technique, the stochastic nature of the problem is suppressed but for two expectation operations, the optimization being deterministic. The use of the technique in treating problems with quadratic and nonquadratic costs is illustrated.

Kramer, L. C.↗

NASA NTRS1974

Finite element solution algorithm for incompressible fluid dynamics

A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the transient motion of a viscous incompressible fluid, i.e., hydrodynamics. Dependent variable transformation renders the differential equation description uniformly elliptic. The finite element algorithm is established using the Galerkin criterion on a local basis within the Method of Weighted Residuals. It is unconstrained with respect to system linearity, computational mesh uniformity or solution domain closure regularity. The finite element matrices are established using a linear 'natural coordinate function' description. Computational solutions using the COMOC computer program illustrate the various features of the algorithm including recirculating flows.

Baker, A. J.↗

NASA NTRS1974

Prediction of compressor stall for distorted and undistorted flow by use of a multistage compressor simulation on the digital computer

Daniele, C. J.↗

NASA NTRS1974

Normal-mode approach to wave propagation in the turbulent atmosphere

Recent studies have used the superposition principle (extended Huygens-Fresnel principle) to characterize completely the statistics of a field that has propagated through a thick slab of turbulent air in terms of the statistics for spherical-wave sources. In this paper, we consider the normal-mode decomposition associated with this linear system propagation model. In particular, we use the statistics of the atmospheric impulse response (Green's function) to show that the atmospheric mode decomposition exhibits far-field and near-field regimes very similar to those of free-space propagation. The significance of these results for optical communication through the atmosphere is briefly discussed.

Shapiro, J. H.↗

NASA NTRS1975

Prediction of compressor stall for distorted and undistorted flow by use of a multistage compressor simulation on the digital computer

A simulation technique is presented for the prediction of compressor stall for axial-flow compressors for clean and distorted inlet flow. The simulation is implemented on the digital computer and uses stage stacking and lumped-volume gas dynamics. The resulting nonlinear differential equations are linearized about a steady-state operating point, and a Routh-Hurwitz stability test is performed on the linear system matrix. Parallel compressor theory is utilized to extend the technique to the distorted inlet flow problem. The method is applied to the eight-stage J85-13 compressor. Analytical stall prediction for the undistorted stall line shows good agreement with experimental results. The predicted stall line for distorted inlet flow is in agreement with experimental results only for large distortion extents and/or low distortion levels. Results for low distortion extents and high distortion level do not agree with experimental results.

Daniele, C. J.↗

NASA NTRS1975

Interpolation in numerical optimization

The present work discusses the generation of the cubic-spline interpolator in numerical optimization methods which use a variable-step integrator with step size control based on local relative truncation error. An algorithm for generating the cubic spline with successive over-relaxation is presented which represents an improvement over that given by Ralston and Wilf (1967). Rewriting the code reduces the number of N-vectors from eight to one. The algorithm is formulated in such a way that the solution of the linear system set up yields the first derivatives at the nodal points. This method is as accurate as other schemes but requires the minimum amount of storage.

Hall, K. R.↗

NASA NTRS1975

Finite element computation of a viscous compressible free shear flow governed by the time dependent Navier-Stokes equations

A finite element algorithm for solution of fluid flow problems characterized by the two-dimensional compressible Navier-Stokes equations was developed. The program is intended for viscous compressible high speed flow; hence, primitive variables are utilized. The physical solution was approximated by trial functions which at a fixed time are piecewise cubic on triangular elements. The Galerkin technique was employed to determine the finite-element model equations. A leapfrog time integration is used for marching asymptotically from initial to steady state, with iterated integrals evaluated by numerical quadratures. The nonsymmetric linear systems of equations governing time transition from step-to-step are solved using a rather economical block iterative triangular decomposition scheme. The concept was applied to the numerical computation of a free shear flow. Numerical results of the finite-element method are in excellent agreement with those obtained from a finite difference solution of the same problem.

Cooke, C. H.↗

NASA NTRS1975

Fully unsteady subsonic and supersonic potential aerodynamics for complex aircraft configurations with applications to flutter

A general formulation is presented for the analysis of steady and unsteady, subsonic and supersonic aerodynamics for complex aircraft configurations. The theoretical formulation, the numerical procedure, the description of the program SOUSSA (steady, oscillatory and unsteady, subsonic and supersonic aerodynamics) and numerical results are included. In particular, generalized forces for fully unsteady (complex frequency) aerodynamics for a wing-body configuration, AGARD wing-tail interference in both subsonic and supersonic flows as well as flutter analysis results are included. The theoretical formulation is based upon an integral equation, which includes completely arbitrary motion. Steady and oscillatory aerodynamic flows are considered. Here small-amplitude, fully transient response in the time domain is considered. This yields the aerodynamic transfer function (Laplace transform of the fully unsteady operator) for frequency domain analysis. This is particularly convenient for the linear systems analysis of the whole aircraft.

Tseng, K.↗

NASA NTRS1975

A discussion of dynamic stability measurement techniques

Techniques for the measurement of the dynamic stability of linear systems are discussed. Particular attention is given to an analysis of the errors in the procedures, and to methods for calculating the system damping from the data. The techniques discussed include: transient decay, moving block analysis, spectral analysis, random decrement signatures, transfer function analysis, and parameter identification methods. The special problems of rotorcraft dynamic stability testing are discussed.

Johnson, W.↗

NASA NTRS1976

Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

Putney, B. H.↗

NASA NTRS1976

Optimization of multi-constrained structures based on optimality criteria

A weight-reduction algorithm is developed for the optimal design of structures subject to several multibehavioral inequality constraints. The structural weight is considered to depend linearly on the design variables. The algorithm incorporates a simple recursion formula derived from the Kuhn-Tucker necessary conditions for optimality, associated with a procedure to delete nonactive constraints based on the Gauss-Seidel iterative method for linear systems. A number of example problems is studied, including typical truss structures and simplified wings subject to static loads and with constraints imposed on stresses and displacements. For one of the latter structures, constraints on the fundamental natural frequency and flutter speed are also imposed. The results obtained show that the method is fast, efficient, and general when compared to other competing techniques. Extensions to the generality of the method to include equality constraints and nonlinear merit functions is discussed.

Rizzi, P.↗

NASA NTRS1976

Numerical solution of the state dependent noise problem

A numerical technique is given for solving the matrix quadratic equation that arises in the optimal stationary control of linear systems with state (and/or control) dependent noise. The technique exploits fully existing, efficient algorithms for the matrix Lyapunov and Ricatti equations. The computational requirements are discussed, with an associated example.

Kleinman, D. L.↗

NASA NTRS1976

Optimal command generation for tracking a class of discontinuous trajectories

Commands are found to drive a linear system to optimally track a class of prescribed trajectories, each of which contains a point of discontinuity. The paper focuses on the guidance problem of command generation, to be implemented in a feedforward fashion; the necessary additional control or feedback regulation structure is not studied in detail, but assumed to be provided in applications as a conventional error-feedback regulator. Solutions are found for the infinite-time problem which are optimal with respect to a quadratic performance criterion; suboptimal controls which satisfy a continuity condition are also found. The controls have applications to certain problems in aircraft guidance where command trajectories are piecewise continuous. Several examples are worked out in detail, with comparisons with conventional, nonfeedforward solutions to the problem, and a brief discussion of a simpler, suboptimal solution.

Weissenberger, S.↗

NASA NTRS1976

A variant of nested dissection for solving n by n grid problems

Nested dissection orderings are known to be very effective for solving the sparse positive definite linear systems which arise from n by n grid problems. In this paper nested dissection is shown to be the final step of incomplete nested dissection, an ordering which corresponds to the premature termination of dissection. Analyses of the arithmetic and storage requirements for incomplete nested dissection are given, and the ordering is shown to be competitive with nested dissection under certain conditions.

George, A.↗