Unterschiede
Hier werden die Unterschiede zwischen zwei Versionen angezeigt.
Beide Seiten der vorigen Revision Vorhergehende Überarbeitung Nächste Überarbeitung | Vorhergehende Überarbeitung | ||
electrical_engineering_1:network_analysis [2021/09/25 01:58] – tfischer | electrical_engineering_1:network_analysis [2025/01/29 00:30] (aktuell) – mexleadmin | ||
---|---|---|---|
Zeile 1: | Zeile 1: | ||
- | ====== 4. Analysis of direct current networks | + | ====== 4 Analysis of Networks |
- | < | + | < |
- | < | + | |
- | < | + | |
- | </ | + | |
- | {{drawio> | + | |
- | </ | + | |
- | Network analysis plays a central role in electrical engineering. It is so important because it can be used to simplify what at first sight appear to be complicated circuits and systems to such an extent that they can be understood and results derived from them. | + | Network analysis plays a central role in electrical engineering. |
+ | It is so important because it can be used to simplify what at first sight appear to be complicated circuits and systems to such an extent that they can be understood and results derived from them. | ||
- | In addition, networks also occur in other areas, for example the force flow through a truss or the heat flow through individual hardware elements (< | + | In addition, networks also occur in other areas, for example, the momentum flux through a truss or the heat flux through individual hardware elements (< |
- | On the {{wpde> | + | On the {{https:// |
- | </ | + | |
< | < | ||
- | === Goals === | + | === Learning Objectives |
- | After this lesson, you should: | + | By the end of this section, you will be able to: |
+ | - < | ||
+ | - < | ||
+ | - < | ||
+ | - understand and be able to apply the superposition procedure. | ||
- | - < | ||
- | - < | ||
- | - < | ||
- | - Understand and be able to apply the superposition procedure. | ||
</ | </ | ||
- | <callout type=" | + | ===== 4.1 Preliminary Work for Network Analysis ===== |
- | Due to the shortened semester, only the subchapter [[analysis_of_dc_grids# | + | ==== Preparation of the Circuit ==== |
- | </callout> | + | < |
+ | Before the network analysis can be tackled, the circuit must be suitably prepared (cf. <imgref imageNo10 >): | ||
- | ===== 4.1 Preliminary work on network analysis ===== | ||
- | |||
- | ==== Preparation of the circuit ==== | ||
- | |||
- | <WRAP right> | ||
- | < | ||
- | </ | ||
- | {{drawio> | ||
- | </ | ||
- | |||
- | Before the network analysis can be tackled, the circuit must be suitably prepared (cf. <imgref FigNo10> | ||
- Clarify what is given and what is sought | - Clarify what is given and what is sought | ||
- Draw a circuit | - Draw a circuit | ||
- | - Add counting | + | - Add voltage and current |
- | - First draw current and voltage arrows at all sources according to the generator arrow system. | + | - First, draw current and voltage arrows at all sources according to the generator arrow system. |
- | - Afterwards define the current arrows at the remaining branches as you like. | + | - Afterwards, define the current arrows at the remaining branches as you like. |
- | - Finally, draw the voltage arrows at the loads according to the load arrow system. | + | - Finally, draw the voltage arrows at the loads according to the load arrow system. |
- Select suitable current and voltage designations. If not already given, then: | - Select suitable current and voltage designations. If not already given, then: | ||
- | | + | |
- | - Do not insert any signs in front of the designators in the circuit. | + | - Do not insert any signs in front of the designators in the circuit. |
- | In real applications it is useful to specify the number of variables ("what is wanted?" | + | In real applications, it is useful to specify the number of variables ("what is wanted?" |
+ | This makes it clear how many equations are needed. This seems to become difficult for larger networks - but a trick for this is presented below. | ||
It often helps to draw the drawing several times (at least in your head) to have enough space for the identifiers (cf. <imgref imageNo10> | It often helps to draw the drawing several times (at least in your head) to have enough space for the identifiers (cf. <imgref imageNo10> | ||
- | ~PAGEBREAK~ ~CLEARFIX~~ | + | ~~PAGEBREAK~~ ~~CLEARFIX~~ |
- | ==== Graph and Trees ==== | + | |
- | <WRAP right> | + | ==== Graphs and Trees ==== |
- | < | + | |
- | </ | + | |
- | {{drawio> | + | |
- | </ | + | |
- | In the chapter [[simple_dc_circuits# | + | <WRAP> < |
- | In <imgref FigNo11> the **graph** | + | |
- | But the important thing is: In this graph only the (real) nodes are drawn. Nodes are by definition the connection of __more than two__ branches. Accordingly, | + | |
- | A concept that has not yet appeared is that of the complete tree. For this, some (mathematical) graph theory is needed. There, too, the terms nodes and meshes | + | In the chapter [[: |
- | Now a tree is characterized precisely by the fact that it contains __no__ | + | But the important thing is: In this graph, only the (real) nodes are drawn. Nodes are by definition the connection of __more than two__ branches. Accordingly, |
- | Among the different trees, there are now some in which each node connects two or fewer meshes.((Here we now depart from the previous electrotechnical notion of node (= connecting more than 2 branches). The mathematical notion of node does not have this restriction)) These are called **complete trees** (occasionally also {{wpde> | + | |
+ | A concept that has not yet appeared is that of the complete tree. For this, some (mathematical) graph theory is needed. There, too, the terms nodes and loops are used as before. A **tree** | ||
+ | Now a tree is characterized precisely by the fact that it contains __no__ | ||
Tree 3 in <imgref imageNo11> | Tree 3 in <imgref imageNo11> | ||
The branches in complete trees are now distinguished according to their membership: | The branches in complete trees are now distinguished according to their membership: | ||
+ | |||
* **tree branches** belong to the complete tree (solid lines in <imgref imageNo11> | * **tree branches** belong to the complete tree (solid lines in <imgref imageNo11> | ||
- | * **Connecting branches** do not belong to the complete tree (dotted lines in <imgref imageNo11> | + | * **Connecting branches** |
+ | Why does the excursion to graph theory make sense now? The trick is that by defining the complete tree, all loops have just been removed. Conversely, a new (independent) loop can be created by each connecting branch. So if the number of independent loop equations $m$ is sought, this is just equal to the number of connecting branches. | ||
- | Why does the swing to graph theory make sense now? The trick is that by defining the complete tree, all meshes have just been removed. Conversely, a new (independent) mesh can be created by each connecting branch. So if the number of independent mesh equations $m$ is sought, this is just equal to the number of connecting branches. | + | To do this, proceed as follows: |
- | To do this, proceed as follows: | ||
- Determine the number of (real) nodes $k$. | - Determine the number of (real) nodes $k$. | ||
- Determine the number of branches $z$ | - Determine the number of branches $z$ | ||
Zeile 90: | Zeile 72: | ||
- The number of connecting branches $v$ is given by "All branches minus tree branches": | - The number of connecting branches $v$ is given by "All branches minus tree branches": | ||
- | Thus, the number of independent | + | Thus, the number of independent |
- | This explanation can also be heard again in [[https:// | + | This explanation can also be heard again in [[https:// |
- | ~~PAGEBREAK~~ ~CLEARFIX~~ | + | ~~PAGEBREAK~~ ~~CLEARFIX~~ |
- | ===== 4.2 Branch Current Procedure ===== | + | |
- | <WRAP right> | + | ===== 4.2 Branch Current Method===== |
- | < | + | |
- | </ | + | |
- | {{drawio> | + | |
- | </ | + | |
- | In the branch current method now " | + | < |
- | * for all nodes k respectively the equation: $\sum_{k=0}^{N_k}{I_k}=0$ | + | |
- | * for all independent meshes m respectively the equation: $\sum_{m=0}^{N_m}{U_m}=0$ \\ Here the number $m$ (as mentioned in the previous subsection) can be determined by the number of nodes and branches. | + | |
- | This forms a linear system of equations. | + | The branch current method (also called branch current method) now " |
+ | Specifically, | ||
+ | * for all nodes $k$ respectively the equation: $\sum_{k=0}^{N_k}{I_k}=0$ | ||
+ | * for all independent loops $m$ respectively the equation: $\sum_{m=0}^{N_m}{U_m}=0$ \\ Here the number $m$ (as mentioned in the previous subsection) can be determined by the number of nodes and branches. | ||
+ | |||
+ | This forms a linear system of equations. This can then be considered as a matrix equation and solved with the rules of (mathematical) art. | ||
<WRAP onlyprint> | <WRAP onlyprint> | ||
+ | |||
For the example (<imgref imageNo12> | For the example (<imgref imageNo12> | ||
- | ~~PAGEBREAK~~~CLEARFIX~~~ | + | ~~PAGEBREAK~~ ~~CLEARFIX~~ |
The matrices still need to be corrected for the voltage and current sources!!! | The matrices still need to be corrected for the voltage and current sources!!! | ||
- | <WRAP group>< | ||
=== Example of nodal equations === | === Example of nodal equations === | ||
- | \begin{align*} | ||
- | \sum\limits_{k=0}^{N_k}{I_k}=0 \. | ||
- | | ||
- | Setting up the individual equations: | + | \begin{align*} \sum\limits_{k=0}^{N_k}{I_k}=0 \end{align*} |
- | \begin{align*} | + | |
- | \scriptsize\text{node ' | + | |
- | \scriptsize\text{node ' | + | |
- | \scriptsize\text{node ' | + | |
- | \scriptsize\text{node ' | + | |
- | \scriptsize\text{node ' | + | |
- | \scriptsize\text{node ' | + | |
- | \end{align*} | + | |
- | Sorting streams into columns: | + | Setting up the individual equations: |
- | \begin{align*} | + | \begin{align*} |
- | \begin{smallmatrix} | + | \scriptsize\text{node ' |
- | \text{node ' | + | \scriptsize\text{node ' |
- | \text{node ' | + | \scriptsize\text{node ' |
- | \text{node ' | + | \scriptsize\text{node ' |
- | \text{node ' | + | \scriptsize\text{node ' |
- | \text{node ' | + | \scriptsize\text{node ' |
- | \text{node ' | + | |
- | \end{smallmatrix} | + | |
\end{align*} | \end{align*} | ||
- | Setting up the matrix: | + | Sorting currents into columns: |
- | \begin{align*} | + | \begin{align*} \begin{smallmatrix} |
- | + | \text{node ' | |
- | \left( | + | \text{node ' |
- | -1 & 0 & 0 & 0 & 0 & 0 & 0 & -1 & -1 & 0 \\ | + | \text{node ' |
- | +1 & -1 & 0 & -1 & 0 & 0 & 0 & 0 & 0 & 0 \\ | + | \text{node ' |
- | 0 & +1 & -1 & 0 & -1 & 0 & 0 & 0 & 0 & 0 \\ | + | \text{node ' |
- | 0 & 0 & 0 & 0 & +1 & -1 & 0 & 0 & 0 & -1 \\ | + | \text{node ' |
- | 0 & 0 & 0 & 0 & 0 & +1 & +1& -1 & 0 & 0 \\ | + | \end{smallmatrix} \end{align*} |
- | 0 & 0 & -1 & +1 & 0 & 0 & -1& 0 & +1 & +1 \\ | + | |
- | \end{smallmatrix} \right) | + | |
- | \left( \begin{smallmatrix} | + | |
- | I_0 \\ I_1 \\ I_2 \ I_3 \ I_4 \ I_5 \ I_6 \ I_7 \ I_9 \ I_{11} | + | |
- | \end{smallmatrix} | + | |
- | \end{align*} | + | |
- | </ | + | Setting up the matrix: |
- | === Example of mesh equations === | + | \begin{align*} \left( \begin{smallmatrix} |
- | \begin{align*} | + | -1 & 0 & 0 & 0 & 0 & 0 & 0 & -1 & -1 & 0 \\ |
- | \sum\limits_{m=0}^{N_m}{U_m}=0 | + | +1 & -1 & 0 & -1 & 0 & 0 & 0 & 0 & 0 & 0 \\ |
- | \end{align*} | + | 0 & +1 & -1 & 0 & -1 & 0 & 0 & 0 & 0 & 0 \\ |
+ | 0 & 0 & 0 & 0 & +1 & -1 & 0 & 0 & 0 & -1 \\ | ||
+ | 0 & 0 & 0 & 0 & 0 & +1 & +1& -1 & 0 & 0 \\ | ||
+ | 0 & 0 & -1 & +1 & 0 & 0 & -1& 0 & +1 & +1 \\ | ||
+ | \end{smallmatrix} \right) | ||
+ | \cdot | ||
+ | \left( \begin{smallmatrix} | ||
+ | I_0 \\ I_1 \\ I_2 \\ I_3 \\ I_4 \\ I_5 \\ I_6 \\ I_7 \\ I_9 \\ I_{11} | ||
+ | \end{smallmatrix} \right) = \vec{0} \end{align*} | ||
+ | |||
+ | |||
+ | === Example of loop equations === | ||
+ | |||
+ | \begin{align*} \sum\limits_{m=0}^{N_m}{U_m}=0 | ||
- | Setting up the individual equations: | + | Setting up the individual equations: |
- | \begin{align} | + | \begin{align*} |
- | \scriptsize\text{mesh ' | + | \scriptsize\text{Masche |
- | \scriptsize\text{mesh ' | + | \scriptsize\text{Masche |
- | \scriptsize\text{mesh ' | + | \scriptsize\text{Masche |
- | \scriptsize\text{mesh ' | + | \scriptsize\text{Masche |
- | \scriptsize\text{mesh ' | + | \scriptsize\text{Masche |
- | \quad \ | + | \quad \\ |
\end{align*} | \end{align*} | ||
- | Sorting | + | |
+ | Sorting | ||
\begin{align*} | \begin{align*} | ||
- | \begin{mallmatrix} | + | \begin{smallmatrix} |
- | \text{mesh ' | + | \text{Masche |
- | \text{mesh ' | + | \text{Masche |
- | \text{mesh ' | + | \text{Masche |
- | \text{mesh ' | + | \text{Masche |
- | \text{mesh ' | + | \text{Masche |
- | \quad \\ \quad \ | + | \quad \\ \quad \\ |
\end{smallmatrix} | \end{smallmatrix} | ||
\end{align*} | \end{align*} | ||
- | Set up the matrix, but note $U_m = R_x \cdot I_m$: | + | Set up the matrix, but note $U_m = R_x \cdot I_m$: |
- | \begin{align*} | + | \begin{align*} |
- | + | \left( \begin{smallmatrix} | |
- | \left( \begin{smallmatrix} | + | -R_0 & 0 & 0 |
- | -R_0 & 0 & 0 & +R_3 & 0 & 0 & -R_9 & 0 & 0 \\. | + | 0 & +R_1 & -R_2 & -R_3 & 0 & 0 |
- | 0 & +R_1 & -R_2 & -R_3 & 0 & 0 & 0 & 0 & 0 \\ | + | 0 & 0 & +R_2 & 0 & +R_4 & 0 & 0 & 0 & 0 & -R_{11} |
- | 0 & 0 & +R_2 & 0 & +R_4 & 0 & 0 & 0 & -R_{11} | + | 0 & 0 & |
- | 0 & 0 & 0 & 0 & +R_5 &-R_6 & 0 & 0 & +R_{11} | + | 0 & 0 & 0 |
- | 0 & 0 & 0 & 0 & 0 &+R_6 & | + | |
\end{smallmatrix} \right) \cdot | \end{smallmatrix} \right) \cdot | ||
- | \left( \begin{smallmatrix} | + | \left( \begin{smallmatrix} |
- | I_0 \\ I_1 \\ I_2 \ I_3 \ I_4 \ I_5 \ I_6 \ I_7 \ I_9 \ I_{11} | + | I_0 \\ I_1 \\ I_2 \\ I_3 \\ I_4 \\ I_5 \\ I_6 \\ I_7 \\ I_9 \\ I_{11} |
\end{smallmatrix} \right) = \vec{0} | \end{smallmatrix} \right) = \vec{0} | ||
\quad \\ | \quad \\ | ||
\end{align*} | \end{align*} | ||
- | </WRAP>< | + | |
+ | These matrices can be solved using, for example, the [[https://en.wikipedia.org/ | ||
+ | |||
+ | ~~PAGEBREAK~~ ~~CLEARFIX~~ | ||
</ | </ | ||
- | These matrices can be solved using, for example, the {{wpde> | ||
- | ~~PAGEBREAK~~ ~CLEARFIX~~ | ||
- | === another | + | === Another |
<WRAP group> <WRAP half column> | <WRAP group> <WRAP half column> | ||
- | In video 1 the following steps are described:\\ \\ | + | In video 1 you will learn: |
- | 1. writing down the given circuit and sizes | + | |
- | 2. drawing in and designating the knots | + | |
- | 3. draw in and label the meshes\\ | + | |
- | </ | + | |
- | Branch current analysis | + | |
- | {{youtube> | + | |
- | </ | + | |
- | <WRAP group> <WRAP half column> | + | |
- | Video 2 describes the following steps: \\ \\ | + | 2. drawing in and designating the nodes |
- | 4. draw and label the branch currents \\ | + | |
- | 5. drawing in and designating the branch voltages \\ | + | |
- | </ | + | 3. draw in and label the loops |
- | Branch current analysis 2/4 | + | |
- | {{youtube> | + | |
- | </ | + | |
- | <WRAP group> <WRAP half column> | + | |
- | Video 3 describes the following steps: \\ \\ | + | 4. draw and label the mesh currents |
- | 6. set up node equations | + | |
- | 7. convert to matrix notation \ | + | |
- | </ | + | 5. drawing in and designating the mesh voltages |
- | Branch current analysis 3/4 | + | |
- | {{youtube> | + | |
- | </ | + | |
- | <WRAP group> <WRAP half column> | + | |
- | In the [[https:// | + | for a simple circuit |
- | 8. inserting the numerical values \\ | + | |
- | 9. calculating the matrix with a calculator \ | + | |
- | </ | + | </ |
- | </WRAP> </ | + | |
- | <panel type=" | + | {{youtube>6sVeFqlSV4A}} |
- | <WRAP group>< | + | |
- | {{youtube>gkJfKFuuyr8}} | + | </ |
- | </ | + | In video 2 you will learn : |
+ | \\ 1. writing down the given circuit and sizes | ||
- | <panel type=" | + | 2. drawing in and designating the nodes |
- | <WRAP group>< | + | |
- | {{youtube> | + | 3. draw in and label the loops |
- | </ | + | 4. draw and label the branch currents |
+ | 5. drawing in and designating the branch voltages | ||
- | ===== 4.3 Mesh flow method ===== | + | for a more complex circuit |
- | In the mesh flow method, only for all meshes m each equation: $\sum\limits_{j=0}^{N_j}{U_j}=0$ are considered. However, these are represented in the form $R\cdot I = U $. | + | </ |
- | The advantage here is that the number of equations to be solved is reduced to the number of independent mesh currents. | + | {{youtube> |
- | These can also be considered as matrix equations and can be solved with the rules of (mathematical) art. | + | </ |
+ | Video 3 describes the following steps: | ||
- | <WRAP group> <WRAP half column> | + | 1. write down the given circuit and sizes |
- | In video 1, the mesh flow method is applied by means of an example. | + | 2. draw in and designate the nodes |
- | <WRAP important> | + | 3. draw in and label the loops |
- | </ | + | 4. draw and label the branch currents |
- | Mesh stream analysis | + | |
- | {{youtube> | + | |
- | </ | + | |
- | <WRAP group> <WRAP half column> | + | |
- | Also in video 2, the mesh flow method is applied by means of an example. | + | 5. draw in and designate the branch voltages |
+ | |||
+ | 6. set up node equations and loop equations | ||
+ | |||
+ | 7. convert to matrix notation | ||
+ | |||
+ | 8. solve the matrix | ||
+ | |||
+ | </ | ||
+ | |||
+ | {{youtube> | ||
+ | |||
+ | </ | ||
+ | |||
+ | In the [[https:// | ||
+ | \\ | ||
+ | 9. inserting | ||
+ | |||
+ | 10. calculating the matrix with a calculator | ||
+ | |||
+ | </ | ||
+ | |||
+ | <panel type=" | ||
+ | |||
+ | {{youtube> | ||
+ | |||
+ | </ | ||
+ | |||
+ | ===== 4.3 Mesh Current Method ===== | ||
+ | |||
+ | In the [[https:// | ||
+ | |||
+ | The advantage here is that the number of equations to be solved is reduced to the number of independent loop currents. | ||
+ | |||
+ | These can also be considered matrix equations and can be solved with the rules of (mathematical) art. | ||
- | </ | ||
- | Mesh stream analysis | ||
- | {{youtube> | ||
- | </ | ||
<WRAP group> <WRAP half column> | <WRAP group> <WRAP half column> | ||
- | In the [[https:// | + | In video 1, the mesh current method |
- | </ | + | </ |
- | </ | + | |
- | ===== 4.4 Nodal potential method ===== | + | {{youtube> |
- | In the nodal potential method, only the equation: $\sum\limits_{i=0}^{N_i}{I_i}=0$ are considered for all nodes k respectively. However, these are expressed in the form ${1\over R} \cdot U = I $ and $G \cdot U = I $ respectively. | + | </ |
+ | |||
+ | Also in video 2, the mesh current method is applied using an example. | ||
+ | |||
+ | </ | ||
+ | |||
+ | {{youtube> | ||
+ | |||
+ | </ | ||
+ | |||
+ | In the [[https:// | ||
+ | |||
+ | </ | ||
+ | |||
+ | ===== 4.4 Nodal Potential Method ===== | ||
+ | |||
+ | In the [[https:// | ||
The advantage here is that the number of equations to be solved is reduced to the number of existing nodes (minus 1). | The advantage here is that the number of equations to be solved is reduced to the number of existing nodes (minus 1). | ||
- | These can also be considered | + | These can also be considered matrix equations and can be solved with the rules of (mathematical) art. |
<WRAP group> <WRAP half column> | <WRAP group> <WRAP half column> | ||
Zeile 314: | Zeile 310: | ||
In Video 1, the idea behind node potential analysis is simply explained. | In Video 1, the idea behind node potential analysis is simply explained. | ||
- | </ | + | </ |
- | Simple example of node potential analysis | + | |
- | {{youtube> | + | {{youtube> |
- | </ | + | |
- | <WRAP group> <WRAP half column> | + | </ |
Video 2 also uses the nodal potential method with an example. | Video 2 also uses the nodal potential method with an example. | ||
- | </ | + | </ |
- | more complex example of a node potential analysis | + | |
- | {{youtube> | + | {{youtube> |
- | </ | + | |
- | <WRAP group> <WRAP half column> | + | </ |
In the [[https:// | In the [[https:// | ||
- | </ | + | </ |
+ | |||
+ | ===== 4.5 Superposition Method / Superposition Principle ===== | ||
+ | |||
+ | The superposition principle shall first be illustrated by some examples: | ||
+ | |||
+ | <callout title=" | ||
+ | |||
+ | **Task**: Three students are to fill a pool. If Alice has to fill it alone, she would need 2 days. Bob would need 3 days and Carol would need 4 days. How long would it take all three to fill a pool if they helped together? | ||
+ | |||
+ | The question sounds far off-topic at first but is directly related. The point is that to solve it, filling the pool is assumed to be linear. So Alice will fill $1 \over 2$, Bob $1 \over 3$, and Carol $1 \over 4$ of the pool per day. So on the first day, ${1 \over 2}+{1 \over 3}+{1 \over 4} = {{6 + 4 + 3} \over 12} = {13 \over 12}$ of the pool filled. \\ So the three of them need ${12 \over 13}$ of a day. \\ \\ However, this solution path is only possible because in linear systems the partial results can be added. </ | ||
+ | |||
+ | <callout title=" | ||
+ | |||
+ | < | ||
+ | |||
+ | **Task**:A mechanical, linear spring is displaced due to masses $m_1$ and $m_2$ in the Earth' | ||
+ | |||
+ | Again, a linear law is used here: \begin{align*} \vec{s}= f(\vec{F}) = - D \cdot \vec{F} \end{align*} | ||
+ | |||
+ | The (seemingly trivial) approach applies here: | ||
+ | \begin{align*} | ||
+ | \vec{s}_{1+2} = f(\vec{F_1} + \vec{F_2}) &= - D \cdot (\vec{F_1} + \vec{F_2}) \\ | ||
+ | & | ||
+ | & | ||
+ | & | ||
+ | \end{align*} </ | ||
+ | |||
+ | <callout icon=" | ||
+ | The total effect is then the sum of the individual effects. </ | ||
+ | |||
+ | For electrical engineering this principle was described by [[https:// | ||
+ | |||
+ | > The currents in the branches of a linear network are equal to the sum of the partial currents in the branches concerned caused by the individual sources. | ||
+ | |||
+ | <WRAP group> <WRAP half column> Thus, in the superposition method, the current (or voltage) sought in a circuit with multiple sources can be viewed as a superposition of the resulting currents (or voltages) of the individual sources. | ||
+ | |||
+ | The " | ||
+ | |||
+ | - Choose the next source '' | ||
+ | - Replace all ideal sources with their respective equivalent resistors: | ||
+ | - ideal voltage sources by short circuits | ||
+ | - ideal current sources by an open line | ||
+ | - Calculate the partial currents sought in the branches considered. | ||
+ | - Go to the next source '' | ||
+ | - Add up the partial currents in the branches under consideration, | ||
+ | |||
+ | This procedure is explained again in more detail using examples in the two videos on the right. | ||
+ | |||
+ | </ | ||
+ | |||
+ | {{youtube> | ||
+ | |||
+ | A more complex example of the superposition method | ||
+ | |||
+ | {{youtube> | ||
</ | </ | ||
- | ===== 4.5 Superposition method / Superposition principle ===== | + | ~~PAGEBREAK~~ ~~CLEARFIX~~ |
- | The superposition principle shall first be illustrated by some examples | + | === Example === |
- | <callout title=" | + | <WRAP> < |
- | **Task**: Three students are to fill a pool. If Alice were to fill it alone, she would need 2 days. Bob would need 3 days and Carol would need 4 days. How long would it take all three to fill a pool if they helped together? \\ \\ | + | ~~PAGEBREAK~~ ~~CLEARFIX~~ |
+ | === Introduction | ||
+ | {{youtube> | ||
- | The question sounds far off topic at first, but is directly related. The point is that to solve it, filling | + | |
- | However, this solution path is only possible because in linear systems the partial results can be added. | + | ~~PAGEBREAK~~ ~~CLEARFIX~~ |
+ | |||
+ | ===== Exercises ===== | ||
+ | |||
+ | # | ||
+ | |||
+ | Imagine you want to develop a circuit that conditions a sensor signal so that it can be processed by a microcontroller. | ||
+ | |||
+ | For conditioning, the input signal | ||
+ | |||
+ | The following simulation shows roughly the situation. Be aware that the resistor and voltage values are not correct! | ||
+ | |||
+ | < | ||
+ | |||
+ | Questions: | ||
+ | |||
+ | 1. Find the relationship between $R_1$, $R_2$, and $R_3$ using superposition. | ||
+ | * Determine suitable values for $R_1$, $R_2$, and $R_3$. | ||
+ | * What values for $R^0_1$, $R^0_2$, and $R^0_3$ from the [[https:// | ||
+ | |||
+ | # | ||
+ | Using superposition, | ||
+ | For these two circuits, we calculate | ||
+ | To make the calculation simpler, the resistors $R_3$ and $R_{\rm s}$ will be joined to $R_4 =R_3 +R_{\rm s}$. | ||
+ | |||
+ | < | ||
+ | === Circuit | ||
+ | {{drawio> | ||
+ | |||
+ | \begin{align*} | ||
+ | U_{\rm O}^{(1)} &= U_{\rm S} \cdot {{R_2||R_4}\over{R_1 + R_2||R_4}} | ||
+ | | ||
+ | &= U_{\rm S} \cdot {{ R_2 R_4 }\over{R_1 (R_2 + R_4)+ R_2 R_4 }} \\ | ||
+ | & | ||
+ | \end{align*} | ||
</ | </ | ||
- | < | + | <callout> |
+ | === Circuit | ||
+ | {{drawio>electrical_engineering_1: | ||
- | <WRAP right> | + | \begin{align*} |
- | < | + | U_{\rm O}^{(2)} |
- | </ | + | = U_{\rm I} \cdot {{ {{R_1 R_2}\over{R_1 + R_2}} }\over{R_4 + {{R_1 R_2}\over{R_1 + R_2}} }} \\ |
- | {{drawio> | + | &= U_{\rm I} \cdot {{ R_1 R_2 }\over{R_4 (R_1 + R_2)+ R_1 R_2 }} \\ |
- | </WRAP> | + | & |
+ | \end{align*} | ||
+ | </callout> | ||
- | **Task**:A mechanical, linear spring is deflected with masses | + | < |
+ | === Superposition: Let's sum it up! === | ||
+ | \\ | ||
+ | These two intermediate voltages for the single sources have to be summed up as $U_{\rm O}= U_{\rm O}^{(1)} + U_{\rm O}^{(2)}$. \\ | ||
+ | When deeper investigated, one can see that the denominator for both $U_{\rm O}^{(1)}$ and $U_{\rm O}^{(2)}$ is the same. \\ | ||
+ | We can also simplify further when looking at often-used sub-terms (here: $R_2$) | ||
- | Again, a linear law is used here: | ||
\begin{align*} | \begin{align*} | ||
- | \vec{s}= f(\vec{F}) = - D \cdot \vec{F} | + | U_{\rm O} &= {{ 1 }\over{R_4 R_1 + R_4 R_2+ R_1 R_2 }} \cdot (U_{\rm S} \cdot R_2 R_4 + U_{\rm I} \cdot R_1 R_2 ) \\ |
+ | U_{\rm O} \cdot (R_4 R_1 + R_4 R_2+ R_1 R_2 ) &= U_{\rm S} \cdot R_2 R_4 + U_{\rm I} \cdot R_1 R_2 \\ \\ | ||
+ | U_{\rm O} \cdot ({{R_1 R_4}\over{R_2}} + R_4 + R_1 ) & | ||
\end{align*} | \end{align*} | ||
- | The (seemingly trivial) approach applies here: | + | The formula $(1)$ is the general formula to calculate the output voltage $U_{\rm O}$ for a changing input voltage $U_{\rm I}$, where the supply voltage $U_{\rm S}$ is constant. \\ |
+ | </ | ||
+ | |||
+ | Now, we can use the requested boundaries: | ||
+ | - For the minimum input voltage $U_{\rm I}= -15 ~\rm V$, the output voltage shall be $U_{\rm O} = 0 ~\rm V$ | ||
+ | - For the maximum input voltage $U_{\rm I}= +15 ~\rm V$, the output voltage shall be $U_{\rm O} = 3.3 ~\rm V$ | ||
+ | |||
+ | This leads to two situations: | ||
+ | |||
+ | < | ||
+ | === Situation I : $U_{\rm I,min}= -15 ~\rm V$ shall create $U_{\rm O,min} = 0 ~\rm V$ === | ||
+ | \\ | ||
+ | We put $U_{\rm A} = 0 ~\rm V$ in the formula $(1)$ : | ||
\begin{align*} | \begin{align*} | ||
- | \vec{s}_{1+2} = f(\vec{F_1} + \vec{F_2}) &= - D \cdot (\vec{F_1} + \vec{F_2}) \\ | + | 0 & |
- | & | + | - U_{\rm I,min} \cdot R_1 |
- | & | + | {{R_1}\over{R_4}} |
- | &= \vec{s_1} + \vec{s_2} | + | |
\end{align*} | \end{align*} | ||
+ | |||
+ | So, with formula $(2)$, we already have a relation between $R_1$ and $R_4$. Yeah 😀 \\ | ||
+ | The next step is situation 2 | ||
</ | </ | ||
- | < | + | <callout> |
- | In a physical system | + | === Situation II : $U_{\rm I,max}= +15 ~\rm V$ shall create $U_{\rm O,max} = 3.3 ~\rm V$ === |
+ | \\ | ||
+ | We use formula $(2)$ to substitute $R_1 = k_{14} \cdot R_4 $ in formula $(1)$, | ||
+ | \begin{align*} | ||
+ | U_{\rm O,max} \cdot (k_{14}{{ R_4^2}\over{R_2}} + R_4 + k_{14} R_4 ) & | ||
+ | U_{\rm O,max} \cdot (k_{14}{{ R_4 }\over{R_2}} + 1 + k_{14} | ||
+ | | ||
+ | | ||
+ | {{ R_4 }\over{R_2}} | ||
+ | \end{align*} | ||
+ | |||
+ | So, another relation for $R_4$ and $R_2$. 😀 \\ | ||
</ | </ | ||
- | For electrical engineering this principle was described | + | So, to get values for the relations, we have to put in the values for the input and output voltage conditions. |
+ | \begin{align*} | ||
+ | k_{14} = {{R_1}\over{R_4}} | ||
+ | \end{align*} | ||
- | > The currents in the branches in a linear network are equal to the sum of the partial currents in the branches concerned caused by the individual sources. | + | This value $k_{14}$ we can use for formula $(3)$: |
+ | \begin{align*} | ||
+ | {{ R_4 }\over{R_2}} &= {{5 ~\rm V + 15 ~\rm V \cdot {{1}\over{3}} }\over{ 3.3 ~\rm V \cdot {{1}\over{3}} }} - {{1 + {{1}\over{3}} }\over{ {{1}\over{3}} }} \\ | ||
+ | & | ||
+ | k_{42} | ||
+ | \end{align*} | ||
- | <WRAP group> <WRAP half column> | + | We could now - theoretically - arbitrarily choose one of the resistors, e.g., $R_2$, and then calculate |
- | Thus, in the superposition method, the current (or voltage) sought in a circuit with multiple sources can be viewed as a superposition | + | |
- | The " | + | But we must consider another boundary, a boundary for $R_{\rm S}$. The maximum voltage and the maximum current are given for the sensor. By this, we can calculate $R_{\rm S}$: |
- | - Choose next source '' | + | \begin{align*} |
- | - Replace all ideal sources with their respective equivalent resistors: | + | R_{\rm S} &= {{ U_{\rm OC} }\over{ I_{\rm SC} }} = {{ U_{\rm S,max} }\over{ I_{\rm S,max} }} = {{ 15 ~\rm V }\over{ 1 ~\rm mA }} \\ |
- | - ideal voltage sources by short circuits | + | & |
- | - ideal current sources by an open line | + | \end{align*} |
- | - Calculate the partial currents sought in the branches considered. | + | |
- | - Go to the next source '' | + | |
- | - Add up the partial currents in the branches under consideration, | + | |
- | This procedure is explained again in more detail using examples in the two videos on the right. | + | Therefore, $R_4 = R_{\rm S} + R_3$ must be larger than this. \\ |
- | </ | + | # |
- | Simple view of the superposition principle | + | |
- | {{youtube> | + | |
- | more complex example of the superposition method | + | # |
- | {{youtube> | + | |
- | </ | + | |
- | ==PAGEBREAK~~CLEARFIX~~ | + | The sensor resistance is |
- | === Example === | + | \begin{align*} |
+ | R_S &= 15 {~\rm k\Omega}\\ | ||
+ | \end{align*} | ||
- | <WRAP right> | + | We can choose $R_3$ arbitrarily. Here I choose a nice value to get integer values for $R_3$ and $R_1$: |
- | < | + | \begin{align*} |
- | </ | + | R_3 &= 45 {~\rm k\Omega}\\ |
- | {{drawio> | + | R_1 & |
- | < | + | R_2 &= {{1}\over{5.09}}(R_3 + 15 {~\rm k\Omega}) = 11.8 {~\rm k\Omega} |
+ | \end{align*} | ||
+ | Based on the E24 series, the following values are next to the calculated ones: | ||
+ | \begin{align*} | ||
+ | R_3^0 &= 43 {~\rm k\Omega}\\ | ||
+ | R_1^0 &= {{1}\over{3}} | ||
+ | R_2^0 &= {{1}\over{5.09}}(R_3 + 15 {~\rm k\Omega}) = 12 {~\rm k\Omega} | ||
+ | \end{align*} | ||
+ | # | ||
- | ~~PAGEBREAK~~~CLEARFIX~~~ | + | 2. Find the relationship between $R_1$, $R_2$, and $R_3$ by investigating Kirchhoff' |
- | <panel type=" | + | # |
- | <WRAP group>< | + | |
- | <WRAP right> | + | The potential of the node is $U_\rm O$. Therefore the currents are: |
- | </ | + | |
+ | | ||
+ | | ||
- | Imagine you want to develop a circuit that conditions a sensor signal so that it can be processed by a microcontroller. The sensor signal is in the range $U_{sens} \in [-15...15V]$, | + | This led to the formula based on the Kirchhoff' |
- | For conditioning, | + | \begin{align*} |
+ | \Sigma I = 0 &= I_1 + I_2 + I_3 \\ | ||
+ | 0 &= {{U_{\rm S} - U_{\rm O}}\over{R_1}} + {{U_{\rm I} - U_{\rm O}}\over{R_4}} - {{U_\rm O}\over{R_2}} | ||
+ | \end{align*} | ||
- | - Find the relationship between $R_1$, $R_2$ and $R_3$ using superposition. | + | The formula can be rearranged, with all terms containing |
- | - Find the relationship between $R_1$, $R_2$ and $R_3$ using star-delta transformation. | + | \begin{align*} |
- | - What is the input resistance $R_{in}(R_1, R_2,R_3)$ of the circuit (viewed from the sensor)? | + | {{U_{\rm O}}\over{R_1}} + {{U_{\rm O}}\over{R_2}} + {{U_{\rm O}}\over{R_4}} |
- | - What is the maximum allowed input resistance $R_{in}(R_1, R_2,R_3)$ for the sensor to still deliver current? | + | U_{\rm O}\cdot \left( {{1}\over{R_1}} + {{1}\over{R_2}} + {{1}\over{R_4}} \right) & |
- | - Determine suitable values for $R_1$, $R_2$ and $R_3$. | + | \end{align*} |
- | - What values for $R^0_1$, $R^0_2$, and $R^0_3$ from the [[https:// | + | |
- | </ | + | Both sides can be multiplied by $\cdot R_1$, $\cdot R_2$, $\cdot R_4$ - in order to get rid of the fractions : |
+ | \begin{align*} | ||
+ | U_{\rm O}\cdot \left( {{R_1 R_2 R_4 }\over{R_1}} + {{R_1 R_2 R_4 }\over{R_2}} + {{R_1 R_2 R_4 }\over{R_4}} \right) & | ||
+ | U_{\rm O}\cdot \left( R_2 R_4 + R_1 R_4 + R_1 R_2 \right) & | ||
+ | U_{\rm O} &= {{R_2}\over{R_2 R_4 + R_1 R_4 + R_1 R_2 }} \left( R_4 \cdot U_{\rm S} + R_1 \cdot U_{\rm I} \right)\\ | ||
+ | \end{align*} | ||
+ | The last formula was just the result we also got by the superposition but by more thinking. \\ | ||
+ | So, sometimes there is an easier way... | ||
+ | * Unluckily, there is no simple way to know before, what way is the easiest. | ||
+ | * Luckily, all ways lead to the correct result. | ||
- | {{page>task_4.5.2_with_calculation& | + | # |
+ | |||
+ | 3. What is the input resistance $R_{\rm in}(R_1, R_2, R_3)$ of the circuit (viewed from the sensor)? | ||
+ | |||
+ | # | ||
+ | |||
+ | \begin{align*} | ||
+ | R_{\rm in}(R_1, R_2, R_3) &= R_3 + R_1 || R_2 \\ | ||
+ | &= R_3 + {{R_1 R_2}\over{R_1 + R_2}} | ||
+ | \end{align*} | ||
+ | |||
+ | # | ||
+ | |||
+ | 4. What is the minimum allowed input resistance ($R_{\rm in, min}(R_1, R_2, R_3)$) for the sensor to still deliver current? | ||
+ | |||
+ | # | ||
+ | |||
+ | \begin{align*} | ||
+ | R_{\rm in, min} &= {{U_{\rm sense}}\over{I_{\rm sense, max}}} \\ | ||
+ | &= \rm {{15 V}\over{1 mA}} \\ | ||
+ | &= 15 k\Omega \\ | ||
+ | \end{align*} | ||
+ | |||
+ | # | ||
+ | |||
+ | # | ||
+ | |||
+ | |||
+ | |||
+ | {{page>aufgabe_4.5.2_mit_rechnung& | ||
{{page> | {{page> | ||
{{page> | {{page> | ||
+ | |||
+ |