Some algorithmic aspects of the D-module theory

Toshinori Oaku
Additional contact information
Toshinori Oaku: Yokohama City University, Department of Mathematical Sciences

A chapter in New Trends in Microlocal Analysis, 1997, pp 205-223 from Springer

Abstract: Abstract We consider D-modules from an algorithmic point of view. Our aim is to present algorithms for computing some invariants attached to a D-module, such as the characteristic variety, the multiplicity, the b-function (or exponents), and the induced system. In particular, we obtain algorithms for computing the classical b-function (Bernstein-Sato polynomial) and D-modules associated with an arbitrary polynomial.

Keywords: Left Ideal; Computer Algebra System; Principal Symbol; Monic Polynomial; Free Resolution (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-4-431-68413-8_17

Ordering information: This item can be ordered from
http://www.springer.com/9784431684138

DOI: 10.1007/978-4-431-68413-8_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().