A BASIC FAMILY OF ITERATION FUNCTIONS FOR POLYNOMIAL ROOT FINDING AND ITS CHARACTERIZATIONS. Bahman Kalantari 3. Department of Computer Science
|
|
- Ferdinand James
- 6 years ago
- Views:
Transcription
1 A BASIC FAMILY OF ITERATION FUNCTIONS FOR POLYNOMIAL ROOT FINDING AND ITS CHARACTERIZATIONS Bahman Kalantari 3 Department of Computer Science Rutgers University, New Brunswick, NJ Iraj Kalantari Department of Mathematics Western Illinois University, Macomb, IL, 6455 Rahim Zaare-Nahandi y Department of Mathematics University of Tehran, Tehran, Iran 3 This research is supported in part by the National Science Foundation under Grant No. CCR y This research is supported in part by a grant from University of Tehran.
2 Abstract Let p(x) be a polynomial of degree n 2 with coecients in a subeld K of the complex numbers. For each natural number m 2, let L m (x) be the m 2 m lower triangular matrix whose diagonal entries are p(x) and for each j = ; : : : ; m 0, its j-th subdiagonal entries are p (j) (x)=j!. For i = ; 2, let L (i) m (x) be the matrix obtained from L m (x) by deleting its rst i rows and its last i columns. L () (x). Then, the function B m (x) = x 0 p(x) det(l () m0 (x))=det(l() m (x)) is a member of S(m; m + n 0 2), where for any M m, S(m; M) is the set of all rational iteration functions such that for all roots of p(x), g(x) = + P M i=m i (x)( 0 x) i, with i (x)'s also rational and well-dened at. Given g 2 S(m; M), and a simple root of p(x), g (i) () = 0, i = ; : : :; m 0, and m () = (0) m g (m) ()=m!. For B m (x) we obtain m () = (0) m det(l (2) m+ ())=det(l() m ()). For m = 2 and 3, B m (x) coincides with Newton's and Halley's, respectively. If all roots of p(x) are simple, B m (x) is the unique member of S(m; m + n 0 2). By making use of the identity 0 = P n i=0 [p (i) (x)=i!]( 0 x) i, we arrive at two recursive formulas for constructing iteration functions within the S(m; M) family. In particular the B m 's can be generated using one of these formulas. Moreover, the other formula gives a simple scheme for constructing a family of iteration functions credited to Euler as well as Schroder, whose m-th order member belong to S(m; mn), m > 2. The iteration functions within S(m; M) can be extended to arbitrary smooth functions f, with the automatic replacement of p (j) with f (j) in g as well as m ().
3 . INTRODUCTION. Let p(x) be a polynomial of degree n 2 with coecients in a subeld K of the complex numbers. For each natural number m 2, let L m (x) be the m 2 m lower triangular matrix whose diagonal entries are p(x) and for each j = ; : : : ; m 0, its j-th subdiagonal entries are p (j) (x)=j!, i.e. L m (x) = 0 p(x) 0 0 : : : 0 p 0 (x) p(x) 0 : : : 0 p 00 (x) p 0 (x) p(x) : : : 0 2! p (m0) (x) (m0)! p (m02) (x) (m02)! p (m03) (x) (m03)! : : : p(x) C A : (:) For i = ; 2, let L (i) m (x) be the (m0i)2(m0i) matrix obtained from L m(x) by deleting its rst i rows, and its last i columns, i.e. L () m = 0 p 0 (x) p(x) 0 : : : 0 p 00 (x) p 0 (x) p(x) : : : 0 2! p (m0) (x) (m0)! p (m02) (x) (m02)! with L () (x). The function p (m03) (x) (m03)! : : : p 0 (x) C A ; L (2) m = 0 p 00 (x) 2! p 0 (x) : : : 0 p 000 (x) 3!. p (m0) (x) (m0)! p 00 (x) : : : 0 2!..... p (m02) (x) (m02)! : : : B m (x) = x 0 p(x) det(l() m0(x)) det(l () m (x)) ; (:2) denes a xed-point iteration function which has local m-th order convergence for simple roots of p(x) (see Remark. below). Here det is the determinant function. We shall refer to the set of all B m (x)'s, m = 2; 3; : : :, as the Basic F amily of xed-point iteration functions for polynomial root nding. Specic members of the family are B 2 (x) = x 0 p(x) p 0 (x) ; which is the well-known Newton's function, and B 3 (x) = x 0 which is Halley's function. For m = 4, one obtains B 4 (x) = x 0 2p 0 (x)p(x) 2(p 0 (x)) 2 0 p 00 (x)p(x) ; 6p 0 (x) 2 p(x) 0 3p 00 (x)p(x) 2 p 000 (x)p(x) 2 + 6p 0 (x) 3 0 6p 00 (x)p 0 (x)p(x) : p 00 (x) 2! C A ;
4 The function B 2 (x) is derived in almost all the numerical analysis textbooks with the usual geometric interpretations (see e.g. Atkinson [2]). The Function B 3 (x), credited to the astronomer Halley [2], is perhaps the best-known third-order method, and has been rediscovered and/or derived through various interesting means, see e.g. Bateman [3], Wall [25], Bodewig [4], Hamilton [3], Stewart [22], Frame [7, 8, 9], Traub [23], Hansen and Patrick [4], Popovski [7], Gander [0]. For the interesting history of Halley's function see the recent paper of Scavo and Thoo [8]. p(x)= Halley's function can also be obtained by applying Newton's method to the function q p 0 (x), see Bateman [3], as well as Brown [5], and Alefeld []. Most recently, this was rediscovered by Gerlach [] who also generalized it to get high order methods : Let F (x) = p(x), and dene inductively for i = 2; 3; : : :, F i (x) = F i0 (x)=[f i0 (x)] =i. Then for m = 2; 3; : : :, the function G m (x) = x 0 F m0 (x)=f 0 m0 (x), under some very restrictive conditions, will have m-th order convergence rate. Interestingly, G 4 (x) coincides with B 4 (x) and possibly they are all identical. Gerlach however oers no closed formula for G m (x). Moreover, the domain of G m 's is very restrictive. Indeed the computation of G m (x) is too cumbersome and Gerlach only obtains G 4 (x) for p(x) = x 3 0. In [5], the closed formula for B m (x) corresponding to this cubic polynomial as well as to p(x) = x 2 0 was obtained. Indeed for general functions, B 4 (x) had been obtained previously and through dierent schemes by Snyder [2], Traub [23](page 9), and others. Interestingly, Hamilton [3], made use of determinants in deriving Halley's function. In fact Hamilton does make use of the determinant of the matrix L () m (x), to arrive at high order methods, but he does not obtain B m (x) for any m 4. For instance he obtains a forth-order method which is dierent than B 4 (x) (see page 52, [3]). The algebraic characterization and the existence of the Basic Family was proved in [6]. The present paper gives further characterizations, closed formula for its members, their corresponding asymptotic constant, and thus oers a deeper understanding of each of its individual members, including Newton's and Halley's functions. Denition.. For each pair of nonnegative integers m and M, M m, let S(m; M) 2
5 be the set of all function g(x) 2 K(x), i.e. a rational function with coecient in K, so that for all roots of p(x) we have g(x) = + M i=m i (x)( 0 x) i ; (:3) where i (x) 2 K(x), for i = m; : : : ; M, and well-dened for any simple root, i.e. lim x! i (x) i () exists. Moreover, m (x) and M (x) are not identically zero. Remark.. Given g 2 S(m; M), from the continuity of i (x)'s at a simple root, and since m 2 it follows that there exists a neighborhood of for which jg(x) 0 j Cjx 0 j m, for some constant C. This implies the existence of a neighborhood I of for which for any x 0 2 I the xed-point iteration converges to, and clearly x k+ = g(x k ); k 0; (:4) ( 0 x k+ ) lim k! ( 0 x k ) = m 0 m(); (:5) i.e. the rate of convergence of the sequence fx k g k=0 is of order m. Also note that if x 0 is in K, then so are all the iterates in (.4). Denoting m (x) corresponding to B m (x) by (m) m (x), we show that for a simple root, the asymptotic constant of convergence for B m (x) is (m) m () = (0) m det(l(2) m+()) det(l () m ()) = In particular for m = 2 and m = 3 we get (0)m p 0 det(l(2) m0 () m+()): (:6) (2) 2 () = p00 () 2p 0 () ; (3) 3 () = 0 2p0 ()p 000 () 0 3p 00 () 2 2p 0 () 2 : We show that if all roots of p are simple, B m (x) is the unique member of S(m; m + n 02). The following denition provides means by which members from two dierent S(m; M)'s can be compared. 3
6 Denition.2. Given g 2 S(m; M), we dene the order of g to be m. The coef f ient vector of g is the vector 0(x) = ( m (x); : : : ; M (x)). The leading coefficient of g is m. The width of g is M 0m+. We dene the depth of g to be d if the formula for g depends on p (j), j = 0; : : : ; d. Similarly we dene the depth of the leading coecient of g. The simple-root-depth of g is dened to be, if for any simple root of p(x), m () depends on p (j) (), j = 0; : : : ;. Remark.2. If g and h are in S(m; M), so is any ane combination, g + h, where + =. As, B m (x) will be shown to belong to S(m; n + m 0 2), it follows that for any m 2, and M m + n 0 2, the set S(m; M) is nonempty. If p(x) has simple roots, as B m (x) will be shown to be the unique element of S(m; m+n02), it follows that S(m; M) is empty if M < n + m 0 2. Thus, B m (x) is also minimal with respect to width. Traub [23], has shown that any m-th order method must have depth at least equal to m 0. Thus, in the sense of depth too, B m (x) is minimal. Remark.3. Given g 2 S(m; M), from Taylor's Theorem and the continuity of i 's at a simple root, it is easy to conclude that that g (i) () = 0, for all i = ; : : : ; m 0, and that m () = (0) m g(m) () : (:7) m! It should be noted that as functions m (x) and (0) m g (m) (x)=m! are not identical. For example take g(x) = x 0 p(x)=p 0 (x). In other words g (m) (x) and m (x) may have dierent depths, but they have the same simple-root-depth. Denition.3. Let S (m; M) be the set of all g(x) 2 K(x) such that p(y) divides M i (x)(y 0 x) i ; (:8) 0 (y) = 0g(x) + y + in K(x)[y], i.e. polynomials in y with coecients in K(x), such that i (x) is well-dened for any simple root of p(x), and neither m (x) nor M (x) are identically zero. i=m Remark.4. If is a root of p, then 0 () = 0. Thus, it follows that S (m; M) is a subset of S(m; M). Also, if all the roots of p(x) are simple (in particular if it is 4
7 irreducible), then S (m; M) = S(m; M). To see this pick g 2 S(m; M), and dene a corresponding 0 (y). Then there exists q(y); r(y) 2 K(x)[y] such that 0 (y) = p(y)q(y) + r(y); (:9) where the degree of r(y) is less than n. Since 0 () = 0, for all roots of p, it follows that r(y) 0 (see e.g. [24]). Note that in particular we must have g(x) = x 0 0 (x): (:0) In general however, S(m; M) and S (m; M) are not the same. For example consider p(x) = x 2. Then g (x) = x=2 and g 2 (x) = x 2 both lie in S(2; 2), but g 2 (x) is not in S (2; 2). Denition.4. Let S(m; M) be the set of all g(x) which can be represented as (:3) but with the relaxation of the condition that i ()'s are well-dened. We will give two formulas for generating new members of S(m; M) with higher orders. Both formulas make use of the following relationship which is a consequence of Taylor's Theorem, but can also be derived using purely algebraic means (see [6]) 0 = n i=0 p (i) (x) ( 0 x) i : (:) i! From (:) we have Writing 0p(x) = n i= p (i) (x) ( 0 x) i : (:2) i! x = 0 ( 0 x); (:3) and adding corresponding sides to (.2) we get B (x) x 0 p(x) = + (p 0 (x) 0 )( 0 x) + n i=2 p (i) (x) ( 0 x) i 2 S(; n): (:4) i! From (.) we also immediately get Newton's function as a member of S(2; n) B 2 (x) = x 0 p(x) p 0 (x) = + n 5 i=2 p (i) (x) i!p 0 (x) ( 0 x)i : (:5)
8 As we shall see from B (x) and B 2 (x) together with the application of the two formulas one can construct a large class of iterative solutions which include the Basic Family, and the Euler-Schroder family. Finally, we show that the iteration functions within S(m; M) can be extended to arbitrary smooth functions f, with the automatic replacement of p (j) with f (j) in g, and the asymptotic constant of convergence m (). In Section 2, we give an algebraic proof of the existence of B m (x). The result will be used in Section 3 for deriving a closed formula for B m (x), and in Section 4, which describes the two formulas for generation of new iteration functions. In Section 5, we consider the extension of iteration function within S(m; M) to arbitrary smooth functions. 2. ALGEBRAIC PROOF OF EISTENCE OF THE BASIC FAMILY In this section we prove algebraically the existence of an iteration function in S(m; m+ n 0 2) as well as its uniqueness under the assumption that p(x) has simple roots. We shall only be concerned with the existence of B m (x) as opposed to its closed form. The theorem of this section will be used in the subsequent sections in deriving the closed form, as well as proving the equivalence of S(m; m + n 0 2), S (m; m + n 0 2), and S(m; m + n 0 2), given that p(x) has simple roots. The proof of the theorem also motivates the denition of S (m; m + n 0 2) which in turn gives rise to the closed formula for B m (x). Moreover the theorem will be used to prove that the Basic Family can also be obtained recursively using one the formulas derived in Section 4. Theorem 2.. For any natural number m 2, S(m; m + n 0 2) is nonempty, and has a unique element if p(x) has simple roots. To prove Theorem 2. we rst need an auxiliary lemma. Given two natural numbers s and t let s t! s(s 0 ) : : : (s 0 t + ) ; (2:) t! the binomial coecient for s t, and zero, for s < t. For a given pair of natural numbers 6
9 m and r dene the following r 2 r matrix U m;r = 0 m m 2. m r m+ m+ 2. m+ r : : : m+r0 m+r0 : : : : : : m+r0 r C A : (2:2) Lemma 2.. For any natural numbers m and r, U m;r is invertible (in fact det(u m;r ) = ). m+r0 r Proof. To prove the lemma we will show that by performing elementary operations on U m;r, we can reduce it to the following matrix W m;r = 0 m (m + ) : : : (m + r 0 ) m 2 (m + ) 2 : : : (m + r 0 ) m r (m + ) r : : : (m + r 0 ) r Since W m;r = V T D, where V is an invertible Vandermonde matrix, and D = diag(m; m+ ; : : : ; m + r 0 ), it follows that W m;r is invertible. To obtain this reduction, we rst multiply the j-th row of U m;r by j!. Let U denote the new matrix. The rst column of U has entries which can be written as the following polynomials in m: f (m) = m, f 2 (m) = m 2 0m; : : :, f r (m) = m r + r0 m r0 + r02 m r02 +: : :+ m, for some coecients i, i = ; : : : ; r 0. The second column of U can be written as the same polynomials evaluated at (m + ), and so on. Thus, U is the r 2 r matrix whose i-th row vector is given by U = 0 f (m) f (m + ) : : : f (m + r 0 ) f 2 (m) f 2 (m + ) : : : f 2 (m + r 0 ) f r (m) f r (m + ) : : : f r (m + r 0 ) By adding scalar multiples of the rst row of U to other rows, we obtain a new matrix U 2 whose rst and second rows are the corresponding rows of W m;r, and whose remaining rows are polynomials free of the linear terms. Next, by adding scalar multiples of the second row of U 2 to its i-th rows, i = 3; 4; : : : ; r, we obtain U 3 whose rst three rows are those of W m;r and whose remaining rows are polynomials free of the linear and quadratic 7 C A : C A :
10 terms. Clearly, repeating this process we arrive at W m;r. 2 Proof of Theorem 2.. Let be any root of p(x). Recalling (:3) and replacing k by (0) k k for convenience, we will prove the existence of rational functions g(x) and k (x), k = m; : : : ; (m + n 0 2) with coecient over K so that 0g(x) + + m+n02 k=m Using that p() = 0, for any k n we can write k = n0 l=0 k (x)(x 0 ) k = 0: (2:3) l l ; (2:4) where l 2 K. From (2:4) it is easy to see that for each j = 0; : : : ; (n 0 2), (x 0 ) m+j = n0 i=0 i P m+j i (x); (2:5) where P m+j i (x)'s are polynomials with coecients in K. Furthermore, for i m + j, and for i > m + j, P m+j i P m+j i (x) = m + j i Using (2.5), we can rewrite (2.3) as where h i (x) =! x m+j0i + lower order terms; (2:6) (x) 0, which from (2.) can be written as P m+j i (x) = 0 = m + j i 0g(x) + h (x) = + m+n02 k=m n0 i=0 m+n02 k=m! x m+j0i : (2:7) i h i (x) = 0; (2:8) k (x)p k (x); (2:9) k (x)p k i (x); i = 0; i = 2; : : : ; n: (2:0) Thus, S(m; m+n02) is nonempty if the system of equations h i (x) 0, i = ; : : : ; (n0), is solvable, in which case g(x) = h 0 (x) = m+n02 k=m k (x)p k 0 (x) 2 S(m; m + n 0 2): (2:) 8
11 Equivalently, S(m; m + n 0 2) is nonempty if the system of nonlinear equations is solvable where 5 m (x)0 m (x) = e; (2:2) 0 m (x) = [ m (x); m+ (x); : : : ; m+n02 (x)] T ; e = [0; 0; : : : ; 0] T ; (2:3) and where 5 m (x) is the following (n 0 ) 2 (n 0 ) matrix 5 m (x) = 0 P m (x) P m+ (x) : : : P m+n02 (x) P m 2 (x) P m+ 2 (x) : : : P m+n02 2 (x) Pn0(x) m P m+ n0 (x) : : : P m+n02 (x) n0 C A : (2:4) All that remains to be done is to show that the determinant of 5 m (x) which is a polynomial in the indeterminate x, is not identically zero, in which case 0 m (x) = 5 0 m (x)e: (2:5) To show that det(5 m (x)) is not identically zero, it suces to prove that its highest term is not zero. From (2.6) and (2.7), the highest term of det(5 m (x)) is the determinant of H m (x), the (n 0 ) 2 (n 0 ) given by H m (x) = 0 It is easy to check that m m 2 m n0 x m0 m+ x m02 m+ 2. x m0n+ m+ n0 hence not identically zero by Lemma 2.. x m : : : m+n02 x m+n03 m+n02 x m+n04 2 x m0 : : :..... x m0n+2 : : : m+n02 n0 x m0 C A : (2:6) det(h m (x)) = x (m0)(n0) det(u m;n0 ); (2:7) We must show that m (x) and m+n02 (x) are not identically zero. To prove this rst suppose that p(x) has simple roots and consider the expression 0g(x) + P n0 i=0 i h i (x) as a polynomial over K(x) in the indeterminate. Every root of p(x) is a root of this 9
12 polynomial. On the other hand its degree is n 0. It follows that 0g(x) + h 0 (x) = 0, and h i (x) = 0, for i = ; : : : ; (n 0 ). In other words (2:5) must be satised implying the uniqueness of g(x). Let us denote this unique solution by B m (x) = + m+n02 i=m (m) i (x)( 0 x) i : (2:8) Next we prove that B m (x) and B m+ (x) are distinct. Otherwise, we must have 0 m (x) = 0 m+ (x). From (2:2) the following must hold 5 m (x)0 m (x) = 5 m+ (x)0 m (x): (2:9) Equivalently, (5 m+ (x) 0 5 m (x))0 m (x) = 0: (2:20) But by the same reasoning as before, the matrix of the leading coecient of (2.20) is H m+ (x), whose determinant is nonzero. This implies 0 m (x) 0, a contradiction. Hence the proof of distinctness m Next we prove that for all m = 2 the leading coecient, (m) (x), and the last coecient, (m) m+n02(x), are nonzero functions. As we have seen for m = 2, the function x 0 p=p 0 (see (:5)) lies in S(2; n). From uniqueness we must have B 2 (x) = x 0 p=p 0. Now assume m > 2 and consider B m0 (x), B m (x), and B m+ (x). If the leading coecient of B m (x) is identically zero, then 2 B m(x) + 2 B m+(x) 2 S(m + ; m + n 0 ); contradicting uniqueness. If the last coecient of B m (x) is identically zero, then again a contradiction. 2 B m(x) + 2 B m0(x) 2 S(m 0 ; m + n 0 3); To complete the proof we must show that the leading coecient of B m (x), as well as the last coecient remain to be nonzero even if p(x) has multiple roots. But in this case too we can arrive at the same set of polynomials P m+j i (x) and hence the same equation (2:). 2 0
13 3. DERIVING CLOSED FORM FOR MEMBERS OF THE BASIC FAMILY In this section we shall derive the closed form for members of the Basic Family. In doing so, it is more convenient to consider the functions in S(m; M), with m 2, M m+n02. Recall that g 2 S(m; M) implies there exists i (x) 2 K(x), i = m; : : : ; M, such that p(y) divides 0 (y) = 0g(x) + y + M l=m l (x)(y 0 x) l ; (3:) in K(x)[y]. Equivalently, if we let z = y 0 x, then f(z) = p(z + x) must divide h(z) = 0 (z + x). From Taylor's Theorem as applied to the polynomial p(y) we have Since 0 (x) = x 0 g(x), f(z) = n i=0 h(z) = 0 (x) + z + p i (x) z i : (3:2) i! M l=m From the divisibility condition, there exist a polynomial q(z) = M0n j=0 l (x)z l : (3:3) v j z j ; (3:4) with v j 2 K(x) such that h(z) = f(z)q(z): (3:5) Equivalently, while suppressing x for brevity we get the system of equations i+j=l i+j=l pv 0 = 0 ; (3:6) pv 0 + p 0 v = ; (3:7) p (i) i! v j = 0; l = 2; : : : ; m 0 ; (3:8) p (i) i! v j = l (x); l = m; : : : ; M: (3:9) The matrix corresponding to the rst m equations, i.e. (3:6), (3:7), and (3:8) is precisely the matrix L m (see (.)). Letting b to be the m-vector ( 0 ; ; 0; : : : ; 0) T and v the m- vector (v 0 ; : : : ; v m0 ) T, we get L m v = b: (3:0)
14 Lemma 3.. For any natural number k the matrix 0 n n 0 0 : : : 0 n n n 2 Z n;k = 0 : : : 0 C A n is invertible. n k n k0 n k02 : : : ; Proof. All that is needed is to reduce it the a matrix of the type U m;r (see (2.2)). n Using the identity i + n i0 = n+ i, starting with the last column of Z = Z n;k we add to each column its previous column to get a new matrix Z 2. We repeat this process to columns of Z 2 except for its 2-nd column and get a new matrix Z 3. Next we repeat the process to columns of Z 3 except for its 3-rd column. This process will eventually result in a matrix of the type U m;r. 2. From Lemma 3., analogous to the proof of invertibility of H m (x), we can immediately conclude Corollary 3.. For each natural number m 2, the matrix L () m is invertible. 2 Theorem 3.. Let B m (x) be the function in S(m; m + n 0 2) whose existence was proved in Theorem 2.. Then B m (x) = x 0 p(x) det(l() m0(x)) det(l () m (x)) : Moreover, it lies in S(m; m + n 0 2), and if is a simple root of p(x) then m (m) det(l(2) () = m+()) (0)m det(l () m ()) : Proof. Letting j to be the determinant of L m with the j-th column replaced with b, from Cramer's rule as applied to the system (3:0) we get v j = j ; j = 0; : : : ; m 0 : (3:) det(l m ) 2
15 Since p is nonzero, det(l m ) is not identically zero, thus each v j is well-dened and unique. Since for B m (x), M = m + n 0 2, we must have v m0 = 0. In particular by expanding the determinant of m0 along its last column, and then expanding the second resulting determinant along its rst row, we get v m0 = m0 = 0 det(l () m ) 0 p(x)det(l() m0) = 0: (3:2) From Corollary 3., L () m is invertible so that (3:2) can be solved for 0 which results in the closed formula for B m (x). To show B m (x) also lies in S(m; m + n 0 2), we will compute (m) l (), l = m; : : : ; m + n 0 2. First consider l = m. The m + equations corresponding to (3:6), (3:7), (3:8), and the rst equation of (3:9) at x =. Since the rst of these equations is zero, if we let b (m) () denote the m-vector (; 0; : : : ; 0; m (m) ()), we get the following m 2 m system L () m+()v() = b (m) (): (3:3) The above system has a unique solution since the coecient matrix is a lower triangular matrix with diagonal entries p 0 () 6= 0. Using the fact that v m0 () = 0, the Cramer's rule, and by expansion along the last column of the matrix L () m+() with its last column replaced by b (m) (), we get m (m) ()det(l() m ()) 0 (0)m0 det(l (2) m+()) = 0: (3:4) The above can be solved for m (m) () which results in the stated equation of the theorem. For l = m + ; : : : ; m + n 0 2, the corresponding equation in (m) i (m) is of the form l ()det(l () ()) + w(); (3:5) for some w(), hence are well-dened proving that B m (x) lies in S(m; m + n 0 2). 2 m Let us treat 0 (x) in equation (3:6) also as a variable, and consider the the m equation in m + unknowns corresponding to equation (3:6) 0 (3:8), i.e. L m v 0 0 e = e 2 ; (3:6) where e i is the column m-vector with the i-th component equal to, and all other components equal to 0. A basic solution of the above system is a solution with at most m 3
16 nonzero components. The following is evident Theorem 3.2. The basic solution of the system of equations in (3:6) corresponding to v i = 0, i = 0; : : : ; m 0 are B i+ (x), where B 0 (x) = x. 2 Remark 3.. If g 2 S(m; M) has the property that its corresponding equation in (3:0) satises v m0 = 0, and v m = 0 (a condition that is necessarily satised for M = m + n 0 2), then m (x) depends only on p (i) (x), i = 0; : : : ; m, i.e. the simple-rootdepth of g will be m. Remark 3.2. Since Taylor's Theorem holds in any eld of characteristic zero, the existence of B m (x) extends to the case where K is such a eld. 4. TWO FORMULAS AND THEIR APPLICATIONS. In this section we derive two formulas that will result in the generation of very large class of iteration functions. Both will all rely on (:2). To derive the rst formula, suppose that g 2 S(m; M), with m, i.e. g = + M i=m i ( 0 x) i : (4:); where for the sake of simplicity we have suppressed the argument x. From (:2) we have where (m) i = Multiplying (4:2) by 0 m = (m) m (0p) m = i +:::+i m=i;ij M 0 i=m (m) i ( 0 x) i ; (4:2) p (i ) p (im) i! i m! ; i = m; : : : ; mn: (4:3) = 0 m=p 0m and adding to (4.) we get h = g 0 (0) m m ( p p 0 )m = + M 0 i=m+ i ( 0 x) i ; (4:4) where M 0 = maxfm; mng; 4
17 with i 0 for i > M, and (m) i (m) i i = i 0 m (p 0 ) m ; i = m + ; : : : ; M 0 ; (4:5) 0 for i > mn. Theorem 4.. Assume that the leading coecient of h is not identically zero. Then, h lies in S(m; M), for some m m +, M M 0. If m = m +, then m+ () = m+ () 0 m () m 2 p 00 () p 0 () : (4:6) Proof. Let be a simple root of p(x). Since g 2 S(m; M) for i = m; : : : ; M, i () is well-dened. Clearly, for i = m + ; : : : ; mn, i () is well-dened. The equation (4.6) follows from (4.5) and that (m) m+ = (m=2)(p 00 p 0m ). 2 Next we derive another formula. Let g be in S(m 0 ; M m0 ), and h in S(m; M m ). Let M m+ = maxfm m ; M m0 ; m + n 0 g. We write where where From (4.7) and (4.8) we get g = + M m+ i=m0 i 0; 8i > M m0 ; h = + M m+ i=m i 0; 8i > M m : g 0 h = m0 ( 0 x) m0 + i ( 0 x) i ; (4:7) i ( 0 x) i ; (4:8) M m+ i=m ( i 0 i )( 0 x) i : (4:9) Also, multiplying (.2) by ( 0 x) m0, and since p j 0, for j > n, we get 0 = p( 0 x) m0 + M m+ i=m p (i+0m) (i + 0 m)! ( 0 x)i : (4:0) Multiplying (4.9) by p, and (4.0) by 0 m0 and adding the resulting equations we get M m+ p p(g 0 h) = p( (i+0m) i 0 i ) 0 m0 ( 0 x) i : (4:) (i + 0 m)! i=m 5
18 Multiplying (4.) by 0 m =D, where and adding the result to (4.8) we get D = [p( m 0 m ) 0 p 0 m0 ]; (4:2) f = h 0 m p(g 0 h) D = + M m+ i=m+ i ( 0 x) i ; (4:3) with p( i 0 i ) 0 p(i+0m) m0 (i+0m)! i = i 0 m ; 8i = m + ; : : : ; M m+ : (4:4) D Theorem 4.2. Suppose that D is not identically zero. Then f 2 S(m; M), where m m +, M M m+. If m = m +, then m+ () = m+ () 0 m () p00 () 2p 0 () : (4:5) Proof. Let be a simple root of p(x). Clearly f lies in S(m; M) for some m+ m M M m+. Since m0 is not identically zero, and since it is a rational function over K, together with the fact that p 0 () 6= 0 it follows from (4.4) that for i = m + ; : : : ; M m+ we have lim p (i+0m) () i(x) = i () 0 m () x! (i + 0 m)!p 0 () ; i.e. i () is well-dened. In particular we get (4:5). 2 Next we consider two application of these formulas. Theorem 4.3. Suppose that in (4:3), g = B m0 and h = B m, then f = B m+, for all m 2. Proof. It suces to prove this under the assumption that p has only simple roots. In order to prove the theorem we rst need to show that the function D is not identically zero. From (4:) we have p(g 0 h) = D + m+n0 i=m+ p( i 0 i ) 0 m0 p (i+0m) (i + 0 m)! ( 0 x) i : (4:6) 6
19 If D is identically zero, then B m+ + p(g 0 h) 2 S(m + ; m + n 0 ): (4:7) But this contradicts the uniqueness result proved in Theorem 2.. Thus, D is not identically zero, implying that f 2 S(m + ; m + n 0 ). Again by Theorem 2., we must have that f = B m+. 2 Theorem 4.4. Consider the family E ; E 2 ; E 3 ; : : : ; of iteration functions obtained from the repeated application of (4:4) starting with E = B = x 0 p(x). For m 3, E m 2 S(m; mn). Moreover, the depth of E m is m 0. Proof. The fact that E m lies in S(m; mn) is a trivial consequence of Theorem 4.. The claim on the depth can be proved inductively using that theorem and (4:5). 2 For a given i let us denote the i 's corresponding to E m by (m) i 's. We now obtain m (m) for m = ; 2; 3; 4, and 5. From (4.4) this will give E 2 ; E 3 ; E 4, and E 5. From (.4) we have () = (p 0 0 ). This gives E 2 = x 0 p=p 0. It follows that (2) 2 = p 00 =2p 0, (2) 3 = p 000 =3!p 0, so (3) 3 = p000 6p 0 0 2p00 4p 02 : Next we need (4) 4 = (3) 4 0 (3) 3 (3=2)(p 00 =p 0 ). This in turn requires the computation of (3) 4 = (2) 4 0 (2) 2 (2) 4 =p 02. Note that (2) 4 = p (4) =4!p 0, and (2) 4 = 2p 0 p 000 =3! + p 002 =4. Substituting these and simplifying we get Thus, and E 2 0 E 5 (4) 4 = p(4) 4!p 0 5p00 p p + 5p p : 03 E 5 = x 0 ( p p 0 ) + ( p p00 )2 p0 2p 0 0 ( p p 0 )3 ( p000 6p 0 0 2p00 4p ) + ( p 02 p 0 )4 ( p(4) 4!p 0 0 5p00 p 000 2p p003 ); 03 8p coincide with the rst few members of a family credited both to Euler as well as Schroder. For historical comments as well as other approaches for deriving this family see Shub and Smale [9]. 7
20 5. ETENSIONS TO NON-POLYNOMIAL ROOT FINDING In the previous sections we have shown the existence of many xed point iteration functions for nding roots of a given polynomial p(x), namely functions within S(m; M), any of whose members, say g(x), has m-th order rate of convergence to any simple root of p(x). In this section we will prove that these high order methods derived for polynomials extend to high order methods for arbitrary smooth functions f(x), having the same order of convergence to simple roots, where in the formulas for g(x), one simply replaces p(x) and its higher derivatives with f(x) and its corresponding derivatives. Moreover, for a simple root, its asymptotic constant of convergence m () can be obtained by simply replacing p (j) () with f (j) (). In particular, both depth and simple-root-depth will be unchanged. Theorem 5.. Assume that there exists h : < m! <, m 2, so that for any polynomial p(x) of degree at most (2m 0 ) the following property holds: If is a simple root of p(x), then h is in C m in a neighborhood of the point z p () = (; p(); p 0 (); : : : ; p (m0) ()), and the function g p (x) = h(x; p(x); p 0 (x); : : : ; p (m0) (x)), satises g p () = ; (i) g (i) p () = 0; i = ; : : : ; m 0 : (ii) Then, the above properties can be extended to any function f(x) which is in C 2m0 in a neighborhood of a simple root in the sense that p (j) can be replaced with f (j). Moreover g (m) f () = g p (m) n (); (iii) where p n (x) = P n i=0 f (i) () i! (x 0 ) i, the Taylor polynomial of degree n = 2m 0 at. Proof. Since f is in C n, f (j) (x) = p n (j) (x) + r n (j) (x), j = 0; : : : ; n, where r n (0) (x) is the remainder term. Since f (j) () = p n (j) () for all j = 0; : : : ; n we have r (j) n () = 0; j = ; : : : ; n: (5:) In particular, is a simple root of p n (x), and properties (i) and (ii) apply to p n (x). Also, the fact that h is in C n in a neighborhood of the point z f () follows immediately. From 8
21 the chain rule we have g 0 @f f 0 f 00 + : : f (m) : (5:2) (m0) If we now substitute for f(x) and f (j) (x) in (5:2), using (5.) and the continuity of the partial derivatives of h we conclude that g 0 f(x) is continuous in an interval containing z f (). From the repeated application of the chain rule, the assumption that h is in C m, that f is in C 2m0, and the use of (5.), it follows by induction that for all j = 0; : : : ; m, g (j) f (x) is continuous in an interval containing z f(). Moreover g (j) f () = g(j) p n (), for all j = 0; : : : ; m. 2 Corollary 5.. The depth of B m (x) with respect to f 2 C 2m0 remains to be m 0. Moreover, the simple-root-depth is m. As an application of the above consider the replacement of f in Newton's method with f(x)=f 0 (x) which results in a new iteration function g(x) credited to Schroder (e.g. see Scavo and Thoo [8]). Then, from the corollary g 00 ()=2 can easily be computed in terms of f and its higher derivatives. Remark 5.. The assumption f 2 C 2m0 in the above corollary can be relaxed for B m (x). It suce to have f 2 C m. For example for B 2 (x) = x 0 p(x)=p 0 (x), it is enough to assume that f 2 C 2, despite the fact that B 00 2(x) relies on the third derivative of f. Concluding Remarks. In this paper we have characterized a family of rational iteration functions for polynomial root-nding having an m-th order rate of convergence to simple roots. Although individual members of the family like Newton's and Halley's iteration functions have been known, no closed formula for the general member of the Basic Family, nor their asymptotic constant had previously been known. These formulas hold in the more general case where the underlying eld K is any eld of characteristic zero. We have shown that the members of this family are \optimal" with respect to the notions of depth, width, simple-root-depth (see Denition.2, and Remark.2). 9 Under the assumption of the
22 simplicity of the roots, the m-th order iteration function was shown to be the unique member of the class S(m; m + n 0 2). We also described two simple recursive formulas for generation of new iteration functions which in particular resulted in the generation of the Euler-Schroder family whose m-th order member belongs to S(m; mn), m > 2. Shub and Smale [9] refer to an \incremental" version of Euler-Schroder family as the \the most appropriate for practically computing zeros of complex polynomials" (see Example 5 k, page 0). In view of the development of the Basic Family, the closed forms, and properties established in this paper, it is fair to venture that their incremental version would be at least as good as the Euler-Schroder family. In particular, the closed form of the Basic Family suggests parallel implementations (see e.g. [5] for a theoretical analysis of parallel implementation of the Basic Family as applied to square-root computation). Another theoretical and practical problem of interest is the study of global convergence of the Basic Family. Acknowledgments. We would like to thank Professor Steve Smale, [20], for suggesting the examination of existence of possible links between the Basic Family (whose algebraic existence was proved in [6]) and the Euler-Schroder family. That suggestion resulted in the discovery of the rst formula (4:4). We also thank Professor Jerry Richter for bringing to our attention a paper by Gerlach []. References [] Alefeld, G.(98). On the convergence of Halley's Method. Amer. Math. Monthly 88, [2] Atkinson, K.E.(989). An Introduction to Numerical Analysis. Second Edition, John Wiley and Sons, Inc. [3] Bateman, H.(938). Halley's method for solving equations. Amer. Math. Monthly 45, -7. [4] Bodewig, E.(949). On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation. Quart. App. Math. 7,
23 [5] Brown, G.H., Jr.(977). On Halley's variation of Newton's method. Amer. Math. Monthly 84, [6] Davies, M and Dawson, B.(975). On the global convergence of Halley's iteration formula. Numer. Math. 24, [7] Frame, J.S.(944). A variation of Newton's method. Amer. Math. Monthly 5, [8] Frame, J.S.(945). Remarks on a variation of Newton's method. Amer. Math. Monthly 52, [9] Frame, J.S.(953). The solution of equations by continued fraction. Amer. Math. Monthly 60, [0] Gander, W.(985). On Halley's iteration method. Amer. Math. Monthly 92, [] Gerlach, J.(994). Accelerated convergence in Newton's method. SIAM Review. 36, [2] Halley, E. (694). A new, exact, and easy method of nding roots of any equations generally, and that without any previous reduction (Latin). Philos. Trans. Roy. Soc. London [English translation: Philos. Trans. Roy. Soc. London(abridged) 3, (809).] [3] Hamilton, H.J.(950). A type of variation of Newton's method. Amer. Math. Monthly 57, [4] Hansen, E. and Patrick, M.(977). A family of root nding methods. Numer. Math. 27, [5] Kalantari, B. and Kalantari, I.(993). High order iterative methods for approximating square and cube roots. Technical Report LCSR-TR-23, Department of Computer Science, Rutgers University, New Brunswick, NJ. [6] Kalantari, B. and Kalantari, I.(993). High order iterative methods for approximating roots of polynomials. Technical Report LCSR-TR-24, Department of Computer Science, Rutgers University, New Brunswick, NJ. [7] Popovski, D.B.(980). A family of one-point iteration formulae for nding roots. Internat.. J. Computer Math. 8,
24 [8] Scavo, T.R. and Thoo, J.B.(995). On the geometry of Halley's method. Amer. Math. Monthly 02, [9] Shub, M. and Smale, S.(985). On the geometry of polynomials and a theory of cost: Part I. Ann. Scient. Ec. Norm. Sup, 8, [20] Smale, S.(994). Private communications with the rst author. [2] Snyder, R.W.(955). One more correction formula. Amer. Math. Monthly 62, [22] Stewart, J.K.(95). Another variation of Newton's method. Amer. Math. Monthly 58, [23] Traub, J.F.(964). Iterative Methods for the Solution of Equations. New Jersey, Prentice Hall. [24] van der Waerden, B.L.(970) Algebra, Volume. F. Ungar Publishing Co., New York. [25] Wall, H.S.(948). A modication of Newton's method. Amer. Math. Monthly 55,
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More information4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial
Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On the Convergence of. Multipoint Iterations. G. W. Stewart y.
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{93{10 TR{3030 On the Convergence of Multipoint Iterations G. W. Stewart y February, 1993 Reviseed,
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More informationLinear Algebra, 4th day, Thursday 7/1/04 REU Info:
Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationCOMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS
Series Logo Volume 00, Number 00, Xxxx 19xx COMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS RICH STANKEWITZ Abstract. Let G be a semigroup of rational functions of degree at least two, under composition
More informationSOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO /4
SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO. 2 2003/4 1 SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL
More informationLecture 16: 9.2 Geometry of Linear Operators
Lecture 16: 9.2 Geometry of Linear Operators Wei-Ta Chu 2008/11/19 Theorem 9.2.1 If T: R 2 R 2 is multiplication by an invertible matrix A, then the geometric effect of T is the same as an appropriate
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationTOPOLOGICAL GROUPS MATH 519
TOPOLOGICAL GROUPS MATH 519 The purpose of these notes is to give a mostly self-contained topological background for the study of the representations of locally compact totally disconnected groups, as
More informationProblem Set 9 Due: In class Tuesday, Nov. 27 Late papers will be accepted until 12:00 on Thursday (at the beginning of class).
Math 3, Fall Jerry L. Kazdan Problem Set 9 Due In class Tuesday, Nov. 7 Late papers will be accepted until on Thursday (at the beginning of class).. Suppose that is an eigenvalue of an n n matrix A and
More informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More information1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)
Cycle times and xed points of min-max functions Jeremy Gunawardena, Department of Computer Science, Stanford University, Stanford, CA 94305, USA. jeremy@cs.stanford.edu October 11, 1993 to appear in the
More informationVII Selected Topics. 28 Matrix Operations
VII Selected Topics Matrix Operations Linear Programming Number Theoretic Algorithms Polynomials and the FFT Approximation Algorithms 28 Matrix Operations We focus on how to multiply matrices and solve
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More information460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses
Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationRichard DiSalvo. Dr. Elmer. Mathematical Foundations of Economics. Fall/Spring,
The Finite Dimensional Normed Linear Space Theorem Richard DiSalvo Dr. Elmer Mathematical Foundations of Economics Fall/Spring, 20-202 The claim that follows, which I have called the nite-dimensional normed
More informationarxiv: v2 [math.gm] 3 Jan 2018
arxiv:1712.04414v2 [math.gm] 3 Jan 2018 Efficient computation of pi by the Newton Raphson iteration and a two-term Machin-like formula S. M. Abrarov and B. M. Quine January 3, 2018 Abstract In our recent
More informationGarrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f
1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation
More informationFraction-free Row Reduction of Matrices of Skew Polynomials
Fraction-free Row Reduction of Matrices of Skew Polynomials Bernhard Beckermann Laboratoire d Analyse Numérique et d Optimisation Université des Sciences et Technologies de Lille France bbecker@ano.univ-lille1.fr
More informationSOME NEW EXAMPLES OF INFINITE IMAGE PARTITION REGULAR MATRICES
#A5 INTEGERS 9 (29) SOME NEW EXAMPLES OF INFINITE IMAGE PARTITION REGULAR MATRIES Neil Hindman Department of Mathematics, Howard University, Washington, D nhindman@aolcom Dona Strauss Department of Pure
More informationNovel Approach to Analysis of Nonlinear Recursions. 1 Department of Physics, Bar-Ilan University, Ramat-Gan, ISRAEL
Novel Approach to Analysis of Nonlinear Recursions G.Berkolaiko 1 2, S. Rabinovich 1,S.Havlin 1 1 Department of Physics, Bar-Ilan University, 529 Ramat-Gan, ISRAEL 2 Department of Mathematics, Voronezh
More informationMATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field.
MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field. Vector space A vector space is a set V equipped with two operations, addition V V
More information(Inv) Computing Invariant Factors Math 683L (Summer 2003)
(Inv) Computing Invariant Factors Math 683L (Summer 23) We have two big results (stated in (Can2) and (Can3)) concerning the behaviour of a single linear transformation T of a vector space V In particular,
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationSOLUTION OF GENERALIZED LINEAR VECTOR EQUATIONS IN IDEMPOTENT ALGEBRA
, pp. 23 36, 2006 Vestnik S.-Peterburgskogo Universiteta. Matematika UDC 519.63 SOLUTION OF GENERALIZED LINEAR VECTOR EQUATIONS IN IDEMPOTENT ALGEBRA N. K. Krivulin The problem on the solutions of homogeneous
More information5 Eigenvalues and Diagonalization
Linear Algebra (part 5): Eigenvalues and Diagonalization (by Evan Dummit, 27, v 5) Contents 5 Eigenvalues and Diagonalization 5 Eigenvalues, Eigenvectors, and The Characteristic Polynomial 5 Eigenvalues
More informationAutomatica, 33(9): , September 1997.
A Parallel Algorithm for Principal nth Roots of Matrices C. K. Koc and M. _ Inceoglu Abstract An iterative algorithm for computing the principal nth root of a positive denite matrix is presented. The algorithm
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationOn Böttcher s mysterious identity
AUSTRALASIAN JOURNAL OF COBINATORICS Volume 43 (2009), Pages 307 316 On Böttcher s mysterious identity Ömer Eğecioğlu Department of Computer Science University of California Santa Barbara, CA 93106 U.S.A.
More informationGeneralized eigenvector - Wikipedia, the free encyclopedia
1 of 30 18/03/2013 20:00 Generalized eigenvector From Wikipedia, the free encyclopedia In linear algebra, for a matrix A, there may not always exist a full set of linearly independent eigenvectors that
More informationVector Spaces ปร ภ ม เวกเตอร
Vector Spaces ปร ภ ม เวกเตอร 5.1 Real Vector Spaces ปร ภ ม เวกเตอร ของจ านวนจร ง Vector Space Axioms (1/2) Let V be an arbitrary nonempty set of objects on which two operations are defined, addition and
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationCoins with arbitrary weights. Abstract. Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to
Coins with arbitrary weights Noga Alon Dmitry N. Kozlov y Abstract Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the
More informationq-alg/ Mar 96
Integrality of Two Variable Kostka Functions Friedrich Knop* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA knop@math.rutgers.edu 1. Introduction q-alg/9603027 29 Mar 96 Macdonald
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE
ADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE ANDREAS LEOPOLD KNUTSEN Abstract. These notes are written as supplementary notes for the course MAT11- Real Analysis, taught at the University
More information6 Lecture 6: More constructions with Huber rings
6 Lecture 6: More constructions with Huber rings 6.1 Introduction Recall from Definition 5.2.4 that a Huber ring is a commutative topological ring A equipped with an open subring A 0, such that the subspace
More informationRoots of Unity, Cyclotomic Polynomials and Applications
Swiss Mathematical Olympiad smo osm Roots of Unity, Cyclotomic Polynomials and Applications The task to be done here is to give an introduction to the topics in the title. This paper is neither complete
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information2. Intersection Multiplicities
2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.
More informationA NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n.
Scientiae Mathematicae Japonicae Online, e-014, 145 15 145 A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS Masaru Nagisa Received May 19, 014 ; revised April 10, 014 Abstract. Let f be oeprator monotone
More informationRATIONAL POINTS ON CURVES. Contents
RATIONAL POINTS ON CURVES BLANCA VIÑA PATIÑO Contents 1. Introduction 1 2. Algebraic Curves 2 3. Genus 0 3 4. Genus 1 7 4.1. Group of E(Q) 7 4.2. Mordell-Weil Theorem 8 5. Genus 2 10 6. Uniformity of Rational
More information6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.
61 Matrices Definition: A Matrix A is a rectangular array of the form A 11 A 12 A 1n A 21 A 22 A 2n A m1 A m2 A mn The size of A is m n, where m is the number of rows and n is the number of columns The
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationDeterminants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
More informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More information2 MICHAEL FILASETA rather than y n (x). The polynomials z n (x) are monic polynomials with integer coecients, and y n (x) is irreducible if and only i
THE IRREDUCIBILITY OF ALL BUT FINITELY MANY BESSEL POLYNOMIALS Michael Filaseta* 1. Introduction Grosswald conjectured that the Bessel Polynomials y n (x) = nx j=0 (n + j)! 2 j (n, j)!j! xj are all irreducible
More informationDefinition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M.
5 Vector fields Last updated: March 12, 2012. 5.1 Definition and general properties We first need to define what a vector field is. Definition 5.1. A vector field v on a manifold M is map M T M such that
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationLifting to non-integral idempotents
Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,
More informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationMath Camp Notes: Linear Algebra I
Math Camp Notes: Linear Algebra I Basic Matrix Operations and Properties Consider two n m matrices: a a m A = a n a nm Then the basic matrix operations are as follows: a + b a m + b m A + B = a n + b n
More informationThe WENO Method for Non-Equidistant Meshes
The WENO Method for Non-Equidistant Meshes Philip Rupp September 11, 01, Berlin Contents 1 Introduction 1.1 Settings and Conditions...................... The WENO Schemes 4.1 The Interpolation Problem.....................
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More information+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4
Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number
More informationOn the decay of elements of inverse triangular Toeplitz matrix
On the decay of elements of inverse triangular Toeplitz matrix Neville Ford, D. V. Savostyanov, N. L. Zamarashkin August 03, 203 arxiv:308.0724v [math.na] 3 Aug 203 Abstract We consider half-infinite triangular
More information1: Introduction to Lattices
CSE 206A: Lattice Algorithms and Applications Winter 2012 Instructor: Daniele Micciancio 1: Introduction to Lattices UCSD CSE Lattices are regular arrangements of points in Euclidean space. The simplest
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationVector Spaces ปร ภ ม เวกเตอร
Vector Spaces ปร ภ ม เวกเตอร 1 5.1 Real Vector Spaces ปร ภ ม เวกเตอร ของจ านวนจร ง Vector Space Axioms (1/2) Let V be an arbitrary nonempty set of objects on which two operations are defined, addition
More information17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8
Contents 17 Galois Fields 2 17.1 Introduction............................... 2 17.2 Irreducible Polynomials, Construction of GF(q m )... 3 17.3 Primitive Elements... 6 17.4 Roots of Polynomials..........................
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationChapter 2. Real Numbers. 1. Rational Numbers
Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element
More informationLinear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains
Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 3, 3 Systems
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationPART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435
PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435 Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu
More informationDeterminants An Introduction
Determinants An Introduction Professor Je rey Stuart Department of Mathematics Paci c Lutheran University Tacoma, WA 9844 USA je rey.stuart@plu.edu The determinant is a useful function that takes a square
More information2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable
Deciding positivity of real polynomials Eberhard Becker, Victoria Powers, and Thorsten Wormann Abstract. We describe an algorithm for deciding whether or not a real polynomial is positive semidenite. The
More informationMax-Min Problems in R n Matrix
Max-Min Problems in R n Matrix 1 and the essian Prerequisite: Section 6., Orthogonal Diagonalization n this section, we study the problem of nding local maxima and minima for realvalued functions on R
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationFactoring Polynomials with Rational Coecients. Kenneth Giuliani
Factoring Polynomials with Rational Coecients Kenneth Giuliani 17 April 1998 1 Introduction Factorization is a problem well-studied in mathematics. Of particular focus is factorization within unique factorization
More informationProperties of Arithmetical Functions
Properties of Arithmetical Functions Zack Clark Math 336, Spring 206 Introduction Arithmetical functions, as dened by Delany [2], are the functions f(n) that take positive integers n to complex numbers.
More information