Related papers: Weierstrass method for quaternionic polynomial roo…
The mixed moments for the Askey-Wilson polynomials are found using a bootstrapping method and connection coefficients. A similar bootstrapping idea on generating functions gives a new Askey-Wilson generating function. An important special…
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous…
In this paper, we propose a reflected forward-backward splitting algorithic framework for finding a zero of the sum of finitely many monotone op-erators, including maximally monotone operators, cocoercive operators, and monotone and…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
This paper studies the integration problem in differential fields that may involve quantities reminiscent of the Weierstrass $\wp$ function, which are defined by a first-order nonlinear differential equation. We extend the classical notion…
Quadratic forms over Z that represent all positive integers are called universal. Starting with Ramanujan, 54 universal quaternary quadratic forms without cross product terms were discovered. The form that is the sum of four squares was…
A new algorithm for real root isolation of polynomial equations based on hybrid computation is presented in this paper. Firstly, the approximate (complex) zeros of the given polynomial equations are obtained via homotopy continuation…
In this paper, using Bourbaki's convention, we consider a simple Lie algebra $\mathfrak g\subset\mathfrak g\mathfrak l_m$ of type B, C or D and a parabolic subalgebra $\mathfrak p$ of $\mathfrak g$ associated with a Levi factor composed…
In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…
The efficacy of numerical methods like integral estimates via Gaussian quadrature formulas depends on the localization of the zeros of the associated family of orthogonal polynomials. In this regard, following the renewed interest in…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…
We revisit the notion of root polynomials, thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020] for general polynomial matrices, and…
Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…
This paper gives the first algorithm for finding a set of natural $\epsilon$-clusters of complex zeros of a triangular system of polynomials within a given polybox in $\mathbb{C}^n$, for any given $\epsilon>0$. Our algorithm is based on a…
We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…