An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
DOI10.1016/J.JSC.2022.07.006zbMATH Open1502.13068OpenAlexW4289778754WikidataQ113869793 ScholiaQ113869793MaRDI QIDQ2674009FDOQ2674009
Jingjing Wei, He-Song Wang, Dingkang Wang, Fanghui Xiao
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
Smith normal formextended greatest common right divisorparametric univariate polynomial matrixcomprehensive Gröbner system
Symbolic computation and algebraic computation (68W30) 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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- A new algorithm for computing comprehensive Gröbner systems
- An alternative approach to comprehensive Gröbner bases
- Fraction-free computation of matrix rational interpolants and matrix GCDs
- Algorithms for computing triangular decomposition of polynomial systems
- Algorithmic Thomas decomposition of algebraic and differential systems
- Hybrid rational function approximation and its accuracy analysis
- Three new algorithms for multivariate polynomial GCD
- Finitely Generated Abelian Groups and Similarity of Matrices over a Field
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On the stability of Gröbner bases under specializations
- On the computation of parametric Gröbner bases for modules and syzygies
- Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
- Part I-Smith form and common divisor of polynomial matrices
- New criteria and system theoretic interpretations for relatively prime polynomial matrices
- Systolic VLSI Arrays for Polynomial GCD Computation
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
- Jordan Canonical Form with Parameters from Frobenius Form with Parameters
- An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
Uses Software
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)
