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 265 articles , 1 standard article )

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

1 2 3 ... 12 13 14 next

  1. Astudillo, R.; van Gijzen, M.B.: A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices (2016)
  2. Guglielmi, Nicola; Manetta, Manuela: An iterative method for computing robustness of polynomial stability (2016)
  3. Maroulas, John; Katsouleas, Georgios: Block imbedding and interlacing results for normal matrices (2016)
  4. Shi, Zhanwen; Yang, Guanyu; Xiao, Yunhai: A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (2016)
  5. Zhou, Yunkai; Wang, Zheng; Zhou, Aihui: Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (2016)
  6. Brandts, Jan H.; Reis da Silva, Ricardo: On the subspace projected approximate matrix method. (2015)
  7. Jia, Zhongxiao; Lv, Hui: A posteriori error estimates of Krylov subspace approximations to matrix functions (2015)
  8. Khazaee, Adib; Lotfi, Vahid: A new technique for determining coupled modes of structure-acoustic systems (2015)
  9. Rostami, Minghao W.: New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices (2015)
  10. Shahzadeh Fazeli, S.A.; Emad, Nahid; Liu, Zifan: A key to choose subspace size in implicitly restarted Arnoldi method (2015)
  11. Duintjer Tebbens, Jurjen; Meurant, Gérard: Prescribing the behavior of early terminating GMRES and Arnoldi iterations (2014)
  12. Katsouleas, Georgios; Maroulas, John: Interaction between Hermitian and normal imbeddings (2014)
  13. Niu, Datian; Yuan, Xuegang: An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets (2014)
  14. Ravibabu, Mashetti; Singh, Arindama: On refined Ritz vectors and polynomial characterization (2014)
  15. Wu, Gang; Zhang, Lu: On expansion of search subspaces for large non-Hermitian eigenproblems (2014)
  16. Zhang, Lei-Hong: On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients (2014)
  17. Astudillo, R.; Castillo, Z.: Computing pseudospectra using block implicitly restarted Arnoldi iteration (2013)
  18. Astudillo, R.; Castillo, Z.: Approximating the weighted pseudospectra of large matrices (2013)
  19. Baglama, James; Reichel, Lothar: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (2013)
  20. Liu, Xin; Hao, Chunlin; Cheng, Minghou: A sequential subspace projection method for linear symmetric eigenvalue problem (2013)

1 2 3 ... 12 13 14 next