Discussion VF
Discussion VF
net/publication/3267558
CITATIONS READS
95 991
2 authors:
Some of the authors of this publication are also working on these related projects:
FP6 OMOORENICE! - Operational MOdel Order REduction for Nanoscale IC Electronics View project
All content following this page was uploaded by Tom Dhaene on 02 January 2013.
Abstract—Vector fitting (VF) is a popular iterative rational ap- where . If we form linear combinations of these basis
proximation technique for sampled data in the frequency domain. functions and add a polynomial of degree , we always
VF is nowadays widely investigated and used in the Power Systems get fractions with the same denominator
and Microwave Engineering communities. The VF methodology is
recognized as an elegant version of the Sanathanan–Koerner iter-
ation with a well-chosen basis.
Index Terms—Rational interpolation, system identification,
vector fitting.
(2)
I. INTRODUCTION
power systems, such as transmission lines and transformers. The On the other hand, if we have a polynomial of degree
compact rational pole-zero models can easily be used in EMTP- , we can always write
type programs, and they can replace the tedious and error-prone
numerical transient simulations by fast and efficient iterative
convolutions. (3)
In [1], a new rational interpolation technique, vector fitting
(VF), was introduced. References [2]–[4] provide more infor-
mation on the subject. In this letter, we elaborate on the internals for some and some polynomial of degree . This is
of this technique. A thorough mathematical analysis provides nothing more than the partial fraction expansion.
insight into the inner working of the VF algorithm and teaches
how it can be improved, e.g., by using an orthonormal rational III. PRELIMINARIES: THE ITERATIVE LEAST-SQUARES SCHEME
basis [5]. Throughout this letter, we have adopted the same no- Suppose we want to approximate the values
tation as in [1]. We assume that the reader is familiar with the at sample points by a model of the form
VF methodology.
In Section II, we discuss the pole-based basis that is used
in VF. Section III describes a general rational iterative least- (4)
squares framework. Section IV finally provides the link with the
VF methodology. Section V contains our conclusions.
for some fixed basis functions and . An optimal solution (in
the least-squares sense) to this problem would be to find and
II. PRELIMINARIES: THE POLE-BASED BASIS
such that
We fix degree and fix (the starting poles)
and look at the basis functions
(5)
for (1)
is minimized. Common practice solving such problems is to lin-
earize the problem to get the following expression:
Manuscript received December 1, 2004; revised July 15, 2005. This work (6)
was supported by the FWO—Flemish Fund for Scientific Research. Paper no.
PESL-00111-2004.
The authors are with the Department of Mathematics and Computer Science,
University of Antwerp, Antwerp 2020, Belgium. Equation (6) is linear in its unknowns and and can be
Digital Object Identifier 10.1109/TPWRS.2005.860905 solved using standard least-squares techniques. Unfortunately,
0885-8950/$20.00 © 2006 IEEE
442 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 1, FEBRUARY 2006
the solutions of this linear problem are not the same as those of Multiplying the second equation in (9) by , evaluating in
the original problem. Note that the weighting factor of and equating both equations (as in [1]), and using (10), we
get the system of equations
(7)
(12)
(8)
for all sample points .
The first set of (11) is the same as in VF for poles , except
Each iteration tries to correct the missing weighting factor in (6) for the weighting factor
by using the denominator of the previous iteration.
This approach is known as the Sanathanan–Koerner (SK) it-
eration [6] in the -domain for continuous time systems or the (13)
Steiglitz–McBride iteration [7] in the -domain for discrete time
systems. These iterative techniques are extensively used, and
their properties have been studied. For more information, we The second set of (12) is exactly the VF formulation for a set of
refer to [8] and [9]. The VF methodology also can be seen as an poles .
implementation of the iteration described in this section, as we Suppose now that we have solved the VF pole identification
will see in the next section. system with starting poles . Expanding in its poles and
zeros gives rise to an expression that matches exactly
IV. CLOSER LOOK AT VECTOR FITTING if is chosen to match the zeros of . In that case, solving
the weighted problem (11) obtains the same approximation
We now take a closer look at the VF iteration [1]. In each
as solving (12). The last is exactly the second iteration in the
iteration, both and are approximated by rational
VF methodology, while the first exactly matches the iterative
functions using a common set of fixed poles
scheme of Section III with equal to the basis
function specified in Section II and
and .
V. CONCLUSION
(9)
VF is identified as an elegant reformulation of the SK iter-
ation. The pole-based basis that is used in VF has numerical
with and . advantages over the power-series approach, which is still often
Based on (2) and (3), we can easily perform a basis transfor- used in other implementations of the SK iteration. Powers of
mation, or do a so-called “pole-relocation,” for each equation in (which lead to ill-conditioning) are avoided in the linear system
(9) by using the pole-based basis.
Furthermore, the explicit pole representation of it makes the
enforcement of stable poles easily achievable (by flipping the
unstable poles) as compared to other implementations of the SK
iteration.
Note that the SK iteration is known not to exactly minimize
a least-squares distance. However, it provides good models and
remains stable during successive iterations [9], [10]. Theoreti-
(10) cally, both the VF and SK methodologies should compute the
same solution to the problem. In practice, VF produces favor-
able linear systems that do not contain high powers of as in a
for some coefficients and a polynomial . direct implementation of SK.
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 1, FEBRUARY 2006 443