On Computation of a Power Series Root with Arbitrary Degree of Convergence

KITAMOTO Takuya

doi:10.1007/bf03168551

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 $$\phi (y) = \alpha _0 + \alpha _1 y + \alpha _2 y^2 + \cdots + \alpha _r y^r + \cdots .$$ (1) Let ☎i(k)(y) denote ☎i(y) truncated atyk, i.e., $$\phi ^{(k)} (y) = \alpha _0 + \alpha _1 y + \alpha _2 y^2 + \cdots + \alpha _k y^k .$$ (2) Then, it is well known that, given initial value ☎i(0)(y) = α0∈C, the symbolic Newton’s method with the formula $$\phi ^{(2^m - 1)} (y) \leftarrow \phi ^{(2^{m - 1} - 1)} (y) - \frac{{f(\phi ^{(2^{m - 1} - 1)} (y),y)}}{{\frac{{\partial f}}{{\partial x}}(\phi ^{(2^{m - 1} - 1)} (y),y)}} (mod y^{2m} )$$ (3) 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.

On Computation of a Power Series Root with Arbitrary Degree of Convergence

Search this article

Description

Journal

References(9)*help

Keywords

Details 詳細情報について

Export

Report a problem