相关论文: A Generalization of Obreshkoff-Ehrlich Method for …

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

In this paper we study two-sided (left and right) axially symmetric solutions of a generalized Cauchy-Riemann operator. We present three methods to obtain special solutions: via the Cauchy-Kowalevski extension theorem, via plane wave…

We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…

We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…

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…

The Eberlein method is a Jacobi-type process for solving the eigenvalue problem of an arbitrary matrix. In each iteration two transformations are applied on the underlying matrix, a plane rotation and a non-unitary elementary…

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

This paper presents a simple, self-contained account of Garding's theory of hyperbolic polynomials, including a recent convexity result of Bauschke-Guler-Lewis-Sendov and an inequality of Gurvits. This account also contains new results,…

We explore the regularity of the roots of Garding hyperbolic polynomials and real stable polynomials. As an application we obtain new regularity results of Sobolev type for the eigenvalues of Hermitian matrices and for the singular values…

We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…

The Householder's method is a root-find algorithm which is a natural extension of the methods of Newton and Halley. The current paper mostly focuses on approximating the square root of a positive real number based on these methods. The…

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 isolation intervals of the real roots of the real symbolic monic cubic polynomial $p(x) = x^3 + a x^2 + b x + c\,\,$ are found in terms of simple functions of the coefficients of the polynomial (such as: $-a$, $-a/3$, $-c/b$, $\pm…

In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…

The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…