相关论文: Aryabhata's Root Extraction Methods
We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
This paper was published in French under the title \textit{Sur une m\'ethode d'approximation des racines carr\'ees dans l'Inde ant\'erieurement \`a la conqu\^ete d'Alexandre}, in the Bulletin de la S. M. F., volume 7 (1879), p. 98-102. It…
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…
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…
We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…
We discuss the work of a brilliant line of Mathematicians who lived in central Kerala and starting with its founder Madhava (1350 CE) developed what can best be described as Calculus and applied it to a class of trigonometric functions. We…
This work presents and extends a known spigot-algorithm for computing square-roots, digit-by-digit, that is suitable for calculation by hand or an abacus, using only addition and subtraction. We offer an elementary proof of correctness for…
Plant roots typically exhibit a highly complex and dense architecture, incorporating numerous slender lateral roots and branches, which significantly hinders the precise capture and modeling of the entire root system. Additionally, roots…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
Runge-Kutta formulas are some of the workhorses of numerical solving of differential equations. However, they are extremely difficult to generate; the algebra involved can be very complicated indeed. It is now standard, following the work…
Several root-ratio multipoint methods for finding multiple zeros of univariate functions were recently presented. The characteristic of these methods is that they deal with $m$-th root of ratio of two functions (hence the name root-ratio…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
This work explores a possible course of evolution of mathematics in ancient times in India when there was no script, no place-value system, and no zero. Reviewing examples of time-reckoning, large numbers, sacrificial altar-making, and…
This paper aims to give a brief account of the mathematical work of the 7th-century Armenian polymath and natural philosopher Anania Shirakatsi. The three sections of Anania's ``Book of Arithmetic'' -- tables of arithmetic operations, a…
Contribution of Indian Mathematics since Vedic Period has been recognised by the Historians. Pingala (200 BC) in his book on 'Chandashaastra', a text related to the description and analysis of meters in poetic work, describes algorithms…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…