相关论文: How to split a tera-polynomial

More than 25 years ago Chazelle~\emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${\Bbb R}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth…

We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Puiseux series including non-separable ones. The method works by transforming the polynomial and its roots into a special form and then…

Iteration of the quadratic map produces sequences of polynomials whose degrees {\sl explode} as the orbital period grows more and more. The polynomial mixing all 335 period-12 orbits has degree $4020$, while for the $52,377$ period-20…

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special case is solvable in polynomial time:…

We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove tightness of the methodology and demonstrate its value by presenting two applications of it. First, we use the…

In this paper the fractional-order Mandelbrot and Julia sets in the sense of $q$-th Caputo-like discrete fractional differences, for $q\in(0,1)$, are introduced and several properties are analytically and numerically studied. Some…

We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius inversion that proceeds point by point, finishing the calculation…

We study the maximum number of limit cycles that can bifurcate from a degenerate center of a cubic homogeneous polynomial differential system. Using the averaging method of second order and perturbing inside the class of all cubic…

Let f be a degree D univariate polynomial with real coefficients and exactly m monomial terms. We show that in the special case m=3 we can approximate within eps all the roots of f in the interval [0,R] using just O(log(D)log(Dlog(R/eps)))…

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…

We propose three semi-decoupled algorithms for efficiently solving a four-field thermoporoelastic model. The first two algorithms adopt a sequential strategy: at the initial time step, all variables are computed simultaneously using a…

Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of…

Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…

The problem is to evaluate a polynomial in several variables and its gradient at a power series truncated to some finite degree with multiple double precision arithmetic. To compensate for the cost overhead of multiple double precision and…

Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…

Finding roots of univariate polynomials is one of the fundamental tasks of numerics, and there is still a wide gap between root finders that are well understood in theory and those that perform well in practice. We investigate the root…

The concept of \emph{data depth} in non-parametric multivariate descriptive statistics is the generalization of the univariate rank method to multivariate data. \emph{Halfspace depth} is a measure of data depth. Given a set $S$ of points…

In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…