Name
Abstract | ||
|---|---|---|
this paper trivially extends to the complexcase. As described in the introduction, we are interested in approximating thistransfer function by another one of lower degree and such that both match intheir first 2k terms (called moments) of an expansion around s = #. Since prefilteringamounts to pre-multiplying a transfer function, the following lemma willbe useful.Lemma 1 (see [11] for a proof)Let {A i , B i , C i , D i } for i = 1, 2 be realizations of transfer functions R i (s) then a... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1023/A:1019168220795 | Numerical Algorithms |
Keywords | Field | DocType |
Lanczos algorithm,Padé approximation,filtering,65F15,65G05 | Tridiagonal matrix,Mathematical optimization,Lanczos approximation,Lanczos resampling,Padé approximant,Proper transfer function,Mathematical analysis,Approximations of π,Lanczos algorithm,Transfer function,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 4 | 1572-9265 |
Citations | PageRank | References |
3 | 0.51 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kyle Gallivan | 1 | 889 | 154.22 |
| Paul van Dooren | 2 | 649 | 90.48 |