• JDQZ

  • Referenced in 610 articles [sw07031]
  • decomposition leads to the wanted eigenpairs...
  • JDQR

  • Referenced in 513 articles [sw04021]
  • decomposition leads to the wanted eigenpairs...
  • lobpcg.m

  • Referenced in 147 articles [sw24008]
  • LOBPCG method provides approximations to first eigenpairs of about the same quality as those...
  • PRIMME

  • Referenced in 51 articles [sw04023]
  • stable algorithms for obtaining a few required eigenpairs. This is probably one of the reasons...
  • TenEig

  • Referenced in 25 articles [sw14671]
  • tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound ... number of equivalence classes of generalized tensor eigenpairs using mixed volume. Based on this bound ... find all equivalence classes of isolated generalized eigenpairs and some generalized eigenpairs contained ... Newton homotopy method to extract real generalized eigenpairs from the found complex generalized eigenpairs...
  • BLOPEX

  • Referenced in 27 articles [sw04024]
  • free iterative method for computing several extreme eigenpairs of symmetric positive generalized eigenproblems; a user...
  • irbleigs

  • Referenced in 19 articles [sw00451]
  • MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix. irbleigs...
  • DVDSON

  • Referenced in 16 articles [sw17845]
  • program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix...
  • EVSL

  • Referenced in 11 articles [sw27222]
  • into a number of subintervals and extracting eigenpairs from each subinterval independently. In order...
  • Sips

  • Referenced in 10 articles [sw20921]
  • compute very large numbers of eigenpairs for sparse symmetric generalized eigenvalue problems. The development...
  • na18

  • Referenced in 5 articles [sw11506]
  • extreme leftmost or rightmost eigenpairs of a large symmetric matrix. This paper contains a description ... format, block size, number of desired extreme eigenpairs, and choice of corrector. It is designed...
  • OEIG

  • Referenced in 4 articles [sw07166]
  • operations for computing all the eigenpairs. We also describe a method to compute practical starting ... eigenpairs. The effectiveness of the new approach is demonstrated with numerical experiments. A MATLAB-based...
  • Algorithm 710

  • Referenced in 4 articles [sw13030]
  • software is to find a few eigenpairs of a dense nonsymmetric matrix faster and more ... less than 20 percent of the eigenpairs are needed...
  • MERAM

  • Referenced in 5 articles [sw12819]
  • propose a new approach for calculating some eigenpairs of large sparse non-Hermitian matrices. This...
  • k-ep

  • Referenced in 5 articles [sw34700]
  • Fortran codes for computing the k-th eigenpair of generalized symmetric definite eigenproblems. Reference...
  • XMR

  • Referenced in 3 articles [sw07169]
  • algorithm for computing selected eigenpairs of symmetric tridiagonal matrices, thus disentangling the principles driving...
  • BDSVDX

  • Referenced in 3 articles [sw35942]
  • bidiagonal matrix through the eigenpairs of an associated symmetric tridiagonal matrix. The algorithm enables...
  • EfficientMaxEigenpair

  • Referenced in 1 article [sw17999]
  • EfficientMaxEigenpair. Efficient Initials for Computing the Maximal Eigenpair. An implementation for using efficient initials ... compute the maximal eigenpair in R. It provides two algorithms to find the efficient initials ... algorithms for the next to the maximal eigenpair under these two cases...
  • PPCG_lrep

  • Referenced in 2 articles [sw29678]
  • which characterizes the desired eigenpairs as its solution. In this paper, we propose a Projected...
  • Davidson

  • Referenced in 1 article [sw13467]
  • method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix ... Davidson is presented for determining a few eigenpairs with lowest or alternatively highest values...