Study on Solving Algorithm of T Matrix Eigenvalues Based on C Programming Language

The problem of solving matrix eigenvalues is a hot research topic, and dichotomy is an important algorithm to solve it. On the basis of the research on matrix eigenvalue algorithm by experts and scholars, the T matrix is studied and found to have eight pairs of eigenvalues of adjacent two sequential...

Full description

Saved in:
Bibliographic Details
Published inComputer and Communication Engineering pp. 94 - 103
Main Authors Qin, Weida, Luo, Ricai, Wei, Yinhu
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
SeriesCommunications in Computer and Information Science
Subjects
Algorithm research
C programming language
Dichotomy
Eigenvalue
T matrix
Online AccessGet full text

Cover

More Information
Summary:The problem of solving matrix eigenvalues is a hot research topic, and dichotomy is an important algorithm to solve it. On the basis of the research on matrix eigenvalue algorithm by experts and scholars, the T matrix is studied and found to have eight pairs of eigenvalues of adjacent two sequential principal square submatrices that are not strictly interlaced, that is, the matrix does not meet the key properties of using dichotomy to solve eigenvalues. Then, the feasible conditions and feasibility of dichotomy algorithm for solving the eigenvalue of T matrix are studied by analyzing the principle of sign change number of characteristic polynomial sequence of sequential principal square submatrices of T matrix. Finally, the accuracy of the algorithm is verified by numerical simulation using C programming language.
ISBN:9783031174216
3031174216
ISSN:1865-0929
1865-0937
DOI:10.1007/978-3-031-17422-3_9