Related papers: A solution of polynomial equations
The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [Kal04]. Here we consider the polynomiography of the partial sums of the exponential series. While…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
In this paper, we investigate new class of sequences related to fully degenerate Bernoulli numbers and polynomials. From those sequences, we derive some formulae for the degenerate Bernoulli and Euler polynomials.
The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…
This paper is devoted to overview of the authors works for numerical solution of singular integral equations (SIE), polysingular integral equations and multi-dimensional singular integral equations of the second kind. The authors…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the given equation system significantly faster than what is…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
This paper presents a comprehensive survey of methods which can be utilized to search for solutions to systems of nonlinear equations (SNEs). Our objectives with this survey are to synthesize pertinent literature in this field by presenting…
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…
We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their…
In a multidimensional infinite layer bounded by two hyperplanes, the Poisson equation with the polynomial right-hand side is considered. It is shown that the Dirichlet boundary value problem and the mixed Dirichlet-Neumann boundary value…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
The main goal of this paper is to analyze a family of "simplest possible" initial data for which, as shown by numerical simulations, the incompressible Euler equations have multiple solutions. We take here a first step toward a rigorous…
A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…