A fast algorithm for Nevanlinna-Pick interpolation
A new fast algorithm is derived for the scalar Nevanlinna-Pick interpolation problem. This fast algorithm requires approximately 28% fewer multiplications than the classical algorithm. The algorithm is based on the three-term recurrence similar to that of the so-called split algorithms for linear prediction. >