東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A Three Dimensional Finite Differenc...

Luong, Kevin Quy Tanh.

FindBook

Google Book

Amazon

博客來

A Three Dimensional Finite Difference Time Domain Sub-Gridding Method.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A Three Dimensional Finite Difference Time Domain Sub-Gridding Method./
作者:	Luong, Kevin Quy Tanh.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2019,
面頁冊數:	72 p.
附註:	Source: Masters Abstracts International, Volume: 80-12.
Contained By:	Masters Abstracts International80-12.
標題:	Computational physics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13896158
ISBN:	9781392235102

A Three Dimensional Finite Difference Time Domain Sub-Gridding Method.
Luong, Kevin Quy Tanh.

A Three Dimensional Finite Difference Time Domain Sub-Gridding Method. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 72 p.

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

Thesis (M.S.)--University of California, Los Angeles, 2019.

This item must not be sold to any third party vendors.

The finite difference time domain method has long been one of the most widely used numerical methods for solving Maxwell's equations due in part to its accuracy, explicit nature, and simplicity of implementation. Modern research interests have created a need for this method to be extended to handle multi-scale multi-physics problems where numerous physical phenomena are coupled with classical electrodynamics. These phenomena typically occur on vastly different spatial scales; however, the conventional finite difference time domain method requires a uniform spatial discretization across the entire simulation space. Additionally, the maximum time evolution that may be solved in a single iteration of the algorithm is proportional to the smallest discretization length. Consequently, properly resolving the smallest feature of a multiscale problem causes phenomena of a larger scale to be over-resolved, resulting in an unnecessarily large amount of memory and often an impractical number of computations required for simulation. The development of a capability for sub-gridding, where local domains of fine resolution may be incorporated into a simulation space of coarser resolution, is imperative to treat this issue. This thesis proposes a new algorithm to implement sub-gridding. The results of comprehensive numerical evaluations show promise for this algorithm to be of general use in solving multi-scale multi-physics problems.

ISBN: 9781392235102Subjects--Topical Terms:

3343998
Computational physics.
Subjects--Index Terms:

Computational

A Three Dimensional Finite Difference Time Domain Sub-Gridding Method.
LDR:02680nmm a2200409 4500 001 2268684
005 20200824072427.5
008 220629s2019 ||||||||||||||||| ||eng d
020 $a 9781392235102
035 $a (MiAaPQ)AAI13896158
035 $a (MiAaPQ)ucla:17771
035 $a AAI13896158
040 $a MiAaPQ $c MiAaPQ
100 1 $a Luong, Kevin Quy Tanh. $3 3545979
245 1 0 $a A Three Dimensional Finite Difference Time Domain Sub-Gridding Method.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 72 p.
500 $a Source: Masters Abstracts International, Volume: 80-12.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Wang, Yuanxun E.
502 $a Thesis (M.S.)--University of California, Los Angeles, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a The finite difference time domain method has long been one of the most widely used numerical methods for solving Maxwell's equations due in part to its accuracy, explicit nature, and simplicity of implementation. Modern research interests have created a need for this method to be extended to handle multi-scale multi-physics problems where numerous physical phenomena are coupled with classical electrodynamics. These phenomena typically occur on vastly different spatial scales; however, the conventional finite difference time domain method requires a uniform spatial discretization across the entire simulation space. Additionally, the maximum time evolution that may be solved in a single iteration of the algorithm is proportional to the smallest discretization length. Consequently, properly resolving the smallest feature of a multiscale problem causes phenomena of a larger scale to be over-resolved, resulting in an unnecessarily large amount of memory and often an impractical number of computations required for simulation. The development of a capability for sub-gridding, where local domains of fine resolution may be incorporated into a simulation space of coarser resolution, is imperative to treat this issue. This thesis proposes a new algorithm to implement sub-gridding. The results of comprehensive numerical evaluations show promise for this algorithm to be of general use in solving multi-scale multi-physics problems.
590 $a School code: 0031.
650 4 $a Computational physics. $3 3343998
650 4 $a Electrical engineering. $3 649834
650 4 $a Electromagnetics. $3 3173223
653 $a Computational
653 $a Electromagnetics
653 $a Fdtd
653 $a Multi-physics
653 $a Multi-scale
653 $a Sub-gridding
690 $a 0216
690 $a 0544
690 $a 0607
710 2 $a University of California, Los Angeles. $b Electrical and Computer Engineering. $3 3437880
773 0 $t Masters Abstracts International $g 80-12.
790 $a 0031
791 $a M.S.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13896158