Scribd
Upload
53 views

Mod4 Lec2

The document discusses transfer functions and polynomial equations. It provides information on representing transfer functions as polynomials divided by polynomials. It also covers deriving coefficients of polynomials using recursion relations.

Uploaded by

lvrevathi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
53 views

Mod4 Lec2

The document discusses transfer functions and polynomial equations. It provides information on representing transfer functions as polynomials divided by polynomials. It also covers deriving coefficients of polynomials using recursion relations.

Uploaded by

lvrevathi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

▪

𝒑(𝒔) 𝒃𝒎 𝒔𝒎 + 𝒃𝒎−𝟏 𝒔𝒎−𝟏 + ⋯ + 𝒃𝟏 𝒔 + 𝒃𝟎


𝑻 𝒔 = =
𝒒(𝒔) 𝒂𝒏 𝒔𝒏 + 𝒂𝒏−𝟏 𝒔𝒏−𝟏 + ⋯ + 𝒂𝟏 𝒔 + 𝒂𝟎
▪
𝒒 𝒔 = 𝒂𝒏 𝒔𝒏 + 𝒂𝒏−𝟏 𝒔𝒏−𝟏 + ⋯ + 𝒂𝟏 𝒔 + 𝒂𝟎 = 𝟎

▪
𝒒 𝒔 = 𝒂𝒏 𝒔 − 𝒑𝟏 𝒔 − 𝒑𝟐 ⋯ 𝒔 − 𝒑𝒏 = 𝟎
𝒏

⇒ 𝒒 𝒔 = 𝒂𝒏 ෑ(𝒔 − 𝒑𝒊 ) = 𝟎
𝒊=𝟏
▪
𝒏 𝒏 𝒏

𝒒 𝒔 = 𝒂𝒏 𝒔𝒏 − 𝒂𝒏 ෍ 𝒑𝒊 𝒔𝒏−𝟏 + 𝒂𝒏 ෍ 𝒑𝒊 𝒑𝒋 𝒔𝒏−𝟐 − ⋯ + 𝒂𝒏 −𝟏 𝒏 ෑ 𝒑𝒊 = 𝟎
𝒊=𝟏 𝒊=𝟏,𝒋=𝟏 𝒊=𝟏

▪
▪
𝒏 𝒏 𝒏
𝒂𝒏−𝟏 𝒂𝒏−𝟐 𝒂𝟎 𝒏
= − ෍ 𝒑𝒊 ; = ෍ 𝒑𝒊 𝒑𝒋 ; ⋯; = −𝟏 ෑ 𝒑𝒊
𝒂𝒏 𝒂𝒏 𝒂𝒏
𝒊=𝟏 𝒊=𝟏,𝒋=𝟏 𝒊=𝟏

▪
▪
▪
𝒔𝟑 + 𝒔𝟐 + 𝟐𝒔 + 𝟖 = 𝟎

▪ 𝒔 = −𝟐, 𝟎. 𝟓 ± 𝒋𝟏. 𝟗𝟑𝟔


▪

▪
▪
𝒒 𝒔 = 𝒂𝒏 𝒔𝒏 + 𝒂𝒏−𝟏 𝒔𝒏−𝟏 + ⋯ + 𝒂𝟏 𝒔 + 𝒂𝟎
▪
𝒔𝒏 𝒂𝒏 𝒂𝒏−𝟐 𝒂𝒏−𝟒 ⋯
𝒔𝒏−𝟏 𝒂𝒏−𝟏 𝒂𝒏−𝟑 𝒂𝒏−𝟓 ⋯
▪
𝒔𝒏 𝒂𝒏 𝒂𝒏−𝟐 𝒂𝒏−𝟒 ⋯

𝒔𝒏−𝟏 𝒂𝒏−𝟏 𝒂𝒏−𝟑 𝒂𝒏−𝟓 ⋯

𝒔𝒏−𝟐 𝒃𝒏−𝟏 𝒃𝒏−𝟐 𝒃𝒏−𝟑 ⋯

𝒂𝒏−𝟏 𝒂𝒏−𝟐 − 𝒂𝒏 𝒂𝒏−𝟑 𝒂𝒏−𝟏 𝒂𝒏−𝟒 − 𝒂𝒏 𝒂𝒏−𝟓


𝒃𝒏−𝟏 = , 𝒃𝒏−𝟐 = ,⋯
𝒂𝒏−𝟏 𝒂𝒏−𝟏
▪
𝒔𝒏 𝒂𝒏 𝒂𝒏−𝟐 𝒂𝒏−𝟒 ⋯

𝒔𝒏−𝟏 𝒂𝒏−𝟏 𝒂𝒏−𝟑 𝒂𝒏−𝟓 ⋯

𝒔𝒏−𝟐 𝒃𝒏−𝟏 𝒃𝒏−𝟐 𝒃𝒏−𝟑 ⋯

𝒔𝒏−𝟑 𝒄𝒏−𝟏 𝒄𝒏−𝟐 𝒄𝒏−𝟑 ⋯

𝒃𝒏−𝟏 𝒂𝒏−𝟑 − 𝒂𝒏−𝟏 𝒃𝒏−𝟐 𝒃𝒏−𝟏 𝒂𝒏−𝟓 − 𝒂𝒏−𝟏 𝒃𝒏−𝟑


𝒄𝒏−𝟏 = , 𝒄𝒏−𝟐 = ,⋯
𝒃𝒏−𝟏 𝒃𝒏−𝟏
▪ 𝒔𝟎

𝒔𝒏 𝒂𝒏 𝒂𝒏−𝟐 𝒂𝒏−𝟒 ⋯

𝒔𝒏−𝟏 𝒂𝒏−𝟏 𝒂𝒏−𝟑 𝒂𝒏−𝟓 ⋯

𝒔𝒏−𝟐 𝒃𝒏−𝟏 𝒃𝒏−𝟐 𝒃𝒏−𝟑 ⋯

𝒔𝒏−𝟑 𝒄𝒏−𝟏 𝒄𝒏−𝟐 𝒄𝒏−𝟑 ⋯

⋮ ⋮ ⋮ ⋮ ⋮

𝒔𝒐 𝒉𝒏−𝟏
▪

𝒔𝒏 𝒂𝒏 𝒂𝒏−𝟐 𝒂𝒏−𝟒 ⋯

𝒔𝒏−𝟏 𝒂𝒏−𝟏 𝒂𝒏−𝟑 𝒂𝒏−𝟓 ⋯

𝒔𝒏−𝟐 𝒃𝒏−𝟏 𝒃𝒏−𝟐 𝒃𝒏−𝟑 ⋯

𝒔𝒏−𝟑 𝒄𝒏−𝟏 𝒄𝒏−𝟐 𝒄𝒏−𝟑 ⋯


⋮ ⋮ ⋮ ⋮ ⋮ ⋮

𝒔𝒐 𝒉𝒏−𝟏
▪
𝒒 𝒔 = 𝒔𝟑 + 𝟒𝒔𝟐 + 𝟗𝒔 + 𝟏𝟎 = 𝟎

▪ 𝒔 = −𝟐, −𝟏 ± 𝒋𝟐

▪
𝒔𝟑 𝟏 𝟗
𝒔𝟐 𝟒 𝟏𝟎
𝟐𝟔
𝒔𝟏
𝟒
𝒔𝟎 𝟏𝟎
▪
▪
𝒒 𝒔 = 𝒔𝟑 + 𝒔𝟐 + 𝟑𝒔 − 𝟓 = 𝟎

▪ 𝒔 = 𝟏, −𝟏 ± 𝒋𝟐

▪
𝒔𝟑 𝟏 𝟑
𝒔𝟐 𝟏 −𝟓
𝒔𝟏 𝟖
𝒔𝟎 −𝟓

▪
▪
𝒔𝟓 + 𝒔𝟒 + 𝟐𝒔𝟑 + 𝟐𝒔𝟐 + 𝟑𝒔 + 𝟏𝟓 = 𝟎
▪

𝒔𝟓 𝟏 𝟐 𝟑
𝒔𝟒 𝟏 𝟐 𝟏𝟓
𝒔𝟑 𝟎 −𝟏𝟐
𝒔𝟐

▪
𝝐
▪ 𝝐
▪
𝒔𝟓 + 𝒔𝟒 + 𝟐𝒔𝟑 + 𝟐𝒔𝟐 + 𝟑𝒔 + 𝟏𝟓 = 𝟎

▪
𝒔𝟓 𝟏 𝟐 𝟑
𝒔𝟒 𝟏 𝟐 𝟏𝟓
𝒔𝟑 𝟎 −𝟏𝟐
𝒔𝟐

▪
▪ 𝝐
▪
𝒔𝟓 𝟏 𝟐 𝟑
𝒔𝟒 𝟏 𝟐 𝟏𝟓
𝒔𝟑 𝝐 −𝟏𝟐
𝟐𝝐+𝟏𝟐
𝒔𝟐 𝟏𝟓
𝝐
𝟏𝟓𝝐𝟐 +𝟐𝟒𝝐+𝟏𝟒𝟒
𝒔𝟏 −
𝟐𝝐+𝟏𝟐
𝒔𝟎 𝟏𝟓

▪ 𝝐→𝟎

▪
▪
▪
𝒔𝟑 + 𝟓𝒔𝟐 + 𝟔𝒔 + 𝟑𝟎 = 𝟎
▪
𝒔𝟑 𝟏 𝟔
𝒔𝟐 𝟓 𝟑𝟎
𝒔𝟏 𝟎 𝟎

▪
▪
▪
𝒔𝟑 + 𝟓𝒔𝟐 + 𝟔𝒔 + 𝟑𝟎 = 𝟎

▪
𝒔𝟑 𝟏 𝟔
𝒔𝟐 𝟓 𝟑𝟎
𝒔𝟏 𝟎 𝟎
▪ 𝒔𝟏

▪
𝑨 𝒔 = 𝟓𝒔𝟐 + 𝟑𝟎 = 𝟎
𝒅𝑨(𝒔)
∴ = 𝟏𝟎𝒔 + 𝟎
𝒅𝒔
▪

𝒔𝟑 𝟏 𝟔
𝒔𝟐 𝟓 𝟑𝟎
𝒔𝟏 𝟏𝟎 𝟎
𝒔𝟎 𝟑𝟎

▪
▪ 𝒔

▪
𝒋𝝎 𝒋𝝎 𝒋𝝎

𝟎 𝝈 𝟎 𝝈 𝟎 𝝈
▪
𝒔𝟓 + 𝟐𝒔𝟒 + 𝟐𝒔𝟑 + 𝟒𝒔𝟐 + 𝒔 + 𝟐 = 𝟎

▪
𝒔𝟓 𝟏 𝟐 𝟏
𝒔𝟒 𝟐 𝟒 𝟐
𝒔𝟑 𝟎 𝟎 𝟎

▪ 𝒔𝟑

▪
𝑨 𝒔 = 𝒔𝟒 + 𝟐𝒔𝟐 + 𝟏 = 𝟎
𝒅𝑨(𝒔)
∴ = 𝟒𝒔𝟑 + 𝟒𝒔 + 𝟎
𝒅𝒔
▪ 𝑨 𝒔 =𝟎
▪
𝒔𝟓 𝟏 𝟐 𝟏
𝒔𝟒 𝟐 𝟒 𝟐
𝒔𝟑 𝟏 𝟏 𝟎
𝒔𝟐 𝟏 𝟏
𝒔𝟏 𝟎 𝟎
▪ 𝒔𝟏

▪
𝑨′ 𝒔 = 𝒔𝟐 + 𝟏 = 𝟎
𝒅𝑨′(𝒔)
∴ = 𝟐𝒔𝟏 + 𝟎
𝒅𝒔
▪ 𝑨′ 𝒔 = 𝟎
▪
𝒔𝟓 𝟏 𝟐 𝟏
𝒔𝟒 𝟐 𝟒 𝟐
𝒔𝟑 𝟏 𝟏 𝟎
𝒔𝟐 𝟏 𝟏
𝒔𝟏 𝟐
𝒔𝟎 𝟏

▪
+ 𝒋, −𝒋, +𝒋, −𝒋
▪

“...
[The condition for stability of the governor] is
mathematically equivalent to the condition that all the
possible roots, and all the possible parts of the
impossible roots, of a certain equation shall be negative.
I have not been able completely to determine these
conditions for equations of a higher degree than the
third; but I hope that the subject will obtain the
attention of mathematicians.
...”

Photos Courtesy : Wikipedia.


▪ 

▪ 

▪
➢

➢
➢ ➢
➢ ➢
➢ ➢
➢

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy