Abstract
Given a bivariate polynomial f(x, y), let ☎i(y) be a power series root of f(x, y) = 0 with respect tox, i.e., ☎i(y) is a function ofy such thatf(☎i(y),,y) = 0. If ☎i(y) is analytic aty = 0, then we have its power series expansion
Let ☎i(k)(y) denote ☎i(y) truncated aty k, i.e.,
Then, it is well known that, given initial value ☎i(0)(y) = α0 ∈ C, the symbolic Newton’s method with the formula
computes\(\phi ^{(2^m - 1)} (y) (1 \le m)\) in (2) with quadratic convergence (the roots are computed in the order\(\phi ^{(0)} (y) \to \phi ^{(2^1 - 1)} (y) \to \phi ^{(2^2 - 1)} (y) \to \cdots \to \phi ^{(2^m - 1)} (y))\). References [1] and [3] indicate that the symbolic Newton’s method can be generalized so that its convergence degree is an arbitrary integerp where its roots are computed in the order\(\phi ^{(0)} (y) \to \phi ^{(p - 1)} (y) \to \phi ^{(p^2 - 1)} (y) \to \cdots \to \phi ^{(p^m - 1)} (y)\). Although the high degree convergent formula in [1] and [3] requires fewer iterations than the symbolic Newton’s method, it may not be efficient as expected, since one iteration of the formula requires more computations than one in the symbolic Newton’s method.
In this paper, we combine the polynomial evaluation method in [9] with the formula of arbitrary degree convergence and propose an algorithm that computes the above power series root ☎i(k)(y). We analyze the complexity of the algorithm and give the number of multiplications/divisions required to compute a power series root in an explicit form. It is shown that when the degree of polynomialf(x, y) is high, high degree convergent formula is advantageous over the symbolic Newton’s method.
Similar content being viewed by others
References
T. Kitamoto, Hensel construction with an arbitrary degree of convergence. Japan J. Indust. Appl. Math.,13 (1996), 203–215.
T. Kitamoto, On efficient computation of approximate roots (in Japanese). Trans. IEICE,J85-A (2002), 189–196.
T. Kitamoto, On extension of symbolic Newton’s method to the formula with high degree of convergence (in Japanese). Trans. IEICE,J84-A (2001), 983–988.
T. Kitamoto, Approximate Eigenvalues, Eigenvectors and Inverse of a Matrix with Polynomial Entries. Japan J. Indust. Appl. Math.,11 (1994), 75–85.
T. Kitamoto, On Computation of Approximate Eigenvalues and Eigenvectors. Trans. IEICE,E85-A (2002), 664–675.
T. Kitamoto, Accurate Computation of a High Degree Coefficient of a Power Series Root. Trans. IEICE,E88-A (2005), 718–727.
H.T. Kung and J.F. Traub, All algebraic functions can be computed fast. J. ACM,25 (1978), 245–260.
J.D. Lipson, Newton’s method: A great algebraic algorithm. ACM Symposium on Symbolic and Algebraic Computations Proceedings, 1976, 260–270.
M. Shaw and J.F. Traub, On the number of multiplications for the evaluation of a polynomial and some of its derivatives. J. ACM,21 (1974), 161–167.
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Kitamoto, T. On computation of a power series root with arbitrary degree of convergence. Japan J. Indust. Appl. Math. 25, 255 (2008). https://doi.org/10.1007/BF03168551
Received:
Revised:
DOI: https://doi.org/10.1007/BF03168551