The parameter functionalization method in the eigenvalue problem (Q1594329)

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 1557643
Language Label Description Also known as
default for all languages
No label defined
    English
    The parameter functionalization method in the eigenvalue problem
    scientific article; zbMATH DE number 1557643

      Statements

      The parameter functionalization method in the eigenvalue problem (English)
      0 references
      0 references
      0 references
      28 January 2001
      0 references
      The first part of the article deals with iterative algorithms of solving the eigenvalue problem \(Ax=\lambda x\) with a complete continuous linear operator \(A\) in a Banach space \(E\). Under the assumption that \(A\) has a nonzero simple (real or complex) eigenvalue \(\lambda_*\) and \(X_*\) is the corresponding eigenvector the authors reduce the problem to the operator equation \(Ax-f(x) x=0\) where \(f\) is a suitable continuous linear functional (this pass is called method of parameter functionalization). Then the basic and modified Newton-Kantorovich iterations for this operator equation are considered. In the second part the problem \(A(\varepsilon) x=\lambda x\) is considered. In this case iterations discussed in the first part depend on the parameter \(\varepsilon\) and are asymptotic approximations to the exact solution. The order of these approximations is easily estimated in dependence on \(n\).
      0 references
      iterative algorithms
      0 references
      eigenvalue problem
      0 references
      complete continuous linear operator
      0 references
      method of parameter functionalization
      0 references
      Newton-Kantorovich iterations
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references