An Improved Diagonal Transformation Algorithm for the Maximum Eigenvalue of Zero Symmetric Nonnegative Matrices
The irreducibility of nonnegative matrices is an important condition for the diagonal transformation algorithm to succeed. In this paper, we introduce zero symmetry to replace the irreducibility of nonnegative matrices and propose an improved diagonal transformation algorithm for finding the maximum...
Main Authors: | Gang Wang, Jinfa Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-08-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/14/8/1707 |
Similar Items
-
The symmetric eigenvalue problem /
by: 313358 Pearlett, Beresford N.
Published: (1980) -
An Eigenvalue Inclusion Set for Matrices with a Constant Main Diagonal Entry
by: Weiqian Zhang, et al.
Published: (2018-12-01) -
Construction of 4 x 4 symmetric stochastic matrices with given spectra
by: Jung Jaewon, et al.
Published: (2024-03-01) -
The disc separation and the eigenvalue distribution of the Schur complement of nonstrictly diagonally dominant matrices
by: Cheng-yi Zhang, et al.
Published: (2017-04-01) -
A Fast Algorithm for the Eigenvalue Bounds of a Class of Symmetric Tridiagonal Interval Matrices
by: Quan Yuan, et al.
Published: (2023-02-01)