Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.