Otwarty dostęp

Dichotomy model based on the finite element differential equation in the educational informatisation teaching reform model


Zacytuj

Introduction

In 2010, the ‘Outline of the National Medium and Long-term Educational Reform and Development Plan (2010–2020)’ for the first time specifically put ‘accelerating the process of education informatisation’ as a chapter and proposed that information technology has a revolutionary impact on education development. Therefore, we must attach great importance to it and improve the quality of education through education informatisation. Subsequently, the Ministry of Education formulated the ‘Ten-Year Development Plan for Education Informatisation (2010–2020)’. As mentioned above, the formulation of the plans pointed out a direction for the reform of mathematics teaching, and at the same time, made mathematics classroom teaching ushered in realistic challenges [1]. For example, how to make information technology scientifically, rationally, efficiently and thoroughly applied to mathematics classroom teaching. As a result, information technology becomes a powerful tool for students to learn mathematical knowledge and solve mathematical problems. In this way, the quality of mathematics classroom teaching is comprehensively improved, and students’ innovative spirit and practical ability are cultivated.

The Laplace transform method is one of the essential methods for analysing continuous-time systems and it is also the basis of some other new transform methods. The origin of the Laplace transform method should be attributed to the British engineer Heaviside at the end of the 19th century. The ‘operator method’ he invented can solve some fundamental problems encountered in power engineering calculations, but it lacks rigorous mathematical arguments. Later, people were able to find a mathematical basis for this method by applying the works of French mathematician Laplace and re-given a strict mathematical definition. As a result, scholars named it Laplace Transformation (Pull Transformation for short) method [2]. Pull transform is used more in signal teaching and more convenient when dealing with circuit teaching problems.

The definition and nature of pull transformation

We know that if the function satisfies the Dirichlet condition, the Fourier transform can be formed. But the requirement of absolute integrability in the Dirichlet condition restricts FT of specific growth signals [3]. For example, some signals continue to increase over time. Such signals cannot have FT, so a pull transformation needs to be introduced.

Let f (t) be the original function and F(s) the image function. They form a pair of pull transformations, usually denoted as f (t) ⇔ F(s), F(s) ⇔ f(t), and they satisfy the relationship: L[f(t)]=F(s)=0f(t)estdt L[f(t)] = F(s) = \int_0^\infty f(t){e^{ - st}}dt L1[F(s)]=f(t)=12πjσjσ+jF(s)estdt {L^{ - 1}}[F(s)] = f(t) = {1 \over {2\pi j}}\int_{\sigma - j\infty }^{\sigma + j\infty } F(s){e^{st}}dt

Unlike the FT transformation, the independent variable s here is a complex number. For the sake of distinction, we call it complex frequency. The set of all its values is called the complex frequency domain (s domain). The image function is a function whose independent variable is complex and so it is a complex variable function [4]. It is already learned that the independent variable will be an actual number in an actual variable function. Therefore, the LT method is a complex frequency domain transform method. We also often call it s-domain analysis.

LT is integrated from 0, so the value of the function in the interval t < 0 has nothing to do with the LT result. When seeking ILT, we can only give the value of the function within the time range t ≥ 0. This feature of LT does not bring inconvenience to its application. Because when analysing the system actually, only the system response of t ≥ 0 is often required, and the situation of t < the system state determines 0 before the excitation access [5]. The fundamental nature of the pull transformation is the basis of the complete transformation and it plays a more critical role in solving problems. Its properties are as follows:

Linearity: L[n=1Nanfn(t)]=n=1NanL[fn(t)] L\left[ {\sum\limits_{n = 1}^N {a_n}{f_n}(t)} \right] = \sum\limits_{n = 1}^N {a_n}L\left[ {{f_n}(t)} \right]

Time-domain translation: L[f(tt0)u(tt0)]=est0L[f(t)u(t)] L\left[ {f(t - {t_0})u(t - {t_0})} \right] = {e^{ - s{t_0}}}L\left[ {f(t)u(t)} \right]

s domain translation: L[f(t)es0t]=F(ss0) L\left[ {f(t){e^{{s_0}t}}} \right] = F\left( {s - {s_0}} \right)

Scale transformation: L[f(at)]=1aF(sa) L\left[ {f(at)} \right] = {1 \over a}F\left( {{s \over a}} \right)

Time-domain differentiation: L[dnf(t)dtn]=snL[f(t)] L\left[ {{{{d^n}f(t)} \over {d{t^n}}}} \right] = {s^n}L[f(t)]

Complex frequency domain integration: L[f(t)dt]=0F(s)ds L\left[ {{{f(t)} \over {dt}}} \right] = \int_0^\infty F(s)ds

Convolution theorem: L[f1f2(t)]=F1(s)F2(s) L\left[ {{f_1}{f_2}(t)} \right] = {F_1}(s){F_2}(s)

Solving method of inverse transformation of pull transformation

When we are teaching circuits, we often fail to explain the meaning of the problem due to too many unknown parameters or maybe because of the complicated steps in solving the problem, which prevents students from clearly understanding the idea of solving the problem [6]. But, now, we need to quote/explain a new transformation-the inverse transformation of the pull transformation. Its problem-solving ideas are as follows: 1) Use partial fraction method in which rational fractions are decomposed into partial fractions and an image function in the form of rational fractions is decomposed into partial fraction sums to solve them with the help of commonly used pairs of pull transformations; 2) Solve the properties of LT; 3) Solve by long division where we use the numerator as the dividend and the denominator as the divisor to find the result; and 4) Solve by the residue method. The partial fraction method is commonly used in the circuit teaching process. Because this method is not only the most basic in signal teaching, it is also the easiest for students to understand when teaching circuits.

Application of pull transformation in circuit teaching

In the circuit, what we think of for the first time is often to use the circuit analysis method to solve the circuit, such as the node current method and loop voltage method. But these methods are not suitable when solving more complicated circuits. In this case, we need to introduce a pull transformation [7]. First, understand several basic models of circuit operations. The resistance element calculation model is shown in Figure 1. U=RiRI(s)I=GuI(s)=GU(s) \matrix{ {U = Ri \Rightarrow RI(s)} \hfill \cr \,{I = Gu \Rightarrow I(s) = GU(s)} \hfill \cr } The calculation model of the capacitive element is shown in Figure 2. ic=cducdtIc(s)=scUc(s)cuc(0) {i_c} = c{{d{u_c}} \over {dt}} \Rightarrow {I_c}(s) = sc{U_c}(s) - c{u_c}{(0_ - }) uc=uc(0)+1c0ticdtUc(s)=1scIc(s)+uc(0)s {u_c} = {u_c}{(0_ - }) + {1 \over c}\int_{{0_ - }}^t {i_c}dt \Rightarrow {U_c}(s) = {1 \over {sc}}{I_c}(s) + {{{u_c}{{(0}_ - })} \over s}

Fig. 1

Resistance model.

Fig. 2

Capacitance model.

The inductance calculation model is shown in Figure 3. u=LdidtU(s)=sLI(s)Li(0) u = L{{di} \over {dt}} \Rightarrow U(s) = sLI(s) - Li{(0_ - })

Fig. 3

Inductance model.

We use the pull transform to solve the problem in the circuit to make the circuit calculation simple. The specific steps are as follows: 1) Find the initial state; 2) We express the power supply, resistance, reactance and capacitance in the frequency domain and make an operation diagram corresponding to the circuit diagram; 3) List the equations; 4) Solve the equation to obtain the image function of the unknown quantity; 5) Time-domain expression obtained by inverse pull transform; and 6) Substitute the initial value. The following example illustrates how to solve a circuit diagram using a pull transformation.

Case study 1: Figure 4(a) shows the RL series circuit and voltage source us(t) = δ(t), find the unit impulse response i(t) and the current flowing through the circuit when t = 1s.

Fig. 4

RL series circuit.

Solution: The arithmetic circuit is shown in Figure 4(b). The image function of the voltage source is Us(s) = 1v. Find the s domain of the circuit to represent the equation. I(s)=Us(s)R+sL=1L1s+R/L I(s) = {{{U_s}(s)} \over {R + sL}} = {1 \over L}{1 \over {s + R/L}} , the inverse transformation i(t)=1LeRLtε(t) i(t) = {1 \over L}{e^{ - {R \over L}t}}\varepsilon (t) of the pull transform. When t = 1s, i(t)=1LeRL i(t) = {1 \over L}{e^{ - {R \over L}}} .

Through example 1, it can be seen that the pull transformation can be applied to the problem-solving of circuit teaching and is more conducive to the understanding of circuit problems.

Case study 2: Considering that s is closed when t = 0, find the voltage and current flowing through the inductor when t = 1.

Solution: Find the initial state of the circuit when the switch is on, iL(0)5A,uc(0)=100V {i_L}{(0_ - })5A,{u_c}{(0_ - }) = 100V

After the switch is closed, the frequency domain representation of the inductance, capacitance and resistance in the circuit is obtained. We draw circuit diagram 5(b).

Fig. 5

Hybrid circuit with inductance.

sL=0.1s1sC=1000s sL = 0.1s{1 \over {sC}} = {{1000} \over s} , uL(0+) = 0.5A. We use the loop current method to list the equations: {I1(s)(40+0.1s)10I2(s)=200s+0.510I1(s)+(10+1000s)I2(s)=100sI1(s)=IL(s) \left\{ {\matrix{ {{I_1}(s)(40 + 0.1s) - 10{I_2}(s) = {{200} \over s} + 0.5} \hfill \cr { - 10{I_1}(s) + \left( {10 + {{1000} \over s}} \right){I_2}(s) = {{100} \over s}} \hfill \cr {{I_1}(s) = {I_L}(s)} \hfill \cr } } \right. and finally we obtain I1(s)=IL(s)=5(s2+700s+40000)s(s+200)2 {I_1}(s) = {I_L}(s) = {{5({s^2} + 700s + 40000)} \over {s{{(s + 200)}^2}}} Use the partial fraction decomposition method to get: IL(s)=1500(s+200)2+5s {I_L}(s) = {{1500} \over {{{(s + 200)}^2}}} + {5 \over s} Then use the inverse transformation property of the pull transformation to obtain: IL(t)=(5+1500te200t)ε(t) {I_L}(t) = \left( {5 + 1500t{e^{ - 200t}}} \right)\varepsilon (t) UL(s)=I1(s)sL0.5=150s+200+30000(s+200)2 {U_L}(s) = {I_1}(s) \bullet sL - 0.5 = {{150} \over {s + 200}} + {{ - 30000} \over {{{(s + 200)}^2}}} uL(t)=150e200t30000te200t {u_L}(t) = 150{e^{ - 200t}} - 30000t{e^{ - 200t}} When t = 1s and IL(1) = (5 + 1500e−200)A, uL(1) = −29850e−200V.

From this point of view, the pull conversion is a necessary means for processing signals and for circuit teaching [8]. Therefore, it is imperative to use and be able to use the pull transform. Furthermore, it has a greater potential for improving learners’ independent innovation ability.

Case study 3: To achieve rapid and effective grid division, we took the following discriminating steps. Assuming that the region's boundary is composed of line segments, the endpoints of the detected dividing lines are i and j, as shown in Figure 6.

Fig. 6

Schematic diagram of area dividing line.

First, determine whether the number of nodes in the boundary of the two sub-regions formed by the segmentation of the measured line segment is less than 4. If it is less than 4, it indicates that the line segment ij under test is excluded [9]. This is because the line segment ij divides the region into two sub-regions, but one of the sub-regions has only 3 boundary points, so the line segment ij cannot be used as the dividing line of the region.

Then, determine the positional relationship between all points and line segments on the boundary except for points i and j. Starting from a certain point on the boundary, determine the positional relationship between each point (except points i(xi, yi) and j(xj, yj)) and the line segment ij in turn. Suppose any point on the boundary of k except for points i and j has coordinates (xk, yk). Take the determinant of a matrix [xixkyiykxixkyiyk] \left[ {\matrix{ {{x_i} - {x_k}} & {{y_i} - {y_k}} \cr {{x_i} - {x_k}} & {{y_i} - {y_k}} \cr } } \right] as the discriminant. If the value of the determinant is less than zero, the point arrangement kij is clockwise. If the value of the determinant is higher than zero, the point arrangement kij is counterclockwise. If the value of the determinant is equal to zero, the arrangement of points kij is on a straight line [10]. For any two adjacent points e(xe, ye) and f (xf, yf) on the boundary contour except i and j, there are the following two cases:

The product of the matrix determinants of any two adjacent points e and f is equal to zero, indicating that points e and f are on the line segment ij or its extension. Assuming that the determinant of pointe is zero, it is necessary further to determine the relationship between pointe and line segment ij. If (ye, yi)(ye, yj) < 0 or (xe, xi)(xe, xj) < 0, line segment ij passes through pointe.

The matrix determinant product of any two adjacent points e and f is not equal to zero. If the product is less than zero, it means that the points e and f are on both sides of the thousand line segment ij. The line segment formed by two adjacent points, e, and f, may intersect the extension line of the line segment, so the third step of judgement is needed [11]. If the product is higher than zero, it means that the points e and f are on the same side of the line segment ij. The line segment ij may be a possible dividing line of the area, so it is necessary to calculate the matrix determinants of all points except i and j on the boundary contour.

Suppose the product of the matrix determinants of all points except j and i on the boundary contour is higher than zero. In that case, the line segment ij is located outside the divided area.

Calculate the distance r between the midpoint C(xc, yc) of the line segment ij and the point C to point i, calculate the intersection P(xp, yp) between the line segment formed by two adjacent points e and f and the line segment ij, if (xcxp)2 + (ycyp)2 < r2 is true. The line segment ij cannot be a division of the area line.

There are many dividing lines that meet the above requirements. Selecting the best dividing line from these possible dividing lines is the key technology of the algorithm. It directly affects the quality and efficiency of meshing [12]. In the previous papers, the optimal dividing line was determined using two non-dimensional parameters, namely the linear combination of the deviation of the angle and the length S. The specific formula is: S=c1k=14|θk90)|360+c2ld S = {c_1}{{\sum\limits_{k = 1}^4 |{\theta _k} - 90)|} \over {360}} + {c_2}{l \over d}

The formula c1, c2 represents the weighting factor, which is a constant. θk − (k = 1, 2, 3, 4) represents the angle formed by the possible dividing line and the ring. l represents the length of the possible dividing line. d represents the length of the diagonal of the rectangle that can completely close the ring.

The possible dividing line corresponding to the minimum value of S calculated by the above formula is the optimal dividing line of the ring. This criterion is very effective when the regional boundary is not complicated [13]. Usually, the first case a is more conducive to improving the quality of the mesh. For this reason, we propose a new method for determining the optimal dividing line. The specific formula is as follows: S=c1k=14|θk(π/2)|2π+c2(xixj)2+(yiyj)2d+c3(|0.5θ1θi|+|0.5θ3θj|)+c4(θminθi+θminθj) \matrix{ {S } \hfill & = {{c_1}{{\sum\limits_{k = 1}^4 |{\theta _k} - (\pi /2)|} \over {2\pi }} + {c_2}{{\sqrt {{{({x_i} - {x_j})}^2} + {{({y_i} - {y_j})}^2}} } \over d} + {c_3}\left( {\left| {0.5 - {{{\theta _1}} \over {{\theta _i}}}} \right| + \left| {0.5 - {{{\theta _3}} \over {{\theta _j}}}} \right|} \right)} \hfill \cr {} \hfill & { +\, {c_4}\left( {{{{\theta _{\min }}} \over {{\theta _i}}} + {{{\theta _{\min }}} \over {{\theta _j}}}} \right)} \hfill \cr } S=c1k=14ϕ(θk)+c2(xixj)2+(yiyj)2d+c3(|0.5θ1θi|+|0.5θ3θj|)+c4(θminθi+θminθj) S = {c_1}\sum\limits_{k = 1}^4 \phi ({\theta _k}) + {c_2}{{\sqrt {{{({x_i} - {x_j})}^2} + {{({y_i} - {y_j})}^2}} } \over d} + {c_3}\left( {\left| {0.5 - {{{\theta _1}} \over {{\theta _i}}}} \right| + \left| {0.5 - {{{\theta _3}} \over {{\theta _j}}}} \right|} \right) + {c_4}\left( {{{{\theta _{\min }}} \over {{\theta _i}}} + {{{\theta _{\min }}} \over {{\theta _j}}}} \right)

When the divided area is a convex polygon, equation (22) is applied. When divided area is a concave polygon, equation (23) is applied. In equations (21) and (22), c3 and c4 are weighting factors. θmin represents the minimum internal angle of the boundary node of the divided subregion. θi and θj indicate that the internal angles of nodes i and j are φ(θ) as: φ(θ)={2π(θ+π2)0<θ<π2|sin2θ|θπ2 \varphi (\theta ) = \left\{ {\matrix{ {{2 \over \pi }( - \theta + {\pi \over 2})} \hfill & {0 < \theta < {\pi \over 2}} \hfill\cr {|\sin 2\theta |} \hfill& {\theta \ge {\pi \over 2}} \hfill\cr } } \right.

In the above formula, the values of the weight factors c1, c2, c3 and c4 will directly affect the quality of meshing. After many trials, the weight factor c1 can be taken as 0.5, the weight factor c2 can be taken as 0.2, the weight factor c3 can be taken as 0.15 and the weight factor c4 can be taken as 0.15.

Conclusion

In this paper, through the study of finite element differential dichotomous farad transformation, students can understand the meaning and nature of pull transformation. In addition to playing a significant role in signal processing, pull transformation can also be applied in the information teaching of circuit education. The introduction of other methods of teaching broadens the students’ thinking and inspires their thinking. Informatisation teaching mode has improved students’ interest and efficiency in learning and further improved their self-learning ability and innovation ability.

eISSN:
2444-8656
Język:
Angielski
Częstotliwość wydawania:
Volume Open
Dziedziny czasopisma:
Life Sciences, other, Mathematics, Applied Mathematics, General Mathematics, Physics