Matrix computation of subresultant polynomial remainder sequences in integral domains

DOI10.1007/BF02391682zbMath0848.65032MaRDI QIDQ1904349

Gennadi I. Malaschonok, Alkiviadis G. Akritas, Evgenia K. Akritas

Publication date: 1 February 1996

Published in: Reliable Computing (Search for Journal in Brave)

zbMATH Keywords

greatest common divisorpolynomialsmatrix-triangularization subresultant polynomial remainder sequences method

Mathematics Subject Classification ID

Related Items (2)

On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Various proofs of Sylvester's (determinant) identity.

Cites Work

• Unnamed Item
• Unnamed Item
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Compact Computation of the Inverse of a Matrix

This page was built for publication: Matrix computation of subresultant polynomial remainder sequences in integral domains