2004高等学校计算数学学报:英文版Requires access

A NON-OVERLAPPING DOMAIN DECOMPOSITION ALGORITHM BASED ON THE NATURAL BOUNDARY REDUCTION FOR WAVE EQUATIONS IN AN UNBOUNDED DOMAIN

杜其奎, 张明新

Open publisher page 3 citations

Abstract

In this paper, a new domain decomposition method based on the natural boundary reduction, which solves wave problems over an unbounded domain, is suggestted. An circular artifcial boundary is introduced. The original unbounded domain is divided into two subdomains, an internal bounded region and external unbounded region outside the artificial boundary. A Dirichlet-Neumann(D-N) alternating iteration algorithm is constructed. We prove that the algorithm is equavilent to preconditional Richardson iteration method. Numerical studies are performed by finite element method. The numerical results show that the convergence rate of the discrete D-N iteration is independent of the fnite element mesh size.

About this research paper

What this paper is about

In this paper, a new domain decomposition method based on the natural boundary reduction, which solves wave problems over an unbounded domain, is suggestted. An circular artifcial boundary is introduced. The original unbounded domain is divided into two subdomains, an internal bounded region and external unbounded region outside the artificial boundary. A Dirichlet-Neumann(D-N) alternating iteration algorithm is constructed. We prove that the algorithm is equavilent to preconditional Richardson iteration method. Numerical studies are performed by finite element method. The numerical results show that the convergence rate of the discrete D-N iteration is independent of the fnite element mesh size.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, a new domain decomposition method based on the natural boundary reduction, which solves wave problems over an unbounded domain, is suggestted. An circular artifcial boundary is introduced. The original unbounded domain is divided into two subdomains, an internal bounded region and external unbounded region outside the artificial boundary. A Dirichlet-Neumann(D-N) alternating iteration algorithm is constructed. We prove that the algorithm is equavilent to preconditional Richardson iteration method. Numerical studies are performed by finite element method. The numerical results show that the convergence rate of the discrete D-N iteration is independent of the fnite element mesh size.

Key concepts: Domain decomposition methods, Mathematics, Boundary (topology), Bounded function, Domain (mathematical analysis), Reduction (mathematics), Neumann boundary condition, Fictitious domain method

Related papers

Back to paper searchBrowse research topicsOriginal source
A NON-OVERLAPPING DOMAIN DECOMPOSITION ALGORITHM BASED ON THE NATURAL BOUNDARY REDUCTION FOR WAVE EQUATIONS IN AN UNBOUNDED DOMAIN — Research Paper | ScholarLens