On the design of optimal constrained dynamic compensators for linear constant systems
Optimal fixed dimensionality dynamic compensator design for linear time-invariant closed-loop system based on quadratic cost and gain criteria
Athans, M.↗
SEARCH · Engineering Papers
Results for “linear system”
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.
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.↗
Rapid identification of linear and nonlinear systems.
Rapid parameter identification system for linear time-invariant plant with only input and output measurable
TRANSFER FUNCTION↗
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↗
Novel Technique for Developing Linearized Convex System Models from Experimentally Derived Data
This poster provides an overview of a novel technique for developing linearized convex system models from experimentally derived data.
24 POWER TRANSMISSION AND DISTRIBUTION↗
The Problem of Package Guidance with Incomplete Information for a Linear Control System with a Delay
The control-package method is applied to solve the problem of constructing guaranteed positional guidance for a linear control dynamical system with a delay under incomplete information about the initial state. The problem is solved for the case when the initial state is contained in a compact functional set. A solvability criterion and a method for the construction of a guidance program package are proposed. The proposed procedure is applied to a particular linear control system of delayed differential equations.
97 MATHEMATICS AND COMPUTING↗
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.↗
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.↗
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.↗
Time and Frequency Domain Methods for Basis Selection in Random Linear Dynamical Systems
Polynomial chaos methods have been extensively used to analyze systems in uncertainty quantification. Furthermore, several approaches exist to determine a low-dimensional approximation (or sparse approximation) for some quantity of interest in a model, where just a few orthogonal basis polynomials are required. In this work, we consider linear dynamical systems consisting of ordinary differential equations with random variables. The aim of this paper is to explore methods for producing low-dimensional approximations of the quantity of interest further. We investigate two numerical techniques to compute a low-dimensional representation, which both fit the approximation to a set of samples in the time domain. On the one hand, a frequency domain analysis of a stochastic Galerkin system yields the selection of the basis polynomials. It follows a linear least squares problem. On the other hand, a sparse minimization yields the choice of the basis polynomials by information from the time domain only. An orthogonal matching pursuit produces an approximate solution of the minimization problem. Finally, we compare the two approaches using a test example from a mechanical application.
97 MATHEMATICS AND COMPUTING↗
High-Order Preconditioners for Modern Computing Architectures: Line-Based Discontinuous Galerkin Method on GPUs
The goals of our project are to be able to overcome issues that plague computing in modern architecture such as limited memory bandwidth, badly conditioned Jacobians, and restrictive time steps. We begin by describing the line-based discontinuous Galerkin (line DG) method for a scalar two-dimensional problem. Line DG has been shown to provide a significant increase in sparsity for Jacobian matrix, especially in the diagonal block elements. In addition to this, the implicit time integration scheme helps alleviate the time step restriction but requires solving a (potentially badly conditioned) linear system. We can precondition the linear system to facilitate the solution. Since we want to solve the system on the GPU, the increase in sparsity from the line DG method is helpful to alleviate the memory issue. We successfully implemented a computation of the Jacobian on the CPU and are currently working on the GPU implementation. Finally, I discuss how this opportunity to intern at Lawrence Livermore National Laboratory through the National Science Foundation Mathematical Sciences Graduate Internship has affected my personal and professional growth.
97 MATHEMATICS AND COMPUTING↗
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↗
A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows
This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.
97 MATHEMATICS AND COMPUTING↗
A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
A hierarchical solver is proposed for solving sparse ill-conditioned linear systems in parallel. The solver is based on a modification of the LoRaSp method, but employs a deferred-compression technique, which provably reduces the approximation error and significantly improves efficiency. Moreover, the deferred-compression technique introduces minimal overhead and does not affect parallelism. As a result, the new solver achieves linear computational complexity under mild assumptions and excellent parallel scalability. To demonstrate the performance of the new solver, we focus on applying it to solve sparse linear systems arising from ice sheet modeling. The strong anisotropic phenomena associated with the thin structure of ice sheets creates serious challenges for existing solvers. To address the anisotropy, we additionally developed a customized partitioning scheme for the solver, which captures the strong-coupling direction accurately. In general, the partitioning can be computed algebraically with existing software packages, and thus the new solver is generalizable for solving other sparse linear systems. Our results show that ice sheet problems of about 300 million degrees of freedom have been solved in just a few minutes using a thousand processors.
97 MATHEMATICS AND COMPUTING↗
Discrete control of linear distributed systems with application to the deformable primary mirror of a large orbiting telescope
One of the more significant technological problems associated with the orbital operation of large astronomical telescope's is the fabrication and maintenance of the primary mirror surface to the tolerance required for diffraction-limited performance. An interesting approach to the solution of this problem involves continuously measuring and automatically correcting the optical surface of a thin deformable mirror by means of discrete actuators located on its rear surface: The realization of diffraction-limited performance from a telescope in space by this method rests on the ability of the designer to achieve extremely accurate control of a highly complex, interacting, multivariable system. This paper presents the results of a detailed study of the discrete control of linear distributed systems with specific application to the design of a practical controller for a plant representative of a telescope primary mirror for an orbiting astronomical observatory. The problem of controlling the distributed plant is treated by employing modal techniques to represent variations in the optical figure. Distortion of the mirror surface, which arises primarily from thermal gradients, is countered by actuators working against a backing structure to apply a corrective force distribution to the controlled surface. Each displacement actuator is in series with a spring attached to the mirror by means of a pad intentionally introduced to restrict the excitation of high-order modes. Control is then exerted over a finite number (equal.to the number of actuators) of the most significant modes. Through the application of the modal expansion technique the mirror equation of motion is transformed tb a set of uncoupled, linear, time-invariant, ordinary differential equations. The desired dynamic response and static accuracy may then be achieved by the application of classical single-variable design techniques. The formulation of a quadratic performance index which incorporates a measure of image quality permits determination of the trade-off between the-number of actuators and optical purity. A criterion for defining actuator placement and pad size is presented which minimizes the tendency of the controller to excite the unmonitored modes.
Jeremiah F Creedon↗
Output feedback for linear multivariable systems with parameter uncertainty.
A minimax design method is applied to the problem of obtaining an acceptable output feedback matrix for linear multivariable systems with parameter uncertainty. The result is a set of nonlinear matrix equations (similar to those obtained by Levine and Athans (1970)), which must be solved for the feedback matrix. An example illustrates the technique and the fact that better results are achieved for large parameter variation than with a purely nominal design.
Basuthakur, S.↗
Model Order Reduction Algorithm for Estimating the Absorption Spectrum
The ab initio description of the spectral interior of the absorption spectrum poses both a theoretical and computational challenge for modern electronic structure theory. Due to the often spectrally dense character of this domain in the quantum propagator’s eigenspectrum for medium-to-large sized systems, traditional approaches based on the partial diagonalization of the propagator often encounter oscillatory and stagnating convergence. Electronic structure methods which solve the molecular response problem through the solution of spectrally shifted linear systems, such as the complex polarization propagator, offer an alternative approach which is agnostic to the underlying spectral density or domain location. This generality comes at a seemingly high computational cost associated with solving a large linear system for each spectral shift in some discretization of the spectral domain of interest. In this work, we present a novel, adaptive solution to this high computational overhead based on model order reduction techniques via interpolation. Model order reduction reduces the computational complexity of mathematical models and is ubiquitous in the simulation of dynamical systems and control theory. The efficiency and effectiveness of the proposed algorithm in the ab initio prediction of X-ray absorption spectra is demonstrated using a test set of challenging water clusters which are spectrally dense in the neighborhood of the oxygen K-edge. On the basis of a single, user defined tolerance we automatically determine the order of the reduced models and approximate the absorption spectrum up to the given tolerance. We also illustrate that, for the systems studied, the automatically determined model order increases logarithmically with the problem dimension, compared to a linear increase of the number of eigenvalues within the energy window. Furthermore, we observed that the computational cost of the proposed algorithm only scales quadratically with respect to the problem dimension.
IDREAM, K-Edge, theoretical, computational, electr↗
Discretization Procedure for Linear Dynamical Systems
We describe in detail a method of construction of a discrete linear dynamical model of a controllable object in the recurrent Cauchy form corresponding to an initial continuous dynamical system. We describe discretization algorithms for free and forced motion of a linear continuous dynamical system and propose methods of construction of the state, control, and perturbation transition matrices.
97 MATHEMATICS AND COMPUTING↗