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

Lecture

Difference Equations and Controllers

In course

ME-321: Control systems + TP

Provides the students with basic notions and tools for the analysis and control of dynamic systems. Shows them how to design controllers and analyze the performance of controlled systems. ...

Description

This lecture covers linear difference equations, their algebraic representation, discretization, and the Tustin approximation for ODEs. It also explains the PI and lead compensator controllers, impact of sample rate on frequency response, and various approximation techniques.

Instructors (2)

Christophe Salzmann

Colin Neil Jones

Colin Jones is an Associate Professor in the Automatic Control Laboratory at the Ecole Polytechnique Federale de Lausanne (EPFL) in Switzerland. He was a Senior Researcher at the Automatic Control Lab at ETH Zurich until 2011 and obtained a PhD in 2005 from the University of Cambridge for his work on polyhedral computational methods for constrained control. Prior to that, he was at the University of British Columbia in Canada, where he took a BASc and MASc in Electrical Engineering and Mathematics. Colin has worked in a variety of industrial roles, ranging from commercial building control to the development of custom optimization tools focusing on retail human resource scheduling. His current research interests are in the theory and computation of predictive control and optimization, and their application to green energy generation, distribution and management.

Official source

Related concepts (29)

Discretization

In applied mathematics, discretization is the process of transferring continuous functions, models, variables, and equations into discrete counterparts. This process is usually carried out as a first step toward making them suitable for numerical evaluation and implementation on digital computers. Dichotomization is the special case of discretization in which the number of discrete classes is 2, which can approximate a continuous variable as a binary variable (creating a dichotomy for modeling purposes, as in binary classification).

Finite difference

A finite difference is a mathematical expression of the form f (x + b) − f (x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the numerical solution of differential equations, especially boundary value problems. The difference operator, commonly denoted is the operator that maps a function f to the function defined by A difference equation is a functional equation that involves the finite difference operator in the same way as a differential equation involves derivatives.

Lie algebra representation

In the mathematical field of representation theory, a Lie algebra representation or representation of a Lie algebra is a way of writing a Lie algebra as a set of matrices (or endomorphisms of a vector space) in such a way that the Lie bracket is given by the commutator. In the language of physics, one looks for a vector space together with a collection of operators on satisfying some fixed set of commutation relations, such as the relations satisfied by the angular momentum operators.

Algebra representation

In abstract algebra, a representation of an associative algebra is a module for that algebra. Here an associative algebra is a (not necessarily unital) ring. If the algebra is not unital, it may be made so in a standard way (see the adjoint functors page); there is no essential difference between modules for the resulting unital ring, in which the identity acts by the identity mapping, and representations of the algebra.

Representation theory

Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures. In essence, a representation makes an abstract algebraic object more concrete by describing its elements by matrices and their algebraic operations (for example, matrix addition, matrix multiplication).

Related lectures (31)

Discrete Systems Theory

Covers difference equations, dynamic systems, linearity, and impulse response in discrete systems.

Discrete Systems: Relations, Linear Dynamics, and Operators

Covers discrete systems, linear dynamics, causality, impulse response, convolution, and operators' effects.

The z-transform: Basics and Applications

Introduces the z-transform, covering its basics, applications to systems, and practical examples.

Signals & Systems II: Roots, Equations, and Impulse Responses

Explores roots verification, stability, reproduction modeling, Z transform, and LTI systems realization.

Finite Difference Method: Approximating Derivatives and Equations