Abstract
The vector fitting (VF) algorithm, as a variant of the Sanathanan-Koerner (SK) algorithm, has been widely used for frequency-domain modeling. This algorithm is essentially an iterative procedure, in which a revised linear least squares (LS) problem is solved in each step. So far, there has been hardly any analytical result in the literature on the convergence property of the SK or the VF algorithm. In this brief, several results are developed. First, it is shown that, if the frequency response data are noisy, then the SK or the VF algorithm, if it converges, would never reach any local minimum of the original nonlinear LS problem. Second, by modeling the SK or the VF algorithm as a sequence of solving weighted LS problems with updated weights, it is shown that, with noisy data, the SK or the VF algorithm, if it converges, would never reach any stationary point with respect to weights. With regard to the general convergence, a counterexample is given to show that the SK or the VF algorithm does not converge and, in fact, runs into limit-cycle-like oscillation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
