Solving Hankel systems over the integers (Q1897568)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 792843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Hankel systems over the integers |
scientific article; zbMATH DE number 792843 |
Statements
Solving Hankel systems over the integers (English)
0 references
4 September 1995
0 references
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, the author proves that this algorithm has a Boolean sequential cost which is almost optimal among the algorithms based on fast integer LU factorization.
0 references
matrices of integers
0 references
algorithm
0 references
Hankel system
0 references
subresultant theory
0 references
factorization
0 references
Hankel matrices
0 references
LU factorization
0 references
0.8030105233192444
0 references
0.8012717962265015
0 references
