Real dqds for the nonsymmetric tridiagonal eigenvalue problem

Details Real dqds for the nonsymmetric tridiagonal eigenvalue problem Real dqds for the nonsymmetric tridiagonal eigenvalue problem

2012-01-24

arxiv.org/abs/1201.5065v1

Mathematics

Numerical Analysis

28 pages; 7 figures

Scientific paper

We present a new transform, triple dqds, to help to compute the eigenvalues of a real tridiagonal matrix C using real arithmetic. The algorithm uses the real dqds transform to shift by a real number and triple dqds to shift by a complex conjugate pair. We present what seems to be a new criteria for splitting the current pair L,U. The algorithm rejects any transform which suffers from excessive element growth and then tries a new transform. Our numerical tests show that the algorithm is about 100 times faster than the Ehrlich-Aberth method of D. A. Bini, L. Gemignani and F. Tisseur. Our code is comparable in performance to a complex dqds code and is sometimes 3 times faster.

Affiliated with

Also associated with

No associations

Rating

Real dqds for the nonsymmetric tridiagonal eigenvalue problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Real dqds for the nonsymmetric tridiagonal eigenvalue problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Real dqds for the nonsymmetric tridiagonal eigenvalue problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-107526