Beyond automated multilevel substructuring: domain decomposition with rational filtering
From MaRDI portal
Publication:3174778
DOI10.1137/17M1154527zbMATH Open1394.65030arXiv1711.09487OpenAlexW2883603641WikidataQ129530302 ScholiaQ129530302MaRDI QIDQ3174778FDOQ3174778
Authors: Vassilis Kalantzis, Yuanzhe Xi, Y. Saad 
Publication date: 18 July 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1711.09487
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
domain decompositionparallel computingSchur complementsymmetric generalized eigenvalue problemrational filtering
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- PRIMME
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- The university of Florida sparse matrix collection
- ScaLAPACK Users' Guide
- Title not available (Why is that?)
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Title not available (Why is that?)
- Numerical methods for large eigenvalue problems
- Title not available (Why is that?)
- A projection method for generalized eigenvalue problems using numerical integration.
- Designing rational filter functions for solving eigenvalue problems by contour integration
- Title not available (Why is that?)
- The Lanczos Algorithm With Partial Reorthogonalization
- Spectral Schur complement techniques for symmetric eigenvalue problems
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Domain decomposition methods for eigenvalue problems
- An Automated Multilevel Substructuring Method for Eigenspace Computation in Linear Elastodynamics
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
- Nonlinear eigenvalue problems and contour integrals
- Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic
- Kron's method for symmetric eigenvalue problems
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- On correction equations and domain decomposition for computing invariant subspaces
- Computation of Smallest Eigenvalues using Spectral Schur Complements
- An Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- Computing partial spectra with least-squares rational filters
- Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems
- Feast eigensolver for non-Hermitian problems
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
- A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems
Cited In (9)
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
- Distributed Solution of Laplacian Eigenvalue Problems
- 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
- 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
- A Domain Decomposition Rayleigh--Ritz Algorithm for Symmetric Generalized Eigenvalue Problems
- Efficient Solution of Symmetric Eigenvalue Problems from Families of Coupled Systems
Uses Software
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)
