Related papers: Third Order Newton's Method for Zernike Polynomial…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
In this paper, we study iterative methods on the coefficients of the rational univariate representation (RUR) of a given algebraic set, called global Newton iteration. We compare two natural approaches to define locally quadratically…
The purpose of this article is to bring together the third-order Jacobsthal numbers and 3-parameter generalized quaternions, which are a general form of the quaternion algebra according to 3-parameters. With this purpose, we introduce and…
We present and demonstrate a method for optical homodyne tomography based on the inverse Radon transform. Different from the usual filtered back-projection algorithm, this method uses an appropriate polynomial series to expand the Wigner…
Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.
Let $d\nu$ be a measure in $\mathbb{R}^d$ obtained from adding a set of mass points to another measure $d\mu$. Orthogonal polynomials in several variables associated with $d\nu$ can be explicitly expressed in terms of orthogonal polynomials…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
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…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
The Schwarzian-Newton method can be defined as the minimal method for solving nonlinear equations $f(x)=0$ which is exact for any function $f$ with constant Schwarzian derivative; exactness means that the method gives the exact root in one…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
An intriguing and unexpected result for students learning numerical analysis is that Newton's method, applied to the simple polynomial z^3 - 1 = 0 in the complex plane, leads to intricately interwoven basins of attraction of the roots. As…
A Newton graph of order $r( \geqslant 2)$ is a cellularly embedded toroidal graph on $r$ vertices, $2r$ edges and $r$ faces that fulfils certain combinatorial properties (Euler, Hall). The significance of these graphs relies on their role…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
The main purpose and motivation of this article is to create a linear transformation on the polynomial ring of rational numbers. A matrix representation of this linear transformation based on standard fundamentals will be given. For some…
The zeta functions for the Schr\"odinger equation with a triangular potential are investigated. Values of the zeta functions are computed using both the Weierstrass factorization theorem and analytic continuation via contour integration.…
We improve upon an Omega result due to Soundararajan with respect to general trigonometric polynomials having positive Fourier coefficients. Instead of Dirichlet's approximation theorem we employ the resonance method and this leads to…
Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…
The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…