Solving linear systems with polynomial coefficients in Sage

Description

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.

Period	04 Sept 2013
Event title	Groebner Bases, Resultants, and Linear Algebra
Event type	Conference
Location	AustriaShow on map