We propose three floating-point validated algorithms to compute respectively fast inversion, Euclidean division and Hensel lifting over $$\mathbb {C}[[x]][y]$$. This is the second step (after Bréhard, Poteaux and Soudant in ISSAC 2023) towards a validated numerical Newton–Puiseux algorithm, and will also be useful towards a validated OM-algorithm over $$\mathbb {C}[[x]][y]$$. Our strategy is simply to first compute a floating-point approximation using the classical algorithm, then to a posteriori validate the result using a Newton-like fixed-point operator. We also provide a prototype Julia implementation of these algorithms and several examples.
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...