Algorithms for Toeplitz matrices

[lesshaste]

Are there any plans to implement algorithms specifically for Toeplitz matrices? Some (the so-called supefast methods) are almost linear time in n where the equivalent for general matrices are O(n^3) (or very similar). I am particularly interested in rank or determinant calculation that can be done using the Levinson-Durbin method. http://en.wikipedia.org/wiki/Levinson_recursion has some more information and links.