Domain decomposition methods for eigenvalue problems (Q1567354)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Domain decomposition methods for eigenvalue problems |
scientific article |
Statements
Domain decomposition methods for eigenvalue problems (English)
0 references
2 January 2001
0 references
The author proposes several domain decomposition methods to compute the smallest eigenvalue of linear symmetric partial differential operators. The main idea is to determine an appropriate boundary condition at the interface separating two subdomains from the zero of a nonlinear operator. This concept is applied to overlapping and nonoverlapping schemes as well as to domain imbedding algorithms. Some numerical experiments for two-dimensional problems verify the convergence of the proposed algorithms.
0 references
domain decomposition
0 references
eigenvalue
0 references
fictitious domain
0 references
domain inbedding
0 references
Schwarz alternating method
0 references
numerical experiments
0 references
convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references