Solving Hankel systems over the integers
type: Item
instance of: scholarly article
title: Solving Hankel systems over the integers
zbMATH Open document ID: 0830.15015
published in: Journal of Symbolic Computation
publication date: 1995-09-04T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 15B36
Mathematics Subject Classification ID: 15A06
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 792843
zbMATH Keywords: matrices of integers
zbMATH Keywords: algorithm
zbMATH Keywords: Hankel system
zbMATH Keywords: subresultant theory
zbMATH Keywords: factorization
zbMATH Keywords: Hankel matrices
zbMATH Keywords: LU factorization
author: L. Gemignani
reviewed by: Rodica Covaci
MaRDI profile type: Publication
full work available at URL: jsco.1994.1066
OpenAlex ID: W2017981706
DOI: 10.1006/JSCO.1994.1066
description: scientific article; zbMATH DE number 792843