Solving linear systems with polynomial coefficients in Sage
Sprache des Vortragstitels:
Groebner Bases, Resultants, and Linear Algebra
Sprache des Tagungstitel:
In several algorithms for recurrences and differential equations, the runtime bottleneck is the computation of a nullspace vector for a matrix with polynomial entries. The matrices arising from such algorithms are not generic, but not very structured either. We present a Sage implementation of several algorithms for computing the nullspace of polynomial matrices and say some words on our experience with their respective performance on matrices we are interested in.