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

DOI10.1016/J.JSC.2022.07.006MaRDI QIDQ2674009zbMATH OpenOpenAlexWikidataFDO

Authors Dingkang Wang, Jingjing Wei, Fanghui Xiao, He-Song Wang

Publication date 22 September 2022

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2022.07.006

zbMATH Keywords

comprehensive Gröbner systemextended greatest common right divisorparametric univariate polynomial matrixSmith normal form

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Matrices over function rings in one or more variables (15A54) Symbolic computation and algebraic computation (68W30)

Review text

This paper (extension of [\textit{T. Kailath}, Linear systems. Englewood Cliffs, N.J.: Prentice-Hall, Inc. (1980; Zbl 0454.93001)]) introduces an algorithm for computing the extended GCRD of parametric univariate matrices.This entails a discussion of parameters such that for each different value, there is a GCRD. Sections 2 and 3 introduce the problem for univariate polynomial matrices. As one can expect, the computation of GCRD implies the computing a minimal Gröbner basis for the submodule generated by the rows of the given matrices (see Theorems 9 and 10); furthermore, the computation of such a minimal basis allows to develop another algorithm for computed the extended GCRD (see Theorem 12). Section 4 introduce the new contributions. The authors extend the ideas introduced in Section 3, in order to compute the extended GCRD of parametric univariate matrices. Logically, usual Gröbner bases must be replaced by comprehensive Gröbner systems which provide the discussion of parameters. Finally, Section 5 introduced the computation of Smith normal form.

Recommendations

• Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
• Minimal polynomial systems for parametric matrices
• An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
• Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
• Algorithms for computing greatest common divisors of parametric multivariate polynomials

Cites work

• A new algorithm for computing comprehensive Gröbner systems
• A new algorithm for discussing Gröbner bases with parameters.
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• A speed-up of the algorithm for computing comprehensive Gröbner systems
• Algorithmic Thomas decomposition of algebraic and differential systems
• Algorithms for computing triangular decomposition of polynomial systems
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• An alternative approach to comprehensive Gröbner bases
• An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
• An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
• An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
• Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
• Comprehensive Gröbner bases
• Finitely Generated Abelian Groups and Similarity of Matrices over a Field
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 41286 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 1263314 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 3388871 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)
• Hybrid rational function approximation and its accuracy analysis
• Jordan canonical form with parameters from Frobenius form with parameters
• New criteria and system theoretic interpretations for relatively prime polynomial matrices
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On the computation of parametric Gröbner bases for modules and syzygies
• On the stability of Gröbner bases under specializations
• Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
• Part I-Smith form and common divisor of polynomial matrices
• Systolic VLSI Arrays for Polynomial GCD Computation
• Three new algorithms for multivariate polynomial GCD

Cited in

(3)

• Minimal polynomial systems for parametric matrices
• An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
• Revisiting the Matrix Polynomial Greatest Common Divisor

Describes a project that uses

Uses Software

• DifferentialThomas
• PGB

This page was built for publication: An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674009)