國立虎尾科技大學 |

Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows./
作者:	George, Laura Amelia.
面頁冊數:	1 online resource (94 pages)
附註:	Source: Masters Abstracts International, Volume: 84-12.
Contained By:	Masters Abstracts International84-12.
標題:	Fluid mechanics. -
電子資源:	click for full text (PQDT)
ISBN:	9798379695200

Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows.
George, Laura Amelia.

Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows. - 1 online resource (94 pages)

Source: Masters Abstracts International, Volume: 84-12.

Thesis (M.A.Sc.)--University of Windsor (Canada), 2023.

Includes bibliographical references

The length of simulation time for unsteady computational fluid dynamics (CFD) is often based on intuition or best practices, as there is no established convergence criteria to guarantee that sufficient flow time has elapsed to resolve all spatio-temporal content. Thus, these simulations are often run longer than necessary, but this increases the run time and computational resources required. This thesis first introduces an algorithm, based on dynamic mode decomposition (DMD), that can determine when continuing an unsteady CFD computation no longer yields additional spatio-temporal information. This algorithm is demonstrated on an analytical dataset as well as two CFD test cases: a fully turbulent flow over a cylinder and a flow over a moving rotor with a stationary downstream duct. This algorithm is able to determine the point at which the spatio-temporal content of the flow stops changing meaningfully in advance of using conventional methods: by 44% in the analytical flow data and by 8% in the flow over cylinder case. However, this algorithm is itself expensive on large datasets typical of practical CFD applications. This thesis then introduces an updated algorithm to make it more robust and prevent the accumulation of unnecessary time steps that would increase the computational cost of using the convergence algorithm. Finally, a downsampling algorithm is introduced that can reduce the number of spatial points analyzed by the algorithm by 80-85%, while retaining a similar convergence location as in the full data calculation. This drastically reduces the computational cost of using the convergence algorithm and makes it useful in practical CFD applications.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798379695200Subjects--Topical Terms:

555551
Fluid mechanics.
Subjects--Index Terms:

Computational fluid dynamicsIndex Terms--Genre/Form:

554714
Electronic books.

Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows.
LDR:03012ntm a22003617 4500 001 1145117
005 20240617111348.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798379695200
035 $a (MiAaPQ)AAI30524380
035 $a AAI30524380
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a George, Laura Amelia. $3 1470336
245 1 0 $a Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows.
264 0 $c 2023
300 $a 1 online resource (94 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 84-12.
500 $a Advisor: Defoe, J.
502 $a Thesis (M.A.Sc.)--University of Windsor (Canada), 2023.
504 $a Includes bibliographical references
520 $a The length of simulation time for unsteady computational fluid dynamics (CFD) is often based on intuition or best practices, as there is no established convergence criteria to guarantee that sufficient flow time has elapsed to resolve all spatio-temporal content. Thus, these simulations are often run longer than necessary, but this increases the run time and computational resources required. This thesis first introduces an algorithm, based on dynamic mode decomposition (DMD), that can determine when continuing an unsteady CFD computation no longer yields additional spatio-temporal information. This algorithm is demonstrated on an analytical dataset as well as two CFD test cases: a fully turbulent flow over a cylinder and a flow over a moving rotor with a stationary downstream duct. This algorithm is able to determine the point at which the spatio-temporal content of the flow stops changing meaningfully in advance of using conventional methods: by 44% in the analytical flow data and by 8% in the flow over cylinder case. However, this algorithm is itself expensive on large datasets typical of practical CFD applications. This thesis then introduces an updated algorithm to make it more robust and prevent the accumulation of unnecessary time steps that would increase the computational cost of using the convergence algorithm. Finally, a downsampling algorithm is introduced that can reduce the number of spatial points analyzed by the algorithm by 80-85%, while retaining a similar convergence location as in the full data calculation. This drastically reduces the computational cost of using the convergence algorithm and makes it useful in practical CFD applications.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Fluid mechanics. $3 555551
650 4 $a Aerospace engineering. $3 686400
653 $a Computational fluid dynamics
653 $a Dynamic mode decomposition
653 $a Downsampling algorithm
655 7 $a Electronic books. $2 local $3 554714
690 $a 0538
690 $a 0204
710 2 $a University of Windsor (Canada). $b MECHANICAL ENGINEERING. $3 845409
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Masters Abstracts International $g 84-12.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30524380 $z click for full text (PQDT)