Algorithms for the case of a symmetrical full matrix
Calculation of eigenvalues
Article REF: AF1224 V1
Algorithms for the case of a symmetrical full matrix
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?

3. Algorithms for the case of a symmetrical full matrix

3.1 Reduction to tridiagonal shape

In this section, we adapt the orthogonal transformation introduced in to the case where the starting matrix is symmetrical. Any orthogonal transformation Q T AQ of the matrix A then remains symmetrical. The final matrix obtained by the procedure is therefore both upper Hessenberg and symmetrical: it is a symmetrical tridiagonal matrix.

When applying Householder transformations, symmetry can be taken into account to reduce the number of operations required. In particular, this can be achieved by using the BLAS library procedure, which updates a matrix with a rank-2 correction. This is programmed in the DSYTRD procedure of the LAPACK library

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?


Ongoing reading
Algorithms for the case of a symmetrical full matrix

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