Two scripts are included here.
1. convsys.m - combines the state space representation of two systems connected in series.
[Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2)
This algorithm gives the convolution of two state space representations
| A1 B1 | | A2 B2 |
u ==> | | ==> | | ==> y
| C1 D1 | | C2 D2 |
The algorithm also accepts state space objects as inputs and gives out a state space object as output.
2. sysfeedbk.m
[Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2)
Gives the closed loop state space representation for two systems connected with negative feedback in the following manner.
| A1 B1 |
u ==> | | ==> y
+ o | C1 D1 | |
- | |
| | A2 B2 | |
|= | |= |
| C2 D2 |
The zip file also contains checkcompatibility.m , which checks the compatibility of matrix dimensions in the system and cleanss.m which can be used to clean a state space representation.
標簽：
representation
included
combines
scripts
上傳時間：
2017-07-25
上傳用戶：semi1981
實驗源代碼
//Warshall.cpp #include<stdio.h> void warshall(int k,int n) { int i , j, t; int temp[20][20]; for(int a=0;a<k;a++) { printf("請輸入矩陣第%d 行元素:",a); for(int b=0;b<n;b++) { scanf ("%d",&temp[a][b]); } } for(i=0;i<k;i++){ for( j=0;j<k;j++){ if(temp[ j][i]==1) { for(t=0;t<n;t++) { temp[ j][t]=temp[i][t]||temp[ j][t]; } } } } printf("可傳遞閉包關系矩陣是:\n"); for(i=0;i<k;i++) { for( j=0;j<n;j++) { printf("%d", temp[i][ j]); } printf("\n"); } } void main() { printf("利用 Warshall 算法求二元關系的可傳遞閉包\n"); void warshall(int,int); int k , n; printf("請輸入矩陣的行數 i: "); scanf("%d",&k);
四川大學實驗報告 printf("請輸入矩陣的列數 j: "); scanf("%d",&n); warshall(k,n); }
標簽：
warshall
離散
實驗
上傳時間：
2016-06-27
上傳用戶：梁雪文以
