Solving Hankel systems over the integers
From MaRDI portal
Publication:1897568
DOI10.1006/jsco.1994.1066zbMath0830.15015MaRDI QIDQ1897568
Publication date: 4 September 1995
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1994.1066
algorithm; factorization; LU factorization; Hankel matrices; matrices of integers; Hankel system; subresultant theory
65F05: Direct numerical methods for linear systems and matrix inversion
15B36: Matrices of integers
15A06: Linear equations (linear algebraic aspects)
Related Items
Sylvester-Habicht sequences and fast Cauchy index computation, A fast iterative method for determining the stability of a polynomial, A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials, Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation, Symmetric subresultants and applications