Recent progress in an algebraic analysis approach to linear systems
D Robertz - Multidimensional Systems and Signal Processing, 2015 - Springer
This paper addresses systems of linear functional equations from an algebraic point of view.
We give an introduction to and an overview of recent work by a small group of people …
We give an introduction to and an overview of recent work by a small group of people …
Applications of the Quillen-Suslin theorem to multidimensional systems theory
A Fabianska, A Quadrat - 2007 - inria.hal.science
The purpose of this paper is to give four new applications of the Quillen-Suslin theorem to
mathematical systems theory. Using a constructive version of the Quillen-Suslin theorem …
mathematical systems theory. Using a constructive version of the Quillen-Suslin theorem …
[KNYGA][B] Formal algorithmic elimination for PDEs
D Robertz - 2014 - books.google.com
Investigating the correspondence between systems of partial differential equations and their
analytic solutions using a formal approach, this monograph presents algorithms to …
analytic solutions using a formal approach, this monograph presents algorithms to …
Algorithmic linearly constrained Gaussian processes
M Lange-Hegermann - Advances in Neural Information …, 2018 - proceedings.neurips.cc
We algorithmically construct multi-output Gaussian process priors which satisfy linear
differential equations. Our approach attempts to parametrize all solutions of the equations …
differential equations. Our approach attempts to parametrize all solutions of the equations …
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 …
and inequations. We decompose these systems into so-called simple subsystems and …
Involutive algorithms for computing Gröbner bases
VP Gerdt - arxiv preprint math/0501111, 2005 - arxiv.org
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of
polynomial ideals. The algorithm is based on the concept of involutive monomial division …
polynomial ideals. The algorithm is based on the concept of involutive monomial division …
An introduction to constructive algebraic analysis and its applications
A Quadrat - Les cours du CIRM, 2010 - ccirm.centre-mersenne.org
An introduction to constructive algebraic analysis and its applications Page 1 Journées
Nationales de Calcul Formel Rencontre organisée par : Jean-Guillaume Dumas, Grégoire …
Nationales de Calcul Formel Rencontre organisée par : Jean-Guillaume Dumas, Grégoire …
Consistency of finite difference approximations for linear PDE systems and its algorithmic verification
In this paper we consider finite difference approximations for numerical solving of systems of
partial differential equations of the form f 1=⊙⊙⊙= fp= 0, where F:={f 1,..., fp} is a set of …
partial differential equations of the form f 1=⊙⊙⊙= fp= 0, where F:={f 1,..., fp} is a set of …
A Maple package for computing Gröbner bases for linear recurrence relations
A Maple package for computing Gröbner bases of linear difference ideals is described. The
underlying algorithm is based on Janet and Janet-like monomial divisions associated with …
underlying algorithm is based on Janet and Janet-like monomial divisions associated with …
Janet's approach to presentations and resolutions for polynomials and linear pdes
W Plesken, D Robertz - Archiv der Mathematik, 2005 - Springer
Janet's algorithm to create normal forms for systems of linear pdes is outlined and used as a
tool to construct resolutions for finitely generated modules over polynomial rings over fields …
tool to construct resolutions for finitely generated modules over polynomial rings over fields …