【摘要】 <正> 一.引言 A.Brauer在文[1]、[2]中提出了用压缩相似变换求正矩阵最大特征值ω。C·A·Hall和T·A·porshing在文[3]、[4]及佟文廷在文[5]中又给出了较好的压缩因子K的计算方案。本文在文[6]中给出了此方法收敛因子K的取值区间。本文将继文[6]进一步给出此方法的最佳因子K_b。更多还原

【Abstract】 Let A0=A is a positive matrix, An=(A(inf)) is the nth matrix of scquanances Rn = maxR(in), rn = rninR(in) ,and (where minb denote the set of all positive roots of equations (l) then (a) If J<kn≤(where δ is an arbitrary positive constant), then {R(n)converges to ω.(b) If kb = max then R(n+1)is the smallest, and k0 is called the optimum.更多还原