Related papers: The complexity and geometry of numerically solving…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…
The objective of this paper is to investigate the existence and the forms of the pair of finite order entire and meromorphic solutions of some certain systems of Fermat-type partial differential-difference equations of several complex…
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
The paper concerns numerical algorithms for solving the Beltrami equation $f_{\bar{z}}(z)=\mu(z) f_z(z)$ for a compactly supported $\mu$. First, we study an efficient algorithm that has been proposed in the literature, and present its…
We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and…
Synthesis problems for linkages in kinematics often yield large structured parameterized polynomial systems which generically have far fewer solutions than traditional upper bounds would suggest. This paper describes statistical models for…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
This paper is devoted to the study of reflected Stochastic Differential Equations when the constraint is not on the paths of the solution but acts on the law of the solution. These reflected equations have been introduced recently by…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
This book, by Molero, Juiz, and Rodeno, titled Performance Evaluation and Modeling of Computer Systems, presents a comprehensive summary of simple quantitative techniques that help answer the above questions. Its approach is not one of…
Boris Shapiro and Michael Shapiro have a conjecture concerning the Schubert calculus and real enumerative geometry and which would give infinitely many families of zero-dimensional systems of real polynomials (including families of…