Title of article :
Total positivity and the QR algorithm
Author/Authors :
L.P. Lebedev and G.M.L. Gladwell، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Pages :
16
From page :
257
To page :
272
Abstract :
An n × n real matrix A is TP (totally positive) if all its minors are positive or zero; NTP, if it is nonsingular and TP; STP, if it is strictly TP; O (oscillatory), if it is TP and a power Am is STP. Let P be one of NTP, O, STP. We prove that if A is symmetric and has property P, μ is not an eigenvalue of A, and A - μI = QR and A′ - μI = RQ with R having positive diagonal, then A′ has property P, and vice versa. The analysis includes a new criterion for A to be STP.
Journal title :
Linear Algebra and its Applications
Serial Year :
1998
Journal title :
Linear Algebra and its Applications
Record number :
822321
Link To Document :
بازگشت