1,438 research outputs found
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a
zero-dimensional bivariate polynomial system. The proposed algorithm
constitutes an elimination method which improves upon existing approaches in a
number of points. First, the amount of purely symbolic operations is
significantly reduced, that is, only resultant computation and square-free
factorization is still needed. Second, our algorithm neither assumes generic
position of the input system nor demands for any change of the coordinate
system. The latter is due to a novel inclusion predicate to certify that a
certain region is isolating for a solution. Our implementation exploits
graphics hardware to expedite the resultant computation. Furthermore, we
integrate a number of filtering techniques to improve the overall performance.
Efficiency of the proposed method is proven by a comparison of our
implementation with two state-of-the-art implementations, that is, LPG and
Maple's isolate. For a series of challenging benchmark instances, experiments
show that our implementation outperforms both contestants.Comment: 16 pages with appendix, 1 figure, submitted to ALENEX 201
Structured matrices, continued fractions, and root localization of polynomials
We give a detailed account of various connections between several classes of
objects: Hankel, Hurwitz, Toeplitz, Vandermonde and other structured matrices,
Stietjes and Jacobi-type continued fractions, Cauchy indices, moment problems,
total positivity, and root localization of univariate polynomials. Along with a
survey of many classical facts, we provide a number of new results.Comment: 79 pages; new material added to the Introductio
Note on Integer Factoring Methods IV
This note continues the theoretical development of deterministic integer
factorization algorithms based on systems of polynomials equations. The main
result establishes a new deterministic time complexity bench mark in integer
factorization.Comment: 20 Pages, New Versio
The Toric SO(10) F-Theory Landscape
Supergravity theories in more than four dimensions with grand unified gauge
symmetries are an important intermediate step towards the ultraviolet
completion of the Standard Model in string theory. Using toric geometry, we
classify and analyze six-dimensional F-theory vacua with gauge group SO(10)
taking into account Mordell-Weil U(1) and discrete gauge factors. We determine
the full matter spectrum of these models, including charged and neutral SO(10)
singlets. Based solely on the geometry, we compute all matter multiplicities
and confirm the cancellation of gauge and gravitational anomalies independent
of the base space. Particular emphasis is put on symmetry enhancements at the
loci of matter fields and to the frequent appearance of superconformal points.
They are linked to non-toric K\"ahler deformations which contribute to the
counting of degrees of freedom. We compute the anomaly coefficients for these
theories as well by using a base-independent blow-up procedure and
superconformal matter transitions. Finally, we identify six-dimensional
supergravity models which can yield the Standard Model with high-scale
supersymmetry by further compactification to four dimensions in an Abelian flux
background.Comment: 64 pages, 40 pages appendices, 18 figures, 6 Tables, references
added, published versio
On the asymptotic and practical complexity of solving bivariate systems over the reals
This paper is concerned with exact real solving of well-constrained,
bivariate polynomial systems. The main problem is to isolate all common real
roots in rational rectangles, and to determine their intersection
multiplicities. We present three algorithms and analyze their asymptotic bit
complexity, obtaining a bound of \sOB(N^{14}) for the purely projection-based
method, and \sOB(N^{12}) for two subresultant-based methods: this notation
ignores polylogarithmic factors, where bounds the degree and the bitsize of
the polynomials. The previous record bound was \sOB(N^{14}).
Our main tool is signed subresultant sequences. We exploit recent advances on
the complexity of univariate root isolation, and extend them to sign evaluation
of bivariate polynomials over two algebraic numbers, and real root counting for
polynomials over an extension field. Our algorithms apply to the problem of
simultaneous inequalities; they also compute the topology of real plane
algebraic curves in \sOB(N^{12}), whereas the previous bound was
\sOB(N^{14}).
All algorithms have been implemented in MAPLE, in conjunction with numeric
filtering. We compare them against FGB/RS, system solvers from SYNAPS, and
MAPLE libraries INSULATE and TOP, which compute curve topology. Our software is
among the most robust, and its runtimes are comparable, or within a small
constant factor, with respect to the C/C++ libraries.
Key words: real solving, polynomial systems, complexity, MAPLE softwareComment: 17 pages, 4 algorithms, 1 table, and 1 figure with 2 sub-figure
Computing the common zeros of two bivariate functions via Bezout resultants
The common zeros of two bivariate functions can be computed by finding the common zeros of their polynomial interpolants expressed in a tensor Chebyshev basis. From here we develop a bivariate rootfinding algorithm based on the hidden variable resultant method and B�ezout matrices with polynomial entries. Using techniques including domain subdivision, B�ezoutian regularization and local refinement we are able to reliably and accurately compute the simple common zeros of two smooth functions with polynomial interpolants of very high degree (� 1000). We analyze the resultant method and its conditioning by noting that the B�ezout matrices are matrix polynomials. Our robust algorithm is implemented in the roots command in Chebfun2, a software package written in object-oriented MATLAB for computing with bivariate functions
- …