Alban Quadrat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alban Quadrat has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Cluzeau
Univ. Limoges, CNRS, XLIM, UMR 7252, F-87000 Limoges, France
9 shared publications Thomas Cluzeau
4 shared publications- Camille Pinto
Sorbonne Université, Inria Paris, PARIS, France
3 shared publications Yacine Bouzidi
Inria Lille – Nord Europe
3 shared publicationsCamille Pinto
2 shared publications- Fabrice Rouillier
HSE University Moscow Russia
2 shared publications
Latest Publications
- 15 June 2026
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 138
The ring of polynomial ordinary integro-differential operators is an effective Cramer ring
- 15 June 2026
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 138
The ring of polynomial ordinary integro-differential operators is an effective Cramer ring
- Open Access
- 4 February 2026
- Published by Elsevier in SSRN Electronic Journal
The ring of polynomial ordinary integro-differential operators is an effective Cramer ring
Bavula proved in \cite{Bavula2013} that the ring I_1(k) of polynomial ordinary integro-differential operators over a field k of characteristic zero is coherent in the sense that every left/right kernel of every finite rectangular matrix with entries in I_1(k) is a finitely generated left/right I_1(k)-modules. Unfortunately, his proof is not algorithmic. This paper gives an algorithmic proof of the coherence of I_1(k). We show that the kernel computation can be reduced to a kernel computation in the ring of skew Laurent polynomials B_1(k) = k[H] < sigma, sigma^{-1} | sigma H = (H + 1) sigma, sigma^{-1} H = (H -1) sigma^{-1} > = I_1(k) / < e > -- where < e > is the only two-sided ideal of I_1(k) defined by the evaluation operators -- and the computation of polynomial solutions of linear polynomial integro-differential systems. These two problems are shown to be effective. We also prove that I_1(k) is an effective Cramer ring (i.e., a computable ring \cite{Barakat,Posur} or a coherent strongly discrete ring \cite{Mines-Richman-Ruitenburg}) in the sense that the solutions of every linear system of the form A X = Y or X A = Y, where A and Y are two fixed rectangular matrices with entries in I_1(k), can be parametrized effectively. The algorithmic proof of the coherence (respectively, the Cramer property) of I_1(k) allows us to develop an algorithmic elimination theory (respectively, an effective homological algebra) for linear systems of polynomial integro-differential equations with separable polynomial kernels. Finally, the algorithms given here are implemented in a Maple package called Bavula.
- 4 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe ring of polynomial ordinary integro-differential operators is an effective Cramer ring
Bavula proved in \cite{Bavula2013} that the ring I_1(k) of polynomial ordinary integro-differential operators over a field k of characteristic zero is coherent in the sense that every left/right kernel of every finite rectangular matrix with entries in I_1(k) is a finitely generated left/right I_1(k)-modules. Unfortunately, his proof is not algorithmic. This paper gives an algorithmic proof of the coherence of I_1(k). We show that the kernel computation can be reduced to a kernel computation in the ring of skew Laurent polynomials B_1(k) = k[H] < sigma, sigma^{-1} | sigma H = (H + 1) sigma, sigma^{-1} H = (H -1) sigma^{-1} > = I_1(k) / < e > -- where < e > is the only two-sided ideal of I_1(k) defined by the evaluation operators -- and the computation of polynomial solutions of linear polynomial integro-differential systems. These two problems are shown to be effective. We also prove that I_1(k) is an effective Cramer ring (i.e., a computable ring \cite{Barakat,Posur} or a coherent strongly discrete ring \cite{Mines-Richman-Ruitenburg}) in the sense that the solutions of every linear system of the form A X = Y or X A = Y, where A and Y are two fixed rectangular matrices with entries in I_1(k), can be parametrized effectively. The algorithmic proof of the coherence (respectively, the Cramer property) of I_1(k) allows us to develop an algorithmic elimination theory (respectively, an effective homological algebra) for linear systems of polynomial integro-differential equations with separable polynomial kernels. Finally, the algorithms given here are implemented in a Maple package called Bavula.
- Open Access
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 178-187
An algorithmic proof of the coherence of the ring of polynomial ordinary integro-differential operators
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 178-187
Open AccessAn algorithmic proof of the coherence of the ring of polynomial ordinary integro-differential operators
- Open Access
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 169-177
Polynomial solutions for general linear polynomial ordinary integro-differential systems
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 169-177
Open AccessPolynomial solutions for general linear polynomial ordinary integro-differential systems
- 5 June 2025
- Published by Springer Nature in Mathematics of Control, Signals, and Systems
- p. 1-39
On a general robust stability test based on the homological perturbation lemma
- 5 June 2025
- Published by Springer Nature in Mathematics of Control, Signals, and Systems
- p. 1-39
On a general robust stability test based on the homological perturbation lemma
- Open Access
Symbolic and Numerical Tools for $L_{\infty}$-Norm Calculation
The computation of the $L_\infty $-norm is an important issue in $H_{\infty}$ control, particularly for analyzing system stability and robustness. This paper focuses on symbolic computation methods for determining the $L_{\infty} $-norm of finite-dimensional linear systems, highlighting their advantages in achieving exact solutions where numerical methods often encounter limitations. Key techniques such as Sturm-Habicht sequences, Rational Univariate Representations (RUR), and Cylindrical Algebraic Decomposition (CAD) are surveyed, with an emphasis on their theoretical foundations, practical implementations, and specific applicability to $ L_{\infty} $-norm computation. A comparative analysis is conducted between symbolic and conventional numerical approaches, underscoring scenarios in which symbolic computation provides superior accuracy, particularly in parametric cases. Benchmark evaluations reveal the strengths and limitations of both approaches, offering insights into the trade-offs involved. Finally, the discussion addresses the challenges of symbolic computation and explores future opportunities for its integration into control theory, particularly for robust and stable system analysis.Open AccessSymbolic and Numerical Tools for $L_{\infty}$-Norm Calculation
The computation of the $L_\infty $-norm is an important issue in $H_{\infty}$ control, particularly for analyzing system stability and robustness. This paper focuses on symbolic computation methods for determining the $L_{\infty} $-norm of finite-dimensional linear systems, highlighting their advantages in achieving exact solutions where numerical methods often encounter limitations. Key techniques such as Sturm-Habicht sequences, Rational Univariate Representations (RUR), and Cylindrical Algebraic Decomposition (CAD) are surveyed, with an emphasis on their theoretical foundations, practical implementations, and specific applicability to $ L_{\infty} $-norm computation. A comparative analysis is conducted between symbolic and conventional numerical approaches, underscoring scenarios in which symbolic computation provides superior accuracy, particularly in parametric cases. Benchmark evaluations reveal the strengths and limitations of both approaches, offering insights into the trade-offs involved. Finally, the discussion addresses the challenges of symbolic computation and explores future opportunities for its integration into control theory, particularly for robust and stable system analysis. - Open Access
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 117-125
Effective characterization of evaluation ideals of the ring of integro-differential operators
This paper provides a step forward to developing an algorithmic study of linear systems of polynomial ordinary integro-differential equations over a field Math 1 of characteristic zero. Such a study can be achieved by first obtaining a constructive proof of the coherence property of the ring Math 2 of linear ordinary integro-differential operators with coefficients in Math 3. To do that, the finiteness of the intersection of two finitely generated ideals has to be algorithmically studied. Three cases must be considered: first when evaluation operators generate the two ideals; second, when only one ideal is generated by evaluation operators; and third, when none is generated by evaluation operators. In this paper, we first explicitly characterize the intersection of two finitely generated ideals defined by evaluation operators. As for the second case, a key result is that the ideals generated by evaluations are semisimple Math 4-modules. We develop an algorithmic proof of this result. In particular, we show how a finite set of generators, defined by “simple” evaluations, can be obtained, that characterizes the class of finitely generated evaluation ideals of Math 5 as finitely generated Math 6-modules. Due to lack of space, the second and third cases will be developed in other publications.
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 117-125
Open AccessEffective characterization of evaluation ideals of the ring of integro-differential operators
This paper provides a step forward to developing an algorithmic study of linear systems of polynomial ordinary integro-differential equations over a field Math 1 of characteristic zero. Such a study can be achieved by first obtaining a constructive proof of the coherence property of the ring Math 2 of linear ordinary integro-differential operators with coefficients in Math 3. To do that, the finiteness of the intersection of two finitely generated ideals has to be algorithmically studied. Three cases must be considered: first when evaluation operators generate the two ideals; second, when only one ideal is generated by evaluation operators; and third, when none is generated by evaluation operators. In this paper, we first explicitly characterize the intersection of two finitely generated ideals defined by evaluation operators. As for the second case, a key result is that the ideals generated by evaluations are semisimple Math 4-modules. We develop an algorithmic proof of this result. In particular, we show how a finite set of generators, defined by “simple” evaluations, can be obtained, that characterizes the class of finitely generated evaluation ideals of Math 5 as finitely generated Math 6-modules. Due to lack of space, the second and third cases will be developed in other publications.
- Open Access
- 28 June 2024
- Published by University of Western Ontario, Western Libraries in Maple Transactions
- Vol. 4 (1)
L^infinity-norm computation for linear time-invariant systems depending on parameters
This paper focuses on representing the L∞-norm of finite-dimensional linear time-invariant systems with parameter-dependent coefficients. Previous studies tackled the problem in a non-parametric scenario by simplifying it to finding the maximum y-projection of real solutions (x, y) of a system of the form Sigma = {P=0, dP/dx=0}, where P is in Z[x, y]. To solve this problem, standard computer algebra methods were employed and analyzed. In this paper, we extend our approach to address the parametric case. We aim to represent the ````"maximal" y-projection of real solutions of Sigma as a function of the given parameters.To accomplish this, we utilize cylindrical algebraic decomposition. This method allows us to determine the desired value as a function of the parameters within specific regions of parameter space.
- 28 June 2024
- Published by University of Western Ontario, Western Libraries in Maple Transactions
- Vol. 4 (1)
Open AccessL^infinity-norm computation for linear time-invariant systems depending on parameters
This paper focuses on representing the L∞-norm of finite-dimensional linear time-invariant systems with parameter-dependent coefficients. Previous studies tackled the problem in a non-parametric scenario by simplifying it to finding the maximum y-projection of real solutions (x, y) of a system of the form Sigma = {P=0, dP/dx=0}, where P is in Z[x, y]. To solve this problem, standard computer algebra methods were employed and analyzed. In this paper, we extend our approach to address the parametric case. We aim to represent the ````"maximal" y-projection of real solutions of Sigma as a function of the given parameters.To accomplish this, we utilize cylindrical algebraic decomposition. This method allows us to determine the desired value as a function of the parameters within specific regions of parameter space.
- Open Access
${L}^{\infty}$-norm computation for linear time-invariant systems depending on parameters
This paper focuses on representing the $L^{\infty}$-norm of finite-dimensional linear time-invariant systems with parameter-dependent coefficients. Previous studies tackled the problem in a non-parametric scenario by simplifying it to finding the maximum $y$-projection of real solutions $(x, y)$ of a system of the form $Σ=\{P=0, \, \partial P/\partial x=0\}$, where $P \in \Z[x, y]$. To solve this problem, standard computer algebra methods were employed and analyzed \cite{bouzidi2021computation}. In this paper, we extend our approach to address the parametric case. We aim to represent the "maximal" $y$-projection of real solutions of $Σ$ as a function of the given parameters. %a set of parameters $α$. To accomplish this, we utilize cylindrical algebraic decomposition. This method allows us to determine the desired value as a function of the parameters within specific regions of parameter space.Open Access${L}^{\infty}$-norm computation for linear time-invariant systems depending on parameters
This paper focuses on representing the $L^{\infty}$-norm of finite-dimensional linear time-invariant systems with parameter-dependent coefficients. Previous studies tackled the problem in a non-parametric scenario by simplifying it to finding the maximum $y$-projection of real solutions $(x, y)$ of a system of the form $Σ=\{P=0, \, \partial P/\partial x=0\}$, where $P \in \Z[x, y]$. To solve this problem, standard computer algebra methods were employed and analyzed \cite{bouzidi2021computation}. In this paper, we extend our approach to address the parametric case. We aim to represent the "maximal" $y$-projection of real solutions of $Σ$ as a function of the given parameters. %a set of parameters $α$. To accomplish this, we utilize cylindrical algebraic decomposition. This method allows us to determine the desired value as a function of the parameters within specific regions of parameter space. - Open Access
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 182-190
Further results on the computation of the annihilators of integro-differential operators
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 182-190
Open AccessFurther results on the computation of the annihilators of integro-differential operators