|
|
| (45 intermediate revisions by the same user not shown) |
| Line 5: |
Line 5: |
| | Perkenalkan nama saya Josiah Enrico S dari jurusan teknik mesin FTUI. Sebagai salah seorang mahasiswa, saya senang belajar dan berbagi banyak hal baru kepada dunia. Melalui wiki ini, saya akan berbagi kepada kalian tentang apa yang saya pelajari. :) | | Perkenalkan nama saya Josiah Enrico S dari jurusan teknik mesin FTUI. Sebagai salah seorang mahasiswa, saya senang belajar dan berbagi banyak hal baru kepada dunia. Melalui wiki ini, saya akan berbagi kepada kalian tentang apa yang saya pelajari. :) |
| | | | |
| − | = Aplikasi CFD = | + | = [[Aplikasi CFD - Josiah Enrico S (1906356286)]] = |
| | | | |
| − | == Melakukan Simulasi Tanpa Menggunakan GUI - Aplikasi Modelica/17 November 2020 == | + | = [[Metode Numerik - Josiah Enrico S (1906356286)]] = |
| | | | |
| − | [[File:VAWT Jos.jpg |200px|thumb|right|Vertical Axis Wind Turbine]]
| + | = [[Mekanika Fluida - Josiah Enrico S (1906356286)]] = |
| − | | |
| − | == Contoh Aplikasi Dynamic Mesh dan 6DoF - Aplikasi Modelica/19 November 2020 ==
| |
| − | | |
| − | | |
| − | VAWT atau singkatan dari Vertical Axis Wind Turbin adalah salah satu mesin tenaga yang mengubah energi mekanis dari aliran angin menjadi kerja. ciri khas mesin tipe ini adalah turbin memiliki poros yang tegak lurus dengan aliran fluida dan vertikal dengan tanah seperti gambar di samping. Desain ini memungkinkan aliran angin dari arah manapun dapat dimanfaatkan untuk menjadi kerja asalkan tidak sejajar dengan poros turbin ini. Dalam insdustri, mesin ini juga dikenal sebagai "transverse axis wind turbine" atau "cross-flow wind turbine." Dalam artikel ini, diperlihatkan simulasi komputer yang menggambarkan dinamika fluida ketika turbin sedang beroperasi (dengan variasi massa jenis).
| |
| − | | |
| − | Untuk mengimplementasikan simulasi CFD dalam desain berikut, digunakan metode Dynamic Mesh dan 6DoF (6 Degree of Freedom). Dynamic Mesh berarti mesh tidak rigid tapi fleksibel misalnya bergerak dalam suatu jalur atau berputar dalam suatu axis, sedangkan 6DoF berarti simulasi dilakukan dengan memperhatikan kebebasan gerak suatu mesh ketika dialiri fluida (Dalam 3 dimensi kebebasan ini berderajat 6)
| |
| − | | |
| − | | |
| − | [[File:VAWT Mesh Jos.png|400px|thumb|center|Bentuk Meshing Geometri]]
| |
| − | | |
| − | {| class="wikitable" style="margin-left: auto; margin-right: auto; border: none;"
| |
| − | |+ Simulasi Dengan Perbedaan Massa Jenis
| |
| − | |-
| |
| − | | [[File:VAWT 1.2RHO Jos.gif]]
| |
| − | | [[File:VAWT 4.8RHO Jos.gif]]
| |
| − | |-
| |
| − | | style='border-style: none right none left;' | rho=1,2 kg/m^3
| |
| − | | style='border-style: none right none left;' | rho=4.8 kg/m^3
| |
| − | |}
| |
| − | | |
| − | Analisa
| |
| − | | |
| − | == CFD Simulation for Economizer Hopper - Aplikasi Modelica/24 November 2020 ==
| |
| − | | |
| − | Economizer Hopper adalah salah satu fitur ducting yang biasanya terdapat dalam PLTU yang menggunakan batu bara. Fitur ini berfungsi menangkap dan menampung fly ash (abu terbang) yang dihasilkan pembakaran batu bara. Tanpa Economizer Hopper, debu tersebut bisa menimbulkan berbagai masalah operasional seperti menghambat aliran fluida di preheater, merusak blade IDF dan Guide Vane, menumpuk di ducting dan bahkan juga mencemari lingkungan. Dalam artikel ini, akan ditunjukkan simulasi CFD yang menggambarkan perbedaan efektifitas sistem yang menggunakan Economizer Hopper dan tanpa Hopper.
| |
| − | | |
| − | :Model Simulasi dalam CFD:
| |
| − | :*3D
| |
| − | :*Transient
| |
| − | :*Incompressible
| |
| − | :*Turbulent
| |
| − | :*No Heat Transfer
| |
| − | :*Multi-phase
| |
| − | | |
| − | {| class="wikitable" style="margin-left: auto; margin-right: auto; border: none;"
| |
| − | |+ Simulasi Economizer Hopper
| |
| − | |-
| |
| − | | [[File:Economizer Hopper Jos.gif]]
| |
| − | | [[File:Economizer combined Jos.gif]]
| |
| − | |-
| |
| − | | style='border-style: none right none left;' | Economizer dengan Hopper
| |
| − | | style='border-style: none right none left;' | Economizer tanpa Hopper
| |
| − | |}
| |
| − | | |
| − | [[File:Skala Economizer Jos.png|400px|center]]
| |
| − | | |
| − | :Analisa:
| |
| − | | |
| − | :
| |
| − | | |
| − | == CFD Simulation for Cyclone Separator - Aplikasi Modelica/26 November 2020 ==
| |
| − | | |
| − | [[File:Cyclone(2) Real Jos.jpg|180px|thumb|right|Cyclone Separator]]
| |
| − | Cyclone separators or simply cyclones are separation devices (dry scrubbers) that use the principle of inertia to remove particulate matter from flue gases. Cyclone separators is one of many air pollution control devices known as pre-cleaners since they generally remove larger pieces of particulate matter. This prevents finer filtration methods from having to deal with large, more abrasive particles later on. In addition, several cyclone separators can operate in parallel, and this system is known as a multi-cyclone.
| |
| − | | |
| − | It is important to note that cyclones can vary drastically in their size. The size of the cyclone depends largely on how much flue gas must be filtered, thus larger operations tend to need larger cyclones. For example, several different models of one cyclone type can exist, and the sizes can range from a relatively small 1.2-1.5 meters tall to around 9 meters —which is about as tall as a three-story building.
| |
| − | | |
| − | source: https://energyeducation.ca/encyclopedia/Cyclone_separator
| |
| − | | |
| − | | |
| − | | |
| − | '''Verification:'''
| |
| − | | |
| − | <div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
| |
| − | [[File:Box Mesh Cyclone Jos.png|300px]][[File:Simulation Model Cyclone Jos.png|300px]][[File:Injection Properties Cyclone Jos.png|300px]]
| |
| − | | |
| − | [[File:Inlet Properties Cyclone Jos.png|300px]][[File:Fluid Properties Cyclone Jos.png|300px]][[File:Particle Bulk Cyclone Jos.png|300px]]
| |
| − | </div>
| |
| − | | |
| − | '''Validation:'''
| |
| − | | |
| − | [[File:Density Effect Cyclone Jos.png|350px|right|Density Effect]]
| |
| − | : '''Effect of Air-Particle Density Difference'''
| |
| − | : Air-particle density difference (ρp − ρg) is a key parameter in cyclone efficiency calculations. Efficiency prediction by Li and Wang modified model for different particle density is shown in Figure 4. The numerical simulation result shows that the critical particle size, dpc, for particle with density 3000 kg/m3 is around 2.2 µm and is around 4.2 µm for 1000 kg/m3 particle density. A bigger particle density tends to result in a larger air-particle density difference since the air density remains constant. Bigger air-particle density difference led to a higher resultant centrifugal force acting on the particle, and the higher centrifugal force in cyclone has led to higher separation efficiency. It can be concluded from this finding that the bigger the particle density is, the smaller the critical particle size (dpc) would be obtained, or by other means, the sharper the separations would be.
| |
| − | | |
| − | [[File:Inlet Velocity Effect Cyclone Jos.png|350px|right|Inlet Velocity Effect]]
| |
| − | : '''Effect of Inlet Velocity'''
| |
| − | : Inlet gas velocity, vi, is an important factor for cyclone sizing in order to achieve a desired separation efficiency. Inlet cyclone velocity is a result of dividing the inlet gas flow rate, Q, to the cyclone inlet area (a.b). At a high flow rate, the inlet velocity becomes larger thus, the tangential velocity, vi, also increases. The cut-off diameter varies inversely with the square root of the inlet velocity. The effect of inlet velocity to the cyclone performance is shown in Figure 5. It shows that for the identical size and configuration of cyclone, the higher the gas inlet velocity is, the sharper the efficiency would be. However, a very high inlet velocity would decrease the collection efficiency because of increased turbulence and saltation/re-entrainment of particles. Shepherd and Lapple recommended that the optimum cyclone operating velocity is around 18 m/s. However, the range of practicable cyclone inlet velocity is around 15 – 30 m/s.
| |
| − | | |
| − | Source: https://www.researchgate.net/publication/314555880_Prediction_of_the_Effect_of_Dimension_Particle_Density_Temperature_and_Inlet_Velocity_on_Cyclone_Collection_Efficiency
| |
| − | | |
| − | | |
| − | '''Simulation Result:'''
| |
| − | | |
| − | [[File:Cyclone Jos.gif|800px|thumb|center|Variation of Particle Diameter]]
| |
| − | | |
| − | | |
| − | '''Analysis:'''
| |
| − | | |
| − | As we can see in the simulation above, the geometry of the cyclone separator will generate swiveling fluid inside the cylinder. This cyclone-like flow is started by the tangential velocity of fluid entering the inlet of the chamber. While whirling along the chamber surface, gravity takes place by driving the multiphase stream downward creating a vortex. Since larger particles tend to have heavier mass relative to the density and worse compliant to the high-speed spiral motion of the vortex, the particles hit the inside walls, lose momentum, and drop down into the bottom of the container. In reverse, the cleaner gas or fluid with smaller particles (blue particles) go along the cone-shaped wall following the high-speed movement of the vortex, float upward and escape out the top of the chamber. This effect is also related to the inertia of every particle itself, less for the smaller particulate and more for the larger ones. Unfortunately, we cannot see the complete upward movement of smaller particles as the duration of the simulation is not long enough respectively, but at the end of the illustration, we may see a glimpse of those particulates (blue particle) are raising upward.
| |
| − | | |
| − | [[File:Elutriator Synopsis Jos.png|thumb|right|200px]]
| |
| − | == Project Synopsis - Aplikasi Modelica/26 November 2020 ==
| |
| − | | |
| − | As elutriator, or an apparatus used to separate suspended solid particles according to size, have been used in the plastic industry regarding dust particles such as streamer or angel hair elimination, there is a need to observe the effectiveness of this control process to produce cleaner plastic pellet. In doing so theoretically, some recent studies show differences in particle size are exploited when they are subjected to an upward flowing current of fluid, leading to separation into size-based underflow and overflow streams. The tendency of a particle to report to either stream is dependent on its terminal sedimentation velocity, as well as the upward velocity of the fluid. Where the terminal velocity exceeds the fluid velocity, the particle will settle against the current and report to the underflow and vice versa. This research will recreate the flow using computational fluid dynamics application to help us understand the variation of particle size or density of particles leading to different sedimentation velocities in the separation process.
| |
| − | | |
| − | = Metode Numerik =
| |
| − | | |
| − | == Intro - Metode Numerik/11 November 2020 ==
| |
| − | | |
| − | Tujuan belajar metode numerik yaitu agar penulis dapat:
| |
| − | | |
| − | 1) Memahami konsep dan prinsip dasar metode numerik.
| |
| − | | |
| − | 2) Memahami aplikasi metode numerik
| |
| − | | |
| − | 3) Menyelesaikan persoalan teknik dengan metoda numerik
| |
| − | | |
| − | 4) Mendapat nilai tambah sebagai manusia yang lebih beradab
| |
| − | | |
| − | | |
| − | == Aplikasi Modelica - Metode Numerik/18 November 2020 ==
| |
| − | | |
| − | | |
| − | Berikut ini adalah contoh penerapan aplikasi OpenModelica untuk membuat 4 algoritma metode numerik dalam mencari ''roots of equation'' (akar persamaan) dari:
| |
| − | | |
| − | <div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
| |
| − | | |
| − | ''f(x) = exp^(-x)-(x)''
| |
| − | | |
| − | ''f'(x) = -exp^(-x)-1''
| |
| − | | |
| − | ''error maksimum = 0.0000001''
| |
| − | | |
| − | </div>
| |
| − | | |
| − | ===1) Newton Raphson (Terbuka)===
| |
| − | | |
| − | model Newton_Raphson_Algorithm
| |
| − |
| |
| − | parameter Real g=1; //guess
| |
| − | parameter Integer N=20; //max iteration
| |
| − | parameter Real er=0.0000001; //error maximum
| |
| − | Real a[N];
| |
| − | Real y[N];//function
| |
| − | Real ER[N]; //error
| |
| − | Real sol; //solution
| |
| − |
| |
| − | algorithm
| |
| − |
| |
| − | a[1]:=g;
| |
| − | y[1]:=a[1]-(exp(-a[1])-a[1])/(-exp(-a[1])-1);
| |
| − | ER[1]:=abs(1-a[1]/y[1]);
| |
| − |
| |
| − | for i in 2:N loop
| |
| − | a[i]:=y[i-1];
| |
| − | y[i]:=a[i]-(exp(-a[i])-a[i])/(-exp(-a[i])-1);
| |
| − | ER[i]:=abs(1-y[i-1]/y[i]);
| |
| − |
| |
| − | if ER[i]<er then
| |
| − | sol:=y[i];
| |
| − | break;
| |
| − | end if;
| |
| − | end for;
| |
| − |
| |
| − | end Newton_Raphson_Algorithm;
| |
| − | | |
| − | ===2) Secant (Terbuka)===
| |
| − |
| |
| − | model Secant_Algorithm
| |
| − |
| |
| − | parameter Real a=0; //guess
| |
| − | parameter Real b=1; //guess
| |
| − | parameter Integer N=10; //max iteration
| |
| − | parameter Real er=0.0000001; //error maximum
| |
| − | Real A[N];
| |
| − | Real B[N];
| |
| − | Real y[N];
| |
| − | Real ER[N];
| |
| − | Real sol; //solution
| |
| − |
| |
| − | algorithm
| |
| − |
| |
| − | A[1]:=a;
| |
| − | B[1]:=b;
| |
| − | y[1]:=B[1]-(exp(-B[1])-B[1])*(A[1]-B[1])/((exp(-A[1])-A[1])-(exp(-B[1])-B[1]));
| |
| − | ER[1]:=abs(1-B[1]/y[1]);
| |
| − |
| |
| − | for i in 2:N loop
| |
| − | A[i]:=B[i-1];
| |
| − | B[i]:=y[i-1];
| |
| − | y[i]:=B[i]-(exp(-B[i])-B[i])*(A[i]-B[i])/((exp(-A[i])-A[i])-(exp(-B[i])-B[i]));
| |
| − | ER[i]:=abs(1-y[i-1]/y[i]);
| |
| − |
| |
| − | if ER[i]<er then
| |
| − | sol:=y[i];
| |
| − | break;
| |
| − |
| |
| − | end if;
| |
| − | end for;
| |
| − |
| |
| − | end Secant_Algorithm;
| |
| − | | |
| − | ===3) Bisection (Tertutup)===
| |
| − | | |
| − | model Bisection_Algorithm
| |
| − |
| |
| − | parameter Real a=0; //guess bawah
| |
| − | parameter Real b=1; //guess atas
| |
| − | parameter Integer N=50; //max iteration
| |
| − | parameter Real er=0.0000001; //error maximum
| |
| − | Real fa=(exp(-a)-a);
| |
| − | Real fb=(exp(-b)-b);
| |
| − | Real A[N];
| |
| − | Real B[N];
| |
| − | Real fy[N];
| |
| − | Real y[N];
| |
| − | Real ER[N];
| |
| − | Real sol; //solution
| |
| − |
| |
| − | algorithm
| |
| − |
| |
| − | if fa*fb<0 then
| |
| − |
| |
| − | A[1]:=a;
| |
| − | B[1]:=b;
| |
| − | y[1]:=(A[1]+B[1])/2;
| |
| − | fy[1]:=exp(-y[1])-y[1];
| |
| − | ER[1]:=1;
| |
| − |
| |
| − | for i in 2:N loop
| |
| − | if fy[i-1]>0 then
| |
| − | A[i]:=y[i-1];
| |
| − | B[i]:=B[i-1];
| |
| − | else
| |
| − | A[i]:=A[i-1];
| |
| − | B[i]:=y[i-1];
| |
| − | end if;
| |
| − |
| |
| − | y[i]:=(A[i]+ B[i])/2;
| |
| − | fy[i]:=exp(-y[i])-y[i];
| |
| − | ER[i]:=abs(1-y[i-1]/y[i]);
| |
| − |
| |
| − | if ER[i]<er then
| |
| − | sol:=y[i];
| |
| − | break;
| |
| − | end if;
| |
| − |
| |
| − | end for;
| |
| − | end if;
| |
| − |
| |
| − | end Bisection_Algorithm;
| |
| − | | |
| − | ===4) Regula Falsi (Tertutup)===
| |
| − | | |
| − | model Regula_Falsi_Algorithm
| |
| − |
| |
| − | parameter Real a=0; //guess bawah
| |
| − | parameter Real b=1; //guess atas
| |
| − | parameter Integer N=20; //max iteration
| |
| − | parameter Real er=0.0000001; //error maximum
| |
| − | Real A[N];
| |
| − | Real B[N];
| |
| − | Real fa[N];
| |
| − | Real fb[N];
| |
| − | Real fy[N];
| |
| − | Real y[N];
| |
| − | Real ER[N];
| |
| − | Real sol; //solution
| |
| − |
| |
| − | algorithm
| |
| − |
| |
| − | A[1]:=a;
| |
| − | B[1]:=b;
| |
| − | fa[1]:=exp(-A[1])-A[1];
| |
| − | fb[1]:=exp(-B[1])-B[1];
| |
| − |
| |
| − | if fa[1]*fb[1]<0 then
| |
| − |
| |
| − | y[1]:=(A[1]*fb[1]-B[1]*fa[1])/(fb[1]-fa[1]);
| |
| − | fy[1]:=exp(-y[1])-y[1];
| |
| − | ER[1]:=1;
| |
| − |
| |
| − | for i in 2:N loop
| |
| − | if fy[i-1]>0 then
| |
| − | A[i]:=y[i-1];
| |
| − | B[i]:=B[i-1];
| |
| − | else
| |
| − | A[i]:=A[i-1];
| |
| − | B[i]:=y[i-1];
| |
| − | end if;
| |
| − |
| |
| − | fa[i]:=exp(-A[i])-A[i];
| |
| − | fb[i]:=exp(-B[i])-B[i];
| |
| − | y[i]:=(A[i]*fb[i]-B[i]*fa[i])/(fb[i]-fa[i]);
| |
| − | fy[i]:=exp(-y[i])-y[i];
| |
| − | ER[i]:=abs(1-y[i-1]/y[i]);
| |
| − |
| |
| − | if ER[i]<er then
| |
| − | sol:=y[i];
| |
| − | break;
| |
| − | end if;
| |
| − | end for;
| |
| − | end if;
| |
| − |
| |
| − | end Regula_Falsi_Algorithm;
| |
| − | | |
| − | Berikut link Youtube yang berisi penjelasan tentang algoritma dan penulisan kode OpenModelica keempat metode diatas:
| |
| − | | |
| − | <div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
| |
| − | <youtube width="200" height="100">66myoVJuyE0</youtube>
| |
| − | </div>
| |
| − | | |
| − | == Fungsi Panggil dalam Modelica - Metode Numerik/18 November 2020 ==
| |
| − | | |
| − | Fungsi panggil dalam aplikasi Modelica adalah metode membuat fungsi numerik dalam kelas ''function'' yang akan digunakan di dalam permodelan numerik utama (tipe 'class'). metode ini biasanya dipakai untuk menyederhanakan persoalan matematika yang kompleks, seperti persamaan aljabar simultan, sehingga lebih mudah diselesaikan. Dalam artikel ini akan ditampilkan 3 contoh persoalan numerik dengan solusi '''array''' atau lebih dari satu anggota:
| |
| − | | |
| − | ===1) Root of Equation (Newton Raphson dan Regula Falsi)===
| |
| − | | |
| − | [[File:Fungsi root Jos.png|600px|thumb|right|Grafik Modelica]]
| |
| − | | |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | | style='border-style: none none solid solid;' |
| |
| − | ''Newton Raphson''
| |
| − | ...
| |
| − | algorithm
| |
| − |
| |
| − | a[1]:=g;
| |
| − | y[1]:=a[1]-(Fungsi(a[1]))/(Der_Fungsi(a[1]));
| |
| − | ER[1]:=abs(1-a[1]/y[1]);
| |
| − |
| |
| − | for i in 2:N loop
| |
| − | a[i]:=y[i-1];
| |
| − | y[i]:=a[i]-(Fungsi(a[i]))/(Der_Fungsi(a[1]));
| |
| − | ER[i]:=abs(1-y[i-1]/y[i]);
| |
| − |
| |
| − | if ER[i]<er then
| |
| − | sol:=y[i];
| |
| − | break;
| |
| − | end if;
| |
| − | ''Regula Falsi''
| |
| − | ...
| |
| − | fa[1]:=Fungsi(A[1]);
| |
| − | fb[1]:=Fungsi(B[1]);
| |
| − |
| |
| − | if fa[1]*fb[1]<0 then
| |
| − |
| |
| − | y[1]:=(A[1]*fb[1]-B[1]*fa[1])/(fb[1]-fa[1]);
| |
| − | fy[1]:=Fungsi(y[1]);
| |
| − | ER[1]:=1;
| |
| − | ...
| |
| − |
| |
| − | fa[i]:=Fungsi(A[i]);
| |
| − | fb[i]:=Fungsi(B[i]);
| |
| − | y[i]:=(A[i]*fb[i]-B[i]*fa[i])/(fb[i]-fa[i]);
| |
| − | fy[i]:=Fungsi(y[i]);
| |
| − | ER[i]:=abs(1-y[i-1]/y[i]);
| |
| − | ...
| |
| − | | |
| − | | style='border-style: solid solid none none;' |
| |
| − | ''fungsi''
| |
| − | | |
| − | function Fungsi
| |
| − | input Real X;
| |
| − | output Real Y;
| |
| − |
| |
| − | algorithm
| |
| − | Y:=exp(-X)-X;
| |
| − | end Fungsi;
| |
| − | ''fungsi turunan''
| |
| − | | |
| − | function Der_Fungsi
| |
| − | input Real X;
| |
| − | output Real Y;
| |
| − |
| |
| − | algorithm
| |
| − | Y:=-exp(-X)-1;
| |
| − | end Der_Fungsi;
| |
| − | |}
| |
| − | | |
| − | ===2) Heat Diffusion===
| |
| − | Referensi: Versteeg, H. K., Malalasekera, W. (2007). An Introduction to Computational Fluid Dynamics. 2nd Edition. Harlow: Pearson (Example 4.2)
| |
| − | | |
| − | [[File:Heat func Jos.png|600px|thumb|right|Grafik Modelica]]
| |
| − | | |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | | style='border-style: none none solid solid;' |
| |
| − | ''Persamaan''
| |
| − | | |
| − | class TesAljabar
| |
| − | parameter Real A[5,5]=[375,-125,0,0,0;
| |
| − | -125,250,-125,0,0;
| |
| − | 0,-125,250,-125,0;
| |
| − | 0,0,-125,250,-125;
| |
| − | 0,0,0,-125,375];
| |
| − |
| |
| − | parameter Real B[5]={29000,4000,4000,4000,54000};
| |
| − | Real X[5];
| |
| − |
| |
| − | equation
| |
| − | X=matriks5(A,B);
| |
| − | end TesAljabar;
| |
| − | | |
| − | | style='border-style: solid solid none none;' |
| |
| − | ''fungsi''
| |
| − | function matriks5
| |
| − | input Real A[5,5];
| |
| − | input Real B[5];
| |
| − | output Real X[5];
| |
| − |
| |
| − | algorithm
| |
| − | X:=Modelica.Math.Matrices.solve(A,B);
| |
| − | end matriks5;
| |
| − | |}
| |
| − | | |
| − | ===3) Combined Spring Stiffness===
| |
| − | Referensi: http://www.sharetechnote.com/html/EngMath_Matrix_FEM_ComplicatedSpring.html
| |
| − | [[File:Spring func Jos.png|600px|thumb|right|Grafik Modelica]]
| |
| − | | |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | | style='border-style: none none solid solid;' |
| |
| − | ''Persamaan''
| |
| − | | |
| − | class Latihan_Matriks
| |
| − |
| |
| − | parameter Real c1=1; //spring 1
| |
| − | parameter Real c2=2; //spring 2
| |
| − | parameter Real c3=3; //spring 3
| |
| − | parameter Real c4=4; //spring 4
| |
| − | parameter Real c5=5; //spring 5
| |
| − | parameter Real k1[3,3]=c1*[1,0,0;
| |
| − | 0,0,0;
| |
| − | 0,0,0];
| |
| − | parameter Real k2[3,3]=c2*[1,-1,0;
| |
| − | -1,1,0;
| |
| − | 0,0,0];
| |
| − | parameter Real k3[3,3]=c3*[1,-1,0;
| |
| − | -1,1,0;
| |
| − | 0,0,0];
| |
| − | parameter Real k4[3,3]=c4*[1,0,-1;
| |
| − | 0,0,1;
| |
| − | -1,0,1];
| |
| − | parameter Real k5[3,3]=c5*[0,0,0;
| |
| − | 0,1,-1;
| |
| − | 0,-1,1];
| |
| − |
| |
| − | parameter Real B[3]={100,200,300};
| |
| − | Real K[3,3];
| |
| − | Real s[3];
| |
| − |
| |
| − | algorithm
| |
| − | K:=k1+k2+k3+k4+k5;
| |
| − | s:=matriks3(K,B);
| |
| − |
| |
| − | end Latihan_Matriks;
| |
| − | | |
| − | | style='border-style: solid solid none none;' |
| |
| − | ''fungsi''
| |
| − | function matriks3
| |
| − | input Real A[3,3];
| |
| − | input Real B[3];
| |
| − | output Real X[3];
| |
| − |
| |
| − | algorithm
| |
| − | X:=Modelica.Math.Matrices.solve(A,B);
| |
| − | end matriks3;
| |
| − | |}
| |
| − | | |
| − | Berikut link Youtube yang berisi penjelasan tentang algoritma dan penulisan kode OpenModelica latihan diatas:
| |
| − | | |
| − | <div class="center" style="width: auto; margin-left: auto; margin-right: auto;">
| |
| − | <youtube width="200" height="100">ZqoUhqul9l8</youtube>
| |
| − | </div>
| |
| − | | |
| − | == Finite Element Method for Trusses - Metode Numerik/2 Desember 2020 ==
| |
| − | | |
| − | Berikut 2 contoh penggunaan aplikasi Modelica untuk menyelesaikan perhitungan ''displacement'' dan ''reaction force'' pada ''trusses'':
| |
| − | | |
| − | '''Trusses Problem 1 (Example 3.1)'''
| |
| − | [[File:Soal Trusses 1 Jos.jpg|700px|thumb|right]]
| |
| − | [[File:Soal Trusses 1 Displacement Jos.jpg|700px|thumb|right|Grafik Displacement]]
| |
| − | [[File:Soal Trusses 1 Reaction Jos.jpg|700px|thumb|right|Grafik Reaction Forces]]
| |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | | style='border-style: none none solid solid;' |
| |
| − | ''Persamaan''
| |
| − | | |
| − | model Trusses
| |
| − |
| |
| − | parameter Integer N=10; //Global matrice = 2*points connected
| |
| − | parameter Real A=8;
| |
| − | parameter Real E=1.9e6;
| |
| − | Real G[N,N]; //global
| |
| − | Real Ginitial[N,N]; //global
| |
| − | Real Sol[N]; //global dispplacement
| |
| − | Real X[N]={0,0,0,0,0,0,0,-500,0,-500};
| |
| − | Real R[N]; //global reaction force
| |
| − | Real SolMat[N,1];
| |
| − | Real XMat[N,1];
| |
| − |
| |
| − | //boundary coundition
| |
| − | Integer b1=1;
| |
| − | Integer b2=3;
| |
| − |
| |
| − | //truss 1
| |
| − | parameter Real X1=0; //degree between truss
| |
| − | Real k1=A*E/36;
| |
| − | Real K1[4,4]; //stiffness matrice
| |
| − | Integer p1a=1;
| |
| − | Integer p1b=2;
| |
| − | Real G1[N,N];
| |
| − |
| |
| − | //truss 2
| |
| − | parameter Real X2=135; //degree between truss
| |
| − | Real k2=A*E/50.912;
| |
| − | Real K2[4,4]; //stiffness matrice
| |
| − | Integer p2a=2;
| |
| − | Integer p2b=3;
| |
| − | Real G2[N,N];
| |
| − |
| |
| − | //truss 3
| |
| − | parameter Real X3=0; //degree between truss
| |
| − | Real k3=A*E/36;
| |
| − | Real K3[4,4]; //stiffness matrice
| |
| − | Integer p3a=3;
| |
| − | Integer p3b=4;
| |
| − | Real G3[N,N];
| |
| − |
| |
| − | //truss 4
| |
| − | parameter Real X4=90; //degree between truss
| |
| − | Real k4=A*E/36;
| |
| − | Real K4[4,4]; //stiffness matrice
| |
| − | Integer p4a=2;
| |
| − | Integer p4b=4;
| |
| − | Real G4[N,N];
| |
| − |
| |
| − | //truss 5
| |
| − | parameter Real X5=45; //degree between truss
| |
| − | Real k5=A*E/50.912;
| |
| − | Real K5[4,4]; //stiffness matrice
| |
| − | Integer p5a=2;
| |
| − | Integer p5b=5;
| |
| − | Real G5[N,N];
| |
| − |
| |
| − | //truss 6
| |
| − | parameter Real X6=0; //degree between truss
| |
| − | Real k6=A*E/36;
| |
| − | Real K6[4,4]; //stiffness matrice
| |
| − | Integer p6a=4;
| |
| − | Integer p6b=5;
| |
| − | Real G6[N,N];
| |
| − |
| |
| − | /*
| |
| − | for each truss, please ensure pXa is lower then pXb (X represents truss element number)
| |
| − | */
| |
| − |
| |
| − | algorithm
| |
| − |
| |
| − | //creating global matrice
| |
| − | K1:=Stiffness_Matrices(X1);
| |
| − | G1:=k1*Local_Global(K1,N,p1a,p1b);
| |
| − |
| |
| − | K2:=Stiffness_Matrices(X2);
| |
| − | G2:=k2*Local_Global(K2,N,p2a,p2b);
| |
| − |
| |
| − | K3:=Stiffness_Matrices(X3);
| |
| − | G3:=k3*Local_Global(K3,N,p3a,p3b);
| |
| − |
| |
| − | K4:=Stiffness_Matrices(X4);
| |
| − | G4:=k4*Local_Global(K4,N,p4a,p4b);
| |
| − |
| |
| − | K5:=Stiffness_Matrices(X5);
| |
| − | G5:=k5*Local_Global(K5,N,p5a,p5b);
| |
| − |
| |
| − | K6:=Stiffness_Matrices(X6);
| |
| − | G6:=k6*Local_Global(K6,N,p6a,p6b);
| |
| − |
| |
| − | G:=G1+G2+G3+G4+G5+G6;
| |
| − | Ginitial:=G;
| |
| − |
| |
| − | //implementing boundary condition
| |
| − | for i in 1:N loop
| |
| − | G[2*b1-1,i]:=0;
| |
| − | G[2*b1,i]:=0;
| |
| − | G[2*b2-1,i]:=0;
| |
| − | G[2*b2,i]:=0;
| |
| − | end for;
| |
| − |
| |
| − | G[2*b1-1,2*b1-1]:=1;
| |
| − | G[2*b1,2*b1]:=1;
| |
| − | G[2*b2-1,2*b2-1]:=1;
| |
| − | G[2*b2,2*b2]:=1;
| |
| − |
| |
| − | //solving displacement
| |
| − | Sol:=Gauss_Jordan(N,G,X);
| |
| − |
| |
| − | //solving reaction force
| |
| − | SolMat:=matrix(Sol);
| |
| − | XMat:=matrix(X);
| |
| − | R:=Reaction_Trusses(N,Ginitial,SolMat,XMat);
| |
| − |
| |
| − | end Trusses;
| |
| − | |}
| |
| − | | |
| − | | |
| − | '''Trusses Problem 2 (Homework)'''
| |
| − | [[File:Soal Trusses 2 Jos.jpg|700px|thumb|right]]
| |
| − | [[File:Soal Trusses 2 Displacement Jos.jpg|700px|thumb|right|Grafik Displacement]]
| |
| − | [[File:Soal Trusses 2 Reaction Jos.jpg|700px|thumb|right|Grafik Reaction Forces]]
| |
| − | {| class="wikitable"
| |
| − | |-
| |
| − | | style='border-style: none none solid solid;' |
| |
| − | ''Persamaan''
| |
| − | | |
| − | class Trusses_HW
| |
| − |
| |
| − | parameter Integer N=8; //Global matrice = 2*points connected
| |
| − | parameter Real A=0.001; //Area m2
| |
| − | parameter Real E=200e9; //Pa
| |
| − | Real G[N,N]; //global
| |
| − | Real Ginitial[N,N]; //global
| |
| − | Real Sol[N]; //global dispplacement
| |
| − | Real X[N]={0,0,-1035.2762,-3863.7033,0,0,-1035.2762,-3863.7033};
| |
| − | Real R[N]; //global reaction force
| |
| − | Real SolMat[N,1];
| |
| − | Real XMat[N,1];
| |
| − |
| |
| − | //boundary condition
| |
| − | Integer b1=1;
| |
| − | Integer b2=3;
| |
| − |
| |
| − | //truss 1
| |
| − | parameter Real X1=0; //degree between truss
| |
| − | Real k1=A*E/1;
| |
| − | Real K1[4,4]; //stiffness matrice
| |
| − | Integer p1a=1;
| |
| − | Integer p1b=2;
| |
| − | Real G1[N,N];
| |
| − |
| |
| − | //truss 2
| |
| − | parameter Real X2=0; //degree between truss
| |
| − | Real k2=A*E/1;
| |
| − | Real K2[4,4]; //stiffness matrice
| |
| − | Integer p2a=2;
| |
| − | Integer p2b=3;
| |
| − | Real G2[N,N];
| |
| − |
| |
| − | //truss 3
| |
| − | parameter Real X3=90; //degree between truss
| |
| − | Real k3=A*E/1.25;
| |
| − | Real K3[4,4]; //stiffness matrice
| |
| − | Integer p3a=2;
| |
| − | Integer p3b=4;
| |
| − | Real G3[N,N];
| |
| − |
| |
| − | //truss 4
| |
| − | parameter Real X4=90+38.6598; //degree between truss
| |
| − | Real k4=A*E/1.6;
| |
| − | Real K4[4,4]; //stiffness matrice
| |
| − | Integer p4a=1;
| |
| − | Integer p4b=4;
| |
| − | Real G4[N,N];
| |
| − |
| |
| − | //truss 5
| |
| − | parameter Real X5=90-38.6598; //degree between truss
| |
| − | Real k5=A*E/1.6;
| |
| − | Real K5[4,4]; //stiffness matrice
| |
| − | Integer p5a=3;
| |
| − | Integer p5b=4;
| |
| − | Real G5[N,N];
| |
| − |
| |
| − | /*
| |
| − | for each truss, please ensure pXa is lower then pXb (X represents truss element number)
| |
| − | */
| |
| − |
| |
| − | algorithm
| |
| − |
| |
| − | //creating global matrice
| |
| − | K1:=Stiffness_Matrices(X1);
| |
| − | G1:=k1*Local_Global(K1,N,p1a,p1b);
| |
| − |
| |
| − | K2:=Stiffness_Matrices(X2);
| |
| − | G2:=k2*Local_Global(K2,N,p2a,p2b);
| |
| − |
| |
| − | K3:=Stiffness_Matrices(X3);
| |
| − | G3:=k3*Local_Global(K3,N,p3a,p3b);
| |
| − |
| |
| − | K4:=Stiffness_Matrices(X4);
| |
| − | G4:=k4*Local_Global(K4,N,p4a,p4b);
| |
| − |
| |
| − | K5:=Stiffness_Matrices(X5);
| |
| − | G5:=k5*Local_Global(K5,N,p5a,p5b);
| |
| − |
| |
| − | G:=G1+G2+G3+G4+G5;
| |
| − | Ginitial:=G;
| |
| − |
| |
| − | //implementing boundary condition
| |
| − | for i in 1:N loop
| |
| − | G[2*b1-1,i]:=0;
| |
| − | G[2*b1,i]:=0;
| |
| − | G[2*b2-1,i]:=0;
| |
| − | G[2*b2,i]:=0;
| |
| − | end for;
| |
| − |
| |
| − | G[2*b1-1,2*b1-1]:=1;
| |
| − | G[2*b1,2*b1]:=1;
| |
| − | G[2*b2-1,2*b2-1]:=1;
| |
| − | G[2*b2,2*b2]:=1;
| |
| − |
| |
| − | //solving displacement
| |
| − | Sol:=Gauss_Jordan(N,G,X);
| |
| − |
| |
| − | //solving reaction force
| |
| − | SolMat:=matrix(Sol);
| |
| − | XMat:=matrix(X);
| |
| − | R:=Reaction_Trusses(N,Ginitial,SolMat,XMat);
| |
| − |
| |
| − | end Trusses_HW;
| |
| − | |}
| |
| | | | |
| | == Gate Valve - Aplikasi CFD/12 November 2020 == | | == Gate Valve - Aplikasi CFD/12 November 2020 == |
