An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
From MaRDI portal
Publication:2674009
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
- 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?)
- 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 Hermite and Smith Normal Matrices and Linear Diophantine Equations
- Algorithms for computing triangular decomposition of polynomial systems
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- An alternative approach to comprehensive Gröbner bases
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- 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
- 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
(2)
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)
