Computationally efficient stepup and stepdown procedures for real predictor coefficients

Algorithms are presented for the stepup and stepdown problem for the real case. It is shown that the split Levinson algorithm and similar algorithms can be used to reduce the multiplicative complexity of the problem considerably.<
>