Asymptotically fast polynomial matrix algorithms for multivariable systems

DOI10.1080/00207170600726477zbMath1133.93319arXivcs/0508113OpenAlexW2036099196MaRDI QIDQ5423851

Claude-Pierre Jeannerod, Gilles Villard

Publication date: 31 October 2007

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0508113

zbMATH Keywords

symbolic algebrabasic problems on univariate polynomial matricespolynomial matrix manipulations

Mathematics Subject Classification ID

Multivariable systems, multidimensional control systems (93C35)

Related Items

A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Simple forms of higher-order linear differential systems and their applications in computing regular solutions ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ Special issue on the use of computer algebra systems for computer aided control system design

Cites Work

• Unnamed Item
• On fast multiplication of polynomials over arbitrary algebras
• Essentially optimal computation of the inverse of generic polynomial matrices
• On the complexity of computing determinants
• Polynomial evaluation and interpolation on special sets of points
• Normal forms for general polynomial matrices
• Fast computation of continued fraction expansions.
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Minimal Degree Coprime Factorization of Rational Matrices