An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form

DOI10.1145/3373207.3404019OpenAlexW3045647318MaRDI QIDQ5146007

Fanghui Xiao, Ding-Kang Wang, He-Song Wang

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373207.3404019

zbMATH Keywords

Smith normal formcomprehensive Gröbner systemextended greatest common divisorparametric univariate polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form

Uses Software

• PGB

This page was built for publication: An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form