Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators (Q1904150)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 826916
Language Label Description Also known as
default for all languages
No label defined
    English
    Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators
    scientific article; zbMATH DE number 826916

      Statements

      Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators (English)
      0 references
      0 references
      1 February 1996
      0 references
      The homotopy method is used to compute the smallest few eigenvalues and their corresponding eigenfunctions of a linear self-adjoint partial differential operator. By this method the homotopy \(H(t) = (1 - t)A_0 + tA_1\) is formed (\(A_0\) is a matrix whose smallest few eigenpairs are known). The eigenpairs at \(t + dt\) are obtained using the Rayleigh quotient iterations, \(dt\) is chosen so that \(H(t)\) and \(H(t + dt)\) do not differ too much. This step is repeated until \(t\) reaches 1, when the solution to the original problem is found. The issues relating to the linear solver and the low-rank perturbations and the case when several eigenvalues are clustered together are discussed. Numerical examples for the Schrödinger eigenvalue problem in two space dimensions are given. The algorithm is used to locate the bifurcation point of a parametrized partial differential equation.
      0 references
      smallest eigenvalues
      0 references
      numerical examples
      0 references
      eigenfunctions
      0 references
      Rayleigh quotient iterations
      0 references
      Schrödinger eigenvalue problem
      0 references
      bifurcation point
      0 references

      Identifiers