• Corpus ID: 245837570

A FEAST SVDsolver for the computation of singular value decompositions of large matrices based on the Chebyshev-Jackson series expansion

  title={A FEAST SVDsolver for the computation of singular value decompositions of large matrices based on the Chebyshev-Jackson series expansion},
  author={Zhongxiao Jia and Kailiang Zhang},
The FEAST eigensolver is extended to the computation of the singular triplets of a large matrix A with the singular values in a given interval. It is subspace iteration in nature applied to an approximate spectral projector associated with the cross-product matrix AA and constructs approximate left and right singular subspaces corresponding to the desired singular values, onto which A is projected to obtain approximations to the desired singular triplets. Approximate spectral projectors are… 

Figures and Tables from this paper


FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
It is shown that FEAST is resilient against rounding errors and establishes properties that can be leveraged to enhance the algorithm's robustness and an extension of FEAST to handle non-Hermitian problems is proposed.
A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
It is proved that for good enough projection subspaces harmonic Ritz values converge if the columns of $A$ are strongly linearly independent, and that IRRHLB is at least competitive with five other algorithms and can be considerably more efficient when computing the smallest singular triplets.
Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves
IFEAST combines the flexibility and power of Krylov methods, requiring only matrix–vector multiplication for solving eigenvalue problems, with the natural parallelism of the traditional FEAST algorithm.
Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
This work proposes improved rational approximants leading to FEAST variants with faster convergence, in particular, when using rational approximation based on the work of Zolotarev, and improves both convergence robustness and load balancing when FEAST runs on multiple search intervals in parallel.
FEAST Eigenvalue Solver v4.0 User Guide
This User's guide provides instructions for installation setup, a detailed description of the FEAST interfaces, and a large number of examples for achieving high performance, robustness, accuracy, and scalability on parallel architectures.
An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
Numerical experiments show that IRRBL can perform better than the implicitly restarted bidiagonalization Lanczos algorithm (IRBL) proposed by Larsen, in particular when the smallest singular triplets are desired.
Feast Eigensolver for Non-Hermitian Problems
A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue problems is presented and thoroughly discussed. It aims at broadening the class of eigenproblems that can be
Matrix algorithms
This volume treats the numerical solution of dense and large-scale eigenvalue problems with an emphasis on algorithms and the theoretical background required to understand them.
CIRR: a Rayleigh-Ritz type method with contour integral for generalized eigenvalue problems
We consider a Rayleigh-Ritz type eigensolver for finding a limited set of eigenvalues and their corresponding eigenvectors in a certain region of generalized eigen- value problems. When the matrices