Comparison and error bounds of non-parametric identification schemes using rational orthogonal
basis functions

Abstract. The study examines two extensions of the Schi–So algorithm, a unique approach that identifies a pole of a complex rational function using its Laguerre series expansion. The two variants of the Schi–So algorithm that are compared in the study are the Iterative Schi–So method which eliminates the effect of previously identified poles from the transfer function, and a recent generalization for periodic Malmquist–Takenaka systems, the Generalized Schi–So method, which ensures that previously found poles are not repeated in the identification process; it is achieved through an iterative parameter change of the Malmquist–Takenaka basis. In this paper these two variants have been compared both numerically and theoretically, moreover error bounds are given to series coefficients.