Abstract
<abstract><p>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.</p></abstract>
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
