Related papers: Aryabhata's Root Extraction Methods
We answer to criticisms of O. Keller about our interpretation work on the Ishango rod, the oldest mathematical tool of humankind. Our hypothesis, that is widely accepted, is that this prehistoric rod is the first mankind manifestation of a…
There is a one-to-one correspondence between natural numbers and rooted trees; the number is called the Matula number of the rooted tree. We show how a large number of properties of trees can be obtained directly from the corresponding…
Geometry and Diophantine equations have been ever-present in mathematics. Diophantus of Alexandria was born in the 3rd century (as far as we know), but a systematic mathematical study of word equations began only in the 20th century. So,…
Root-finding method is an iterative process that constructs a sequence converging to a solution of an equation. Householder's method is a higher-order method that requires higher order derivatives of the reciprocal of a function and has…
This paper presents a modification of Secant method for finding roots of equations that uses three points for iteration instead of just two. The development of the mathematical formula to be used in the iteration process is provided…
In this paper a new method which is a generalization of the Ehrlich-Kjurkchiev method is developed. The method allows to find simultaneously all roots of the algebraic equation in the case when the roots are supposed to be multiple with…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
In this paper, we study the so-called 'Mathematical part' of Plato's Theaetetus. Its subject concerns the incommensurability of certain magnitudes, in modern terms the question of the rationality or irrationality of the square roots of…
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…
The solution of the cubic equation has a century-long history; however, the usual presentation is geared towards applications in algebra and is somewhat inconvenient to use in optimization where frequently the main interest lies in real…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.
The root extraction problem in braid groups is the following: given a braid $\beta \in \mathcal{B}_n$ and a number $k\in \mathbb{N}$, find $\alpha\in \mathcal{B}_n$ such that $\alpha^k=\beta$. In the last decades, many cryptosystems such as…
Heron, in Metrica III.20-22, is concerned with the the division of solid figures - pyramids, cones and frustra of cones - to which end there is a need to extract cube roots. We report here on some of our findings on the conjecture by…
This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…
Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.
Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…
Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…