• FEAST

  • Referenced in 92 articles [sw04025]
  • deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms...
  • Modulef

  • Referenced in 39 articles [sw01072]
  • Solution methods for eigenproblems include inverse iteration, subspace iteration, Lanczos and QR methods. Solution...
  • svdpack

  • Referenced in 61 articles [sw04819]
  • SVDPACK comprises four numerical (iterative) methods for computing the singular value decomposition (SVD) of large ... This software package implements Lanczos and subspace iteration-based methods for determining several...
  • Algorithm 919

  • Referenced in 71 articles [sw07350]
  • constructing a Krylov subspace using Arnoldi or Lanczos iteration and projecting the function on this...
  • QMRPACK

  • Referenced in 78 articles [sw00754]
  • algorithm is a Krylov-subspace method for the iterative solution of large non-Hermitian linear...
  • CheFSI

  • Referenced in 16 articles [sw22461]
  • Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation ... most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors ... large scale problems. The Chebyshev-filtered subspace iteration (CheFSI) method avoids most of the explicit ... sparse iterative diagonalization at the first SCF step to provide initial vectors for subspace filtering...
  • VASP

  • Referenced in 16 articles [sw19550]
  • method with direct inversion of the iterative subspace (RMM-DIIS) or blocked Davidson algorithms. These...
  • AmgX

  • Referenced in 14 articles [sw13440]
  • distributed algebraic multigrid (AMG) and preconditioned iterative methods. The AmgX library implements both classical ... standard and flexible preconditioned Krylov subspace iterative methods, which can be combined with...
  • BLOOMP

  • Referenced in 28 articles [sw06454]
  • orthogonal matching pursuit (OMP), subspace pursuit (SP), iterative hard thresholding (IHT), basis pursuit...
  • EVSL

  • Referenced in 11 articles [sw27222]
  • with Krylov subspace methods and the subspace iteration algorithm. On the implementation side, the package...
  • ClusterES

  • Referenced in 10 articles [sw18311]
  • eigensolvers and Chebyshev polynomial filter accelerated subspace iterations. Several algorithmic and computational aspects...
  • SMCSolver

  • Referenced in 18 articles [sw15194]
  • Cyclic Reduction (QBD_CR.m), Functional Iterations (QBD_FI.m), Invariant Subspace Approach (QBD_IS.m), Logarithmic Reduction...
  • CIRR

  • Referenced in 41 articles [sw12618]
  • very large, iterative methods are used to generate an invariant subspace that contains the desired...
  • NITSOL

  • Referenced in 99 articles [sw00623]
  • introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems ... obtained using one of several Krylov subspace methods. The algorithm is implemented in a Fortran...
  • mu-diff

  • Referenced in 6 articles [sw19503]
  • gaussian elimination method or preconditioned Krylov subspace iterative techniques). Pre- and post-processing facilities...
  • GenASPI

  • Referenced in 5 articles [sw19575]
  • linear systems in conjunction with Krylov subspace iterative methods. The effectiveness of explicit preconditioning schemes...
  • SRRIT

  • Referenced in 29 articles [sw01229]
  • invariant subspace of a real matrix A by the method of simultaneous iteration. Specifically, given ... columns of Q span the invariant subspace corresponding to those eigenvalues. SRRIT references A only...
  • PSPIKE+

  • Referenced in 4 articles [sw18330]
  • more robust than other available preconditioned iterative methods, and more scalable than parallel sparse direct ... overlap sizes. In each outer Krylov subspace iteration for solving the linear system, we need...
  • ChASE

  • Referenced in 2 articles [sw30514]
  • ChASE: Chebyshev accelerated subspace iteration eigensolver for sequences of Hermitian eigenvalue problems. Solving dense Hermitian ... substantial. We present the Chebyshev Accelerated Subspace iteration Eigensolver (ChASE), a modern algorithm and library ... based on subspace iteration with polynomial acceleration. Novel to ChASE is the computation...
  • lobpcg.m

  • Referenced in 147 articles [sw24008]
  • speed of convergence, costs of every iteration, and memory requirements. We provide such comparison ... method on the same generalized block Krylov subspace. We propose a new version of block...