A new algorithm is described in the paper for calculating continued fractions. The conditions are given under which this algorithm is faster than the hitherto fastest algorithm for handling this problem. Also the interrelation between the suggested algorithm and that for calculatinga tridiagonal sys
β¦ LIBER β¦
An algorithm for a 2-D continued fraction inversion
β Scribed by Chyi Hwang; Yen-Ping Shih
- Book ID
- 114613673
- Publisher
- IEEE
- Year
- 1984
- Weight
- 294 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0098-4094
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An algorithm for calculating continued f
β
Jozef MikloΕ‘ko
π
Article
π
1977
π
Elsevier Science
π
English
β 208 KB
A generalized algorithm for the inversio
β
Parthasarathy, R.; John, S.
π
Article
π
1980
π
IEEE
β 297 KB
An algorithm for calculating generalized
β
M.G. de Bruin
π
Article
π
1978
π
Elsevier Science
π
English
β 184 KB
An algorithm for shifted continued fract
β
Harald Niederreiter; Michael Vielhaber
π
Article
π
1999
π
Elsevier Science
π
English
β 119 KB
The linear complexity proΓΏle of a sequence of length n is readily obtained in O(n 2 ) steps by the Berlekamp-Massey algorithm (BMA). Piper demands that the linear complexity proΓΏles should be acceptable for every starting point, that is, for all shifted sequences as well. By repetition of the BMA, t
Algorithms for expansion and inversion o
β
Parthasarathy, R.; Iyer, S.
π
Article
π
1987
π
IEEE
β 401 KB
A novel efficient algorithm for stabilit
β
Nie, X.; Unbehauen, R.
π
Article
π
1989
π
IEEE
β 270 KB