Saved in:
Bibliographic Details
Main Authors: Chen, Yuer, Li, Yingzhou
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2310.18043
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914966820356096
author Chen, Yuer
Li, Yingzhou
author_facet Chen, Yuer
Li, Yingzhou
contents Contour-integral-based rational filter leads to interior eigensolvers for non-Hermitian generalized eigenvalue problems. Based on Zolotarev's third problem, this paper proves the asymptotic optimality of the trapezoidal quadrature of the contour integral in terms of the spectrum separation. A composite rule of the trapezoidal quadrature is derived, and two interior eigensolvers are proposed based on it. Both eigensolvers adopt direct factorization and multi-shift generalized minimal residual method for the inner and outer rational functions, respectively. The first eigensolver fixes the order of the outer rational function and applies the subspace iterations to achieve convergence, whereas the second eigensolver doubles the order of the outer rational function every iteration to achieve convergence without subspace iteration. The efficiency and stability of proposed eigensolvers are demonstrated on synthetic and practical sparse matrix pencils.
format Preprint
id arxiv_https___arxiv_org_abs_2310_18043
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Interior Eigensolver Based on Rational Filter with Composite rule
Chen, Yuer
Li, Yingzhou
Numerical Analysis
65F15
Contour-integral-based rational filter leads to interior eigensolvers for non-Hermitian generalized eigenvalue problems. Based on Zolotarev's third problem, this paper proves the asymptotic optimality of the trapezoidal quadrature of the contour integral in terms of the spectrum separation. A composite rule of the trapezoidal quadrature is derived, and two interior eigensolvers are proposed based on it. Both eigensolvers adopt direct factorization and multi-shift generalized minimal residual method for the inner and outer rational functions, respectively. The first eigensolver fixes the order of the outer rational function and applies the subspace iterations to achieve convergence, whereas the second eigensolver doubles the order of the outer rational function every iteration to achieve convergence without subspace iteration. The efficiency and stability of proposed eigensolvers are demonstrated on synthetic and practical sparse matrix pencils.
title Interior Eigensolver Based on Rational Filter with Composite rule
topic Numerical Analysis
65F15
url https://arxiv.org/abs/2310.18043