TY - JOUR
T1 - Multidimensional continued fraction inversion
AU - Antoniou, G. E.
AU - Varoufakis, S. J.
AU - Paraskevopoulos, P. N.
PY - 1989
Y1 - 1989
N2 - A computationally simple algorithm for the inversion of multidimensional (mD) continued fraction expansions is presented. The approach is based on the interpretation of an mD continued fraction expansion as a driving-point admittance. To facilitate the inversion procedure a cyclic function Ti(z1, z2, ..., zm) is introduced. Several examples are given for inverting 3-D and 4-D systems to illustrate the efficiency of the algorithm.
AB - A computationally simple algorithm for the inversion of multidimensional (mD) continued fraction expansions is presented. The approach is based on the interpretation of an mD continued fraction expansion as a driving-point admittance. To facilitate the inversion procedure a cyclic function Ti(z1, z2, ..., zm) is introduced. Several examples are given for inverting 3-D and 4-D systems to illustrate the efficiency of the algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0024940824&partnerID=8YFLogxK
U2 - 10.1049/ip-g-2.1989.0051
DO - 10.1049/ip-g-2.1989.0051
M3 - Article
AN - SCOPUS:0024940824
SN - 0143-7089
VL - 136
SP - 307
EP - 312
JO - IEE proceedings. Part G. Electronic circuits and systems
JF - IEE proceedings. Part G. Electronic circuits and systems
IS - 6
ER -