Related papers: The multivariate Hermite method for counting real …
We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We present a proof procedure for univariate real polynomial problems in Isabelle/HOL. The core mathematics of our procedure is based on univariate cylindrical algebraic decomposition. We follow the approach of untrusted certificates,…
The \texttt{StronglyStableIdeals} package for \textit{Macaulay2} provides a method to compute all saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. A description of the main method and auxiliary…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…
This paper offers a review of numerical methods for computation of the eigenvalues of Hermitian matrices and the singular values of general and some classes of structured matrices. The focus is on the main principles behind the methods that…
We consider resultant-based methods for elimination of indeterminates of Ore polynomial systems in Ore algebra. We start with defining the concept of resultant for bivariate Ore polynomials then compute it by the Dieudonne determinant of…
In this paper, based on the homotopy continuation method and the interval Newton method, an efficient algorithm is introduced to isolate the real roots of semi-algebraic system. Tests on some random examples and a variety of problems…
Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F. Our techniques…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
We provide, in a 474 pages study, a comprehensive and self-contained treatment of Resultant Theory for a homogeneous system of polynomials with several variables (as many variables as of polynomials). In a non classical way, we use the…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose two algorithms LZ1 and LZ2 to refine real roots of univariate…
Multiple Hermite polynomials are an extension of the classical Hermite polynomials for which orthogonality conditions are imposed with respect to $r>1$ normal (Gaussian) weights $w_j(x)=e^{-x^2+c_jx}$ with different means $c_j/2$, $1 \leq j…
A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…