While working with Jean-Michel Marin on the revision of Bayesian Core, and more specifically on the time series chapter, I was wondering about the following problem:
It is well-known [at least to readers of Bayesian Core] that an AR(p) process
is causal and stationary if and only if the roots of the polynomial
are all outside the unit circle in the complex plane. This defines an implicit (and unfriendly!) parameter space for the original parameters of the AR(p) model. In particular, when considering a candidate parameter, to determine whether or not the constraint is satisfied implies checking for the root of the associated polynomial. The question I asked on Cross Validated a few days ago was whether or not there existed a faster algorithm than the naïve one that consists in (a) finding the roots of P and (b) checking none one them is inside the unit circle. Two hours later I got a reply from J. Bowman about the Schur-Cohn procedure that answers the question about the roots in O(p²) steps without going through the determination of the roots. (This is presumably the same Issai Schur as in Schur’s lemma.) However, J. Bowman also pointed out that the corresponding order for polynomial root solvers is O(p²)! Nonetheless, I think the Schur-Cohn procedure is way faster.
Xi'an's Og 