Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)

DOI10.1007/BF01294834zbMath0765.65049MaRDI QIDQ1205122

Juan Llovet, Juan Rafael Sendra

Publication date: 1 April 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmrational functionsHankel matrixrankmultivariate polynomialspolynomial matrixworst case complexity

Mathematics Subject Classification ID

Matrices over function rings in one or more variables (15A54)

Related Items (1)

Finite-time general function consensus for multi-agent systems over signed digraphs

Cites Work

• Algebraic methods for Toeplitz-like matrices and operators
• An extended polynomial GCD algorithm using Hankel matrices
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• The Calculation of Multivariate Polynomial Resultants
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)