This paper presents a domain decomposition-type method for solving real symmetric (Hermitian) eigenvalue problems in which we seek all eigenpairs in an interval [α; β] or a few eigenpairs next to a given real shift ζ. A Newton-based scheme is described whereby the problem is converted to one that deals with the interface nodes of the computational domain. This approach relies on the fact that the inner solves related to each local subdomain are relatively inexpensive. This Newton scheme exploits spectral Schur complements, and these lead to so-called eigenbranches, which are rational functions whose roots are eigenvalues of the original matrix. Theoretical and practical aspects of domain decomposition techniques for computing eigenvalues and eigenvectors are discussed. A parallel implementation is presented and its performance on distributed computing environments is illustrated by means of a few numerical examples.
|Original language||English (US)|
|Number of pages||25|
|Journal||Electronic Transactions on Numerical Analysis|
|State||Published - 2016|
Bibliographical notePublisher Copyright:
© 2016, Kent State University.
- Domain decomposition
- Eigenvalue problems
- Newton's method
- Parallel computing
- Spectral Schur complements