[Trilinos-Users] Large Generalized Symmetric Complex Eigenvalue Problem: From ARPACK to Anasazi?

[Heroux, Michael A]

Klaus,

The software stack that supports complex is growing quickly.  Belos already
supports complex for Krylov methods for linear systems.  There is a new
package called Tifpack that supports complex to do domain decomposition with
ILU and related preconditioners.  So, using Trilinos 10.4 (the current
release), there is a better answer than Komplex for iterative linear
solvers.

In the next version of Trilinos (Oct 2010), we plan to have Amesos2 and KLU
2, which support complex.  How much of the linking support to complex
versions of MUMPS, UMFPACK, etc. will be done by October is not clear right
now, but we are moving in the right direction.

BTW, all of the support for complex comes from using templated scalar types

Mike

On 8/6/10 4:41 PM, "Klaus Zimmermann"
<klaus.zimmermann at physik.uni-freiburg.de> wrote:

> Hi All,
> 
> for my ab initio quantum calculations I have to find some eigenvalues
> for large, sparse complex symmetric generalized eigenvalue problems.
> I would really like to move from our legacy ARPACK fortran code to a
> more modern code base
> in order to make use of our local MPI based grid. I am a bit overwhelmed
> by the choices. But I now think
> I boiled my possibilities down to Anasazi or SLEPc. I'd prefer to go the
> C++ way.
> However I understand the support for complex systems in the linear
> solver part is limited.
> 
> What would be the best way to go about tackling this kind of problem?
> Right now I am thinking: Anasazi<Tpetra, BlockKrylovSchur> +
> (Komplex+Amesos+MUMPS).
> Is this reasonable?
> 
> Thanks for any hints in advance!
> 
> Regards,
> Klaus Zimmermann
> 
> _______________________________________________
> Trilinos-Users mailing list
> Trilinos-Users at software.sandia.gov
> http://software.sandia.gov/mailman/listinfo/trilinos-users