2006
DOI: 10.1007/3-540-28073-1_15
|View full text |Cite
|
Sign up to set email alerts
|

Some Remarks on the Vector Fitting Iteration

Abstract: Summary. Vector Fitting (VF) is an iterative technique to construct rational approximations based on multiple frequency domain samples, introduced by Gustavsen and Semlyen [1,3]. VF is nowadays widely investigated and used in the Power Systems and Microwave Engineering communities. Numerical experiments show that VF has favorable convergence properties. However, so far, no theoretical proof for its convergence, or conditions to guarantee convergence, have been published. This paper gives a description of a gen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
5
1
1

Relationship

4
3

Authors

Journals

citations
Cited by 21 publications
(17 citation statements)
references
References 3 publications
0
17
0
Order By: Relevance
“…It is known that the iterative procedure of VF is equivalent to the Sanathanan-Koerner iteration [7], [8] using an implicit weighting scheme [5]. This iteration is known to have good convergence properties if the signal-to-noise ratios are sufficiently high.…”
Section: B Relaxationmentioning
confidence: 99%
“…It is known that the iterative procedure of VF is equivalent to the Sanathanan-Koerner iteration [7], [8] using an implicit weighting scheme [5]. This iteration is known to have good convergence properties if the signal-to-noise ratios are sufficiently high.…”
Section: B Relaxationmentioning
confidence: 99%
“…The trivial null solution of (1) is avoided by setting one coefficientc t 0 = 1 or by adding an additional relaxation constraint to (1), as in [9]. It was shown in a previous report that this process is related to the Sanathanan-Koerner iteration [16].…”
Section: Vector Fitting Algorithmmentioning
confidence: 99%
“…By repeating this process iteratively , updated values of the coefficients and can be derived by minimizing the following cost function [16]: (4) The trivial null solution can typically be avoided by fixing one coefficient (e.g., the constant term of the denominator) to unity. This can be done without loss of generality since both the numerator and denominator can be divided by the same constant value.…”
Section: Model Identificationmentioning
confidence: 99%
“…The starting poles of the frequency-dependent basis functions and are chosen as stable complex conjugate pairs , which have small real parts , and their imaginary parts linearly spaced over the frequency range of interest such that (15) (16) It was shown in [10] that this distribution of the poles reduces the probability that poles must be relocated over long distances and, therefore, avoids that the Sanathanan-Koerner weighting exhibits a large dynamic variation, which breaks down the numerical conditioning of the system equations [20].…”
Section: A Frequencymentioning
confidence: 99%
See 1 more Smart Citation