Nonconforming spectral/hp element methods for elliptic systems

We propose a nonconforming spectral/hp element method for solving elliptic systems on non smooth domains using parallel computers. A geometric mesh is used in a neighbourhood of the corners and a modified set of polar coordinates, as defined by Kondratiev [Diff. Equations 6: 1392 – 1401, 1970], is i...

Full description

Saved in:
Bibliographic Details
Published inJournal of numerical mathematics Vol. 17; no. 2; pp. 119 - 142
Main Authors Kumar, N. K., Dutt, P. K., Upadhyay, C. S.
Format Journal Article
LanguageEnglish
Published Walter de Gruyter GmbH & Co. KG 01.07.2009
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We propose a nonconforming spectral/hp element method for solving elliptic systems on non smooth domains using parallel computers. A geometric mesh is used in a neighbourhood of the corners and a modified set of polar coordinates, as defined by Kondratiev [Diff. Equations 6: 1392 – 1401, 1970], is introduced in these neighbourhoods. In the remaining part of the domain Cartesian coordinates are used. With this mesh we seek a solution which minimizes the sum of a weighted squared norm of the residuals in the partial differential equation and the squared norm of the residuals in the boundary conditions in fractional Sobolev spaces and enforce continuity by adding a term which measures the jump in the function and its derivatives at inter-element boundaries, in fractional Sobolev norms, to the functional being minimized. The set of common boundary values consists only of the values of the spectral element functions at the vertices of the polygonal domain. Since the cardinality of the set of common boundary values is so small, a nearly exact Schur complement matrix can be computed. The method is exponentially accurate and asymptotically faster than the h-p finite element method. The normal equations obtained from the least-squares formulation can be solved by the preconditioned conjugate gradient method using a parallel preconditioner. The algorithm is implemented on a distributed memory parallel computer with small inter- processor communication. Numerical results for scalar problems and the equations of elasticity are provided to validate the error estimates and estimates of computational complexity that have been obtained.
Bibliography:ArticleID:JNMA.17.2.119
istex:BA40C3ED35B9B16B4AEF9C2F68D59F0428D57770
ark:/67375/QT4-8HFBCSWN-B
jnum.2009.008.pdf
ISSN:1570-2820
1569-3953
DOI:10.1515/JNUM.2009.008