Preconditioned Krylov Subspace Methods for Sixth Order Compact Approximations of the Helmholtz Equation. (21st January 2014)

• Record Type: Journal Article
• Authors: Gryazin, Yury
• Other Names: Hajdu L. Academic Editor.; Manservisi S. Academic Editor.; Peng Y. Academic Editor.; Tuzun R. Academic Editor.
• Is Part Of: ISRN computational mathematics. Volume 2014(2014)
• Publication Date: 2014-01-21
• Subjects: Numerical analysis -- Periodicals; Mathematics -- Data processing -- Periodicals; Mathematics -- Data processing; Numerical analysis; Electronic journals; Periodicals; 510
• DOI: 10.1155/2014/745849
• Languages: English
• ISSNs: 2090-7842

Abstract

Abstract : We consider an efficient iterative approach to the solution of the discrete Helmholtz equation with Dirichlet, Neumann, and Sommerfeld-like boundary conditions based on a compact sixth order approximation scheme and lower order preconditioned Krylov subspace methodology. The resulting systems of finite-difference equations are solved by different preconditioned Krylov subspace-based methods. In the analysis of the lower order preconditioning developed here, we introduce the term " k th order preconditioned matrix" in addition to the commonly used "an optimal preconditioner." The necessity of the new criterion is justified by the fact that the condition number of the preconditioned matrix in some of our test problems improves with the decrease of the grid step size. In a simple 1D case, we are able to prove this analytically. This new parameter could serve as a guide in the construction of new preconditioners. The lower order direct preconditioner used in our algorithms is based on a combination of the separation of variables technique and fast Fourier transform (FFT) type methods. The resulting numerical methods allow efficient implementation on parallel computers. Numerical results confirm the high efficiency of the proposed iterative approach.