Articles written in Proceedings – Mathematical Sciences
Volume 112 Issue 4 November 2002 pp 601-639
In a series of papers of which this is the first we study how to solve elliptic problems on polygonal domains using spectral methods on parallel computers. To overcome the singularities that arise in a neighborhood of the corners we use a geometrical mesh. With this mesh we seek a solution which minimizes a weighted squared norm of the residuals in the partial differential equation and a fractional Sobolev norm of the residuals in the boundary conditions and enforce continuity by adding a term which measures the jump in the function and its derivatives at inter-element boundaries, in an appropriate fractional Sobolev norm, to the functional being minimized. Since the second derivatives of the actual solution are not square integrable in a neighborhood of the corners we have to multiply the residuals in the partial differential equation by an appropriate power of rk, where rk measures the distance between the point
In  we will show that we can use the stability estimate to obtain parallel preconditioners and error estimates for the solution of the minimization problem which are nearly optimal as the condition number of the preconditioned system is polylogarithmic in
Volume 113 Issue 4 November 2003 pp 395-429
In this paper we show that the h-p spectral element method developed in [3,8,9] applies to elliptic problems in curvilinear polygons with mixed Neumann and Dirichlet boundary conditions provided that the Babuska-Brezzi inf-sup conditions are satisfied. We establish basic stability estimates for a non-conforming h-p spectral element method which allows for simultaneous mesh refinement and variable polynomial degree. The spectral element functions are non-conforming if the boundary conditions are Dirichlet. For problems with mixed boundary conditions they are continuous only at the vertices of the elements. We obtain a stability estimate when the spectral element functions vanish at the vertices of the elements, which is needed for parallelizing the numerical scheme. Finally, we indicate how the mesh refinement strategy and choice of polynomial degree depends on the regularity of the coefficients of the differential operator, smoothness of the sides of the polygon and the regularity of the data to obtain the maximum accuracy achievable.