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.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

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

Showing results 521 to 540 of 557.
Sorted by year (citations)

previous 1 2 3 ... 25 26 27 28 next

  1. Morgan, Ronald B.: Preconditioning eigenvalues and some comparison of solvers (2000)
  2. Ruhe, A.: The rational Krylov algorithm for nonlinear matrix eigenvalue problems (2000)
  3. Sameh, Ahmed; Tong, Zhanye: The trace minimization method for the symmetric generalized eigenvalue problem (2000)
  4. Wu, Kesheng; Simon, Horst: Thick-restart Lanczos method for large symmetric eigenvalue problems (2000)
  5. Bai, Zhaojun; Day, David; Ye, Qiang: ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems (1999)
  6. Dohlus, M.; Schuhmann, R.; Weiland, T.: Calculation of frequency domain parameters using 3D eigensolutions (1999)
  7. Elsner, Ulrich; Mehrmann, Volker; Milde, Frank; Römer, Rudolf A.; Schreiber, Michael: The Anderson model of localization: A challenge for modern eigenvalue methods (1999)
  8. Engelborghs, Koen; Roose, Dirk: Numerical computation of stability and detection of Hopf bifurcations of steady state solutions of delay differential equations (1999)
  9. Fattebert, Jean-Luc: Finite difference schemes and block Rayleigh quotient iteration for electronic structure calculations on composite grids (1999)
  10. Fokkema, Diederik R.; Sleijpen, Gerard L. G.; van der Vorst, Henk A.: Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils (1999)
  11. Jia, Zhongxiao: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (1999)
  12. Jia, Zhongxiao: Composite orthogonal projection methods for large matrix eigenproblems (1999)
  13. Baglama, J.; Calvetti, D.; Reichel, L.; Ruttan, A.: Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling (1998)
  14. Edelman, Alan; Arias, Tomás A.; Smith, Steven T.: The geometry of algorithms with orthogonality constraints (1998)
  15. Fokkema, Diederik R.; Sleijpen, Gerard L. G.; Van der Vorst, Henk A.: Accelerated inexact Newton schemes for large systems of nonlinear equations (1998)
  16. Grimme, E.; Gallivan, K. A.; Van Dooren, P. M.: On some recent developments in projection-based model reduction (1998)
  17. Lehoucq, R. B.; Meerbergen, Karl: Using generalized Cayley transformations within an inexact rational Krylov sequence method (1998)
  18. Morgan, R. B.; Zeng, M.: Harmonic projection methods for large non-symmetric eigenvalue problems (1998)
  19. Ruhe, Axel: Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils (1998)
  20. Sleijpen, Gerard L. G.; van der Horst, Henk A.; Meijerbrink, Ellen: Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems (1998)

previous 1 2 3 ... 25 26 27 28 next