Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Microwave Theory and Techniques
Article . 2013 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

On the Convergence of the Vector-Fitting Algorithm

Authors: Sanda Lefteriu; Athanasios C. Antoulas;

On the Convergence of the Vector-Fitting Algorithm

Abstract

Vector fitting (VF), first published by Gustavesen and Semlyen in 1999, is widely used for constructing rational models from measured or full-wave electromagnetic simulated frequency-domain responses ( $S$ -, $Y$ -, or $Z$ -parameters). As pointed out by Grivet-Talocia and Bandinu in 2006, to date there is no convergence analysis of the pole relocation iteration in VF. The goal of this paper is to elucidate this issue. It will be shown that the iteration seeks the roots of a set of coupled multivariate rational equations. For noise-free measurements, it is shown that there is no iteration involved, assuming that the number of starting poles is chosen greater or equal to the order of the underlying system. For noisy data, the VF iteration may not find any solution due to the fact that all stationary points of the fixed point iteration are repelling. Therefore, in case the iteration does not converge, we propose to incorporate the Newton step in the VF iteration, thus guaranteeing local convergence. Lastly, we provide a short review of variable projection as an alternative to VF.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    29
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
29
Top 10%
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!