You are on page 1of 1

Linear Algebra (LA) Signal Analysis (SA)

1. Z-transform
1. Basic Vectors and Matrices
1.1. Definition of z transform
1.1. Definition of vectors
1.2. Scalar product of two vectors
Control System Design – Part I 1.2. Basic z transform (pulse, step, ramp, a^t)

1.3. Vectorial product of two vectors 1.3. Other z transforms


• Definition of Systems
1.4. Definition of matrix 1.4. Basic Properties of the Z-transform (linearity, temporal shifts, convolution, final value)
• 1.1 Definition of Systems
1.5. Product of a matrix and a vector 1.5. Other properties of the Z-transform
• 1.2 Definition of State
1.6. Product between two matrices 1.6. Definition of inverse z-transform
• 1.2.bis The 4 standard representations of systems (local/global i/o and i/s/o)
1.7. Definition of the inverse of a matrix 1.7. Algorithm to perform an inverse z transform (simple poles)
• 1.3. Superposition Principle and Linearity
1.8. Computation of the inverse of a matrix with Gauss 1.8. Algorithm to perform an inverse z transform (multiple poles)
• 1.4. Definition of Linear Time Invariant Systems
1.9. Determinant of a matrix 2. Laplace transform
1.10. Computation of determinant of a matrix • 2. Representations of LTI systems (Discrete Time) 2.1. Definition of laplace transform
• 2.1. State Space Representations (local i/s/o) DT 2.2. Basic Laplace transform (pulse, step, ramp, exponential\)
2. Linear Subspaces • 2.2. Definition of Transfer Matrix (local i/o) DT 2.3. Other Laplace transforms
2.1. Definition of linear combination of vectors • 2.3. Definition of Impulse Response Matrix (global i/o) DT
2.2. Definition of Linear Subspace • 2.4. Properties of the impulse response matrix DT 2.4. Basic Properties of the Laplace-transform (linearity, temporal shifts, convolution, final value)
2.3. Basis of a Linear Subspace • 2.5. Solution of a linear difference equation (global i/s/o) DT 2.5. Other properties of the Laplace-transform
2.4. Orthogonality of vector 2.6. Definition of inverse Laplace-transform
2.5. Orthogonal matrices and their properties • 3. Realizations 2.7. Algorithm to perform an inverse Laplace transform (simple poles)
2.6. Ortonormal and Ortogonal Basis • 3.1. The concept of Realization 2.8. Algorithm to perform an inverse Laplace transform (multiple poles)
2.7. Definition of Image and Kernel of a matrix • 3.2. Canonical State-Space Realizations
3. Fourier transform
2.8. Rank of a matrix • 3.3. The concept of Minimal Realization
3.1. Definition of laplace transform
2.9. Relationship between Image and Kernel of a matrix
3.2. Basic Fourier transform (pulse, step, ramp, exponential)
• 4. Comparison with the 4 Representations of LTI systems for Continuous Time
3.3. Frequential Meaning and Connection with Laplace Transform
3. Matrix Manipulations • 5. Zero Input Response and Zero State response (Discrete Time)
3.1. Change of basis of a matrix and similarity matrices • 5.1. Zero Input Response - Invertible A, Real Poles DT • 8. State Feedback (Discrete Time)
3.2. Eigenvalues and Eigenvector of a matrix • 5.2. Zero Input Response - Invertible A, Complex Poles DT
5.3. Zero Input Response -Non invertible A DT
• 8.1. Linear State Feedback and Closed Loop Systems TD
8.2. Eigenvalue Allocation
Automatic Control (AC)
3.3. Diagonalization and Diagonalizable matrices • •
3.4. Jordan form • 5.4. Modes and Eigenvalues, characterizations DT • 8.3. Definition of stabilizability, TD 1. Dynamic Systems
3.5. Factorization QR • 5.5. Use of the transfer matrix to compute the Zero State Response DT • 8.4. Linear Quadratic Regulation on Infinite Horizon TD 1.1. Introduction to dynamic systems
3.6. Singular Value Decomposition • 5.6. Zero State Response - DC Gain DT 1.2. Dynamics systems and ODE
3.7. Definition of Pseudo-inverse (simple) • 5.7. Zero State Response - Frequency Response Matrix DT • 9. State Feedback and Set Point Tracking (Discrete Time) 1.3. Linearization around an equilibrium
3.8. Computation of Pseudo-Inverse (with SVD) • 5.8. Comparison of ZSR and ZRI between DT and CT • 9.1. Open Loop mapping between Reference and Output DT 1.4. Introduction to stability
3.9. Triangular matrices and their properties • 9.2. Servo-System (with integrator) DT
3.10. Symmetric Matrices and their properties • 6. Stability (Continuous and Discrete Time) 2. Transfer Function of a SISO systems

3.11. Caley-Hamilton Theorem • 6.1. Definition of equilibria (CT & DT) • 10. Observability (Discrete Time) 2.1. Definition of Transfer Function
• 6.2. Definition of Stability, Attractivity (local and global), Asymptotic Stability (CT & DT) • 10.1. Observability DT 2.2. Block Composition
4. Linear Systems of equation • 6.3. Stability of Linear Systems (CT & DT) • 10.2. Observability Analysis and Non-Observable Subspace DT
3. Stability and Response of Elementary systems
4.1. Matrix Interpretation of a Linear Systems of equations • 6.4. Lyapunov Direct Method (local and global) (CT&DT) • 10.3.Duality
3.1. BIBO Stability Definition
4.2. Rouche-Capelli theorem: existence, and unicity of solutions • 6.5. Estimation of the basins of attraction using Lyapunov direct method (CT&DT) • 10.4. Canonical Observability Decomposition DT
3.2. BIBO Stability and Impulse Response
4.3. Solution of a square full rank system of equations • 6.6. Lasalle Invariance Principle (CT&DT) • 10.5. Observable and non observable eigenvalues and poles of 3.3. BIBO Stability and Transfer Functions
4.4. Solutions of an undetermined system of equation • 6.7. Lyapunov Instability Criterion (CT&DT) the transfer matrix DT 3.4. Impulse and Step response of First and Second Order systems
4.5. Least Means Square approximation of an unsolvable system of equation • 6.8. Cetoev Instability Criterion (CT&DT) • 10.6. Kalman Decomposition and Minimal Realizations DT
4.6. Gaussian Elimination • 6.9. Lyapunov Equation for LTI systems (CT&DT) 4. Harmonic Response
• 6.10. Linearization of a system around a point of equilibrium • 11. Observers (Discrete Time) 4.1. Harmonic Response of a SISO system
5. Bilinear Forms • 6.11. Lyapunov Indirect Method (CT & DT) • 11.1. Open Loop Observers 4.2. Bode Diagram: Introduction
5.1. Definition of a bilinear form • 6.12. BIBO Stability of LTI Systems (CT & DT) • 11.2. Luenberger Observers 4.3. Bode Diagram: Tracing rules
• 11.3. Definition of Detectability 4.4. Nyquist Diagram : Definition
5.2. Definition of positive definiteness
• 7. Reachability (Discrete Time) 4.5. Links between 1st and 2nd order systems poles and temporal and frequential properties
5.3. Positive definiteness for symmetric matrices
5.4. Properties of positive definite matrices • 7.1. Reachability Definition DT • 12. Dynamic Regulator (Discrete Time)
5. Feedback Systems
• 7.2. Reachability Analysis and Reachability Subspace DT • 12.1. Dynamic regulator structure DT 5.1. Introduction to Feedback
• 7.3. Canonical Reachability Decomposition DT • 12.2. Separation Principle DT 5.2. The problem of stability in feedback design
• 7.4. Reachable and unreachable eigenvalues and poles of the transfer matrix DT 5.3. Routh criterion
5.4. Root Locus : definitions
5.5. Root Locus : tracing rules
5.6. Nyquist Stability Criterion

6. Design
6.1. Steady State Response (internal model principles for step and ramp signals, use of integrator)
6.2. Closed-loop design in the frequency domain
6.3. Closed-loop design in the root-locus

7. Standard Control Schemes


7.1. Lead-Lag compensators, definition
7.2. Design of Lead-Lag compensators
7.3. Introduction to PID Regulators
 Click on the green buttons to reveal content unit prerequisites 7.4. Ziegler-Nichols PID tuning techniques

You might also like