Related papers: How to split a tera-polynomial
Based on the Bezout approach we propose a simple algorithm to determine the {\tt gcd} of two polynomials which doesn't need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
This paper presents an improved forward-backward splitting algorithm with two inertial parameters. It aims to find a point in the real Hilbert space at which the sum of a co-coercive operator and a maximal monotone operator vanishes. Under…
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…
The real roots of the cubic and quartic polynomials are studied geometrically with the help of their respective Siebeck--Marden--Northshield equilateral triangle and regular tetrahedron. The Vi\`ete trigonometric formulae for the roots of…
The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
Cardinal's factorization algorithm of 1996 splits a univariate polynomial into two factors with root sets separated by the imaginary axis, which is an important goal itself and a basic step toward root-finding. The novelty of the algorithm…
Using equidistribution criteria, we establish divisibility by cyclotomic polynomials of several partition polynomials of interest, including $spt$-crank, overpartition pairs, and $t$-core partitions. As corollaries, we obtain new proofs of…
For a degree $5$ real polynomial with roots $x_1\leq \cdots \leq x_5$ and roots $\xi_1\leq \cdots \leq \xi_4$ of its derivative, we set $z_j:=(x_j+x_{j+1})/2$, $1\leq j\leq 4$. We prove that one cannot have at the same time $\min_{1\leq…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
In this note, we test the performance of six algorithms from the family of graph-based splitting methods [SIAM J. Optim., 34 (2024), pp. 1569-1594] specialized to normal cones of linear subspaces. To do this, we first implement some…
Operator-splitting methods are widely used to solve differential equations, especially those that arise from multi-scale or multi-physics models, because a monolithic (single-method) approach may be inefficient or even infeasible. The most…
Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…
The concept of data depth in non-parametric multivariate descriptive statistics is the generalization of the univariate rank method to multivariate data. Halfspace depth is a measure of data depth. Given a set S of points and a point p, the…
The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…
We propose a variational splitting technique for the generalized-$\alpha$ method to solve hyperbolic partial differential equations. We use tensor-product meshes to develop the splitting method, which has a computational cost that grows…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).