Main Page | See live article | Alphabetical index Levinson recursion is a mathematical procedure which recursively calculates the solution to a Toeplitz matrix. It was proposed by N. Levinson in 1947. See also: split Levinson recursion, Linear prediction This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.