Abstract

To solve linear and nonlinear eigenvalue problems, we develop a simple method by directly solving a nonhomogeneous system obtained by supplementing a normalization condition on the eigen-equation for the uniqueness of the eigenvector. The novelty of the present paper is that we transform the original homogeneous eigen-equation to a nonhomogeneous eigen-equation by a normalization technique and the introduction of a simple merit function, the minimum of which leads to a precise eigenvalue. For complex eigenvalue problems, two normalization equations are derived utilizing two different normalization conditions. The golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues, and simultaneously, we can obtain precise eigenvectors to satisfy the eigen-equation. Two regularized normalization methods can accelerate the convergence speed for two extensions of the simple method, and a derivative-free fixed-point Newton iterative scheme is developed to compute real eigenvalues, the convergence speed of which is ten times faster than the golden section search algorithm. Newton methods are developed for solving two systems of nonlinear regularized equations, and the efficiency and accuracy are significantly improved. Over ten examples demonstrate the high performance of the proposed methods. Among them, the two regularization methods are better than the simple method.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call