東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Pseudospectral methods for a class o...

Geldhof, Sam.

Linked to FindBook

Google Book

Amazon

博客來

Pseudospectral methods for a class of evolutionary systems.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Pseudospectral methods for a class of evolutionary systems./
Author:	Geldhof, Sam.
Description:	83 p.
Notes:	Source: Masters Abstracts International, Volume: 51-05.
Contained By:	Masters Abstracts International51-05(E).
Subject:	Applied Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1535600
ISBN:	9781303017407

Pseudospectral methods for a class of evolutionary systems.
Geldhof, Sam.

Pseudospectral methods for a class of evolutionary systems. - 83 p.

Source: Masters Abstracts International, Volume: 51-05.

Thesis (M.S.)--Colorado School of Mines, 2013.

Mathematical and computer modeling of various physical processes typically involve evolutionary systems which are a class of time dependent partial differential equations. Exact solutions to many of these evolutionary systems are not known in general and a variety of numerical methods have been proposed to simulate the solutions of these problems. In this thesis, we approximate the solution of evolutionary systems using the method of lines in which we separately discretize our problem in space and in time. The spatial discretization is done using a class of high order Fourier spectral Galerkin methods with quadrature, also known as Fourier pseudospectral methods. Many evolutionary systems that we will be concerned with contain quadratic nonlinear terms, causing aliasing affects. We consider two techniques to resolve the affects of aliasing. The spatial discretization reduces the problem to a system of ordinary differential equations in time which we solve using standard numerical techniques. Many of these systems are stiff and therefore we also consider the stability of our numerical solvers and consider some implicit methods. In order to obtain accurate solutions for many problems, we must calculate a large number of Fourier coefficients, leading to impractical computation times. Therefore, we seek methods that allow us to calculate more Fourier modes in a computationally inexpensive manner. The algorithms developed and implemented in this thesis are based on the high order pseudospectral Galerkin method with quadrature in space and various implicit and explicit discretization techniques in time..

ISBN: 9781303017407Subjects--Topical Terms:

1669109
Applied Mathematics.

Pseudospectral methods for a class of evolutionary systems.
LDR:02434nam a2200265 4500 001 1960672
005 20140624205948.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303017407
035 $a (MiAaPQ)AAI1535600
035 $a AAI1535600
040 $a MiAaPQ $c MiAaPQ
100 1 $a Geldhof, Sam. $3 2096370
245 1 0 $a Pseudospectral methods for a class of evolutionary systems.
300 $a 83 p.
500 $a Source: Masters Abstracts International, Volume: 51-05.
500 $a Adviser: Mahadevan Ganesh.
502 $a Thesis (M.S.)--Colorado School of Mines, 2013.
520 $a Mathematical and computer modeling of various physical processes typically involve evolutionary systems which are a class of time dependent partial differential equations. Exact solutions to many of these evolutionary systems are not known in general and a variety of numerical methods have been proposed to simulate the solutions of these problems. In this thesis, we approximate the solution of evolutionary systems using the method of lines in which we separately discretize our problem in space and in time. The spatial discretization is done using a class of high order Fourier spectral Galerkin methods with quadrature, also known as Fourier pseudospectral methods. Many evolutionary systems that we will be concerned with contain quadratic nonlinear terms, causing aliasing affects. We consider two techniques to resolve the affects of aliasing. The spatial discretization reduces the problem to a system of ordinary differential equations in time which we solve using standard numerical techniques. Many of these systems are stiff and therefore we also consider the stability of our numerical solvers and consider some implicit methods. In order to obtain accurate solutions for many problems, we must calculate a large number of Fourier coefficients, leading to impractical computation times. Therefore, we seek methods that allow us to calculate more Fourier modes in a computationally inexpensive manner. The algorithms developed and implemented in this thesis are based on the high order pseudospectral Galerkin method with quadrature in space and various implicit and explicit discretization techniques in time..
590 $a School code: 0052.
650 4 $a Applied Mathematics. $3 1669109
690 $a 0364
710 2 $a Colorado School of Mines. $b Applied Mathematics and Statistics. $3 2095737
773 0 $t Masters Abstracts International $g 51-05(E).
790 $a 0052
791 $a M.S.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1535600