** Next:** The shift
** Up:** Implicit -algorithms for semiseparable
** Previous:** Proof of the correctness
** Contents**
** Index**

In the previous section we developed an implicit -algorithm for
symmetric semiseparable matrices. This was useful because every
symmetric matrix can be transformed into a similar semiseparable
one. As nonsymmetric matrices can be transformed via similarity
transformations into
Hessenberg-like matrices, we will deduce in this section an
implicit -algorithm this class of matrices.

**Subsections**

Raf Vandebril
2004-05-03