Abstract
An algorithm is given for model reduction by continued-fraction expansion about the origin and a general point. It is seen to be more efficient than the existing method and has the advantage of also generating biased models. An example illustrates its use.
| Original language | English |
|---|---|
| Pages (from-to) | 991–993 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 19 |
| Issue number | 23 |
| DOIs | |
| Publication status | Published - 10 Nov 1983 |
Cite this
Lucas, T. N. (1983). Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a. Electronics Letters, 19(23), 991–993. https://doi.org/10.1049/el:19830673