Computing Tensor Eigenvalues via Homotopy Methods
نویسندگان
چکیده
We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor eigenpairs using mixed volume. Based on this bound and the structures of tensor eigenvalue problems, we propose two homotopy continuation type algorithms to solve tensor eigenproblems. With proper implementation, these methods can find all equivalence classes of isolated generalized eigenpairs and some generalized eigenpairs contained in the positive dimensional components (if there are any). We also introduce an algorithm that combines a heuristic approach and a Newton homotopy method to extract real generalized eigenpairs from the found complex generalized eigenpairs. A MATLAB software package TenEig has been developed to implement these methods. Numerical results are presented to illustrate the effectiveness and efficiency of TenEig for computing complex or real generalized eigenpairs.
منابع مشابه
Homotopy perturbation method for eigenvalues of non-definite Sturm-Liouville problem
In this paper, we consider the application of the homotopy perturbation method (HPM) to compute the eigenvalues of the Sturm-Liouville problem (SLP) which is called non-definite SLP. Two important Examples show that HPM is reliable method for computing the eigenvalues of SLP.
متن کاملNew Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada
Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...
متن کاملHomotopy-determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
The eigenvalues of a matrix A are the zeros of its characteristic polynomial fiX) = dtt[A XI]. With Hyman's method of determinant evaluation, a new homotopy continuation method, homotopy-determinant method, is developed in this paper for finding all eigenvalues of a real upper Hessenberg matrix. In contrast to other homotopy continuation methods, the homotopy-determinant method calculates eigen...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملHomotopy Analysis Method for Computing Eigenvalues of Sturm-Liouville Problems
In this paper, we apply homotopy analysis method (HAM) for computing the eigenvalues of SturmLiouville problems. The parameter h, in this method, helps us to adjust and control the convergence region. The results show that this method has validity and high accuracy with less iteration number in compare to Variation Iteration Method (VIM) and Adomian decomposition method (ADM). Moreover it is il...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 37 شماره
صفحات -
تاریخ انتشار 2016