Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 TASK Quarterly : scientific bulletin of Academic Computer Centre in Gdansk

1 2008

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: non-overlapping domain decomposition method

Sortuj według:

Ogranicz wyniki do:

Dirichlet/Dirichlet and Dirichlet/Dirichlet-Neumann/Neumann non-overlapping iterative domain decomposition methods

Kubacki S., Bogusławski A.

TASK Quarterly : scientific bulletin of Academic Computer Centre in Gdansk

2008

Vol. 12, No 1-2

85-104

A new iterative non-overlapping domain decomposition method is proposed for solving the one- and two-dimensional Helmholtz equation on parallel computers. The spectral collocation method is applied to solve the Helmholtz equation in each subdomain based on the Chebyshev approximation, while the patching conditions are imposed at the interfaces between subdomains through a correction, being a linear function of the space coordinates. Convergence analysis is performed for two applications of the proposed method (DDLC and DDNNLC algorithms - the meaning of these abbreviations is explained below) based on the works of Zanolli and Funaro et al. Numerical tests have been performed and results obtained using the proposed method and other iterative algorithms have been compared. Parallel performance of the multi-domain algorithms has been analyzed by decomposing the two-dimensional domain into a number of subdomains in one spatial direction. For the one-dimensional problem, convergence of the iteration process was quickly obtained using the proposed method, setting a small value of the ? constant in the Helmholtz equation. Another application of the proposed method may be an alternative to other iterative schemes when solving the two-dimensional Helmholtz equation.