Download presentation

Presentation is loading. Please wait.

Published bySofia Hodkinson Modified over 3 years ago

1
Start Presentation October 11, 2012 3 rd Homework Solution In this homework problem, we wish to exercise the application of the algorithms by Pantelides and Tarjan, as well as the tearing method. The problem deals with another simple electrical circuit.

2
Start Presentation October 11, 2012 Structural Singularity Pantelides Algorithm Tarjan Algorithm Tearing of Algebraic Loops Structure Diagram Solving of Coupled Equations

3
Start Presentation October 11, 2012 Structural Singularity i0i0 i R1 i R2 i R4 i C2 i R3 i C1 i C3 v0v0 v1v1 v2v2 v3v3 v4v4 Show that the circuit depicted on the left exhibits a structural singularity. To this end, find a complete set of equations in currents, potentials, and Voltages (ignoring the mesh equations), and draw the digraph of the resulting DAE system. Subsequently, color the digraph by use of the algorithm by Tarjan, and demonstrate that the system is indeed structurally singular. Explain the structural singularity by analyzing the mesh that is formed by the three capacitors.

4
Start Presentation October 11, 2012 1: U 0 = f(t) 13: U 0 = v 1 – v 0 2: u R1 = R 1 · i R1 14: u R1 = v 1 – v 2 3: u R2 = R 2 · i R2 15: u R2 = v 2 – v 3 4: u R3 = R 3 · i R3 16: u R3 = v 3 – v 0 5: u R4 = R 4 · i R4 17: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 18: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 /dt 19: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 20: u C3 = v 4 – v 0 9: i 0 = i R1 21: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 11: i R2 = i R3 + i R4 12: i C3 = i R4 + i C2 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 18 19 20 21 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 /dt i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4

5
Start Presentation October 11, 2012 1: U 0 = f(t) 13: U 0 = v 1 – v 0 2: u R1 = R 1 · i R1 14: u R1 = v 1 – v 2 3: u R2 = R 2 · i R2 15: u R2 = v 2 – v 3 4: u R3 = R 3 · i R3 16: u R3 = v 3 – v 0 5: u R4 = R 4 · i R4 17: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 18: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 /dt 19: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 20: u C3 = v 4 – v 0 9: i 0 = i R1 21: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 11: i R2 = i R3 + i R4 12: i C3 = i R4 + i C2 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 18 19 20 21 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 /dt i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4

6
Start Presentation October 11, 2012 1: U 0 = f(t) 13: U 0 = v 1 – v 0 2: u R1 = R 1 · i R1 14: u R1 = v 1 – v 2 3: u R2 = R 2 · i R2 15: u R2 = v 2 – v 3 4: u R3 = R 3 · i R3 16: u R3 = v 3 – v 0 5: u R4 = R 4 · i R4 17: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 18: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 /dt 19: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 20: u C3 = v 4 – v 0 9: i 0 = i R1 21: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 11: i R2 = i R3 + i R4 12: i C3 = i R4 + i C2 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 18 19 20 21 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 /dt i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 Constraint equation

7
Start Presentation October 11, 2012 Pantelides Algorithm Apply the algorithm by Pantelides to the equation system found before, and determine the resulting DAE system that by now no longer exhibits any structural singularity. Find the structure incidence matrix of the resulting implicit DAE system.

8
Start Presentation October 11, 2012 1: U 0 = f(t) 13: U 0 = v 1 – v 0 2: u R1 = R 1 · i R1 14: u R1 = v 1 – v 2 3: u R2 = R 2 · i R2 15: u R2 = v 2 – v 3 4: u R3 = R 3 · i R3 16: u R3 = v 3 – v 0 5: u R4 = R 4 · i R4 17: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 18: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 19: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 20: u C3 = v 4 – v 0 9: i 0 = i R1 21: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 22: du C2 = dv 2 – dv 4 11: i R2 = i R3 + i R4 23: du C1 /dt = dv 2 – dv 0 12: i C3 = i R4 + i C2 24: du C3 /dt = dv 4 – dv 0 25: dv 0 = 0 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4

9
Start Presentation October 11, 2012 S =

10
Start Presentation October 11, 2012 Algorithm by Tarjan Draw the digraph of the resulting DAE system, and color it by use of the algorithm by Tarjan. The colored digraph symbolizes a partially sorted equation system, which however still contains a large algebraic loop. Write down the partially sorted equation system. Find the structure incidence matrix of the partially sorted equation system. This is now in block lower triangular form ( BLT-Form).

11
Start Presentation October 11, 2012 01: U 0 = f(t) 03: U 0 = v 1 – v 0 09: u R1 = R 1 · i R1 08: u R1 = v 1 – v 2 3: u R2 = R 2 · i R2 15: u R2 = v 2 – v 3 4: u R3 = R 3 · i R3 16: u R3 = v 3 – v 0 5: u R4 = R 4 · i R4 17: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 04: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 05: u C3 = v 4 – v 0 25: i 0 = i R1 02: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 22: du C2 = dv 2 – dv 4 11: i R2 = i R3 + i R4 23: du C1 /dt = dv 2 – dv 0 12: i C3 = i R4 + i C2 24: du C3 /dt = dv 4 – dv 0 07: dv 0 = 0 01 09 03 04 05 06 07 08 25 10 11 12 03 08 15 16 17 04 06 05 02 22 23 24 07 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4

12
Start Presentation October 11, 2012 S =

13
Start Presentation October 11, 2012 Tearing of the Algebraic Loop Find appropriate tearing variables using the following heuristics: In the digraph, determine those equations with the largest number of unknowns. For every one of these equations, find those unknowns that show up most frequently in the not yet used equations. For every one of these variables, determine how many additional equations can be made causal if they are assumed known. Choose the one variable as the next tearing variable, which allows to make the largest number of additional equations causal.

14
Start Presentation October 11, 2012 1 st tearing variable Selection of tearing variables: Equations:10111222 (all with 3 variables each) i R2 i C1 i C2 i R2 i R3 i R4 i C2 i C3 du C2 dv 2 dv 4 3 eq. 2 eq. 3 eq. 2 eq. 3 eq. 2 eq.

15
Start Presentation October 11, 2012 01: U 0 = f(t) 03: U 0 = v 1 – v 0 09: u R1 = R 1 · i R1 08: u R1 = v 1 – v 2 3: u R2 = R 2 · i R2 15: u R2 = v 2 – v 3 4: u R3 = R 3 · i R3 16: u R3 = v 3 – v 0 5: u R4 = R 4 · i R4 17: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 04: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 05: u C3 = v 4 – v 0 25: i 0 = i R1 02: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 22: du C2 = dv 2 – dv 4 10: i R2 = i R3 + i R4 23: du C1 /dt = dv 2 – dv 0 12: i C3 = i R4 + i C2 24: du C3 /dt = dv 4 – dv 0 07: dv 0 = 0 01 09 03 04 05 06 07 08 25 10 12 03 08 15 16 17 04 06 05 02 22 23 24 07 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4

16
Start Presentation October 11, 2012 01: U 0 = f(t) 03: U 0 = v 1 – v 0 09: u R1 = R 1 · i R1 08: u R1 = v 1 – v 2 11: u R2 = R 2 · i R2 12: u R2 = v 2 – v 3 15: u R3 = R 3 · i R3 13: u R3 = v 3 – v 0 16: u R4 = R 4 · i R4 14: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 04: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 05: u C3 = v 4 – v 0 25: i 0 = i R1 02: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 22: du C2 = dv 2 – dv 4 10: i R2 = i R3 + i R4 23: du C1 /dt = dv 2 – dv 0 12: i C3 = i R4 + i C2 24: du C3 /dt = dv 4 – dv 0 07: dv 0 = 0 01 09 11 15 16 06 07 08 25 10 12 03 08 12 13 14 04 06 05 02 22 23 24 07 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4

17
Start Presentation October 11, 2012 2 nd tearing variable Selection of tearing variables: Equations:22 (the only equation with 3 unknowns) du C2 dv 2 dv 4 2 eq.

18
Start Presentation October 11, 2012 01: U 0 = f(t) 03: U 0 = v 1 – v 0 09: u R1 = R 1 · i R1 08: u R1 = v 1 – v 2 11: u R2 = R 2 · i R2 12: u R2 = v 2 – v 3 15: u R3 = R 3 · i R3 13: u R3 = v 3 – v 0 16: u R4 = R 4 · i R4 14: u R4 = v 3 – v 4 6: i C1 = C 1 · du C1 /dt 04: u C1 = v 2 – v 0 7: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 8: i C3 = C 3 · du C3 /dt 05: u C3 = v 4 – v 0 25: i 0 = i R1 02: v 0 = 0 10: i R1 = i C1 + i C2 + i R2 17: du C2 = dv 2 – dv 4 10: i R2 = i R3 + i R4 23: du C1 /dt = dv 2 – dv 0 12: i C3 = i R4 + i C2 24: du C3 /dt = dv 4 – dv 0 07: dv 0 = 0 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4 01 09 11 15 16 06 07 08 25 10 12 03 08 12 13 14 04 06 05 02 17 23 24 07

19
Start Presentation October 11, 2012 01: U 0 = f(t) 03: U 0 = v 1 – v 0 09: u R1 = R 1 · i R1 08: u R1 = v 1 – v 2 11: u R2 = R 2 · i R2 12: u R2 = v 2 – v 3 15: u R3 = R 3 · i R3 13: u R3 = v 3 – v 0 16: u R4 = R 4 · i R4 14: u R4 = v 3 – v 4 21: i C1 = C 1 · du C1 /dt 04: u C1 = v 2 – v 0 18: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 22: i C3 = C 3 · du C3 /dt 05: u C3 = v 4 – v 0 25: i 0 = i R1 02: v 0 = 0 19: i R1 = i C1 + i C2 + i R2 17: du C2 = dv 2 – dv 4 10: i R2 = i R3 + i R4 23: du C1 /dt = dv 2 – dv 0 20: i C3 = i R4 + i C2 24: du C3 /dt = dv 4 – dv 0 07: dv 0 = 0 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4 01 09 11 15 16 21 18 22 25 19 10 20 03 08 12 13 14 04 06 05 02 17 23 24 07

20
Start Presentation October 11, 2012 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4 01 09 11 15 16 21 18 22 25 19 10 20 03 08 12 13 14 04 06 05 02 17 23 24 07 01: U 0 = f(t) 14: u R4 = v 3 – v 4 02: v 0 = 0 15: i R3 = u R3 /R 3 03: v 1 = U 0 – v 0 16: i R4 = u R4 /R 4 04: v 2 = u C1 – v 0 17: du C2 = dv 2 – dv 4 05: v 4 = u C3 – v 0 18: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 19: i C1 = i R1 – i C2 – i R2 07: dv 0 = 0 20: i C3 = i R4 + i C2 08: u R1 = v 1 – v 2 21: du C1 /dt = i C1 /C 1 09: i R1 = u R1 /R 1 22: du C3 /dt = i C3 /C 3 10: i R2 = i R3 + i R4 23: dv 2 = du C1 /dt – dv 0 11: u R2 = R 2 · i R2 24: dv 4 = du C3 /dt – dv 0 12: v 3 = v 2 – u R2 25: i 0 = i R1 13: u R3 = v 3 – v 0

21
Start Presentation October 11, 2012 Structure Diagram Draw the structure diagram of the causalized algebraic loop. It can be seen that two tearing variables are needed to make all equations of the loop causal. The two tearing variables decouple the equation system in such a way that there result two separate equation systems in one tearing variable each (this is not always the case, but it happens in the given example). Find the structure incidence matrix of the fully causalized DAE system. This now has two diagonal blocks of smaller sizes.

22
Start Presentation October 11, 2012 du C3 /dt dv 4 i C2 i C3 du C2 du C1 /dt dv 2 i C1 i R2 u R2 v3v3 u R3 i R3 i R4 u R4 Algebraic Loop 1 st tearing variable 2 nd tearing variable

23
Start Presentation October 11, 2012 S =

24
Start Presentation October 11, 2012 Solving the Coupled Equations Solve the two equation systems symbolically, and replace the residual equations of the equation system by the so found explicit equations. Draw the digraph of the once more modified equation system, and color it by use of the algorithm by Tarjan. Determine the resulting structure incidence matrix. This is now in lower triangular form.

25
Start Presentation October 11, 2012 01: U 0 = f(t) 14: u R4 = v 3 – v 4 02: v 0 = 0 15: i R3 = u R3 /R 3 03: v 1 = U 0 – v 0 16: i R4 = u R4 /R 4 04: v 2 = u C1 – v 0 17: du C2 = dv 2 – dv 4 05: v 4 = u C3 – v 0 18: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 19: i C1 = i R1 – i C2 – i R2 07: dv 0 = 0 20: i C3 = i R4 + i C2 08: u R1 = v 1 – v 2 21: du C1 /dt = i C1 /C 1 09: i R1 = u R1 /R 1 22: du C3 /dt = i C3 /C 3 10: i R2 = i R3 + i R4 23: dv 2 = du C1 /dt – dv 0 11: u R2 = R 2 · i R2 24: dv 4 = du C3 /dt – dv 0 12: v 3 = v 2 – u R2 25: i 0 = i R1 13: u R3 = v 3 – v 0 i R2 = i R3 + i R4 = u R3 /R 3 + u R4 /R 4 = (v 3 – v 0 )/R 3 + (v 3 – v 4 )/R 4 = (R 3 + R 4 )/(R 3 ·R 4 ) v 3 – v 0 /R 3 – v 4 /R 4 = (R 3 + R 4 )/(R 3 ·R 4 ) · (v 2 – u R2 ) – v 0 /R 3 – v 4 /R 4 = – (R 3 + R 4 )/(R 3 ·R 4 ) · u R2 + (R 3 + R 4 )/(R 3 ·R 4 ) · v 2 – v 0 /R 3 – v 4 /R 4 = – R 2 · (R 3 + R 4 )/(R 3 ·R 4 ) · i R2 + (R 3 + R 4 )/(R 3 ·R 4 ) · v 2 – v 0 /R 3 – v 4 /R 4 i R2 = (R 3 + R 4 ) · v 2 – R 4 · v 0 – R 3 · v 4 R 2 ·R 3 + R 2 ·R 4 + R 3 ·R 4

26
Start Presentation October 11, 2012 du C2 = dv 2 – dv 4 = (du C1 /dt – dv 0 ) – (du C3 /dt – dv 0 ) = du C1 /dt – du C3 /dt = i C1 /C 1 – i C3 /C 3 = (i R1 – i C2 – i R2 )/C 1 – (i R4 + i C2 )/C 3 = – (C 1 + C 3 )/(C 1 · C 3 ) · i C2 + (i R1 – i R2 )/C 1 – i R4 /C 3 = – C 2 · (C 1 + C 3 )/(C 1 · C 3 ) · du C2 + (i R1 – i R2 )/C 1 – i R4 /C 3 01: U 0 = f(t) 14: u R4 = v 3 – v 4 02: v 0 = 0 15: i R3 = u R3 /R 3 03: v 1 = U 0 – v 0 16: i R4 = u R4 /R 4 04: v 2 = u C1 – v 0 17: du C2 = dv 2 – dv 4 05: v 4 = u C3 – v 0 18: i C2 = C 2 · du C2 06: u C2 = v 2 – v 4 19: i C1 = i R1 – i C2 – i R2 07: dv 0 = 0 20: i C3 = i R4 + i C2 08: u R1 = v 1 – v 2 21: du C1 /dt = i C1 /C 1 09: i R1 = u R1 /R 1 22: du C3 /dt = i C3 /C 3 10: i R2 = i R3 + i R4 23: dv 2 = du C1 /dt – dv 0 11: u R2 = R 2 · i R2 24: dv 4 = du C3 /dt – dv 0 12: v 3 = v 2 – u R2 25: i 0 = i R1 13: u R3 = v 3 – v 0 du C2 = C 3 · (i R1 – i R2 ) – C 1 · i R4 C 1 ·C 2 + C 1 ·C 3 + C 2 ·C 3

27
Start Presentation October 11, 2012 14: u R4 = v 3 – v 4 15: i R3 = u R3 /R 3 16: i R4 = u R4 /R 4 17: 18: i C2 = C 2 · du C2 19: i C1 = i R1 – i C2 – i R2 20: i C3 = i R4 + i C2 21: du C1 /dt = i C1 /C 1 22: du C3 /dt = i C3 /C 3 23: dv 2 = du C1 /dt – dv 0 24: dv 4 = du C3 /dt – dv 0 25: i 0 = i R1 01: U 0 = f(t) 02: v 0 = 0 03: v 1 = U 0 – v 0 04: v 2 = u C1 – v 0 05: v 4 = u C3 – v 0 06: u C2 = v 2 – v 4 07: dv 0 = 0 08: u R1 = v 1 – v 2 09: i R1 = u R1 /R 1 10: 11: u R2 = R 2 · i R2 12: v 3 = v 2 – u R2 13: u R3 = v 3 – v 0 i R2 = (R 3 + R 4 ) · v 2 – R 4 · v 0 – R 3 · v 4 R 2 ·R 3 + R 2 ·R 4 + R 3 ·R 4 du C2 = C 3 · (i R1 – i R2 ) – C 1 · i R4 C 1 ·C 2 + C 1 ·C 3 + C 2 ·C 3

28
Start Presentation October 11, 2012 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4 01 09 11 15 16 21 18 22 25 19 10 20 03 08 12 13 14 04 06 05 02 17 23 24 07 U 0 i 0 u R1 i R1 u R2 i R2 u R3 i R3 u R4 i R4 du C1 /dt i C1 du C2 i C2 du C3 /dt i C3 v 0 v 1 v 2 v 3 v 4 u C2 dv 0 dv 2 dv 4 01 09 11 15 16 21 18 22 25 19 10 20 03 08 12 13 14 04 06 05 02 17 23 24 07

29
Start Presentation October 11, 2012 S =

Similar presentations

Presentation is loading. Please wait....

OK

Numerical Algorithms Matrix multiplication

Numerical Algorithms Matrix multiplication

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google