東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Dynamic Mode Decomposition as a Tool...

George, Laura Amelia.

Linked to FindBook

Google Book

Amazon

博客來

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

Record Type:	Electronic resources : Monograph/item
Title/Author:	Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows./
Author:	George, Laura Amelia.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2023,
Description:	94 p.
Notes:	Source: Masters Abstracts International, Volume: 84-12.
Contained By:	Masters Abstracts International84-12.
Subject:	Aerospace engineering. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30524380
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. - Ann Arbor : ProQuest Dissertations & Theses, 2023 - 94 p.

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

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

This item is not available from ProQuest Dissertations & Theses.

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.

ISBN: 9798379695200Subjects--Topical Terms:

1002622
Aerospace engineering.
Subjects--Index Terms:

Computational fluid dynamics

Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows.
LDR:02942nmm a2200373 4500 001 2397217
005 20240617111348.5
006 m o d
007 cr#unu||||||||
008 251215s2023 ||||||||||||||||| ||eng d
020 $a 9798379695200
035 $a (MiAaPQ)AAI30524380
035 $a AAI30524380
040 $a MiAaPQ $c MiAaPQ
100 1 $a George, Laura Amelia. $3 3766980
245 1 0 $a Dynamic Mode Decomposition as a Tool for Reducing Computational Time in Numerical Simulation of Complex Flows.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 94 p.
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.
506 $a This item is not available from ProQuest Dissertations & Theses.
506 $a This item must not be sold to any third party vendors.
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.
590 $a School code: 0115.
650 4 $a Aerospace engineering. $3 1002622
650 4 $a Fluid mechanics. $3 528155
653 $a Computational fluid dynamics
653 $a Dynamic mode decomposition
653 $a Downsampling algorithm
690 $a 0538
690 $a 0204
710 2 $a University of Windsor (Canada). $b MECHANICAL ENGINEERING. $3 2093247
773 0 $t Masters Abstracts International $g 84-12.
790 $a 0115
791 $a M.A.Sc.
792 $a 2023
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30524380