Changes in Version 2.3.2
-
A new 'krylovschur' eigensolver has been added, that implements the
Krylov-Schur method. This method is related to the Arnoldi and Lanczos
algorithms, but incorporates a new restarting scheme that makes it
competitive with respect to implicit restart. This eigensolver is now
the default for both symmetric and non-symmetric problems.
-
A new wrapper has been developed to interface with the PRIMME library.
This library provides Davidson-type eigensolvers.
-
The 'lanczos' solver has been improved, in particular, the different
reorthogonalization strategies are now more robust.
-
Now the 'arnoldi' eigensolver supports the computation of eigenvalues
other than those of largest magnitude.
-
EPSGetLinearIterations has been replaced with EPSGetOperationCounters,
providing more statistics about the solution process.
-
EPSGetIterationNumber now returns the number corresponding to outer
iterations.
-
The 'lobpcg' wrapper has been renamed to 'blopex'.
-
The 'planso' wrapper has been removed since PLANSO is no longer being
distributed.
Changes in Version 2.3.1
-
New variant of the Arnoldi method added to the 'arnoldi' eigensolver
(with delayed reorthogonalization, see EPSArnoldiSetDelayed).
-
Several optimizations for improving performance and scalability, in particular
the orthogonalization steps.
Changes in Version 2.3.0
-
New 'lanczos' eigensolver, an explicitly restarted version of the Lanczos method
for symmetric eigenproblems. Allows the user to choose among 5 reorthogonalization
strategies.
-
New spectrum folding spectral transformation.
-
New configuration system, similar to PETSc's configure.py.
-
New interface to an external eigensolver: LOBPCG implemented in Hypre.
-
Added graphical convergence monitor (with -eps_xmonitor).
-
Improvement of Arnoldi solver in terms of efficiency and robustness.
-
Now the 'lapack' solver uses specific Lapack routines for symmetric and generalized problems.
-
Bug fix in the ARPACK interface.
Changes in Version 2.2.1
- The 'power' eigensolver has been replaced by a simpler implementation.
- The 'rqi' eigensolver has been removed. Now the Rayleigh Quotient Iteration is embedded in the 'power' method.
- The 'subspace' eigensolver has been rewritten. Now it follows the SRRIT implementation, which is much faster than the old one.
- The 'arnoldi' eigensolver has been re-implemented as well. The new implementation is much more robust and efficient.
- A new Spectral Tranformation (ST) has been added: the generalized Cayley transform.
- Support for user-provided deflation subspaces has been added (see EPSAttachDeflationSpace).
- Support for preservation of symmetry in eigensolvers. For this feature, the user must explicitly call EPSSetProblemType in symmetric problems.
- The two types of monitors (error estimates and values) have been merged in a single one.
- New function EPSGetInvariantSubspace.
- Better support for spectrum slicing in 'blzpack'.
Changes in Version 2.2.0
- EPSSolve does not return the number of iterations. Use EPSGetIterationNumber for this purpose.
- EPSGetSolution has been replaced by EPSGetEigenpair with a cleaner interface.
- EPSComputeError has been replaced by EPSComputeRelativeError and EPSComputeResidualNorm with better error computing for zero eigenvalues. These functions now are oriented to single eigenpairs, as well as EPSGetErrorEstimate.
- The possibilities of EPSSetWhichEigenpairs have been reduced and now are more coherent across problem types.
- Removed STNONE spectral transformation. The default of STSHIFT with 0 shift is equivalent.
- Added STSinvertSetMatStructure to optimize performance of MatAXPY in shift-and-invert transformation.
- Classical and modified Gram-Schmidt orthogonalization use iterative refinement, with user options for parameter adjustment.
Changes in Version 2.1.5
- Added call to MatGetInertia
in BLZPACK interface.
|