11 |
Computational algorithms for stability analysis of linear systems with time-delay /Kalavagunta, Sushma, January 2003 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Vita. Includes bibliographical references (leaves 26-28). Also available on the Internet.
|
12 |
Computational algorithms for stability analysis of linear systems with time-delayKalavagunta, Sushma, January 2003 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Vita. Includes bibliographical references (leaves 26-28). Also available on the Internet.
|
13 |
Linear system design using state variable feedbackSlivinsky, Charles Robert, 1941- January 1966 (has links)
No description available.
|
14 |
Algorithms for singular systemsBeauchamp, Gerson 05 1900 (has links)
No description available.
|
15 |
Identification and control of nonlinear laboratory processesXi, Zhiyu, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW January 2007 (has links)
In this thesis, a class of control and identification methods on a typical laboratory process - a ball and beam system - are discussed. The ball and beam is a common laboratory process which contains nonlinearity, a double integrator and time-delay. In our project, the hardware made by Wincon (Quanser SRV02 +BB01) is used. The main contribution of this work is the development of a variety of controller design methods, which together with suitable parameter identification techniques provide tools for rapid prototyping for real time control of processes within the laboratory, in preparation for industrial implementation of more complex schemes. The novelty of this work lies in the use of model predictive control (MPC) methods based on a non-minimal state space formulation, which permits the inclusion of process measurements and actuations in the state vector, leading to controller designs which are immediately ready for on-line implementation. A linear MPC controller based on a non-minimal state space model is based on an approximate linear model. The results from simulation and online experiment show that the linear MPC controller realizes a satisfying reference tracking in the face of nonlinearity and time-delay. In the following chapter, a nonlinear Hammerstein model is identified, which is a type of reliable structure for describing nonlinear plants. A nonlinear MPC scheme is developed based on the Hammerstein model. An inversion block is created to cancel the effect of the nonlinearity. The performance IS also tested in both simulation and experiment. Finally, MPC is combined with sliding mode control. The non-minimal state space model is also used here. In the first part of this chapter, the idea underlying sliding mode control contributes a method of modifying the definition of the cost function in MPC. In the second half, MPC is used to design the switching surface in sliding mode control. The performance of tests on the example (ball and beam system) illustrates that these are both valid methods for dealing with complex processes.
|
16 |
Stability of parametrically forced linear systems /Leccese, Andrew J. January 1994 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1994. / Typescript. Includes bibliographical references.
|
17 |
On the external stability of linear systems with actuator saturation constraints, and the decentralized control of communicating-agent networks with security constraintsWen, Zheng, January 2007 (has links) (PDF)
Thesis (M.S. in electrical engineering)--Washington State University, August 2007. / Includes bibliographical references (p. 73-77).
|
18 |
Parallel algorithms for SIMD and MIMD computersLevin, Matthew D. January 1990 (has links)
The thesis is concerned with the inversion of matrices and the solution of linear systems and eigensystems in a parallel environment. Following an introductory chapter of concepts and definitions in the field of linear algebra, a general survey of parallel machines and algorithms is presented in Chapters 2 and 3, including a detailed description of the Distributed Array Processor (DAP) and the Neptune multiprocessing system. In Chapter 4, a new technique, the double-bordering algorithm, for the solution of linear systems is derived, and its application to the parallel solution of difference systems described. A modified form of the method for the inversion of matrices is derived, implemented on the Neptune multiprocessing system, and its performance compared with that of the Gauss-Jordan and (single) bordering algorithms. The results of the implementation of several other parallel algorithms are also presented. Chapter 5 deals with the class of matrices known as Toeplitz matrices, which arise in the field of signal processing. Trench's algorithm for the inversion of such matrices is implemented on the Neptune multiprocessing system, and, for the solution of banded symmetric Toeplitz systems, the relative efficiencies of three sequential strategies are compared: Levinson's algorithm, the double-bordering algorithm, and a method based on a novel factorisation scheme. Chapter 6 is concerned with the implementation of various iterative methods on the DAP. The solution of several difference systems by the Jacobi, Gauss-Seidel and successive over-relaxation (SOR) algorithms is compared with their solution by a variation (c. 1943) of the algorithms proposed by Hotelling, in which matrix-vector products are replaced by successive matrix squarings. The technique is also applied to the power method for the solution of the eigenvalue problem. The thesis concludes with a summary and recommendations for future work.
|
19 |
Multidimensional linear systems : factorisation and stabilisationLin, M. January 1987 (has links)
This thesis is concerned with various problems associated with the factorisation and feedback stabilisation of multidimensional linear discrete systems, which may be represented by rational matrices in several variables. Some factorisation techniques for polynomial and rational matrices in several variables have been explored and applied to the study of feedback stabilisation of multidimensional linear systems. The work presented here may be divided into two parts. The first part (Chapters 2 and 3) is concerned with two-dimensional systems, while the second part (Chapters 4 and 5) deals with three- and higher-dimensional systems. The emphasis of the first part is placed on the development of constructive algorithms for several kinds of factorisation of polynomial and rational matrices in two variables. In Chapter 2, an algorithm for obtaining primitive factorisation of polynomial matrices in two variables is developed, which is then followed by an algorithm for the decomposition of a rational matrix in two variables into factor coprime matrix fraction descriptions. Chapter 3 presents a procedure for the analysis and compensator design of two-dimensional feedback systems. A constructive algorithm for solving a Diophantine-type equation in two variables is derived. A necessary and sufficient condition for the feedback stabilisability of two-dimensional systems is obtained. The complete set of stabilising compensators for a given two-dimensional plant is then characterised. The role played by the matrix fraction description approach in the study of three- and higher dimensional systems, particularly with respect to the feedback stabilisation of these systems, is then investigated in detail in the second part. Chapter 4 deals with various kinds of factorisations for polynomial and rational matrices in three or more variables. For example, a criterion for the existence of primitive factorisation of a class of polynomial matrices in three or more variables is derived. By introducing a new concept: <i>generating polynomials</i>, it is shown that a direct generalisation of several existing results in two-dimensional systems theory to their higher-dimensional counterparts is not possible. In chapter 5, applying the generating polynomials, we obtain a stability test and a necessary and sufficient condition for feedback stabilisability of three- and higher-dimensional systems.
|
20 |
GPU computing of Heat EquationsZhang, Junchi 29 April 2015 (has links)
There is an increasing amount of evidence in scientific research and industrial engineering indicating that the graphic processing unit (GPU) has a higher efficiency and a stronger ability over CPUs to process certain computations. The heat equation is one of the most well-known partial differential equations with well-developed theories, and application in engineering. Thus, we chose in this report to use the heat equation to numerically solve for the heat distributions at different time points using both GPU and CPU programs. The heat equation with three different boundary conditions (Dirichlet, Neumann and Periodic) were calculated on the given domain and discretized by finite difference approximations. The programs solving the linear system from the heat equation with different boundary conditions were implemented on GPU and CPU. A convergence analysis and stability analysis for the finite difference method was performed to guarantee the success of the program. Iterative methods and direct methods to solve the linear system are also discussed for the GPU. The results show that the GPU has a huge advantage in terms of time spent compared with CPU in large size problems.
|
Page generated in 0.0506 seconds