A new algorithm for the solution of a polynomial matrix Diophantine equation

DOI10.1016/j.amc.2007.03.076zbMath1193.11029OpenAlexW2006117942MaRDI QIDQ990617

P. A. Tzekis

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.076

zbMATH Keywords

algorithmpolynomial solutionspolynomial matrix Diophantine equation

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Polynomials in number theory (11C08) Linear Diophantine equations (11D04) Matrices, determinants in number theory (11C20)

Related Items

Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method ⋮ Integer Solutions of Matrix Linear Unilateral and Bilateral Equations over Quadratic Rings ⋮ Diophantine approximation over primes with different powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-dimensional linear systems
• The feedback interconnection of lumped linear time-invariant systems
• Diophantine equations in control. -- A survey
• Algebraic theory for robust stability of interconnected systems: Necessary and sufficient conditions
• Stabilization of non-linear systems†
• Disturbance rejection: A polynomial approach
• Fraction representations of non-linear systems: a simplified approach
• n-D polynomial matrix equations
• Feedback system design: The fractional representation approach to analysis and synthesis
• Exact model matching, polynomial equation approach
• Polynomial design of stochastic tracking systems
• The standard ℋ₂-optimal control problem: a polynomial solution
• On the division of polynomial matrices