A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

B. Kiss; GY. Molnárka

doi:10.1007/bf02330875

Jump to Content Jump to Main Navigation

Periodica Mathematica Hungarica

Volume/Issue:: Volume 24: Issue 3

A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

Authors: B. Kiss¹ and GY. Molnárka¹

View More View Less

¹ Eötvös Lóránd University Department of Numerical Analysis Bogdánfy U. 10/B 1117 Hungary Bogdánfy U. 10/B 1117 Hungary

DOI:: https://doi.org/10.1007/bf02330875

Page Count:: 151–165

Publication Date:: 23 Jun 1992

Online Publication Date:: 10 Apr 2006

Article Category:: Research Article

Restricted access

Check for updates

Abstract

A new preconditioned conjugate gradient (PCG)-based domain decomposition method is given for the solution of linear equations arising in the finite element method applied to the elliptic Neumann problem. The novelty of the proposed method is in the recommended preconditioner which is constructed by using cyclic matrix. The resulting preconditioned algorithms are well suited to parallel computation.