Last active
October 26, 2021 11:46
-
-
Save Wasabules/116ef5ed13fbbde6f066b9e086cc310a to your computer and use it in GitHub Desktop.
automa
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
F(p)*e^(-to*p) | |
F(p) = somme de signaux simples | |
retardés si possible | |
G static = | |
Valeur en régim permenant | |
Poles = | |
p qui annule déno | |
p+1, avoir 1 au déno ! | |
1/p inté | |
p dériv | |
1/to*p+1 passe bas | |
to*p/to*p+1 passe haut | |
H(p) = | |
1 | |
------ | |
p^2/Wn^2 + 2E*p/Wn + 1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
classe = nb intégration | |
p^2 = classe 2 | |
(au déno) | |
Erreur static = | |
Echelon 1/p | |
Erreur trainage = | |
Rampe a^2/p | |
Supperposition | |
S(p) = S1(p) + S2(p) | |
Routh | |
1) tout Ai > 0 | |
2) methode du tableau |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# This comment was added automatically to allow this file to save. | |
# You'll be able to remove it after adding text to the file. | |
Compensation pole lent | |
C(p) = | |
Gr*(1+Ti*p) | |
----- | |
Ti*p | |
H(p) = C(p)*H(p) | |
Gr = Gain à 135° | |
Ti = pole lent |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Marge de phase = passage à 0dB | |
Marge de Gain = passage à 180° |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment