𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fast Version of the Schur–Cohn Algorithm

✍ Scribed by Cyril Brunie; Philippe Saux Picart

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
180 KB
Volume
16
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast transversal versions of the RIV alg
Fast transversal versions of the RIV algorithm
✍ Ananthram Swami 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 737 KB

The system of linear equations A(n)w(n) = b ( n ) , where AOz) is the sample cross-correlation matrix between an observed process and an instrumental variable process and b ( n ) is the cross-correlation vector between some desired process and the instrumental variable process, is frequently encount

Schur-Cohn Sub-transforms of a Polynomia
Schur-Cohn Sub-transforms of a Polynomial
✍ M.Ph.Saux Picart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Considering the exponential growth of the size of the coefficients of the Schur-Cohn transforms of a polynomial, we define new polynomials proportional to the latter and whose coefficients remain small. These Schur-Cohn sub-transforms replace the Schur-Cohn transforms in the computation of the numbe

An algorithmic version of the blow-up le
An algorithmic version of the blow-up lemma
✍ János Komlós; Gabor N. Sarkozy; Endre Szemerédi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up Ž w Ž .x lemma Komlos, Sarkozy, and Szemeredi