### 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_{1}, z_{2}, ..., 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

*IEE proceedings. Part G. Electronic circuits and systems*,

*136*(6), 307-312.

}

*IEE proceedings. Part G. Electronic circuits and systems*, vol. 136, no. 6, pp. 307-312.

**Multidimensional continued fraction inversion.** / Antoniou, G. E.; Varoufakis, S. J.; Paraskevopoulos, P. N.

Research output: Contribution to journal › Article

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

VL - 136

SP - 307

EP - 312

JO - IEE Proceedings G: Electronics Circuits and Systems

JF - IEE Proceedings G: Electronics Circuits and Systems

SN - 0143-7089

IS - 6

ER -