## Abstract

Iterative substructuring methods form an important family of domain decomposition algorithms for elliptic finite element problems. Two preconditioners for p-version finite element methods based on continuous, piecewise Q_{p} functions are considered for second order elliptic problems in three dimensions; these special methods can also be viewed as spectral element methods. The first iterative method is designed for the Galerkin formulation of the problem. The second applies to linear systems for a discrete model derived by using Gauss-Lobatto-Legendre quadrature. For both methods, it is established that the condition number of the relevant operator grows only in proportion to (1 + log p)^{2}. These bounds are independent of the number of elements, into which the given region has been divided, their diameters, as well as the jumps in the coefficients of the elliptic equation between elements. Results of numerical computations are also given, which provide upper bounds on the condition numbers as functions of p and which confirms the correctness of our theory.

Original language | English (US) |
---|---|

Pages (from-to) | 193-209 |

Number of pages | 17 |

Journal | Computers and Mathematics with Applications |

Volume | 33 |

Issue number | 1-2 |

DOIs | |

State | Published - Jan 1997 |

## Keywords

- Domain decomposition
- Gauss-Lobatto-Legendre quadrature
- Iterative substructuring
- Preconditioned conjugate gradient methods
- Spectral finite element approximation

## ASJC Scopus subject areas

- Modeling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics