Solving Hankel systems over the integers (Q1897568): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jsco.1994.1066 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017981706 / rank | |||
Normal rank | |||
Latest revision as of 21:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Hankel systems over the integers |
scientific article |
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
