Horner Systems: How to efficiently evaluate non-commutative polynomials (by matrices)

Publication date 3 October 2019

Computational aspects of associative rings (general theory) (16Z05) Functions whose values are linear operators (operator- and matrix-valued functions, etc., including analytic and meromorphic ones) (47A56) Symbolic computation and algebraic computation (68W30)

Abstract: By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner systems (which has parallels to that of companion matrices), discuss their construction and show how they enable the efficient evaluation of non-commutative polynomials by matrices.

This page was built for publication: Horner Systems: How to efficiently evaluate non-commutative polynomials (by matrices)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326472)