✦ LIBER ✦

Convergence and domain decomposition algorithm for nonconforming and mixed methods for nonselfadjoint and indefinite problems

✍ Scribed by Jinru Chen; Li Likang

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 931 KB
Volume: 173
Category: Article
ISSN: 0045-7825
DOI: 10.1016/s0045-7825(98)00251-5

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, the existence, uniqueness and convergence of the solutions of nonconforming and mixed methods with non-quasi-uniform partition are proven for nonselfadjoint and indefinite second-order elliptic problems under minimal regularity assumption, moreover, uniform convergence of the solution of nonconforming method is obtained. Meanwhile, the domain decomposition algorithm which suits non-quasi-uniform partition is proposed for nonconforming and mixed methods.

📜 SIMILAR VOLUMES

Uniform convergence and preconditioning

Uniform convergence and preconditioning methods for projection nonconforming and mixed methods for nonselfadjoint and indefinite problems

✍ Jinru Chen; Likang Li 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The purpose of this paper is to prove the existence, uniqueness and uniform convergence of the solutions of so-called projection nonconforming and mixed element methods and the equivalence between projection nonconforming element method and mixed element method with nonquasi-uniform partition for no

Uniform convergence and Schwarz method f

Uniform convergence and Schwarz method for the mortar projection nonconforming and mixed element methods for nonselfadjoint and indefinite problems

✍ Jinru Chen; Xuejun Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In this paper, two mortar versions of the so-called projection nonconforming and the mixed element methods are proposed, respectively, for nonselfadjoint and indefinite second-order elliptic problems. It is proven that the mortar mixed element method is equivalent to the mortar projection nonconform

Nonconforming multigrid method for nonsy

Nonconforming multigrid method for nonsymmetric and indefinite problems

✍ Y.J. Yon; D.Y. Kwak 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 295 KB

V-cycle Galerkin-multigrid methods for n

V-cycle Galerkin-multigrid methods for nonconforming methods for nonsymmetric and indefinite problems

✍ Zhangxin Chen; Do Y. Kwak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 943 KB

On using the cell discretization algorit

On using the cell discretization algorithm for mixed-boundary value problems and domain decomposition

✍ Howard Swann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 276 KB

The cell discretization algorithm is used to approximate solutions to self-adjoint elliptic equations with general nonhomogeneous Dirichlet or Neumann or mixed-boundary values. Error estimates are obtained showing general convergence. This provides the framework for a nonoverlapping iterative algori

Convergence Estimates of Multilevel Addi

Convergence Estimates of Multilevel Additive and Multiplicative Algorithms for Non-symmetric and Indefinite Problems

✍ Zhiqiang Cai; Chen-Yao G. Lai 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 639 KB

New uniform estimates for multigrid algorithms are established for certain non-symmetric indefinite problems. In particular, we are concerned with the simple additive algorithm and multigrid (V(1, 0)-cycle) algorithms given in [5]. We prove, without full elliptic regularity assumption, that these al