Certified Hermite matrices from approximate roots
نویسندگان
چکیده
Let I=〈f1,…,fm〉⊂Q[x1,…,xn] be a zero dimensional radical ideal defined by polynomials given with exact rational coefficients. Assume that we are approximations {z1,…,zk}⊂Cn for the common roots {ξ1,…,ξk}=V(I)⊆Cn. In this paper show how to construct and certify entries of Hermite matrices I from approximate {z1,…,zk}. When is non-radical, give methods roots. Furthermore, use signatures these certificates non-negativity polynomial over (possibly positive dimensional) real variety, as well there root within an ε distance point z∈Qn.
منابع مشابه
On Approximate Hermite–hadamard Type Inequalities
The main results of this paper offer sufficient conditions in order that an approximate lower Hermite–Hadamard type inequality implies an approximate Jensen convexity property. The key for the proof of the main result is a Korovkin type theorem.
متن کاملMultiple Roots and Approximate GCDs
The pejorative manifold was defined by Kahan in 1972. While multiple roots of a polynomial are naturally ill conditioned, we have that: if we know the multiplicities of the roots, then the roots are well conditioned. Consider a polynomial p with k distinct roots zi, the ith root has multiplicity mi, for i = 1, 2, . . . , k. The degree n of p is then the sum of multiplicities: n = m1 +m2 + · · ·...
متن کاملApproximate Roots in Graded Rings
An approximate root of an univariate polynomial over a graded ring A is an element in A for which the evaluated polynomial vanishes up to a prescribed order. We give an algorithm for deciding existence of approximate roots and computing essentially all of them. Based on this algorithm we also suggest a finite representation for multivariate algebraic power series.
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملRoots Multiplicity without Companion Matrices
We show a method for constructing a polynomial interpolating roots’ multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig– Szechtman square-free decomposition algorithm that is more efficient both in theory and in practice. The problem of computing the square-free decomposition of a polynomial is well established in the realm of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2023
ISSN: ['1095-855X', '0747-7171']
DOI: https://doi.org/10.1016/j.jsc.2022.12.001