QR algorithm for the non-symmetrical case
Calculation of eigenvalues
Article REF: AF1224 V1
QR algorithm for the non-symmetrical case
Calculation of eigenvalues

Authors : Bernard PHILIPPE, Yousef SAAD

Publication date: October 10, 2008 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. QR algorithm for the non-symmetrical case

In this paragraph, we assume that the matrix A, whose eigenvalues we are looking for, is real and that we keep the calculations real for as long as possible. This is indeed the most common case. Although the use of complex arithmetic in the case of non-symmetric matrices is conceptually simpler than the restriction to real calculations, since it eliminates the need to deal with special cases, from a computing point of view, we prefer to avoid complex calculations as they generally slow down execution. However, all the calculations described can be performed in complex arithmetic, taking care to use the Hermitian scalar product of two complex vectors x and y defined by xHy=xTy...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Article included in this offer

"Mathematics"

( 166 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us