JDQZ

Matlab® implementation of the JDQZ algorithm. The JDQZ algorithm can be used for computing a few selected eigenvalues with some desirable property together with the associated eigenvectors of a matrix pencil A-lambda*B. The matrices can be real or complex, Hermitian or non-Hermitian, .... The algorithm is effective especially in case A and B are sparse and of large size. The Jacobi-Davidson method is used to compute a partial generalized Schur decomposition of the pair (A,B). The decomposition leads to the wanted eigenpairs.


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

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

1 2 3 ... 18 19 20 next

  1. Breuer, Alex; Lumsdaine, Andrew: Matrix-free Krylov iteration for implicit convolution of numerically low-rank data (2016)
  2. Brown, Kirsty L.; Gejadze, Igor; Ramage, Alison: A multilevel approach for computing the limited-memory Hessian and its inverse in variational data assimilation (2016)
  3. Campos, Carmen; Roman, Jose E.: Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc (2016)
  4. Gaudreau, P.; Slevinsky, R.; Safouhi, H.: The double exponential sinc collocation method for singular Sturm-Liouville problems (2016)
  5. Giani, Stefano; Grubišić, Luka; Międlar, Agnieszka; Ovall, Jeffrey S.: Robust error estimates for approximations of non-self-adjoint eigenvalue problems (2016)
  6. Higham, Nicholas J.; Strabić, Nataša: Bounds for the distance to the nearest correlation matrix (2016)
  7. Huang, Tsung-Ming; Lin, Wen-Wei; Mehrmann, Volker: A Newton-type method with nonequivalence deflation for nonlinear eigenvalue problems arising in photonic crystal modeling (2016)
  8. Imbrie, John Z.: Multi-scale Jacobi method for Anderson localization (2016)
  9. Imbrie, John Z.: On many-body localization for quantum spin chains (2016)
  10. Nakatsukasa, Yuji; Freund, Roland W.: Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: the power of Zolotarev’s functions (2016)
  11. Neymeyr, Klaus; Zhou, Ming: Convergence analysis of restarted Krylov subspace eigensolvers (2016)
  12. Palacios, José Luis; Quiroz, Daniel: Birth and death chains on finite trees: computing their stationary distribution and hitting times (2016)
  13. Schröder, Christian; Taslaman, Leo: Backward error analysis of the shift-and-invert Arnoldi algorithm (2016)
  14. Shi, Zhanwen; Yang, Guanyu; Xiao, Yunhai: A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (2016)
  15. Szyld, Daniel B.; Xue, Fei: Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I: Extreme eigenvalues (2016)
  16. Vecharynski, Eugene: A generalization of Saad’s bound on harmonic Ritz vectors of Hermitian matrices (2016)
  17. Vecharynski, Eugene; Yang, Chao; Xue, Fei: Generalized preconditioned locally harmonic residual method for non-Hermitian eigenproblems (2016)
  18. Zhou, Yunkai; Wang, Zheng; Zhou, Aihui: Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (2016)
  19. Abdolmaleki, Mohammad; Aldeen, Mohammad: Unstructured quotient fixed modes and decentralised stabilisability (2015)
  20. Aishima, Kensuke: Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems (2015)

1 2 3 ... 18 19 20 next