Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a

T. Nigel Lucas

doi:10.1049/el:19830673

Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a

T. Nigel Lucas

Research output: Contribution to journal › Article › peer-review

13 Citations (Scopus)

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	https://doi.org/10.1049/el:19830673
Publication status	Published - 10 Nov 1983

Keywords

Control system analysis
Linear systems
Modelling
System theory

Access to Document

10.1049/el:19830673

Cite this

@article{02915df9d0f342dfb4e6f3b78a770686,

title = "Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a",

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.",

author = "Lucas, \{T. Nigel\}",

year = "1983",

month = nov,

day = "10",

doi = "10.1049/el:19830673",

language = "English",

volume = "19",

pages = "991–993",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley \& Sons Inc.",

number = "23",

}

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

SN - 0013-5194

VL - 19

SP - 991

EP - 993

JO - Electronics Letters

JF - Electronics Letters

IS - 23

ER -

Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a

Abstract

Keywords

Access to Document

Fingerprint

Cite this