Fast domain decomposition algorithm discretizations of 3-d elliptic equations by spectral elements

✍ Scribed by V. Korneev; A. Rytov

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 290 KB
• Volume: 197
• Category: Article
• ISSN: 0045-7825
• DOI: 10.1016/j.cma.2007.10.013

✦ Synopsis

The main obstacle for obtaining fast domain decomposition solvers for spectral element discretizations of second order elliptic equations was the lack of fast solvers for local internal problems on subdomains of decomposition and their faces. As recently shown by Korneev and Rytov, such solvers can be derived on the basis of a specific interrelation between stiffness matrices of the spectral and hierarchical p reference elements (coordinate polynomials of the latter are tensor products of the integrated Legendre's polynomials). This interrelation allows us to develop fast solvers for discretizations by spectral elements, which are quite similar in basic features to those developed for discretizations by hierarchical elements. Using these facts and preceding findings on the wire basket preconditioners, we present a domain decomposition preconditioner-solver for spectral element discretizations of second order elliptic equations in 3-d domains which is almost optimal in the total arithmetical cost.