Related papers: Locating the Closest Singularity in a Polynomial H…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
For an arbitrary evolution family, we consider the notion of a polynomial dichotomy with respect to a family of norms and characterize it in terms of the admissibility property, that is, the existence of a unique bounded solution for each…
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…
In this article, we consider nonlinear complementarity problem. We introduce a new homotopy function for finding the solution of nonlinear complementarity problem through the trajectory . We show that the homotopy path approaching the…
Compound distributions allow construction of a rich set of distributions. Typically they involve an intractable integral. Here we use a quadrature approximation to that integral to define the quadrature compound family. Special care is…
We study bifurcation for the constant scalar curvature equation along a one-parameter family of Riemannian metrics on the total space of a harmonic Riemannian submersion. We provide an existence theorem for bifurcation points and a…
It is known that parallel manipulators suffer from singular configurations. Evaluating the distance between a given configuration to the closest singular one is of interest for industrial applications (e.g.\ singularity-free path planning).…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the…
We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…
In this paper, we are concerned with the problem of locating the zeros of polynomials of a quaternionic variable with quaternionic coefficients. We derive some new Cauchy bounds for the zeros of a polynomial by virtue of maximum modulus…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
We explore the connection between two seemingly distant fields: the set of cyclic functions $f$ in a Hilbert space of analytic functions over the unit disc $\D$, on the one hand, and the families of orthogonal polynomials for a weight on…
How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input…
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $(1+\varepsilon, \dots ,…