Daniel Andres
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Daniel Andres has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jorge Martín-Morales
Academia General Militar
3 shared publications - Viktor Levandovskyy
RWTH Aachen University
3 shared publications - Hans Schönemann
Department of Mathematics University of Kaiserslautern 67663 Kaiserslautern Germany
2 shared publications - Michael Brickenstein
Mathematisches Forschungsinstitut Oberwolfach
2 shared publications
Latest Publications
- 1 September 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 4 (2-3) , 359-383
Constructive D-Module Theory with Singular
- 1 September 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 4 (2-3) , 359-383
Constructive D-Module Theory with Singular
- Open Access
Constructive $D$-module Theory with \textsc{Singular}
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{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 address such applications as the computation of a zeta-function for certain integrals and revealing the algebraic dependence between pairwise commuting elements.
Open AccessConstructive $D$-module Theory with \textsc{Singular}
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{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 address such applications as the computation of a zeta-function for certain integrals and revealing the algebraic dependence between pairwise commuting elements.
- Open Access
Effective Methods for the Computation of Bernstein-Sato polynomials for Hypersurfaces and Affine Varieties
This paper is the widely extended version of the publication, appeared in Proceedings of ISSAC'2009 conference \citep*{ALM09}. We discuss more details on proofs, present new algorithms and examples. We present a general algorithm for computing an intersection of a left ideal of an associative algebra over a field with a subalgebra, generated by a single element. We show applications of this algorithm in different algebraic situations and describe our implementation in \textsc{Singular}. Among other, we use this algorithm in computational $D$-module theory for computing e. g. the Bernstein-Sato polynomial of a single polynomial with several approaches. We also present a new method, having no analogues yet, for the computation of the Bernstein-Sato polynomial of an affine variety. Also, we provide a new proof of the algorithm by Brian\c{c}on-Maisonobe for the computation of the $s$-parametric annihilator of a polynomial. Moreover, we present new methods for the latter computation as well as optimized algorithms for the computation of Bernstein-Sato polynomial in various settings.
Open AccessEffective Methods for the Computation of Bernstein-Sato polynomials for Hypersurfaces and Affine Varieties
This paper is the widely extended version of the publication, appeared in Proceedings of ISSAC'2009 conference \citep*{ALM09}. We discuss more details on proofs, present new algorithms and examples. We present a general algorithm for computing an intersection of a left ideal of an associative algebra over a field with a subalgebra, generated by a single element. We show applications of this algorithm in different algebraic situations and describe our implementation in \textsc{Singular}. Among other, we use this algorithm in computational $D$-module theory for computing e. g. the Bernstein-Sato polynomial of a single polynomial with several approaches. We also present a new method, having no analogues yet, for the computation of the Bernstein-Sato polynomial of an affine variety. Also, we provide a new proof of the algorithm by Brian\c{c}on-Maisonobe for the computation of the $s$-parametric annihilator of a polynomial. Moreover, we present new methods for the latter computation as well as optimized algorithms for the computation of Bernstein-Sato polynomial in various settings.