This text is an extension of lectures notes I prepared for les Journées Nationales de Calcul Formel held at the CIRM, Luminy (France) on May 3-7, 2010. The main purpose of these lectures was to introduce the French community of symbolic computation to the constructive approach to algebraic analysis and particularly to algebraic D-modules, its...
-
July 27, 2010 (v1)ReportUploaded on: April 5, 2025
-
2006 (v1)Conference paper
No description
Uploaded on: April 5, 2025 -
2007 (v1)Report
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, also known as Serre's conjecture, we show how to effectively compute flat outputs and injective parametrizations of flat multidimensional linear systems. We prove...
Uploaded on: April 5, 2025 -
2005 (v1)Report
A well-known result due to J. T. Stafford asserts that a stably free left module $M$ over the Weyl algebras $D=A_n(k)$ or $B_n(k)$ $-$ where $k$ is a field of characteristic $0$ $-$ with $rank_D(M) \geq2$ is free. The purpose of this paper is to present a new constructive proof of this result as well as an effective algorithm for the...
Uploaded on: April 5, 2025 -
February 24, 2010 (v1)Report
Serre's reduction aims at reducing the number of unknowns and equations of a linear functional system (e.g., system of partial differential equations, system of differential time-delay equations, system of difference equations). Finding an equivalent representation of a linear functional system containing fewer equations and fewer unknowns...
Uploaded on: April 5, 2025 -
2007 (v1)Report
Within an algebraic analysis approach, the purpose of the paper is to constructively solve the following problem: given two fixed multidimensional linear systems $S_1$ and $S_2$, parametrize the multidimensional linear systems $S$ which contain $S_1$ as a subsystem and satisfy that $S/S_1$ is isomorphic to $S_2$. In order to study this problem,...
Uploaded on: April 5, 2025 -
2006 (v1)Report
Within a constructive homological algebra approach, we study the factorization and decomposition problems for general linear functional systems (determined, under-determined, over-determined). Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we...
Uploaded on: April 5, 2025 -
2008 (v1)Journal article
International audience
Uploaded on: April 5, 2025 -
2004 (v1)Report
In this paper, we study linear control systems over Ore algebras. Within this mathematical framework, we can simultaneously deal with different classes of linear control systems such as time-varying systems of ordinary differential equations (ODEs), differential time-delay systems, underdetermined systems of partial differential equations...
Uploaded on: April 5, 2025 -
2012 (v1)Publication
Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov...
Uploaded on: December 3, 2022 -
May 4, 2012 (v1)Report
The purpose of this work is to show how algebraic and symbolic techniques such as Smith normal forms and Gröbner basis techniques can be used to develop new Schwarz-like algorithms and preconditioners for linear systems of partial differential equations
Uploaded on: December 3, 2022 -
February 7, 2011 (v1)Conference paper
International audience
Uploaded on: February 22, 2023 -
February 7, 2011 (v1)Conference paper
International audience
Uploaded on: December 3, 2022 -
2013 (v1)Book section
Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov...
Uploaded on: December 2, 2022 -
2013 (v1)Book section
Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov...
Uploaded on: October 11, 2023