Tell me more ×
Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It's 100% free, no registration required.
up vote 8 down vote favorite

I have to solve generalized eigenvalue problems $Ax = \lambda Bx$ where $A$ and $B$ are both tridiagonal, $B$ is symmetric positive definite and real, but $A$ is only complex symmetric (not definite or Hermitian). Furthermore, I need the full eigendecomposition. I am currently just calling Lapack's ZGGEV generalized eigensolver, but I am wondering if there are better methods for this particular, highly structured problem. In particular, having freely available code (C++) would be the best.

share|improve this question
1  
If $A$ is truly only complex symmetric, then it might not even be diagonalizable. You may want to first look into methods for computing the EVD or Schur decomposition of complex symmetric tridiagonal matrices ($B=I$) and work from there. I am skeptical that there will be existing software for this problem. – Jack Poulson Feb 24 at 17:58
I'd recommend doing a Google search here. I found quite a few references that might be useful to you. – Michael C. Grant Mar 27 at 0:49

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.