I wish to efficiently compute the eigenvectors of an n x n symmetric positive definite Toeplitz matrix K. A full eigendecomposition would be even better. Although I assumed this would be a well addressed problem in the numerical linear algebra literature, I have found surprisingly little on t...
For me, working in an industrial context, even so we cared more about the practical question, the theoretical question could never be entirely ignored, because it gave us a feeling for the limits of what our competitors might come up with, if they just tried hard enough and invested sufficient resources.
The question how to work efficiently with Toeplitz matrices came up in the context of generalizations of the algorithm from Lifeng Li's paper "New formulation of the Fourier modal method for crossed surface-relief gratings" to general non-Manhattan geometries.
« first day (1144 days earlier) ← previous day