Homotopy algorithm for symmetric eigenvalue problems (Q1107947)

From MaRDI portal





scientific article; zbMATH DE number 4066221
Language Label Description Also known as
default for all languages
No label defined
    English
    Homotopy algorithm for symmetric eigenvalue problems
    scientific article; zbMATH DE number 4066221

      Statements

      Homotopy algorithm for symmetric eigenvalue problems (English)
      0 references
      1989
      0 references
      The homotopy method can be used to solve eigenvalue-eigenvector problems. The purpose of this paper is to report the numerical experience of the homotopy method of computing eigenpairs for real symmetric tridiagonal matrices together with a couple of new theoretical results. In practice, it is rarely of any interest to compute all the eigenvalues. The homotopy method, having the order preserving property, can provide any specific eigenvalue without calculating any other eigenvalues. Besides this advantage, we note that the homotopy algorithm is to a large degree a parallel algorithm. Numerical experimentation shows that the homotopy method can be very efficient especially for graded matrices.
      0 references
      eigenvalue
      0 references
      eigenvector
      0 references
      homotopy continuation method
      0 references
      symmetric tridiagonal matrices
      0 references
      parallel algorithm
      0 references
      graded matrices
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers