none Parallel Computation of Acoustic Eigenvalue Problems Using a Polynomial Jacobi-Davidson Method

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/43913

Title:	none Parallel Computation of Acoustic Eigenvalue Problems Using a Polynomial Jacobi-Davidson Method
Authors:	賴聲泓;Sheng-Hong Lai
Contributors:	數學研究所
Keywords:	平行計算;多項式型;特徵值;有限元素法;finite element method;acoustic;eigenvalue;precondition;additive Schwarz;Jacobi-Davidson method
Date:	2010-07-28
Issue Date:	2010-12-08 14:26:36 (UTC+8)
Publisher:	國立中央大學
Abstract:	在我們日常生活周遭隨處可遇到有關於聲音的問題。例如開車時、搭公車時或搭飛機時。這些問題可以經由數學模型來描述聲音在一些吸振材質加入之下的振動情況，再經由有限元素法離散之後可以得到一個多項式型的特徵值問題。在部份應用中，我們有興趣找出一些低頻率的特徵值，但這些特徵值通常都落在頻譜的內部。並且當網格切的非常細的時後，特徵值問題的維度會變成相當地大。所以我們需要一個可平行化的工具來解這種大型稀疏的多項式特徵值問題。Jacobi-Davidson 演算法提供了一個快速並且有效率的方式來解出這類問題的內部特徵值。我們在 additive Schwarz 的架構下平行化實作 acobi-Davidson 演算法，並且用來解由聲音的問題所產生的多項式型的特徵值問題。經由數值實驗結果，我們列出了一些 additive Schwarz preconditioned Jacobi-Davidson 的平行效能。在解 correction equation 時，經由 Krylov-Schwarz 演算法的幫助之下，Jacobi-Davidson 的效率有著顯著的進步。 The acoustic problems usually happens around us in our daily life when we drive a car, take a bus or take a plane. From the problems of acoustic vibrations with damping, a polynomial eigenvalue problem is obtained by applying the Galerkin finite element method. For particular applications, we are interested in finding some selected low frequency eigenvalues which are located within the interior of the spectrum. The size of the resulting eigenproblem is typically large especially for very fined mesh case so that the parallel polynomial eigensolver is need to deal with such problem. The Jacobi-Davidson method provides a fast and efficient manner for solving the interior eigenvalues for the large sparse polynomial eigenvalue problems. We proposed an Jacobi-Davidson method based on an additive Schwarz framework in parallel implementation and used it to solve the polynomial eigenvalue problem arising from the acoustic. And we showed some parallel performance of the additive Schwarz preconditioned Jacobi-Davidson method by numerical experiments. With help of Krylov-Schwarz algorithm for the correction equation, the efficiency of JD algorithm is greatly improved.
Appears in Collections:	[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	754	View/Open

社群 sharing

Loading...