Solving Polynomial Systems via a Stabilized Representation of Quotient Algebras

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to compute the structure of the quotient ring R/I from the null space of a Macaulay-type matrix. The affine dense, affine sparse, homogeneous and multi-homogeneous cases are treated. In the presented framework, the concept of a border basis is generalized by relaxing the conditions on the set of basis elements. This allows for algorithms to adapt the choice of basis in order to enhance the numerical stability. We present such an algorithm and show numerical results

Space-Based Localization of Radio Frequency Transmitters Utilizing Macaulay Resultant and Heuristic Optimization Methods

This research focuses on radio frequency geolocation of space objects utilizing space-based platforms. Geolocation has long been the solution for locating objects. In particular, this study examines the scenario of two cooperative receivers geolocating a transmitter in close proximity. An algorithm is developed to calculate the initial estimated transmitter location and projected orbital trajectory. The algorithm uses the Macaulay method of solving a system of polynomials as well as heuristic optimization techniques to locate a transmitter with respect to receivers at different time intervals. For the scenarios investigated, both Macaulay and heuristic optimization methods achieve initial relative orbit determination

On the Complexity of the F5 Gr\"obner basis Algorithm

We study the complexity of Gr\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree $d$ in a Gr\"obner basis computed by Faug\`ere's $F_5$ algorithm~(Fau02) in this generic case for the grevlex ordering (which is also a bound on the number of polynomials for a reduced Gr\"obner basis, independently of the algorithm used). Next, we analyse more precisely the structure of the polynomials in the Gr\"obner bases with signatures that $F_5$ computes and use it to bound the complexity of the algorithm. Our estimates show that the version of~$F_5$ we analyse, which uses only standard Gaussian elimination techniques, outperforms row reduction of the Macaulay matrix with the best known algorithms for moderate degrees, and even for degrees up to the thousands if Strassen's multiplication is used. The degree being fixed, the factor of improvement grows exponentially with the number of variables.Comment: 24 page

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 (�$\ge$ 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

Numerical Instability of Resultant Methods for Multidimensional Rootfinding

Hidden-variable resultant methods are a class of algorithms for solving multidimensional polynomial rootfinding problems. In two dimensions, when significant care is taken, they are competitive practical rootfinders. However, in higher dimensions they are known to miss zeros, calculate roots to low precision, and introduce spurious solutions. We show that the hidden variable resultant method based on the Cayley (Dixon or Bézout) matrix is inherently and spectacularly numerically unstable by a factor that grows exponentially with the dimension. We also show that the Sylvester matrix for solving bivariate polynomial systems can square the condition number of the problem. In other words, two popular hidden variable resultant methods are numerically unstable, and this mathematically explains the difficulties that are frequently reported by practitioners. Regardless of how the constructed polynomial eigenvalue problem is solved, severe numerical difficulties will be present. Along the way, we prove that the Cayley resultant is a generalization of Cramer's rule for solving linear systems and generalize Clenshaw's algorithm to an evaluation scheme for polynomials expressed in a degree-graded polynomial basis

Space-based relative multitarget tracking

Access to space has expanded dramatically over the past decade. The growing popularity of small satellites, specifically cubesats, and the following launch initiatives have resulted in exponentially growing launch numbers into low Earth orbit. This growing congestion in space has punctuated the need for local space monitoring and autonomous satellite inspection. This work describes the development of a framework for monitoring local space and tracking multiple objects concurrently in a satellite\u27s neighborhood. The development of this multitarget tracking systems has produced collateral developments in numerical methods, relative orbital mechanics, and initial relative orbit determination. This work belongs to a class of navigation known as angles-only navigation, in which angles representing the direction to the target are measured but no range measurements are available. A key difference between this work and traditional angles-only relative navigation research is that angle measurements are collected from two separate cameras simultaneously. Such measurements, when coupled with the known location and orientation of the stereo cameras, can be used to resolve the relative range component of a target\u27s position. This fact is exploited to form initial statistical representations of the targets\u27 relative states, which are subsequently refined in Bayesian single-target and multitarget frameworks --Abstract, page iii