Abstract
| Original language | English |
|---|---|
| Pages (from-to) | 991–993 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 19 |
| Issue number | 23 |
| DOIs | |
| State | Published - 10 Nov 1983 |
Cite this
}
Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a. / Lucas, T. Nigel.
In: Electronics Letters, Vol. 19, No. 23, 10.11.1983, p. 991–993.Research output: Contribution to journal › Article
TY - JOUR
T1 - Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a
AU - Lucas,T. Nigel
PY - 1983/11/10
Y1 - 1983/11/10
N2 - 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.
AB - 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.
U2 - 10.1049/el:19830673
DO - 10.1049/el:19830673
M3 - Article
VL - 19
SP - 991
EP - 993
JO - Electronics Letters
T2 - Electronics Letters
JF - Electronics Letters
SN - 0013-5194
IS - 23
ER -