Encyclopedia > Levinson recursion

  Article Content

Levinson recursion

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



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Kuru Kuru Kururin

... player controls a slowly spinning stick and must get it through a series of mazes without touching the walls - but it rotates all the time, making the task difficult. The ...

 
 
 
This page was created in 22.4 ms