arrow
Volume 14, Issue 1
Trace Averaging Domain Decomposition Method with Nonconforming Finite Elements

J. Gu & X. Hu

J. Comp. Math., 14 (1996), pp. 40-53.

Published online: 1996-02

Export citation
  • Abstract

We consider, in this paper, the trace averaging domain decomposition method for the second order self-adjoint elliptic problems discretized by a class of nonconforming finite elements, which is only continuous at the nodes of the quasi-uniform mesh. We show its geometric convergence and present the dependence of the convergence factor on the relaxation factor, the subdomain diameter $H$ and the mesh parameter $h$. In essence, this method is equivalent to the simple iterative method for the preconditioned capacitance equation. The preconditioner implied in this iteration is easily invertible and can be applied to preconditioning the capacitance matrix with the condition number no more than $O\bigl ( (1+\ln {H\over h}) max(1+H^{-2}, 1+\ln {H\over h}) \bigr )$.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-14-40, author = {}, title = {Trace Averaging Domain Decomposition Method with Nonconforming Finite Elements}, journal = {Journal of Computational Mathematics}, year = {1996}, volume = {14}, number = {1}, pages = {40--53}, abstract = {

We consider, in this paper, the trace averaging domain decomposition method for the second order self-adjoint elliptic problems discretized by a class of nonconforming finite elements, which is only continuous at the nodes of the quasi-uniform mesh. We show its geometric convergence and present the dependence of the convergence factor on the relaxation factor, the subdomain diameter $H$ and the mesh parameter $h$. In essence, this method is equivalent to the simple iterative method for the preconditioned capacitance equation. The preconditioner implied in this iteration is easily invertible and can be applied to preconditioning the capacitance matrix with the condition number no more than $O\bigl ( (1+\ln {H\over h}) max(1+H^{-2}, 1+\ln {H\over h}) \bigr )$.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9218.html} }
TY - JOUR T1 - Trace Averaging Domain Decomposition Method with Nonconforming Finite Elements JO - Journal of Computational Mathematics VL - 1 SP - 40 EP - 53 PY - 1996 DA - 1996/02 SN - 14 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9218.html KW - AB -

We consider, in this paper, the trace averaging domain decomposition method for the second order self-adjoint elliptic problems discretized by a class of nonconforming finite elements, which is only continuous at the nodes of the quasi-uniform mesh. We show its geometric convergence and present the dependence of the convergence factor on the relaxation factor, the subdomain diameter $H$ and the mesh parameter $h$. In essence, this method is equivalent to the simple iterative method for the preconditioned capacitance equation. The preconditioner implied in this iteration is easily invertible and can be applied to preconditioning the capacitance matrix with the condition number no more than $O\bigl ( (1+\ln {H\over h}) max(1+H^{-2}, 1+\ln {H\over h}) \bigr )$.

J. Gu & X. Hu. (1970). Trace Averaging Domain Decomposition Method with Nonconforming Finite Elements. Journal of Computational Mathematics. 14 (1). 40-53. doi:
Copy to clipboard
The citation has been copied to your clipboard