𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving Hankel Systems over the Integers

✍ Scribed by Luca Gemignani

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
351 KB
Volume
18
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

A new algorithm is presented for computing the solution of a Hankel system with integer entries by means of structured matrix techniques. By combining subresultant theory and factorization properties of Hankel matrices, we prove that this algorithm has a Boolean sequential cost which is almost optimal among the algorithms based on fast integer LU factorization.

πŸ“œ SIMILAR VOLUMES

Cyclic Codes over the Integers Modulopm
Cyclic Codes over the Integers Modulopm
✍ Pramod Kanwar; Sergio R. LΓ³pez-Permouth πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 430 KB

The purpose of this paper is twofold. First, we generalize the results of Pless and Qian and those of Pless, Sole Β΄, and Qian for cyclic β€«ήšβ€¬ 4 -codes to cyclic β€«ήšβ€¬ p m -codes. Second, we establish connections between this new development and the results on cyclic β€«ήšβ€¬ p m -codes obtained by Calderban

Sum graphs over all the integers
Sum graphs over all the integers
✍ Frank Harary πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 392 KB

We introduced the sum graph of a set S of positive integers as the graph G+(S) having S as its node set, with two nodes adjacent whenever their sum is in S. Now we study sum graphs over all the integers so that S may contain positive or negative integers on zero. A graph so obtained is called an int

Perfect ideals over the Gaussian integer
Perfect ideals over the Gaussian integers
✍ Miriam Hausman; Harold N. Shapiro πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 664 KB
Matrix fields over the integers modulo m
Matrix fields over the integers modulo m
✍ Jacob T.B. Beard Jr.; Robert M. McConnel πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 622 KB