Smoothing algorithm for the maximal eigenvalue of non-defective positive matrices

This paper introduced a smoothing algorithm for calculating the maximal eigenvalue of non-defective positive matrices. Two special matrices were constructed to provide monotonically increasing lower-bound estimates and monotonically decreasing upper-bound estimates of the maximal eigenvalue. The mon...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	AIMS mathematics Ročník 9; číslo 3; s. 5925 - 5936
Hlavní autori:	Li, Na, Zhong, Qin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	AIMS Press 01.01.2024
Predmet:	lower bound maximal eigenvalue non-defective positive matrix upper bound
ISSN:	2473-6988, 2473-6988
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper introduced a smoothing algorithm for calculating the maximal eigenvalue of non-defective positive matrices. Two special matrices were constructed to provide monotonically increasing lower-bound estimates and monotonically decreasing upper-bound estimates of the maximal eigenvalue. The monotonicity and convergence of these estimations was also proven. Finally, the effectiveness of the algorithm was demonstrated with numerical examples.
ISSN:	2473-6988 2473-6988
DOI:	10.3934/math.2024289