Advertisement

Nondefective Complex Symmetric Matrices

  • Jane K. Cullum
  • Ralph A. Willoughby
Part of the Progress in Scientific Computing book series (PSC, volume 4)

Abstract

The FORTRAN codes in this chapter address the question of computing distinct eigenvalues and eigenvectors of a nondefective, complex symmetric matrix, using a single-vector Lanczos procedure. For a given nondefective, complex symmetric matrix A, these codes compute complex scalars À and corresponding complex vectors x ≠ 0 such that
(7.1.1)
Definition 7.1.1 A complex nxn matrix A ≡ (aij), 1 ≤ i,j ≤ n, is complex symmetric if and only if for every i and j, aij = aji. A complex symmetric matrix is nondefective if and only if it has a complete set of eigenvectors.

Keywords

Distinct Eigenvalue Inverse Iteration Eigenvalue Computation Ritz Vector History File 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston, Inc. 1985

Authors and Affiliations

  • Jane K. Cullum
    • 1
  • Ralph A. Willoughby
    • 1
  1. 1.IBM T. J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations