Computational algebraic geometry applies algorithmic techniques to problems in algebraic geometry, focusing on the effective manipulation of polynomial ideals and the algebraic varieties they define.
Polynomial matrices, whose entries are univariate or multivariate polynomials, furnish a powerful algebraic framework for the analysis and control of linear systems. By extending classical matrix ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results