Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
This paper analyses the contribution of various numerical approaches to making the estimation of threshold autoregressive time series more efficient. It relies on the computational advantages of QR factorizations and proposes Givens transformations to update these factors for sequential LS problems. By showing that the residual sum of squares is a continuous rational function over threshold intervals it develops a new fitting method based on rational interpolation and the standard necessary optimality condition. Taking as benchmark a simple grid search, the paper illustrates via Monte Carlo simulations the efficiency gains of the proposed tools.