On a relaxation procedure for domain decomposition methods with many subdomains and inexact solver

Abstract

A domain decomposition technique was presented by Marini and Quarteroni [9,10]. They assumed that the domain was partioned into two nonintersecting subdomains. In this paper we generalized this techniques such that the domain can be partioned into many subdomains. Furthermore, we discuss the domain decomposition technique with domain partioned into two subdomains when the solution on one subdomain is inexact.

Keywords:

• Relaxation Procedure
• Domain Decomposition Method
• Multigrid Method
• Inexact Solver

C.R. Categories:

• G 1.7

Supported by the State Major Key Project for Basic Researches of China

Supported by the State Major Key Project for Basic Researches of China

Notes

Supported by the State Major Key Project for Basic Researches of China