Title of article
Good bases for tame polynomials
Author/Authors
Trude Heift and Mathias Schulze، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
24
From page
103
To page
126
Abstract
An algorithm to compute a good basis of the Brieskorn lattice of a cohomologically tame polynomial is described. This algorithm is based on the results of C. Sabbah and generalizes the algorithm by A. Douai for convenient Newton non-degenerate polynomials.
Keywords
Tame polynomial , Brieskorn lattice , V-filtration , Gauss–Manin system , Monodromy , Mixed Hodge structure , Good basis
Journal title
Journal of Symbolic Computation
Serial Year
2005
Journal title
Journal of Symbolic Computation
Record number
805826
Link To Document