Engineering Papers⌕ Search

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.

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

At least 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Transformation of two and three-dimensional regions by elliptic systems

A reliable linear system is presented for grid generation in 2-D and 3-D. The method is robust in the sense that convergence is guaranteed but is not as reliable as other nonlinear elliptic methods in generating nonfolding grids. The construction of nonfolding grids depends on having reasonable approximations of cell aspect ratios and an appropriate distribution of grid points on the boundary of the region. Some guidelines are included on approximating the aspect ratios, but little help is offered on setting up the boundary grid other than to say that in 2-D the boundary correspondence should be close to that generated by a conformal mapping. It is assumed that the functions which control the grid distribution depend only on the computational variables and not on the physical variables. Whether this is actually the case depends on how the grid is constructed. In a dynamic adaptive procedure where the grid is constructed in the process of solving a fluid flow problem, the grid is usually updated at fixed iteration counts using the current value of the control function. Since the control function is not being updated during the iteration of the grid equations, the grid construction is a linear procedure. However, in the case of a static adaptive procedure where a trial solution is computed and used to construct an adaptive grid, the control functions may be recomputed at every step of the grid iteration.

Mastin, C. Wayne↗
DOE OSTI2022

Data-driven Resilience Characterization of Control Dynamical Systems

In this paper, we define and quantify resiliency of a power network and propose data-driven algorithms for computing the same for the power grid. To do this, we use the Koopman operator framework to lift the controlled dynamical system to an abstract (possibly higher) dimensional space, where the evolution is linear. The linear system representation allows us to relate small time local controllability and observability of a general nonlinear control system to the controllability and observability of the lifted linear system. Finally, we define the resiliency of the underlying power grid in terms of the controllability and observability gramians of the lifted linear system. We illustrate the proposed approach to compute the resiliency metrics on time-series data obtained from a microgrid.

koopman operator, resilience, control↗
NASA NTRS1975

On the computation of minimal indices for linear multivariable systems

This paper presents an algorithm for the computation of the minimal indices for linear multivariable systems. The same algorithm can be used to determine the rank of a transfer function. As an application, this algorithm is shown to be useful in the design of non-interacting control systems.

Wang, S. H.↗
NASA NTRS1991

Design And Analysis Of Linear Control Systems

Package of five computer programs developed to assist in design and analysis of linear control systems by use of root-locus and frequency-response methods. Package written in FORTRAN (BODE, TPEAK) and BASIC (LOCUS, KTUNE, and POLYROOT).

Jamison, John W.↗
NASA NTRS1975

On the invertibility of linear multivariable systems

Some results concerning invertibility of a class of linear, time-invariant systems are presented. It is shown that by an appropriate factorization of the transfer matrix of such a system, the problem of checking its invertibility can be reduced to that of checking the invertibility of a lower-order system. A sufficient condition for invertibility is also obtained.

Patel, R. V.↗
NASA NTRS2001

Multigrid approaches to non-linear diffusion problems on unstructured meshes

The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.

Mavriplis, Dimitri J.↗
NASA NTRS1979

Robustness of multiloop linear feedback systems

This paper presents a new approach to the frequency-domain analysis of multiloop linear feedback systems. The properties of the return difference equation are examined using the concepts of singular values, singular vectors and the spectral norm of a matrix. A number of new tools for multiloop systems are developed which are analogous to those for scalar Nyquist and Bode analysis. These provide a generalization of the scalar frequency-domain notions such as gain, bandwidth, stability margins and M-circles, and provide considerable insight into system robustness.

Doyle, J. C.↗
NASA NTRS1994

A linear method for analyzing lightning field changes

A constrained, least-squares method for analyzing multiple-station measurements of lightning field changes (delta Es) is introduced. Previous methods have attempted to fit the spatial pattern of lightning delta Es using nonlinear models, such as a point charge (Q) or a point dipole (P) model. With the linear method, the delta Es are described not by models but by a general volume charge distribution that is deposited on a large (40 x 40 x 20 cu km) Cartesian grid above the measuring network. A linear system of equations is used to relate the measured delta Es to the charges that are deposited at each grid point. With this approach, the information content of the measurements can be quantified by an eigenanalysis of the covariance matrix of the linear system. Constraints can be used to reduce the infinity of possible solutions to the linear system and also to reduce systematic biases that can be introduced by the method of solution. It is shown that a Landweber iterative method, derived from the general method of steepest descent, can be used to solve the linear system and that the resulting volume charge distributions are generally consistent with computer-simulated charge sources, when these sources are over the measuring network. The Landweber iteration has also provided solutions for natural lightning events that are consistent with Q- and P-model results.

Koshak, William J.↗
NASA NTRS1993

Multivariable control of the Space Shuttle Remote Manipulator System using linearization by state feedback

This paper demonstrates an approach to nonlinear control system design that uses linearization by state feedback to allow faster maneuvering of payloads by the Shuttle Remote Manipulator System (SRMS). A nonlinear feedback law is defined to cancel the nonlinear plant dynamics so that a linear controller can be designed for the SRMS. First a nonlinear design model was generated via SIMULINK. This design model included nonlinear arm dynamics derived from the Lagrangian approach, linearized servo model, and linearized gearbox model. The current SRMS position hold controller was implemented on this system. Next, a trajectory was defined using a rigid body kinematics SRMS tool, KRMS. The maneuver was simulated. Finally, higher bandwidth controllers were developed. Results of the new controllers were compared with the existing SRMS automatic control modes for the Space Station Freedom Mission Build 4 Payload extended on the SRMS.

Gettman, Chang-Ching L.↗
NASA NTRS1996

Indirect Identification of Linear Stochastic Systems with Known Feedback Dynamics

An algorithm is presented for identifying a state-space model of linear stochastic systems operating under known feedback controller. In this algorithm, only the reference input and output of closed-loop data are required. No feedback signal needs to be recorded. The overall closed-loop system dynamics is first identified. Then a recursive formulation is derived to compute the open-loop plant dynamics from the identified closed-loop system dynamics and known feedback controller dynamics. The controller can be a dynamic or constant-gain full-state feedback controller. Numerical simulations and test data of a highly unstable large-gap magnetic suspension system are presented to demonstrate the feasibility of this indirect identification method.

Huang, Jen-Kuang↗
NASA NTRS1972

Digital simulation of stiff linear dynamic systems.

A method is derived for digital computer simulation of linear time-invariant systems when the insignificant eigenvalues involved in such systems are eliminated by an ALSAP root removal technique. The method is applied to a thirteenth-order dynamic system representing a passive RLC network.

Holland, L. D.↗
NASA NTRS1992

A numerical method for solving systems of linear ordinary differential equations with rapidly oscillating solutions

The present numerical method for accurate and efficient solution of systems of linear equations proceeds by numerically developing a set of basis solutions characterized by slowly varying dependent variables. The solutions thus obtained are shown to have a computational overhead largely independent of the small size of the scale length which characterizes the solutions; in many cases, the technique obviates series solutions near singular points, and its known sources of error can be easily controlled without a substantial increase in computational time.

Bernstein, Ira B.↗
NASA NTRS1990

Stochastic Satbility and Performance Robustness of Linear Multivariable Systems

Stochastic robustness, a simple technique used to estimate the robustness of linear, time invariant systems, is applied to a single-link robot arm control system. Concepts behind stochastic stability robustness are extended to systems with estimators and to stochastic performance robustness. Stochastic performance robustness measures based on classical design specifications are introduced, and the relationship between stochastic robustness measures and control system design parameters are discussed. The application of stochastic performance robustness, and the relationship between performance objectives and design parameters are demonstrated by means of example. The results prove stochastic robustness to be a good overall robustness analysis method that can relate robustness characteristics to control system design parameters.

Ryan, Laurie E.↗
NASA NTRS2007

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.

Memarsadeghi, Nargess↗