Some Observations on Khovanskii's Matrix Methods for extracting Roots of Polynomials
From MaRDI portal
(Redirected from Publication:5445362)
Abstract: In this article we apply a formula for the -th power of a matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer , how to construct certain families of integer sequences such that a certain rational expression, involving the ratio of successive terms in each family, tends to . We also show how to choose the optimal value of a free parameter to get maximum speed of convergence. We apply a similar method, also due to Khovanskii, to a more general class of cubic equations, and, for each such cubic, obtain a sequence of rationals that converge to the real root of the cubic. We prove that Khovanskii's method for finding the -th () root of a positive integer works, provided a free parameter is chosen to satisfy a very simple condition. Finally, we briefly consider another procedure of Khovanskii's, which also involves matrices, for approximating the root of an arbitrary polynomial of degree .
Recommendations
- A root-finding algorithm for cubics
- A study of Schröder's method for the matrix \(p\)th root using power series expansions
- The calculation of cubic roots after Héron
- On the Computation of the Matrixk-th Root
- On a generalization of the Euler-Chebyshev method for simultaneous extraction of only a part of all roots of polynomials
Cited in
(4)
This page was built for publication: Some Observations on Khovanskii's Matrix Methods for extracting Roots of Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445362)