A nonoverlapping domain decomposition method for Legendre spectral collocation problems (Q2385517): Difference between revisions

This paper deals with the Legendre spectral collocation method in a non-overlapping domain decomposition version to solve Poisson's equation in an \(L\)-shaped region. The collocation equations use Gauss-Legendre nodes instead of the more usual Gauss-Legendre-Lobatto points. The problem is decoupled into several independent steps. First uncoupled discrete Poisson equations are solved in each subdomain. Secondly, a discrete Steklov-Poincaré problem is solved at the interfaces. And, finally, the solution is readily reconstructed adding the local functions computed in the previous steps. The interface problem is solved by means of the preconditioned conjugate gradient method, the preconditioner being obtained from interface problems in adjacent domains. The numerical approximation is shown to be continuous on the interfaces with normal derivative continuous only at the collocation points located on the interfaces. The discussion of several implementation issues shows that with a suitable choice of the basis function it is possible to reduce the total cost of the method to \(O(N^3)+O(mN^2)\) operations, \(N\) being the number of collocation points in each direction and \(m\) the number of PCG iterations. The numerical experiments presented in the paper show fast spectral convergence for some test problems.