𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quantum Convolution of Linearly Recursive Sequences

✍ Scribed by Siu-Hung Ng; Earl J. Taft


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
272 KB
Volume
198
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Hadamard invertibility of linearly recur
✍ Earl J. Taft πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 251 KB

A linearly recursive sequence in n variables is a tableau of scalars {./i,...i,,) for i 1 , i 2 ..... i, ~> 0. such that for each 1 <<.i<~n, all rows parallel to the ith axis satisfy a fixed linearly recursive relation hi(x ) with constant coefficients. We show that such a tableau is Hadamard invert

Attractivity of the recursive sequence
✍ Alaa E. Hamza; S.G. Barbary πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 441 KB

In this paper we investigate the global attractivity of the recursive sequence where Ξ±, Ξ² β‰₯ 0. We show that the unique positive equilibrium point of the equation is a global attractor with some basin. We apply this result to the rational recursive sequence where Ξ±, Ξ², a i , b i β‰₯ 0 and Ξ³ > 0, and

Bialgebras of Recursive Sequences and Co
✍ Carl A. Futia; Eric F. MΓΌller; Earl J. Taft πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 194 KB

A recursive sequence is an infinite sequence of elements of some fixed ground field which satisfies a recursion relation of finite order. We shall investigate certain bialgebra structures on linear spaces of recursive sequences. By choosing appropriate bases for these bialgebras we show how an expli

Recursive reconstruction of sequences fr
✍ L.F. Chaparro; Aruna Bayya πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 569 KB

A recursive procedure to reconstruct a given sequence ,from its group delay or phase derivative is g&en. The procedure is &used on the relationships between minims, maximum phase sequences and their cepstra, and on the modtjied Ieast squares (MLS) rational approximation. To avoid unwrapping of the p