Domain decomposition preconditioners for the spectral collocation method

We propose and analyze several block iteration preconditioners for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate that does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism.

[1]  T. A. Zang,et al.  Spectral methods for fluid dynamics , 1987 .

[2]  A. Quarteroni,et al.  Parallel algorithms for the capacitance matrix method in domain decompositions , 1988 .

[3]  T. Chan.  Analysis of preconditioners for domain decomposition , 1987 .

[4]  C. Streett,et al.  Improvements in spectral collocation discretization through a multiple domain technique , 1986 .

[5]  Alfio Quarteroni,et al.  A relaxation procedure for domain decomposition methods using finite elements , 1989 .

[6]  Daniele Funaro.  A multidomain spectral approximation of elliptic equations , 1986 .

[7]  J. Lions,et al.  Non-homogeneous boundary value problems and applications , 1972 .

[8]  Philip Rabinowitz,et al.  Methods of Numerical Integration , 1985 .

[9]  J. Pasciak,et al.  The Construction of Preconditioners for Elliptic Problems by Substructuring. , 2010 .

[10]  M. Dryja,et al.  A finite element — Capacitance method for elliptic problems on regions partitioned into subregions , 1984 .

[11]  R. Cottle.  Manifestations of the Schur complement , 1974 .

[12]  Alfio Quarteroni,et al.  An Iterative Procedure with Interface Relaxation for Domain Decomposition Methods , 1988 .

[13]  Daniele Funaro,et al.  Domain decomposition methods for pseudo spectral approximations , 1987 .

[14]  S. Orszag.  Spectral methods for problems in complex geometries , 1980 .

[15]  V. I. Agoshkov.  Reflection operators and domain decomposition methods in transport theory problems , 1987 .