Received 24 November 2015; accepted 17 January 2016; published 20 January 2016

Transcription

1 Applied Mathematics, 06, 7, Published Online January 06 in SciRes. The Formulas to Compare the Convergences of Newton s Method and the Etended Newton s Method (Tsuchiura-Horiguchi Method and the Numerical Calculations Shunji Horiguchi Department of Economics, Niigata Sangyo University, Niigata, Japan Received 4 November 05; accepted 7 January 06; published 0 January 06 Copyright 06 by author and Scientific Research Publishing Inc. This wor is licensed under the Creative Commons Attribution International License (CC BY. Abstract This paper gives the etension of Newton s method, and a variety of formulas to compare the convergences for the etension of Newton s method (Section 4. Section 5 gives the numerical calculations. Section introduces the three formulas obtained from the cubic euation of a hearth by Murase (Ref. []. We find that Murase s three formulas lead to a Horner s method (Ref. [] and etension of a Newton s method (009 at the same time. This shows originality of Wasan (mathematics developed in Japan in the Edo era ( Suzui (Ref. [3] estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section gives the relations between Newton s method, Horner s method and Murase s y = g t : = f t = f. three formulas. Section 3 gives a new function defined such as Keywords Recurrence Formula, Newton-Raphson s Method (Newton s Method, Etension of Newton s Method. Murase s Three Formulas from the Cubic Euation of a Hearth We write this paper from two inds of recurrence formulas of the suare and the deformation of a cubic euation written in Murase s boo (Ref. [], and a hint of Tsuchiura (Ref. [4]. It is enough for readers to now these three formulas. It is very difficult even for Japanese people to read the Murase s boo written in the How to cite this paper: Horiguchi, S. (06 The Formulas to Compare the Convergences of Newton s Method and the Etended Newton s Method (Tsuchiura-Horiguchi Method and the Numerical Calculations. Applied Mathematics, 7,

2 Japanese ancient writing. Therefore, the readers do not need to read the boo. Furthermore, the readers do not need to mind Japanese references. From now on, we eplain the Murase s three formulas as introduction. The readers can now the origin of this paper. Murase made the cubic euation for the net problem in 673. There is a rectangular solid (base is a suare. We put it together four and mae the hearth such as Figure. We claim one side of length of the suare that one side is 4, and a volume becomes 9 of the hearth. Let one side of length of the suare be, then the net cubic euation is obtained. that is ( = (. 3 f = = 0. (. This has three solutions of real number, 6 ± 5. Murase derived two following recurrence formulas (.3, (.4 and deformed euation (.5 from (.. The first method: = ( = 0,,,. (.3 4 Using on an abacus, Murase calculates to 0 = 0 (initial value, =.85, =.97, 3 =.9936, and decides a solution with. The second method: 48 = + ( 0,,,. 4 = (.4 Here he calculates to 0 = 0, =.85, =.976, 3 =.9989, 4 = , and decides a solution with. Formula (.4 has better precision than that (.3, and convergence becomes fast. The third method was nonrecurring in spite of a short sentence for many years. However, Yasuo Fujii (Sei Kowa Institute Mathematics of Yoaichi University succeeds in decoding in May 009. It is the net euation. The third method: 3 ( 4 = 48. (.5 The studies of three formulas of Murase progress by the third method have been decoded. Furthermore we obtain the net recurrence formula from ( = ( = 0,,,. (.6 4. Relations between Newton s Method, Horner s Method and the Murase s Three Formulas Throughout this paper, function f( be i ( times differentiable if necessary, and f (i ( continuous. We start with the definition of Newton s method. Figure. Hearth. 4

3 Net Newton s method is eplained in a boo of the standard numerical computation (Ref. [5]. The recurrence formula to approimate a root of the euation f( = 0 ( f = 0,,, + f = (. is called Newton s method or Newton-Raphson s method. Newton s method is a method of giving the initial value 0, calculating,, one after another, and to determine for a root. The uadratic convergence and the linearly convergence of the Newton s method are nown as followings. Let α be a simple root for f( = 0, i.e., f ( α 0. Then Newton s method to the uadratic convergence of the following formula. + ( α ( α α f α (. f If α is m ( multiple root, then it will become the linearly convergence of the following formula. + α ( α (.3 m Remar. Concerning choosing the initial value 0, the number of iterations until it converges on a root changes. Moreover, it may not be converged on a root. Eample.. By the transformation of variable = t, Murase s euation f( = = 0 becomes 3 It becomes the following formula if Newton s method is applied to g( t. t+ = t = t = This becomes the following formula by t =. g t = t 4t+ 48 = 0. (.4 g t t 4t t g t t 4 t = 4.5 This is a middle formula of (.4 and (.6 eactly. That is, Murase s formulas (.3, (.4, and (.5 lead to etension of a Newton s method (009. Eample.. Applying the Horner s method to Murase s euation f( = = 0 for root, we get Table. Here, number 4,, 0 of the second column corresponds to the denominator 4,4, 4 for = of (.3, (.4, (.6, respectively. Therefore, from the Table, we find that the Murase s formulas (.3, (.4, and (.6 lead to a Horner s method. Furthermore, please read Ref. [] if you want to now this deeply. Table. Horner s method for Murase s euation (.5 (.6 4

4 Proposition.3. We epand the first, second, third method of Murase, and obtain the net recurrence formula where m is a real number. 3. Function y = g(t Defined by Definition 3.. Let + ( m 3 48 = 4 m = of y = f( t = t where is a real number that is not 0. We define the function g(t such as : (.7 g t = f t = f. (3. Because g( = f(, the graph of g( is etended and contracted by = t in the -ais, without changing the height of f(. Epansion and contraction come to object in < and >. g g f, f as follows. Lemma 3.., are represented by f ( ( Proof. It is proved by the net calculations. g = (3. ( f + f (3.3 g ( = f ( f ( + f (, f ( 0 (3.4 ( dg t df df d g ( t = = = = f dt dt d dt dg t d f d f d g ( t = = = dt dt d dt ( f f = Theorem 3.3. The curvature of the curve y = g( at the point is this. ( ( f + f (3.5 3 f ( + g ( t µ ( t = = µ 3 ( = f ( ( + g ( t f ( + f (, f ( 0 (3.6 3 f ( + f ( These become µ ( = of f( if = in particular. ( + f ( 3 Proof. Formula (3.5 is obtained by substituting the formulas (3., (3.3 for g ( t, g ( t ( t µ. in the curvature 43

5 4. Etension of Newton s Method (Tsuchiura-Horiguchi s Method 4.. Etension of Newton s Method and the Convergences In 009, we found the etension of Newton s method from the Murase s three formulas as follows. Applying the Newton s method to g(t, we have ( ( t f ( t ( g t t+ = t, t+ = t g f t t. (4. This means the intersection t+ = +, t g t =, g of the graph of y = g( t ( g(. Returning to the variable by = t, we get an etension of Newton s method below. Definition 4.. For euation f( = 0, we call the net recurrence formulas the etension of Newton s method or Murase-Newton s method, Tsuchiura-Horiguchi s method. with the t(-ais of the tangent in the point ( ( ( f = + ( 0, f R (4. ( ( f + = (4. f Here, if =, then the formulas (4., (4. become Newton s method. Eample 4.. In the case of =, applying the formula (4. to the Murase s euation (. of the hearth, we get = =. ( The formula (4.3 euals to (.6. Lemma 4.3. In the seuence { n }, let lim n = α, and, r anarbitrary real constant that is not 0, respectively. n In this case, following formula holds for large enough integer n. r r r n α α ( n α r Proof. Applying L Hospital s rule to ( α ( r α r (4.4, (4.4 is obtained. Proposition 4.4. If α is a simple root (m (> multiple root resp. of f( = 0, then α becomes the simple root (m multiple root resp. of g(. Theorem 4.5. Let α ( 0 be a simple root for f( = 0, i.e., f ( α 0. For sufficiently close to α, -th power of TH-method (Tsuchiura-Horiguchi s method becomes the uadratic convergence of the following formula. + ( α f α + ( α (4.5 f α If α is m ( multiple root, then it will become linearly convergence of the following formula. + α ( α (4.6 m Proof. If α is a simple root for g(t = 0, then Newton s method for g(t becomes the uadratic convergence of the following formula. Since t + ( α ( t α α g α (4.7 g 44

6 (4.7 becomes f g ( α = ( α α g, ( α + ( f α f α α =, (4.8 α + ( α f α f α α α α f ( α α +. (4.9 Here by the formula (4.4, α f α + f α α ( + α α α α f α is obtained. Similarly formula (4.6 is obtained from (.3. ( Varieties of Formulas to Compare the Convergences for the Etension of Newton s Method (Tsuchiura-Horiguchi s Method We deform the euation f( = 0 to h( = 0. That is, two euations have the same root. r-th power of TH-method for h( is ( ( r r r h = + r h and if α ( 0 is a simple root, then it becomes uadratic convergence + ( α, (4. h r α + ( α. (4. h α of formula (4.5 and (4.. = =, and α( 0 a simple root. Then the necessary and sufficient condition for the convergence to α of -th power of TH-method of f( to be eual to or faster than that r-th power of TH-method of h( is that the real numbers and r satisfy the following condition. We get the following proposition by comparing the coefficients of ( α Proposition 4.6. Let the euation h( = 0 be deformed from f( = 0. Let f h 0 ( α ( α f + f α h r + h α (4.3 Theorem 4.7. Let α ( 0 be a simple root of f( = 0, and f ( α 0. Then a necessary and sufficient condition for the convergence to α of -th power of TH-method is eual to or faster than that Newton s method is that satisfies the following conditions. i.e., ( α f + f α ( α f 0. f α Eual signs are the case of = and α f f Proof. Compare the coefficient of (4.4 (4.5 = +. α of the uadratic convergence (4.5 of -th power of TH-method and that (. of Newton s method. Then the necessary and sufficient condition is euivalent to f f +. (4.6 f α α f α 45

7 The formula (4.4 is obtained from (4.6. Theorem 4.8. Let α ( 0 be a simple root of f( = 0, and f ( α = 0 (i.e. the graph of f( is nearly the straight line in the neighborhood of the point α.. In this case (4.7 holds. 0 ( ( µ α = µ α (4.7 This is euivalent to the convergence to α of Newton s method euals to or faster than that -th power of THmethod. µ α. Proof. By deforming the formula to ( α µ α, we compare it with ( f ( f 0 + α α µ α = 0 µ α = = f f + + ( α α α f f f = 0 f = α α α (4.8 (4.9 We get the conclusion by this. The following are the results related to the conve-concave of curve and the formulas for comparing convergences of TH-method. Lemma 4.9. Let 0 and f ( 0. Then a necessary and sufficient condition for g ( and f ( are the same sign (opposite sign resp. is Proof. Because according to ( f ( f ( f + > 0( < 0 resp.. (4.0 f ( f ( f ( f ( + f ( + ( f ( g ( = =, (4. + > 0 < 0 resp. and f (, g ( resp.. We get the net theorem from Lemma 4.9, directly. ( Theorem 4.0. Let α( 0 be a simple root of f( = 0, and f ( α 0 Theorem 4.7 into positive and negative range as follows. ( α f + < 0 f α ( α f 0< + f α become the same sign (opposite sign. We divide the Formula (4.4 of (4. (4.3 If satisfies the condition (4.3 ((4. resp., then the conve-concave of curve of g( in the neighborhood g α = 0 and the f( in the neighborhood of f ( α ( = 0 are the same (opposite resp.. Theorem 4.. Let the conditions be the same as the above theorem. We give the following ineuality. of ( α ( α f f g (4.4 ( α Then the convergence to α of -th power of TH-method is eual to or faster than Newton s method euivalent 46

8 to the formula (4.4. Proof. By the formula ( + = + f f f f f and (4.4 of Theorem 4.7, (4.4 is obtained. Corollary 4.. If α then ineuality (4.4 becomes ( α (4.5 f g f. (4.6 The following are the results related to the curvature and the formulas for comparing the convergences of THmethod. Theorem 4.3. Let α ( 0 be a simple root of f( = 0, and f ( α 0. Suppose that the curvature μ ( of g( satisfies the condition µ α ( α f ( α ( α f + α 3. (4.7 Then the convergence to α of -th power of TH-method is eual to or faster than that Newton s method is euivalent to that (4.7 holds. Proof. The formula f ( α ( α ( f ( α 3 + α f f ( α + 3 = + α f f α α f α + α (4.8 and (4.4 of Theorem 4.7, (4.7 is obtained. Theorem 4.4. Let the conditions be same as the above theorem. Then formulas (4.9 and (4.30 are the euivalent. and ( α ( f ( α f + α f ( α µ ( α = = µ 3 3 ( f f α ( α + α + α ( α ( α α 3 f + f α f + ( + f ( α Proof. (4.30 is obtained from (4.9. Theorem 4.5. Let the conditions be same as Theorem 4.3. If ( α 3 (4.9 (4.30 µ α µ α (4.9 3 f 3 ( α ( f + + α hold, then the convergence to α of -th power of TH-method is eual to or faster than that Newton s method. (4.3 47

9 Proof. Assertion is obtained from (4.4 of Theorem 4.7 and (4.30, ( Convergence Comparisons of the Numerical Calculations of Newton s Method and Epansion of Newton s Method (Tsuchiura-Horiguchi s Method We use formula (4.' for the numerical calculations of -th power of TH-method for various euations such as n-th order euations ( n, euations of trigonometric, eponential, logarithmic function. We perform numerical calculations in the standard format in Ecel of Microsoft. Eample 5.. Numerical calculation of the p-th root. Let A be a real number, and p a natural number. The euation for p-th root is this. ( The application of the formula (4.5 In this case, formula (4.5 becomes p 0 f = A= p (5.. p A is p-th root of (5.., and we get p p p p p f A = p A = pa p p p f A = p p A = p p A. p pa 0 p p p p A A ( f = A= is p Especially p-th power of TH-method for 0 p p p p + p p (5.. i.e. p. (5..3 A = p = A. (5..4 Therefore, it converges to the root once for any initial value. Hence the number of iterations of formula (5..4 is less than that of the recurrence formula other. ( Speeds of convergences. The roots of f ( = 4= 0 are α = ±. The interval of of (5..3 is 3. In the following, we eamine the speed of convergence of -th power of TH-method in case of α =. The results of the calculations are Table. We eplain how to read this. The first column represents the initial value 0 and the absolute error + ( =, and the first row represents the real number of. Two numbers 3 and.36646e of intersection of two rows and two columns mean the following. Number 3 indicates the number of iterations that 0.5-th power of TH-method ( f 4 = 0.5 = 0.5 = f Table. Calculations of -th power of TH-method for f( = 4 = 0. ( (N-method ( 3 = Absolute error.36646e E 3.533E E E E E Absolute error E E E E E Absolute error 3.597E 4.045E E E E Absolute error 8.058E E E E E E 3.98E 48

10 to converge to a root e indicates the absolute error the value of the convergence of the numerical calculation + root. -th power of TH-methods converges to in number of iterations ; other TH-methods converge to that in three times. In case of 0 =.9,.95, absolute errors of =.,.5,.5, 3 are smaller than that = (Newton s method. Therefore degree of approimations of =.,.5,.5, 3 is better than that =. Furthermore, absolute errors of = 0.5, 3.5 are larger than that =. Thus, these numerical calculations are compatible with the theory of Theorem 4.7. f = 4 is this. (3 The application of the formula (4.7 of Theorem 4.3 for µ α = ( ( (5..6 Indeed, by calculating the left and right sides of (5..6 for in the Table 3 we get the numbers there. g( becomes a straight line 4 in case of =, and the curvature is 0. Therefore, the suare of TH-method converges to root in the number of iterations. For each, the second and third columns are calculations of formula (5..6. The fourth column is the calculations of µ. Columns 5 and 6 are the calculation of the left-hand side and the right-hand side of the ineuality (4.30, respectively. For each in 3, the numbers of the second column and third column satisfy the condition (5..6. (4 Formulas (4.9, (4.30 and (4.3. In case of =., the formulas (4.9, (4.30 of Theorem 4.4 do not hold, respectively. Formulas (4.9, (4.3 of Theorem 4.5 hold in.4 ecept for =.. However, in.6, formula (4.9 holds, but (4.3 does not hold. Eample 5.. A uadratic euation ( The roots of (5.. are α =,. Because f ( f ( Table 3. Calculations of (5..6, µ, (4.30 for f( = 4 = 0. f = = 3+ = 0 (5.. = 3, =, condition (4.5 becomes µ ( Right-hand side of (5..6 µ f ( f + Right-hand side of (

11 A. In case of α = Numerical calculations of TH-method, formulas (4.7, α 3 0. (5.. α 3. (5..3 µ α, (4.30 for α =. (A We eamine the speed of convergence of -th power of TH-method in 4. The results of the calculations are Table 4. In case of 0 =.05,., -th ( = _ 3, _, _, 0.5 power of TH-method converges better than Newton s method, respectively. Therefore, these are compatible with the theory of Theorem 4.7. f = 3+ and α=, formula (4.7 of Theorem 4.3 becomes (3A For + µ ( = (5..4 Indeed, by calculating the left and right sides of (5..4 for in the Table 5 we get the numbers there. For each in 3, the numbers of the second column and third column satisfy the condition (5..4. Table 4. Calculations of TH-method for f( = 3 + = 0, α = Absolute error E 9.77E E.6439E E Absolute error.63685e E 7.974E E E Absolute error.337e 5.045E E E Absolute error.06004e E E.383E 0 Table 5. Calculations of (5..4, µ (, (4.30 for f( = 3 + = 0. µ ( Right-hand side of (5..4 µ ( + f ( ( f ( Right-hand side of (

12 (4A Formulas (4.9, (4.30 of Theorem 4.4 hold. Formula (4.3 of Theorem 4.5 hold for = _ 0.5, 0.5,. B. In case of α = Numerical calculations of TH-method, formulas (4.7, 9. (5..5 µ α, (4.30 for α =. (B We eamine the speed of convergence of -th power of TH-method in 9.3. The results of the calculations are Table 6. In case of 0 =., numerical calculations of -th power of TH-method are compatible with the theory of Theorem 4.7. (3B For α =, formula (4.7 of Theorem 4.3 becomes + µ = ( ( (5..6 Indeed, by calculating the left and right sides of (5..6 for in Table 7 formula (5..6 holds in 9. (4B Formulas (4.9, (4.30 of Theorem 4.4 hold ecept for = _. In this case, according to increases, the value of the right-hand side of (4.30 increases rapidly. Formula (4.3 of Theorem 4.5 holds the eual sign only =. 3 Eample 5.3. Murase s third degree euation f ( = = 0 (5.3. = (.. Graph of f( is this (Figure. The graph is drawn in Bear Graph of free software. ( For a root of (5.3., condition (4.5 becomes 7 = (5.3. Table 6. Calculations of TH-method for f( = 3 + = 0, α = Absolute error E E Absolute error 6.784E E E Absolute error E E E E E E E 6.045E E E E 5

13 Table 7. Calculations of (5..6, µ, (4.30 for f( = 3 + = 0. µ ( Right-hand side of (5..6 µ + f ( f Right-hand side of ( E E E E E E E E E E E E Figure. Graph of 3 f = ( In case of = 0.5,,.5,,.45,.5, we calculate -th power of TH-method. The results are Table 8. In case of 0 =.9, numerical calculations of -th power of TH-method are compatible with Theorem 4.7. (3 Formula (4.7 of Theorem 4.3 becomes 6 6 µ = ( ( (5.3.3 By calculating the left and right sides of (5.3.3 for in Table 9 formula (5.3.3 holds ecept for 0.5 and.5. (4 Formulas (4.9, (4.30 of Theorem 4.4 hold for = 0.5,,.5. Formula (4.3 of Theorem 4.5 holds for =,.5. 5

14 Table 8. Calculations of TH-method for ( Absolute error.946e Absolute error 3.45E Absolute error E.337E Absolute error E E 4.045E E E Absolute error.9957e 5.543E E E 3 Table 9. Calculations of (5.3.3, µ, (4.30 for (5.3.. µ ( Right-hand side of (5.3.3 µ + f ( f Right-hand side of ( E Eample 5.4. A fifth degree euation 5 3 f = + 3= 0 ( f( has no terms of,,, and a root is α =. Graph of f( is Figure 3. Graph is the conve downward and monotonic decreases in < 0, the conve upward and monotonic decreases in 0<, and point (0,3 is a point of inflection. ( Condition (4.5 becomes (5.4. ( In case of = _,, 3, 5, 6, 6.8, 7, we calculate -th power of TH-method. The results are Table 0. Notation 5(#DIV/0! denotes that it is #DIV/0! in 5 iterations. In case of 0 =.063, numerical calculations of -th power of TH-method are compatible with Theorem 4.7. There is a noteworthy thing. In case of 0 = 0., number of iterations of Newton s method is times but that 3-th power of TH-method is 5 times only. (3 Formula (4.7 of Theorem 4.3 becomes 3 3 µ = (5.4.3 Indeed, by calculating the left and right sides of (5.4.3 for = _,, 3, 5, 6, 6.8, 8, 0 we get Table. Formula (5.4.3 holds for =, 3, 5, 6, 6.8, respectively. 53

15 Figure 3. Graph of 5 3 f = + 3. Table 0. Calculations of TH-method for f( = = (#DIV/0! (#NUM! Absolute error 8.86E E E Absolute error.0658e E 6 Table. Calculations of (5.4.3, µ (, (4.30 for f( = = 0. µ ( Right-hand side of (5.4.3 µ ( + f ( ( f ( Right-hand side of ( (4 Formulas (4.9, (4.30 of Theorem 4.4 hold for = and 3. Similarly formulas (4.9, (4.3 of Theorem 4.5 also hold for = and 3. Eample 5.5. Fifth degree euation f( has no terms of 5 4 f = + + = 0 (5.5. 3,,, and a root of (5.5. is α Graph of f( is Figure 4. The graph 54

16 Figure 4. Graph of 5 4 f = + +. becomes minimum at = 0, which is parallel to the -ais in the neighborhood. Net it increases and becomes maimum at =.6. Further, it decreases monotonically from here, and intersects with root α. The graph changes intensely in this way in _ < <.5. ( The formula (4.5 of Theorem 4.7 becomes (5.5.. f ( ie.. about 6.08 (5.5. f (The value of formula (5.5. for = 6.08 is ( For = _,, 3, 6, 9,, 5, 6, 7, we calculate -th power of TH-method. The results are Table. For 0 =.85, number of iterations of Newton s method and 3-th power of TH-method are the same 5. But absolute error of Newton s method is slightly smaller than that 3-th power of TH-method. The theory compatible with all other cases. In particular for the initial value is 0 =.5, the number of iterations of the 9-th power of TH-method is 4, which is etremely small than 54 times of the Newton s method. Therefore, we eamine the state of convergence of the 9-th power of TH-method. 9 Converting f( by = t, following formula is obtained. y g t f t t t The formula of the tangent of the curve of g(t at point ( n, ( n = = = + + (5.5.3 t g t is the following y = t + t n + g t 9tn 9tn 9tn 9tn n (5.5.4 For the initial value is.5 9, we give in Table 3 the calculations of 9-th power of TH-method to converge to (= and the tangents. Then we give the graphs of Figure 5 g( and the changes of the tangents. Straight line, and 3 in Figure 5 indicates the tangent to the number of iterations =,, 3, respectively. Point (., (. f is a point of inflection of graph f(. It becomes conve downward in <., minimum at = 0, and parallel to the -ais in the neighborhood of = 0. It becomes conve upward in. <, maimum at =.6. Therefore, choosing to.5 initial value for Newton s method, vibrate, and the number of iterations increase. Graph g(t (g( becomes minimum at t( = 0, but parallel parts to the t(-ais do not eist in the 9 9 neighborhood of this point. Further it becomes conve upward in t <, conve downward in < t, intersects at t = with t-ais, and close to the shape of a straight line in the neighborhood. Therefore, 55

17 Table. Calculations of TH-method for f( = = #NUM! 8 Oscillation #NUM! 3 #NUM! #DIV/0! 45 Oscillation #NUM! 9 #NUM!.5 #DIV/0! 54 Oscillation #NUM! 4 #NUM!.65 #DIV/0! Absolute error.66674e 0.878E Absolute error.5995e E #NUM! #NUM! 0 6 #NUM! E 0 Absolute error Absolute error 0 Table 3. Calculations of 9-th power of TH-method and tangents f ( f ( 9 Gradient of tangent Intercept vibration is only once, become a monotonically increasing seuence, and the number of iterations is reduced. (3 Formula (4.7 of Theorem 4.3 becomes µ α α + 4α + 5α + 8α 0α + 4α = α + 8α 5α + 8α + + ( α ( α α α. (

18 Figure 5. Graph g( and tangents (5.5.4 of g(. Indeed, by calculating the left and right sides of (5.5.5 for = _,, 3, 6, 9,, 5, 6, 7 we get Table 4. Formula (5.5.5 holds for =, 3, 6, 9,, 5, 6. (4 Formulas (4.9, (4.30 of Theorem 4.4 do not hold for = 3. Theorem 4.5 holds as euality for =. Euation (5.4.,(5.5. has only one term which degree is smaller than highest degree, respectively. These euations have the trend that the convergences of TH-methods are etremely fast than that Newton s method. Eample 5.6. f ( = sin = 0 (5.6 f mπ = sin mπ = 0. Because µ ( α = 0 µ ( α ( m 0, of Theorem 4.8 holds, convergence of Newton s method of = is the fastest in other -th power of TH-method. For α = π, = ±, ±, ±3, we calculate -th power of TH-method. The results are Table 5. Eample 5.7. Roots of euation (5.6 are α = mπ (m is an integer, π , and n α α 0 ( α 0, ( 3 : natural number f = + = n (5.7. A root of euation (5.7. is α. Because n f n α n = + α, f ( = n( n ( α, f ( α 0 this is also an eample of Theorem 4.8. Particular if n 4 then root α of f ( 0 For n = 3, α =, euation (5.7. is the following. 3 3 =, = becomes multiple root. f = + = = 0 (5.7. For = _, _,,, 3, we calculate -th power of TH-method, and get Table 6. Eample 5.8. ( The root of (5.8. is ln , and 0 f = e = (5.8. ( n 0 f = e. Applying (4.5 of Theorem 4.7, we have + ln (5.8. ( For = 0.5,,.5,, ,.5, we calculate -th power of TH-method. However, we calculate the absolute error as ln root. The results are Table 7. For 0 = 0.73, 0.76, -th power of TH-method has better approimate degree than Newton s method in the range of (5.8.. (3 Formula (4.7 of Theorem 4.3 for (5.8. becomes 57

19 Table 4. Calculations of (5.5.5, µα, (4.30 for f( = = 0. µ ( α Right-hand side of (5.5.5 µ ( α + f ( α f Right-hand side of ( E E E E E E E 0.505E E.4048E Table 5. Calculations of TH-method for f( = sin = Absolute error 4.007E E Absolute error 4.007E E Table 6. Calculations of TH-method for ( Absolute error E E 6.453E.3887E Absolute error.0953e E E E Absolute error E E 3 Table 7. Calculations of TH-method for f( = e = Absolute error E Absolute error.0e 6.744E E.305E Absolute error E 3.533E 4.0E E E Absolute error.0667e E 5.55E E E E 58

20 µ (( ln = ( ( ( + ln ln + ( ln ln + ( ln 3 3. (5.8.3 By calculating the left and right sides of (5.8.3 for in Table 8 we get the numbers there. Formula (5.8.3 holds for ecept for 0.8 and.4. (4 In Table 8, formulas (4.9, (4.30 hold in the range of (5.8. ecept for = (4.3 holds in (5.8.. Eample 5.9. ( The root of (5.9. is α =, and f ( = 0. Applying (4.5 we have f ( = ln = 0 (5.9.. (5.9. ( The calculations for TH-method are Table 9. For 0 =.05,.,., -th ( = _, _ 0.5, 0.5 power of TH-method converges better than Newton s method, respectively. (3 Formula (4.7 of Theorem 4.3 for (5.9. is this. µ ( ( + = = (5.9.3 By calculating the left and right sides of (5.9.3 for in Table 0 we get the numbers in its. In euality (5.9.3 holds for ecept for _.5 and.5. (4 Formulas (4.9, (4.30, (4.3 hold for = _, _ 0.5, 0.5,. Table 8. Calculations of (5.8.3, µα, (4.30 for f( = e = 0. µ ( Right-hand side of (5.8.3 µ ( α + f ( α f Right-hand side of (

21 Table 9. Calculations of TH-method for f( = ln = Absolute error.57945e E E E E Absolute error.3334e E E E E E Absolute error.0476e.049e E E E E Absolute error.8553e E.93099E E E E Absolute error.045e E E 5 Table 0. Calculations of (5.9.3, µ (, (4.30 for f( = ln = 0. µ ( Right-hand side of (5.9.3 µ ( + f ( ( f ( Right-hand side of ( Acnowledgements Dr. Tamotsu Tsuchiura (93-05, professor emeritus of Tohou University and Dr. Mitsuo Morimoto (professor emeritus of Sophia University gave hints to me. I am deeply grateful to them. References [] Murase, Y. (673 Sanpoufutsudanai. Nishida, T., Ed., Kenseisha Co., Ltd., Toyo. (In Japanese [] Horiguchi, S. (04 On Relations between the General Recurrence Formula of the Etension of Murase-Newton s Method (the Etension of Tsuchiura-Horiguchi s Method and Horner s Method. Applied Mathematics, 5, [3] Suzui, T. (004 Wasan no Seiritsu. Kouseisha Kouseiau Co., Ltd., Toyo. (In Japanese [4] Tsuchiura, T. (0 Calculation Methods of p-th Root by the Ideas That the Mathematicians of Wasan Thin about. The Bulletin of Wasan Institute, 3, 0-6. (In Japanese [5] Nagasaa, H. (980 Computer and Numerical Calculations. Asaura Publishing Co., Ltd., Toyo. (In Japanese 60