Some examples for solving systems of algebraic equations by calculating groebner bases
Journal of Symbolic Computation
Root neighborhoods of a polynomial
Mathematics of Computation
Risa/Asir—a computer algebra system
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
An algorithm to compute floating point Gro¨bner bases
Proceedings of the Maple summer workshop and symposium on Mathematical computation with Maple V : ideas and applications: ideas and applications
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Efficient algorithms for computing the nearest polynomial with constrained roots
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On approximate GCDs of univariate polynomials
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Remarks on automatic algorithm stabilization
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Efficient algorithms for computing the nearest polynomial with a real root and related problems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
The nearest polynomial with a given zero, and similar problems
ACM SIGSAM Bulletin
Approximate computation of pseudovarieties
ACM SIGSAM Bulletin
The nearest polynomial with a zero in a given domain
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On real factors of real interval polynomials
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
The nearest polynomial with a zero in a given domain from a geometrical viewpoint
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
Computer Mathematics
The nearest polynomial with a zero in a given domain
Theoretical Computer Science
On real factors of real interval polynomials
Journal of Symbolic Computation
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
Journal of Symbolic Computation
The nearest complex polynomial with a zero in a given complex domain
Theoretical Computer Science
Hi-index | 0.00 |
For a real interval polynomial F, we provide a rigorous method for deciding whether there exists a polynomial in F that has a multiple zero in a prescribed interval in R. We show that it is sufficient to examine a finite number of edge polynomials in F. An edge polynomial is a real interval polynomial such that the number of coefficients that are intervals is one. The decision method uses the property that a univariate polynomial is of degree one with respect to each coefficient regarded as a variable. Using this method, we can completely determine the set of real numbers each of which is a multiple zero of some polynomial in F.