Asymptotic change-of-variable conjecture for preconditioned Toeplitz eigenvalues

About 4 years old · traced to

Let l,gl,g be two even functions with g>0g>0 on (0,π)(0,\pi), and suppose that f≡l/gf\equiv l/g is monotone increasing over (0,π)(0,\pi). Set Xn≡Tn−1(g)Tn(l)X_n\equiv T_n^{-1}(g)T_n(l) for all nn. Let sj,n∈(0,π)s_{j,n}\in(0,\pi) satisfy λj(Xn)=f(sj,n)\lambda_j(X_n)=f(s_{j,n}), let h≡1/(n+1)h\equiv 1/(n+1), and set θj,n≡πjh\theta_{j,n}\equiv \pi jh. Asymptotic change-of-variable conjecture. For some integer K≥0K\geq 0, every nn, and every j=1,…,nj=1,\ldots,n, the points sj,ns_{j,n} have the expansion

sj,n=θj,n+∑k=1Kρk(θj,n)hk+Ej,n,K,s_{j,n}=\theta_{j,n}+\sum_{k=1}^{K}\rho_k(\theta_{j,n})h^k+E_{j,n,K},

where the sj,ns_{j,n} are arranged in nondecreasing order, each ρk:(0,π)→R\rho_k:(0,\pi)\to\mathbb{R} is continuous and depends only on ff, and Ej,n,K=O(hK+1)E_{j,n,K}=O(h^{K+1}) with ∣Ej,n,K∣≤chK+1|E_{j,n,K}|\leq c h^{K+1} for a constant cc depending only on K,l,gK,l,g. The result would refine the known zeroth-order localization sj,n=θj,n+o(1)s_{j,n}=\theta_{j,n}+o(1) and underlies more precise matrix-less algorithms. Its validity for the preconditioned setting remains open.

References

Primary source

Manuel Bogoya, Stefano Serra-Cappizano and Paris Vassalos, “Fast Toeplitz eigenvalue computations, joining interpolation-extrapolation matrix-less algorithms and simple-loop conjectures: the preconditioned setting”, arXiv:2203.11338 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.