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

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

1 2 3 ... 27 28 29 next

  1. Ahmad, Sk. Safique; Kanhya, Prince: Structured perturbation analysis of sparse matrix pencils with (s)-specified eigenpairs (2020)
  2. Aishima, Kensuke: Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems (2020)
  3. Aristodemo, A.; Gemignani, L.: Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods (2020)
  4. Benner, Peter; Bujanović, Zvonimir; Kürschner, Patrick; Saak, Jens: A numerical comparison of different solvers for large-scale, continuous-time algebraic Riccati equations and LQR problems (2020)
  5. Campos, Carmen; Roman, Jose E.: A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation (2020)
  6. Dax, Achiya: A cross-product approach for low-rank approximations of large matrices (2020)
  7. Demyanko, Kirill V.; Kaporin, Igor E.; Nechepurenko, Yuri M.: Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis (2020)
  8. Fukaya, Takeshi; Kannan, Ramaseshan; Nakatsukasa, Yuji; Yamamoto, Yusaku; Yanagisawa, Yuka: Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices (2020)
  9. Horning, Andrew; Townsend, Alex: FEAST for differential eigenvalue problems (2020)
  10. Jia, Zhongxiao: Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems (2020)
  11. Kelley, C. T.; Bernholc, J.; Briggs, E. L.; Hamilton, Steven; Lin, Lin; Yang, Chao: Mesh independence of the generalized Davidson algorithm (2020)
  12. Litvinenko, Alexander; Logashenko, Dmitry; Tempone, Raul; Wittum, Gabriel; Keyes, David: Solution of the 3D density-driven groundwater flow problem with uncertain porosity and permeability (2020)
  13. Miao, Cun-Qiang: Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations (2020)
  14. Miao, Cun-Qiang; Tan, Xue-Yuan: Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank (2020)
  15. Nakatsukasa, Yuji: Sharp error bounds for Ritz vectors and approximate singular vectors (2020)
  16. Nasser, Rayan; Sadkane, Miloud: Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems (2020)
  17. Rong, Xin; Niu, Ruiping; Liu, Guirong: Stability analysis of smoothed finite element methods with explicit method for transient heat transfer problems (2020)
  18. Tremblay, Nicolas; Loukas, Andreas: Approximating spectral clustering via sampling: a review (2020)
  19. Adachi, Satoru; Nakatsukasa, Yuji: Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (2019)
  20. Altmann, R.; Peterseim, D.: Localized computation of eigenstates of random Schrödinger operators (2019)

1 2 3 ... 27 28 29 next