Beyond automated multilevel substructuring: domain decomposition with rational filtering
From MaRDI portal
Publication:3174778
Abstract: This paper proposes a rational filtering domain decomposition technique for the solution of large and sparse symmetric generalized eigenvalue problems. The proposed technique is purely algebraic and decomposes the eigenvalue problem associated with each subdomain into two disjoint subproblems. The first subproblem is associated with the interface variables and accounts for the interaction among neighboring subdomains. To compute the solution of the original eigenvalue problem at the interface variables we leverage ideas from contour integral eigenvalue solvers. The second subproblem is associated with the interior variables in each subdomain and can be solved in parallel among the different subdomains using real arithmetic only. Compared to rational filtering projection methods applied to the original matrix pencil, the proposed technique integrates only a part of the matrix resolvent while it applies any orthogonalization necessary to vectors whose length is equal to the number of interface variables. In addition, no estimation of the number of eigenvalues lying inside the interval of interest is needed. Numerical experiments performed in distributed memory architectures illustrate the competitiveness of the proposed technique against rational filtering Krylov approaches.
Recommendations
- A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
- scientific article; zbMATH DE number 218070
- A two-level overlapping hybrid domain decomposition method for eigenvalue problems
- Spectral Schur complement techniques for symmetric eigenvalue problems
- scientific article; zbMATH DE number 218267
Cites work
- scientific article; zbMATH DE number 1069512 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A fast contour-integral eigensolver for non-Hermitian matrices
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- A projection method for generalized eigenvalue problems using numerical integration.
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- An Automated Multilevel Substructuring Method for Eigenspace Computation in Linear Elastodynamics
- An Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems
- Computation of Smallest Eigenvalues using Spectral Schur Complements
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Computing partial spectra with least-squares rational filters
- Designing rational filter functions for solving eigenvalue problems by contour integration
- Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems
- Domain decomposition methods for eigenvalue problems
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Feast eigensolver for non-Hermitian problems
- Kron's method for symmetric eigenvalue problems
- Nonlinear eigenvalue problems and contour integrals
- Numerical methods for large eigenvalue problems
- On correction equations and domain decomposition for computing invariant subspaces
- PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- ScaLAPACK Users' Guide
- Spectral Schur complement techniques for symmetric eigenvalue problems
- The Lanczos Algorithm With Partial Reorthogonalization
- The University of Florida sparse matrix collection
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
Cited in
(9)- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
- A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
- Efficient solution of symmetric eigenvalue problems from families of coupled systems
- Complex moment-based eigensolver coupled with two Krylov subspaces
- Multiscale modal analysis of fully-loaded spent nuclear fuel canisters
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- Distributed solution of Laplacian eigenvalue problems
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- A rational filtering algorithm for sequences of shifted symmetric linear systems with applications to frequency response analysis
This page was built for publication: Beyond automated multilevel substructuring: domain decomposition with rational filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174778)
