ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Question 6.1 of Chalmoukis, Tsikalas and Yakubovich asks how far the Power boundedness constant P(T)P(T) of a matrix can exceed its ordinary Kreiss constant K(T)K(T). Answered more strongly: for every K>1K > 1 there are matrices whose Cayley transforms satisfy K(Ch(An,h))≤KK(C_h(A_{n,h})) \le K while the strong Kreiss constant satisfies Ks(Ch(An,h))≥12CnαKK_s(C_h(A_{n,h})) \ge \tfrac{1}{2}Cn^{\alpha_K} with αK=(K−1)/(C+K−1)\alpha_K = (K-1)/(C+K-1). Since P(T)≥Ks(T)P(T)\geq K_s(T), this solves the question. Moreover, since the Kreiss matrix theorem gives Ks(T)≤P(T)≤edK(T)K_s(T) \le P(T) \le edK(T) in dimension dd, the exponent α<1\alpha < 1 is optimal up to an arbitrarily small power loss.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.