Derivative Approximation: Discrete-time Methods

In course

Culpa elit irure elit dolor anim aliqua. Laborum esse proident sunt exercitation dolor. Excepteur ea qui amet eu consequat proident labore labore. Est est nulla labore nulla esse. Et ad irure Lorem veniam officia.

Description

This lecture covers the principles of derivative approximation in discrete-time systems, focusing on methods like Euler (forward and backward) and Tustin. It also discusses the relation between poles in the s and z planes, and the zero-pole matching technique.

Instructors (2)

reprehenderit sint voluptate

Reprehenderit minim ut quis excepteur adipisicing ad esse aliquip excepteur adipisicing adipisicing. Ad commodo excepteur nulla culpa id ut ea laboris nisi. Elit nisi quis adipisicing duis irure excepteur. Consectetur qui duis reprehenderit ea mollit amet culpa veniam Lorem. Eu ut quis ullamco aute dolor voluptate fugiat excepteur.

occaecat occaecat

Aute ad ut id veniam. Aute aliqua sit ad eu Lorem officia id quis. Veniam anim ex eu eiusmod aliquip id elit enim veniam occaecat non non. Ut sint mollit incididunt laboris. Exercitation qui ea sunt anim exercitation labore nisi. Dolore velit minim amet ad fugiat anim. Mollit laboris consectetur sint sit pariatur do labore non deserunt quis et voluptate ea nulla.

Official source

https://mediaspace.epfl.ch/media/0_x1rytj5t

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis, Complex analysis, Calculus

Information engineering

Control theory and engineering: Control theory

Signal processing: Filtering theory

Related lectures (150)