This article is cited in 2 papers

Spectral discretizations of 3-d elliptic problems and fast domain decomposition methods

V. Korneev^ab, A. Rytov<sup>b

a</sup> St. Petersburg State University, Russia
^b St. Petersburg State Polytechnical University, Russia

Abstract: An important for applications, the class of $hp$ discretizations of second-order elliptic equations consists of discretizations based on spectral finite elements. The development of fast domain decomposition algorithms for them was restrained by the absence of fast solvers for the basic components of the method, i.e., for local interior problems on decomposition subdomains and their faces. Recently, the authors have established that such solvers can be designed using special factorized preconditioners. In turn, factorized preconditioners are constructed using an important analogy between the stiffness matrices of spectral and hierarchical basis $hp$-elements (coordinate functions of the latter are defined as tensor products of integrated Legendre polynomials). Due to this analogy, for matrices of spectral elements, fast solvers can be developed that are similar to those for matrices of hierarchical elements. Based on these facts and previous results on the preconditioning of other components, fast domain decomposition algorithms for spectral discretizations are obtained.

Key words: domain decomposition method, spectral discretization, fast algorithms, preconditioning.

UDC: 519.632.6

Received: 15.02.2007
Revised: 22.05.2007

Language: English

 English version: Computational Mathematics and Mathematical Physics, 2007, 47:10, 1656–1674

Bibliographic databases:

• 
•