A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices

DOI10.1007/s10915-023-02342-yzbMath1526.65013arXiv2201.02901OpenAlexW4386691872MaRDI QIDQ6077289

Zhongxiao Jia, Kailiang Zhang

Publication date: 17 October 2023

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.02901

zbMATH Keywords

singular value decompositionconvergence ratepointwise convergencespectral projectorsubspace iterationChebyshev-Jackson series expansionFEAST SVDsolverJackson damping factor

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (1)

An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on sample size for implicit matrix trace estimators
• Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• A projection method for generalized eigenvalue problems using numerical integration.
• Electronic structure calculations for plane-wave codes without diagonalization
• A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems
• Relationships among contour integral-based methods for solving generalized eigenvalue problems
• CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
• A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
• On randomized trace estimates for indefinite matrices with an application to determinants
• Matrix Algorithms
• Feast Eigensolver for Non-Hermitian Problems
• Parallel stochastic estimation method of eigenvalue distribution
• FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
• Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
• Efficient estimation of eigenvalue counts in an interval
• The university of Florida sparse matrix collection
• Numerical Methods for Large Eigenvalue Problems
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• ARPACK Users' Guide
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves
• Inexact Inverse Subspace Iteration with Preconditioning Applied to Non-Hermitian Eigenvalue Problems

This page was built for publication: A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices