On the Quadratic Convergence of an Algorithm which Diagonalizes a Complex Symmetric Matrix

1 December 1973

journal article
Published by Oxford University Press (OUP) in IMA Journal of Applied Mathematics

Vol. 12 (3) , 261-271
https://doi.org/10.1093/imamat/12.3.261

Abstract

A norm-reducing Jacobi algorithm for diagonalizing complex symmetric matrices, due to P. J. Eberlein, is proven to be ultimately quadratically convergent, provided the matrix is normalizable, that is non-defective. The pivot elements are chosen either maximally or serially.

Keywords

ALGORITHM
QUADRATIC CONVERGENCE
SYMMETRIC MATRIX
COMPLEX SYMMETRIC
DIAGONALIZES

This publication has 0 references indexed in Scilit: