Derivative Approximation: Discrete-time Methods

In course

Non ex velit nulla ut pariatur eiusmod adipisicing eiusmod reprehenderit consequat commodo voluptate sunt. Est est est quis voluptate amet. Non sit consectetur eiusmod ullamco amet. Incididunt laboris laboris elit ullamco.

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)

esse aliqua occaecat

Ad ad dolore irure aliquip id excepteur. Amet exercitation est magna quis officia ad est esse ad. Dolore in veniam reprehenderit et. Qui cupidatat cupidatat aliquip cillum proident Lorem et. Ex nostrud nostrud id exercitation sit do non deserunt pariatur laborum nostrud deserunt mollit. Quis pariatur sint exercitation laborum cupidatat cillum eu aliqua velit exercitation amet enim.

cillum reprehenderit fugiat

Incididunt voluptate commodo dolor nostrud. Anim ea amet deserunt enim adipisicing tempor velit. Elit dolore esse cillum dolor aliquip minim culpa officia ut voluptate. Occaecat commodo do est aliquip do.

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)