An iterative and parallel solver based on domain decomposition for the \(h-p\) version of the finite element method (Q1372118): Difference between revisions

The preconditioning technique from a previous paper of the same authors [Numer. Math. 75, No. 1, 59-77 (1996; Zbl 0873.65047)] is extended to make it more flexible and more efficient in practical applications. There are two major improvements. First, the authors distinguish between the super-elements and the subdomains. A subdomain is defined as a union of several super-elements of the coarse mesh. Thus the subdomains are allowed to be of arbitrary sizes and shapes. Second, the \(p\)-version components (i.e. the high-order side and internal nodes) are treated separately in the preconditioner. Such a treatment results in better parallelism and is convenient for implementation in finite element codes. It is proved also that the same bound of the condition number for the preconditioned system is retained.