Answers are grounded in this paper and cite their sources.
Given a real number a ≥ 1, let K n ( a ) be the set of all n × n unit lower triangular matrices with each element in the interval [− a , a ]. Denoting by λ n (·) the smallest eigenvalue of a given matrix, let c n ( a ) = min {λ n ( YY T ) : Y ∈ K n ( a )}. Then <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline"> <m:mrow> <m:msqrt> <m:mrow> <m:msub> <m:mrow> <m:mi>c</m:mi> </m:mrow> <m:mi>n</m:mi> </m:msub> <m:mrow> <m:mo>(</m:mo> <m:mi>a</m:mi> <m:mo>)</m:mo> </m:mrow> </m:mrow> </m:msqrt> </m:mrow> </m:math> √ {{c_n}( a )} is the smallest singular value in K n ( a ). We find all minimizing matrices. Moreover, we study the asymptotic behavior of c n ( a ) as n → ∞. Finally, replacing [− a , a ] with [ a , b ], a ≤ 0 < b , we present an open question: Can our results be generalized in this extension?
No takes yet. Share an insight, caveat, or question.
Ercan Altınışık (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: