Models of computation | Automata (computation) | Signal processing
In theoretical computer science, a discrete system is a system with a countable number of states. Discrete systems may be contrasted with continuous systems, which may also be called analog systems. A final discrete system is often modeled with a directed graph and is analyzed for correctness and complexity according to computational theory. Because discrete systems have a countable number of states, they may be described in precise mathematical models. A computer is a finite state machine that may be viewed as a discrete system. Because computers are often used to model not only other discrete systems but continuous systems as well, methods have been developed to represent real-world continuous systems as discrete systems. One such method involves sampling a continuous signal at discrete time intervals. (Wikipedia).
Discrete-Time Dynamical Systems
This video shows how discrete-time dynamical systems may be induced from continuous-time systems. https://www.eigensteve.com/
From playlist Data-Driven Dynamical Systems
Introduction to Discrete and Continuous Functions
This video defines and provides examples of discrete and continuous functions.
From playlist Introduction to Functions: Function Basics
Discrete Structures, Oct 20: Counting
Combinations, Permutations, Pigeonhole Principle
From playlist Discrete Structures
Connecting discrete and continuous systems
To have an effect in the real world, discrete systems have to sample sample continuous signals to operate on them and reconstruct their outputs to continuous signals. This video explains this and the problems associated with the z transform
From playlist Discrete
Discrete physical realisability 2019-04-12
Translating physical realisability to the discrete domain
From playlist Discrete
This video explains what is taught in discrete mathematics.
From playlist Mathematical Statements (Discrete Math)
Introduction to Discrete and Continuous Variables
This video defines and provides examples of discrete and continuous variables.
From playlist Introduction to Functions: Function Basics
Closed loop discrete controller Lecture 2019-04-08
Evaluating the response of a continuous system controlled by a discrete controller using several methods
From playlist Discrete
Wolfgang Schief: A canonical discrete analogue of classical circular cross sections of ellipsoids
Abstract: Two classical but perhaps little known facts of "elementary" geometry are that an ellipsoid may be sliced into two one-parameter families of circles and that ellipsoids may be deformed into each other in such a manner that these circles are preserved. In fact, as an illustration
From playlist Integrable Systems 9th Workshop
Two different problems that start with G(s) and end with G(z)
Here are two different scenarios where you start with a continuous function and end with a discrete one. In the first, you are trying to build a discrete approximation, in the second you are trying to find the exact response of a system with a sample and hold in front of it.
From playlist Modelica
Paul Kotyczka: Discrete-time port-Hamiltonian systems and control
CONFERENCE Recorded during the meeting "Energy-Based Modeling, Simulation, and Control of Complex Constrained Multiphysical Systems" the April 21, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other
From playlist Control Theory and Optimization
Lecture 23, Mapping Continuous-Time Filters to Discrete-Time Filters | MIT RES.6.007
Lecture 23, Mapping Continuous-Time Filters to Discrete-Time Filters Instructor: Alan V. Oppenheim View the complete course: http://ocw.mit.edu/RES-6.007S11 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT RES.6.007 Signals and Systems, 1987
Lecture 1, Introduction | MIT RES.6.007 Signals and Systems, Spring 2011
Lecture 1, Introduction Instructor: Alan V. Oppenheim View the complete course: http://ocw.mit.edu/RES-6.007S11 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist Fourier
Stability of Forward Euler and Backward Euler Integration Schemes for Differential Equations
In this video, we explore the stability of the Forward Euler and Backward/Implicit Euler integration schemes. In particular, we investigate the eigenvalues of these discrete-time update equations, relating the eigenvalues to the stability of the algorithm. This basic stability analysis t
From playlist Engineering Math: Differential Equations and Dynamical Systems
http://AllSignalProcessing.com for more great signal processing content, including concept/screenshot files, quizzes, MATLAB and data files. Definition and properties of the bilinear transform for converting between continuous- and discrete-time system representations in the context of fi
From playlist Infinite Impulse Response Filter Design
Important PID Concepts | Understanding PID Control, Part 7
Now that you ’ve gotten an overview of PID tuning techniques, this video moves on to discussing two important concepts in PID control: cascaded loops and discrete systems. Both concepts are fundamental to most practical control systems, and they each change the way you approach and think a
From playlist Understanding PID Control
Lecture 25, Feedback | MIT RES.6.007 Signals and Systems, Spring 2011
Lecture 25, Feedback Instructor: Alan V. Oppenheim View the complete course: http://ocw.mit.edu/RES-6.007S11 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT RES.6.007 Signals and Systems, 1987
OpenModelica for discrete systems
It can be very useful to build systems using graphical tools which allow us to think about the systems on a higher conceptual level and not worry about the implementation.
From playlist Modelica
DISCRETE Random Variables: Finite and Infinite Distributions (9-2)
A Discrete Random Variable is any outcome of a statistical experiment that takes on discrete (i.e., separate and distinct) numerical values. Discrete outcomes: all potential outcomes numerical values are integers (i.e., whole numbers). They cannot be negative. Using an example of tests in
From playlist Discrete Probability Distributions in Statistics (WK 9 - QBA 237)