Constructive D-Module Theory with Singular
Resumen: We overview numerous algorithms in computational D-module theory together with the theoretical background as well as the implementation in the computer algebra system SINGULAR. We discuss new approaches to the computation of Bernstein operators, of logarithmic annihilator of a polynomial, of annihilators of rational functions as well as complex powers of polynomials. We analyze algorithms for local Bernstein–Sato polynomials and also algorithms, recovering any kind of Bernstein–Sato polynomial from partial knowledge of its roots. We address a novel way to compute the Bernstein–Sato polynomial for an affine variety algorithmically. All the carefully selected nontrivial examples, which we present, have been computed with our implementation. We also address such applications as the computation of a zeta-function for certain integrals and revealing the algebraic dependence between pairwise commuting elements.
Idioma: Inglés
DOI: 10.1007/s11786-010-0058-x
Año: 2011
Publicado en: Mathematics in computer science 4 (2011), 359-383
ISSN: 1661-8270

Tipo y forma: Article (PostPrint)

Rights Reserved All rights reserved by journal editor


Exportado de SIDERAL (2024-03-01-14:36:57)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles



 Record created 2024-03-01, last modified 2024-03-01


Postprint:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)