Minimal polynomial systems for parametric matrices
From MaRDI portal
Recommendations
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Minimal canonical comprehensive Gröbner systems
- On the computation of the minimal polynomial of a polynomial matrix
- scientific article; zbMATH DE number 1960344
- Gröbner bases for polynomial systems with parameters
Cites work
- A new algorithm for discussing Gröbner bases with parameters.
- An alternative approach to comprehensive Gröbner bases
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Canonical comprehensive Gröbner bases
- Comprehensive Gröbner bases
- Eigenvalue range determination for interval and parametric matrices
- Gröbner bases for polynomial systems with parameters
- Improving the DISPGB algorithm using the discriminant ideal
- Minimal canonical comprehensive Gröbner systems
- To solving inverse eigenvalue problems for parametric matrices
Cited in
(7)- Gröbner systems conversion
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- A package for parametric matrix computations
- Parametric FGLM algorithm
- A parametric \(\mathrm{F}_4\) algorithm
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- An algorithm for minimal generating set of parametric homogeneous polynomial ideals
This page was built for publication: Minimal polynomial systems for parametric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908175)
