Abstract
An in-place Levinson update algorithm is presented which requires less storage than update algorithms in some published programs. The algorithm may be easily implemented in a program which employs a Levinson recursion.

This publication has 0 references indexed in Scilit: