Superexponentially Convergent Algorithm for an Abstract Eigenvalue Problem with Applications to Ordinary Differential Equations.

A new algorithm for the solution of eigenvalue problems for linear operators of the form A = A + B (with a special application to high-order ordinary differential equations) is proposed and justified. The algorithm is based on the approximation of A by an operator $$ \overline{A}=A+\overline{B} $$ such that the eigenvalue problem for Ā is supposed to be simpler than for A: The algorithm for this eigenvalue problem is based on the homotopy idea and, for a given eigenpair number, recursively computes a sequence of approximate eigenpairs that converges to the exact eigenpair with a superexponential convergence rate. The eigenpairs can be computed in parallel for all prescribed indexes. The case of multiple eigenvalues of the operator Ā is emphasized. Examples of eigenvalue problems for the high-order ordinary differential operators are presented to support the theory. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Mathematical Sciences is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)