English
Related papers

Related papers: Weierstrass method for quaternionic polynomial roo…

200 papers

Inspired by the relation between the algebra of complex numbers and plane geometry, William Rowan Hamilton sought an algebra of triples for application to three dimensional geometry. Unable to multiply and divide triples, he invented a…

History and Overview · Mathematics 2016-06-13 Govind S. Krishnaswami , Sonakshi Sachdev

We show that the dilogarithm has at most one zero on each branch, that each zero is close to a root of unity, and that they may be found to any precision with Newton's method. This work is motivated by applications to the asymptotics of…

Number Theory · Mathematics 2015-07-30 Cormac O'Sullivan

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

Rings and Algebras · Mathematics 2022-09-30 Maximilian Illmer , Tim Netzer

In this paper we prove a strong version of the Hilbert Nullstellensatz in the ring $\mathbb H[q_1,\ldots,q_n]$ of slice regular polynomials in several quaternionic variables. Our proof deeply depends on a detailed analysis of the common…

Complex Variables · Mathematics 2025-09-16 Anna Gori , Giulia Sarfatti , Fabio Vlacci

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…

Rings and Algebras · Mathematics 2022-11-08 Daniel F. Scharler , Hans-Peter Schröcker

Quaternion optimization has attracted significant interest due to its broad applications, including color face recognition, video compression, and signal processing. Despite the growing literature on quadratic and matrix quaternion…

Optimization and Control · Mathematics 2025-12-02 Chang He , Bo Jiang , Hongye Wang , Xihua Zhu

We show that the higher dimensional Weierstrass and Ehrlich-Aberth methods for finding roots of polynomials have infinite orbits that diverge to infinity. This is possible for the Jacobi update scheme (all coordinates are updated in…

Dynamical Systems · Mathematics 2020-11-04 Bernhard Reinke

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

Numerical Analysis · Mathematics 2025-04-15 Yousra Gati , Vladimir Petrov Kostov , Mohamed Chaouki Tarchi

The notion of "Weierstrass Section", comes from Weierstrass canonical form for elliptic curves. In celebrated work [B. Kostant, Lie group representations on polynomial rings, Amer. J. Math. 85 (1963), 327-404] constructed such a section for…

Representation Theory · Mathematics 2020-01-03 Yasmine Fittouhi , Anthony Joseph

We discuss a new approach to realization of the well-known Weierstrass's programme on efficient continuation of an analytic element corresponding to a~multivalued analytic function with finite number of branch points. Our approach is based…

Complex Variables · Mathematics 2018-06-25 Sergey P. Suetin

We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…

Probability · Mathematics 2022-01-10 Christopher Corley , Andrew Ledoan , Aaron Yeager

We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly…

Symbolic Computation · Computer Science 2013-12-03 Jin-San Cheng , Kai Jin

We study in detail the zero set of a regular function of a quaternionic or octonionic variable. By means of a division lemma for convergent power series, we find the exact relation existing between the zeros of two octonionic regular…

Complex Variables · Mathematics 2010-08-26 Riccardo Ghiloni , Alessandro Perotti

In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…

Symbolic Computation · Computer Science 2019-01-01 Jin-San Cheng , Xiaojie Dou , Junyi Wen

We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n^2$: \begin{equation*} Q_n^g(x)= x \sum_{k=1}^n g(k) \, Q_{n-k}^g(x), \quad Q_0^g(x):=1. \end{equation*} It is known that the case $g=id$ involves…

Classical Analysis and ODEs · Mathematics 2021-07-13 Bernhard Heim , Markus Neuhauser

A method for finding relations for the roots of polynomials is presented. Our approach allows us to get a number of relations for the zeros of the classical polynomials and for the roots of special polynomials associated with rational…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 Nikolai A. Kudryashov , Maria V. Demina

Numerous attempts have been made to replicate the success of complex-valued algebra in engineering and science to other hypercomplex domains such as quaternions, tessarines, biquaternions, and octonions. Perhaps, none have matched the…

Machine Learning · Statistics 2026-03-13 Sayed Pouria Talebi , Clive Cheong Took

There are four division algebras over $\mathbb{R}$, namely real numbers, complex numbers, quaternions, and octonions. Lack of commutativity and associativity make it difficult to investigate algebraic and geometric properties of octonions.…

General Mathematics · Mathematics 2021-01-01 T. Kalpa Madhawa

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…

Numerical Analysis · Mathematics 2017-09-13 Dierk Schleicher , Robin Stoll

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

Data Structures and Algorithms · Computer Science 2023-06-22 Katrin Casel , Philipp Fischbeck , Tobias Friedrich , Andreas Göbel , J. A. Gregor Lagodzinski
‹ Prev 1 3 4 5 6 7 10 Next ›