Multidimensional continued fraction inversion

G. E. Antoniou; S. J. Varoufakis; P. N. Paraskevopoulos

Multidimensional continued fraction inversion

G. E. Antoniou, S. J. Varoufakis, P. N. Paraskevopoulos

Computer Science

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

2 Scopus citations

Abstract

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 T_i(z₁, z₂, ..., z_m) is introduced. Several examples are given for inverting 3-D and 4-D systems to illustrate the efficiency of the algorithm.

Original language	English
Pages (from-to)	307-312
Number of pages	6
Journal	IEE proceedings. Part G. Electronic circuits and systems
Volume	136
Issue number	6
State	Published - 1 Dec 1989

Cite this

@article{df02649351c6427293d90d3ec28d8eeb,

title = "Multidimensional continued fraction inversion",

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

author = "Antoniou, {G. E.} and Varoufakis, {S. J.} and Paraskevopoulos, {P. N.}",

year = "1989",

month = dec,

day = "1",

language = "English",

volume = "136",

pages = "307--312",

journal = "IEE Proceedings G: Electronics Circuits and Systems",

issn = "0143-7089",

publisher = "Institute of Electrical Engineers",

number = "6",

}

TY - JOUR

T1 - Multidimensional continued fraction inversion

AU - Antoniou, G. E.

AU - Varoufakis, S. J.

AU - Paraskevopoulos, P. N.

PY - 1989/12/1

Y1 - 1989/12/1

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

M3 - Article

AN - SCOPUS:0024940824

SN - 0143-7089

VL - 136

SP - 307

EP - 312

JO - IEE Proceedings G: Electronics Circuits and Systems

JF - IEE Proceedings G: Electronics Circuits and Systems

IS - 6

ER -

Multidimensional continued fraction inversion

Abstract

Other files and links

Cite this