東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Error Behavior and Optimal Discretiz...

Frontin, Cory.

Linked to FindBook

Google Book

Amazon

博客來

Error Behavior and Optimal Discretization of Chaotic Differential Equations.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Error Behavior and Optimal Discretization of Chaotic Differential Equations./
Author:	Frontin, Cory.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2023,
Description:	164 p.
Notes:	Source: Dissertations Abstracts International, Volume: 85-02, Section: B.
Contained By:	Dissertations Abstracts International85-02B.
Subject:	Aeronautics. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30672382
ISBN:	9798380097239

Error Behavior and Optimal Discretization of Chaotic Differential Equations.
Frontin, Cory.

Error Behavior and Optimal Discretization of Chaotic Differential Equations. - Ann Arbor : ProQuest Dissertations & Theses, 2023 - 164 p.

Source: Dissertations Abstracts International, Volume: 85-02, Section: B.

Thesis (Ph.D.)--Massachusetts Institute of Technology, 2023.

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

In this thesis, the simulation of chaotic systems is considered. For many chaotic systems, we desire to make estimates of mean values of quantities of interest, and in this case, the effect of chaos is to introduce behavior that naturally lends itself to statistical, rather than deterministic, description. When simulating chaotic systems using discrete versions of governing differential equations, then, chaos introduces statistical errors alongside discretization errors. These statistical errors are generally one of two types: transient spin-up error before the system reaches the attractor (i.e. the stationary distribution of long-run states) and sampling error due to finite-time averaging of trajectories on the attractor.In this work, we first propose an error model to describe the expected absolute errors on the attractor of a chaotic ordinary differential equation system. This model for the error implies optimal choices of timestep and sampling time to minimize the error in the simulation- including discretization error and sampling error- given some computational budget. Adding a model for the spin-up error, this allows the description of the optimal choice of timestep, sampling, and spin-up times. Next, we develop a small-sample Bayesian approach that allows the estimation of the discretization and the sampling error using only a small number of simulation results with distinct timesteps and sampling times on the attractor.We then extend the approach for spatiotemporally chaotic partial differential equation systems, which introduces error due to spatial discretization in addition to the temporal discretization errors and statistical errors. Finally, we augment the small-sample approach with corrections for non-negligible spin-up transient behavior, then embed the resulting small-sample method in a naive explore-exploit algorithm. Using this algorithm, we demonstrate that given a fixed total computational budget such an approach can allow chaotic simulations that achieve near-optimal estimates without strong prior knowledge of the behavior of the system. In addition to this near-optimal discretization, the method allows an a posteriori estimate of the simulation error in the final result after the exploitation stage.

ISBN: 9798380097239Subjects--Topical Terms:

560293
Aeronautics.

Error Behavior and Optimal Discretization of Chaotic Differential Equations.
LDR:03374nmm a2200349 4500 001 2397277
005 20240617111402.5
006 m o d
007 cr#unu||||||||
008 251215s2023 ||||||||||||||||| ||eng d
020 $a 9798380097239
035 $a (MiAaPQ)AAI30672382
035 $a (MiAaPQ)MIT1721_1_150280
035 $a AAI30672382
040 $a MiAaPQ $c MiAaPQ
100 1 $a Frontin, Cory. $0 (orcid)0000-0002-9375-7488 $3 3767040
245 1 0 $a Error Behavior and Optimal Discretization of Chaotic Differential Equations.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 164 p.
500 $a Source: Dissertations Abstracts International, Volume: 85-02, Section: B.
500 $a Advisor: Darmofal, David.
502 $a Thesis (Ph.D.)--Massachusetts Institute of Technology, 2023.
506 $a This item must not be sold to any third party vendors.
520 $a In this thesis, the simulation of chaotic systems is considered. For many chaotic systems, we desire to make estimates of mean values of quantities of interest, and in this case, the effect of chaos is to introduce behavior that naturally lends itself to statistical, rather than deterministic, description. When simulating chaotic systems using discrete versions of governing differential equations, then, chaos introduces statistical errors alongside discretization errors. These statistical errors are generally one of two types: transient spin-up error before the system reaches the attractor (i.e. the stationary distribution of long-run states) and sampling error due to finite-time averaging of trajectories on the attractor.In this work, we first propose an error model to describe the expected absolute errors on the attractor of a chaotic ordinary differential equation system. This model for the error implies optimal choices of timestep and sampling time to minimize the error in the simulation- including discretization error and sampling error- given some computational budget. Adding a model for the spin-up error, this allows the description of the optimal choice of timestep, sampling, and spin-up times. Next, we develop a small-sample Bayesian approach that allows the estimation of the discretization and the sampling error using only a small number of simulation results with distinct timesteps and sampling times on the attractor.We then extend the approach for spatiotemporally chaotic partial differential equation systems, which introduces error due to spatial discretization in addition to the temporal discretization errors and statistical errors. Finally, we augment the small-sample approach with corrections for non-negligible spin-up transient behavior, then embed the resulting small-sample method in a naive explore-exploit algorithm. Using this algorithm, we demonstrate that given a fixed total computational budget such an approach can allow chaotic simulations that achieve near-optimal estimates without strong prior knowledge of the behavior of the system. In addition to this near-optimal discretization, the method allows an a posteriori estimate of the simulation error in the final result after the exploitation stage.
590 $a School code: 0753.
650 4 $a Aeronautics. $3 560293
650 4 $a Optimization. $3 891104
650 4 $a Aviation. $3 873136
650 4 $a Adaptation. $3 3562958
650 4 $a Aerospace engineering. $3 1002622
650 4 $a Dynamical systems. $3 3219613
650 4 $a Aircraft. $3 832698
650 4 $a Partial differential equations. $3 2180177
650 4 $a Spacetime. $3 3564379
650 4 $a Reynolds number. $3 3681436
650 4 $a Applied mathematics. $3 2122814
650 4 $a Applied physics. $3 3343996
690 $a 0538
690 $a 0364
690 $a 0215
710 2 $a Massachusetts Institute of Technology. $b Department of Aeronautics and Astronautics. $3 3762524
773 0 $t Dissertations Abstracts International $g 85-02B.
790 $a 0753
791 $a Ph.D.
792 $a 2023
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30672382