41 research outputs found
A FEAST SVDsolver based on Chebyshev--Jackson series for computing partial singular triplets of large matrices
The FEAST eigensolver is extended to the computation of the singular triplets
of a large matrix with the singular values in a given interval. The
resulting FEAST SVDsolver is subspace iteration applied to an approximate
spectral projector of corresponding to the desired singular values in a
given interval, and constructs approximate left and right singular subspaces
corresponding to the desired singular values, onto which is projected to
obtain Ritz approximations. Differently from a commonly used contour
integral-based FEAST solver, we propose a robust alternative that constructs
approximate spectral projectors by using the Chebyshev--Jackson polynomial
series, which are symmetric positive semi-definite with the eigenvalues in
. We prove the pointwise convergence of this series and give compact
estimates for pointwise errors of it and the step function that corresponds to
the exact spectral projector. We present error bounds for the approximate
spectral projector and reliable estimates for the number of desired singular
triplets, establish numerous convergence results on the resulting FEAST
SVDsolver, and propose practical selection strategies for determining the
series degree and for reliably determining the subspace dimension. The solver
and results on it are directly applicable or adaptable to the real symmetric
and complex Hermitian eigenvalue problem. Numerical experiments illustrate that
our FEAST SVDsolver is at least competitive with and is much more efficient
than the contour integral-based FEAST SVDsolver when the desired singular
values are extreme and interior ones, respectively, and it is also more robust
than the latter.Comment: 33, 5 figure
Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
The FEAST method for solving large sparse eigenproblems is equivalent to
subspace iteration with an approximate spectral projector and implicit
orthogonalization. This relation allows to characterize the convergence of this
method in terms of the error of a certain rational approximant to an indicator
function. We propose improved rational approximants leading to FEAST variants
with faster convergence, in particular, when using rational approximants based
on the work of Zolotarev. Numerical experiments demonstrate the possible
computational savings especially for pencils whose eigenvalues are not well
separated and when the dimension of the search space is only slightly larger
than the number of wanted eigenvalues. The new approach improves both
convergence robustness and load balancing when FEAST runs on multiple search
intervals in parallel.Comment: 22 pages, 8 figure
Complex moment-based methods for differential eigenvalue problems
This paper considers computing partial eigenpairs of differential eigenvalue
problems (DEPs) such that eigenvalues are in a certain region on the complex
plane. Recently, based on a "solve-then-discretize" paradigm, an operator
analogue of the FEAST method has been proposed for DEPs without discretization
of the coefficient operators. Compared to conventional "discretize-then-solve"
approaches that discretize the operators and solve the resulting matrix
problem, the operator analogue of FEAST exhibits much higher accuracy; however,
it involves solving a large number of ordinary differential equations (ODEs).
In this paper, to reduce the computational costs, we propose operation
analogues of Sakurai-Sugiura-type complex moment-based eigensolvers for DEPs
using higher-order complex moments and analyze the error bound of the proposed
methods. We show that the number of ODEs to be solved can be reduced by a
factor of the degree of complex moments without degrading accuracy, which is
verified by numerical results. Numerical results demonstrate that the proposed
methods are over five times faster compared with the operator analogue of FEAST
for several DEPs while maintaining almost the same high accuracy. This study is
expected to promote the "solve-then-discretize" paradigm for solving DEPs and
contribute to faster and more accurate solutions in real-world applications.Comment: 26 pages, 9 figure