Daniel Robertz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Daniel Robertz has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir P. Gerdt
Joint Institute for Nuclear Research
5 shared publications - A. Quadrat
CAFE project
2 shared publications - Markus Lange-Hegermann
Lehrstuhl B für Mathematik, RWTH Aachen University, Aachen, Germany
2 shared publications - Mohamed Barakat
Aix-Marseille Université, Saint-Paul-lez-Durance, F-13108, France
2 shared publications - Thomas Bächler
Lehrstuhl B für Mathematik RWTH-Aachen University Templergraben 64 52062 Aachen Germany
2 shared publications - Wilhelm Plesken
Lehrstuhl B für Mathematik, RWTH Aachen University, Aachen, Germany
2 shared publications
Latest Publications
- Open Access
Computation of Difference Groebner Bases
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the package. Its applications are illustrated by generation of finite difference approximations to linear partial differential equations and by reduction of Feynman integrals. We also present the algorithm for an ideal generated by a finite set of nonlinear difference polynomials. If the algorithm terminates, then it constructs a Groebner basis of the ideal.
Open AccessComputation of Difference Groebner Bases
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the package. Its applications are illustrated by generation of finite difference approximations to linear partial differential equations and by reduction of Feynman integrals. We also present the algorithm for an ideal generated by a finite set of nonlinear difference polynomials. If the algorithm terminates, then it constructs a Groebner basis of the ideal.
- Open Access
Algorithmic Thomas Decomposition of Algebraic and Differential Systems
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.
Open AccessAlgorithmic Thomas Decomposition of Algebraic and Differential Systems
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.
- 1 September 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 4 (2-3) , 231-242
Linear Differential Elimination for Analytic Functions
- 1 September 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 4 (2-3) , 231-242
Linear Differential Elimination for Analytic Functions
- Open Access
Thomas Decomposition of Algebraic and Differential Systems
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple.
Open AccessThomas Decomposition of Algebraic and Differential Systems
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple.
- 17 October 2009
- Published by Springer Nature in Archiv der Mathematik
- Vol. 93 (5) , 445-449
The average number of cycles
- 17 October 2009
- Published by Springer Nature in Archiv der Mathematik
- Vol. 93 (5) , 445-449
The average number of cycles
- Open Access
Homalg: A meta-package for homological algebra
The central notion of this work is that of a functor between categories of finitely presented modules over so-called computable rings, i.e. rings R where one can algorithmically solve inhomogeneous linear equations with coefficients in R. The paper describes a way allowing one to realize such functors, e.g. Hom, tensor product, Ext, Tor, as a mathematical object in a computer algebra system. Once this is achieved, one can compose and derive functors and even iterate this process without the need of any specific knowledge of these functors. These ideas are realized in the ring independent package homalg. It is designed to extend any computer algebra software implementing the arithmetics of a computable ring R, as soon as the latter contains algorithms to solve inhomogeneous linear equations with coefficients in R. Beside explaining how this suffices, the paper describes the nature of the extensions provided by homalg.
Open AccessHomalg: A meta-package for homological algebra
The central notion of this work is that of a functor between categories of finitely presented modules over so-called computable rings, i.e. rings R where one can algorithmically solve inhomogeneous linear equations with coefficients in R. The paper describes a way allowing one to realize such functors, e.g. Hom, tensor product, Ext, Tor, as a mathematical object in a computer algebra system. Once this is achieved, one can compose and derive functors and even iterate this process without the need of any specific knowledge of these functors. These ideas are realized in the ring independent package homalg. It is designed to extend any computer algebra software implementing the arithmetics of a computable ring R, as soon as the latter contains algorithms to solve inhomogeneous linear equations with coefficients in R. Beside explaining how this suffices, the paper describes the nature of the extensions provided by homalg.
- Open Access
Conley: Computing connection matrices in Maple
In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition and for the computation of such matrices. We introduce the notion of triangles that suffices to state the definition of (C)-connection matrices. The notion of octahedra, which is equivalent to that of braids is also introduced.
Open AccessConley: Computing connection matrices in Maple
In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition and for the computation of such matrices. We introduce the notion of triangles that suffices to state the definition of (C)-connection matrices. The notion of octahedra, which is equivalent to that of braids is also introduced.
- 17 November 2005
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 16 (5) , 319-376
Effective algorithms for parametrizing linear control systems over Ore algebras
- 17 November 2005
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 16 (5) , 319-376
Effective algorithms for parametrizing linear control systems over Ore algebras
- Open Access
A Maple Package for Computing Groebner Bases for Linear Recurrence Relations
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two possible applications are illustrated by simple examples of the Laplace equation and a one-loop scalar integral of propagator type
Open AccessA Maple Package for Computing Groebner Bases for Linear Recurrence Relations
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two possible applications are illustrated by simple examples of the Laplace equation and a one-loop scalar integral of propagator type