Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Polynomial Regulator Design

In course

ME-324: Discrete-time control of dynamical systems

On introduit les bases de l'automatique linéaire discrète qui consiste à appliquer une commande sur des intervalles uniformément espacés. La cadence de l'échantillonnage qui est associée joue un rôle primordial pour assurer la stabilité et la performance d ...

Description

This lecture covers the design of polynomial regulators using the RST method. It explains the factorization of the system matrix, simplification of terms, and the necessary conditions for simplification. The lecture also discusses the Diophantine equation, observer polynomial choice theory, and theoretical examples of observer design.

Instructor

Philippe Müllhaupt

Official source

Related concepts (32)

Factorization

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4. Factorization is not usually considered meaningful within number systems possessing division, such as the real or complex numbers, since any can be trivially written as whenever is not zero.

Factorization of polynomials

In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems. The first polynomial factorization algorithm was published by Theodor von Schubert in 1793. Leopold Kronecker rediscovered Schubert's algorithm in 1882 and extended it to multivariate polynomials and coefficients in an algebraic extension.

Matrix (mathematics)

In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a " matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra.

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

Matrix decomposition

In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems. In numerical analysis, different decompositions are used to implement efficient matrix algorithms. For instance, when solving a system of linear equations , the matrix A can be decomposed via the LU decomposition.

Related lectures (42)

RST Regulator: Theory and Implementation

Covers the theory and implementation of RST regulators, focusing on factorization of zeros and matrix writing.

Asymptotic States and S-matrix

Covers the concept of asymptotic states and S-matrix in quantum field theory, focusing on the evolution of wave packets and the scattering states.

Principles of Quantum Mechanics

Covers the principles of quantum mechanics, including the Measurement Principle and Max Born Rule.

Discrete Symmetries: Asymptotic States and S-matrix

Covers the concept of discrete symmetries, focusing on the introduction to asymptotic states and S-matrix.

Matrix Factorization: Least Squares Method Log in to Mediaspace to watch this video