Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/17448
標題: 多重網格與區域分割法解非線性橢圓特徵值問題
Multigrid and Domain Decomposition for Nonlinear Elliptic Eigenvalue Problems
作者: 張勝麟
Chang, Shing-Lin
關鍵字: 多重網格
區域分割法
出版社: 應用數學系
摘要: 我們研究一些疊代法(如Lanczos,GMRES及他們的各種變形)和區域分割法來求解非線性橢圓特徵值問題。首先,我們利用Lanczos方法解多重右邊向量的線性系統。我們給出求第二組線性系統近似解的一個誤差上限,其中使用Lanczos-Galerkin程序解第一組線性系統。我們也探索了所提出的數值方法對延續問題的可能應用。接著,對Lanczos方法的一種變形MINRES,我們給了一些收斂定理。Multigrid-Lanczos及Multigrid-GMRES算則被提出來求解對應的離散問題的分支解及偵測分支解的奇異點。這些算則有健全且易執行的優點。最後,我們使用非重疊及重疊的區域分割法求解四階非線性特徵值問題。對線性的方程,我們利用Fourier分析及探針技巧對介面系統找出前置矩陣,方法類似於Chan等人的推導。我們的數值結果證實這些算則的效力。
We study some iterative methods (such as the Lanczos method, GMRES and their other variants) and domain decomposition methods for solving nonlinear elliptic eigenvalue problems. First, we apply the Lanczos method to solve linear systems with multiple right hand side. We give an error bound for the approximate solution of the second linear system, where the Lanczos-Galerkin process is used to solve the first linear system. We also seek the possible application of the proposed numerical method to continuation problems. Next, we show some convergence theory for the MINRES, a variant of the Lanczos method. A multigrid-Lanczos and a multigrid-GMRES algorithm are proposed for tracking solution branches of associated discrete problem and detecting singular points along solution branches. The proposed algorithms have the advantage of being robust and easy to implement. Finally, we show how nonoverlapping and overlapping domain decomposition methods can be used to solve fourth order nonlinear elliptic eigenvalue problems. For the linearized von Krmn equation, we present preconditioners using both Fourier analysis and probing techniques for the interface systems, which are similar to those derived by Chan et al. Our numerical results show the efficiency of these algorithms.
URI: http://hdl.handle.net/11455/17448
Appears in Collections:應用數學系所

文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.