eigs

eigs: Largest eigenvalues and eigenvectors of matrix The author describes and analyses a new implementation of the Arnoldi method for computing a few eigenvalues and the corresponding eigenvectors of a large general square matrix (which reduces to the Lanczos method in the symmetric case). Using a truncated variant of the implicitly shifted QR-iteration, the author applies a polynomial filter to the Arnoldi (Lanczos) vector on each iteration. This approach generalizes explicit restart methods. Advantages of the method are discussed and some preliminary computational results using parallel and vector computers are given.


References in zbMATH (referenced in 275 articles , 1 standard article )

Showing results 1 to 20 of 275.
Sorted by year (citations)

1 2 3 ... 12 13 14 next

  1. Ma, Lingling; Jiang, Lijian: Convergence analysis for GMsFEM approximation of elliptic eigenvalue problems (2018)
  2. Che, Maolin; Li, Guoyin; Qi, Liqun; Wei, Yimin: Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems (2017)
  3. Grote, Marcus J.; Kray, Marie; Nahum, Uri: Adaptive eigenspace method for inverse scattering problems in the frequency domain (2017)
  4. Gu, Chuanqing; Wang, Wenwen: An Arnoldi-Inout algorithm for computing PageRank problems (2017)
  5. Hou, Thomas Y.; Li, Qin; Zhang, Pengchuan: A sparse decomposition of low rank symmetric positive semidefinite matrices (2017)
  6. Kao, Chiu-Yen; Lai, Rongjie; Osting, Braxton: Maximization of Laplace-Beltrami eigenvalues on closed Riemannian surfaces (2017)
  7. Onunwor, Enyinda; Reichel, Lothar: On the computation of a truncated SVD of a large linear discrete ill-posed problem (2017)
  8. Zwaan, Ian N.; Hochstenbach, Michiel E.: Krylov-Schur-type restarts for the two-sided Arnoldi method (2017)
  9. Astudillo, R.; van Gijzen, M.B.: A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices (2016)
  10. Guglielmi, Nicola; Manetta, Manuela: An iterative method for computing robustness of polynomial stability (2016)
  11. Maroulas, John; Katsouleas, Georgios: Block imbedding and interlacing results for normal matrices (2016)
  12. Shi, Zhanwen; Yang, Guanyu; Xiao, Yunhai: A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (2016)
  13. Zhou, Yunkai; Wang, Zheng; Zhou, Aihui: Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (2016)
  14. Brandts, Jan H.; Reis da Silva, Ricardo: On the subspace projected approximate matrix method. (2015)
  15. Jia, Zhongxiao; Lv, Hui: A posteriori error estimates of Krylov subspace approximations to matrix functions (2015)
  16. Khazaee, Adib; Lotfi, Vahid: A new technique for determining coupled modes of structure-acoustic systems (2015)
  17. Plestenjak, Bor; Gheorghiu, Călin I.; Hochstenbach, Michiel E.: Spectral collocation for multiparameter eigenvalue problems arising from separable boundary value problems (2015)
  18. Rostami, Minghao W.: New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices (2015)
  19. Shahzadeh Fazeli, S.A.; Emad, Nahid; Liu, Zifan: A key to choose subspace size in implicitly restarted Arnoldi method (2015)
  20. Duintjer Tebbens, Jurjen; Meurant, Gérard: Prescribing the behavior of early terminating GMRES and Arnoldi iterations (2014)

1 2 3 ... 12 13 14 next