Quadratic Bezier Homotopy Function for Solving System of Polynomial Equations
|
|
- Jeremy Carroll
- 5 years ago
- Views:
Transcription
1 MATEMATIKA, 2013, Volume 29, Number 2, c Department of Mathematcal Scences, UTM Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons 1 Hafzudn Mohamad Nor, 2 Ahmad Izan Md. Ismal and 3 Ahmad Abdul Majd 1,2,3 School of Mathematcal Scences, Unverst Sans Malaysa, Gelugor, Penang, Malaysa e-mal: 1 hafz97my2001@yahoo.com, 2 zan@cs.usm.my, 3 majd@cs.usm.my Abstract We compare standard homotopy functon wth a proposed quadratc Bezer homotopy functon to see whch method has greater applcablty and greater accuracy. We test the methods on system of polynomal equatons by usng Newton-Homotopy Contnuaton method. The results obtaned ndcate the superor accuracy of our proposed quadratc Bezer homotopy functon. Keywords Numercal method; Polynomal equatons; Homotopy functon Mathematcs Subject Classfcaton 65H05; 65H10; 65H20. 1 Introducton In ths paper we consder the soluton of the system of n polynomal equatons f 1 (x 1, x 2,, x n ) f 2 (x 1, x 2,, x n ) F(x) =. = 0 (1) f n (x 1, x 2,, x n ) where x = {x 1, x 2,..., x n } usng homotopy contnuaton method (HCM). A popular method for solvng (1) s the Newton method whch s derved from the Taylor expanson seres [1]. In recent years, the study of the soluton of polynomal equatons especally on system of polynomal equatons usng methods based on the concept of homotopy from Topology has attracted consderable nterest. Rafq and Awas [2] stated that the homotopy contnuaton method (HCM) has been known snce the 1930s. However, more recent work n the development of homotopy concepts for nonlnear algebrac equaton was developed n the 1970s [3]. Ths was followed by works of Garca and Zangwll [4], Melhem and Rhenboldt [5], Morgan [6] and Watson [7,8]. Alexander and Yorke [3] stated that HCM nvolves numercally fndng the soluton of a problem by startng the soluton from the soluton of a known problem and contnung the soluton as the known problem s homotoped to the gven problem. Alexander and Yorke [3] also descrbed the connecton between algebrac topology and the contnuaton method. Garca and Zangwll [4] suggested a procedure to obtan all solutons to certan systems of n equatons n the complex doman. Let z q + P (z) = 0, = 1, 2,...,n. (2) where z s the complex vector, q s the large nteger and P(z) = F(z) 1. By rewrtng (2), we obtan (z q 1) + (P (z) + 1) = 0 (3)
2 160 Hafzudn Mohamad Nor, Ahmad Izan Md. Ismal and Ahmad Abdul Majd To start wth, the authors defned homotopy functon as (z q 1) + t(p (z) + 1) = 0 (4) where z s the complex vector, q s the large nteger and t [0, 1] s a load parameter. Snce 1 0, thus we wll get a trval soluton when t = 0. Then, the authors rewrte (4) as z q By assgnng z q From (6), we have As t 1, we have (1 t)(z q 1) + t(p (z) + 1) = 0 (5) 1 = G(z) and P (z) + 1 = F(z), then we have (1 t)g(z) + tf(z) = 0 (6) F(z) G(z) = 1 1 t (7) F(z) lm t 1 G(z) = 0 (8) Eq. (8) showed the relatonshp between the auxlary homotopy functon and the gven functon n the homotopy functon (6). Garca and Zangwll [4] also dscussed the meanng of the terms - homotopy paths, monotoncty of the paths, smplcal pvotng and pecewse lnear paths. Melhem and Rhenboldt [5] compared several methods from local teratve and contnuaton path methods for determnng turnng ponts. For nstance, Abbott s method [9], Moore and Spence s method [10], Seydel s method [11], Smpson s method [12], Rhennboldt s method [13] and so on. The results showed the Rhenboldt s method s most approprate because t has the hghest degree of relablty among all methods [5]. Snce HCM s a method of solvng dvergence problem, therefore a body of knowledge about how to determne the turnng ponts are become mportant. Morgan [6] used SYMPOL (systems of polynomals) to conduct the mplementaton. SYMPOL was desgned to fnd all solutons to a system of n polynomal equatons wth complex coeffcents n n unknowns. The author also nvestgated three cases of choosng auxlary homotopy functon G(x) havng a theorem developed n [6]. The auxlary functons selected to form the homotopy functons were () H(x, t) = (1 t)(x x 0 ) + t( x 2 + 1) (9) () H(x, t) = (1 t)(x 2 x 2 0) + t( x 2 + 1) (10) () H(x, t) = (1 t)(x 3 x 3 0 ) + t( x2 + 1) (11) where the target functon was F(x) = x = 0. Morgan [6] also descrbed the basc concepts of HCM such as homotopy functon and the auxlary homotopy functon. Homotopy functon, denoted as H(x, t), s a connecton between the start and target functons, whle the auxlary homotopy functon s the startng functon. Accordng to Watson [7], homotopy methods are theoretcally powerful, and f constructed and mplemented properly, are robust, numercally stable, accurate, and practcal.
3 Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons 161 In [8], the homotopy functon was defned n the complex doman. The choce of auxlary homotopy functon s defned by G(x) = b x d a, = 1, 2,...,n (12) where a and b are nonzero complex numbers. There are two types of total degree, denoted by d and d. The total degree of polynomal F(x), d s d = max k n d jk (13) j=1 and the total degree of the entre system (1), d s d = d 1 d 2... d n. (14) Accordng to Kotsreas [14], the total number of geometrcally solated solutons and solutons at nfnty s no more than that gven by equaton (14). By usng (12) and (13), the nvestgated homotopy functons by Morgan [6] can be smplfed as () H(x, t) = (1 t)(x x 0 ) + tf(x) (15) () H(x, t) = (1 t)(x d x d 0 ) + tf(x) (16) () H(x, t) = (1 t)(x d+1 x d+1 0 ) + tf(x). (17) Jalal and Seader [15] analyzed the stablty of multphase and reactng systems by usng HCM. The accuracy of the ntal guess was not mportant. Jalal and Seader focused on the use of the Newton, fxed-pont, and affne homotopes whch are as follows () Newton homotopy () Fxed-pont homotopy H(x, t) = tf(x) + (1 t)[f(x) F(x 0 )] (18) () Affne homotopy H(x, t) = tf(x) + (1 t)(x x 0 ) (19) H(x, t) = tf(x) + (1 t)f (x 0 )(x x 0 ) (20) where F(x) s the polynomal equatons and t [0, 1]. Grtton et al. [16] classfed HCM as a global method whch the user can use to fnd the soluton from an arbtrary ntal guess. For local methods such as the Newton method, the user should have suffcent knowledge regardng the locaton of a root to determne the ntal guess. The closer the ntal guess s to the soluton, the more effcent s the local method. Otherwse, the teratve scheme of the local method wll dverge away from the
4 162 Hafzudn Mohamad Nor, Ahmad Izan Md. Ismal and Ahmad Abdul Majd actual soluton. Global methods overcome the problem of choosng the approprate ntal guess. Grtton et al. [16] used HCM to study 16 chemcal engneerng problems nvolvng sothermal flash, knetcs n a strred reactor, azeotropc-pont, flow n a smooth ppe, chemcal equlbrum and others. One problem consdered nvolved the equaton, F(x) = 8(4 x)2 x = 0 (21) (6 3x) 2 (2 x) where x s the fractonal converson of ntrogen. The solutons were tracked by usng HCM and adjustng auxlary functons (.e. the ntal guess). Allgower and Georg [17] defned the polynomal systems (1) as n 1 F(z) = z n + a j z j (22) and equaton (22) s a monc polynomal n whch the coeffcent of z n s equal to 1. Lettng G(z) = z n + b 0 where b 0 0, the authors defned homotopy functon as Hence, we have j=0 H(z, t) = (1 t)g(z) + tf(z). (23) n 1 H(z, t) = z n + t a j z j + (1 t)b 0 + ta 0 (24) j=0 where H(z, t) s measured n complex doman H : C [0, 1] C. Wu [18-22] has conducted extensve research on HCM. Wu [18] ntroduced Ancent Chnese Homotopy method (ACHM) and Wu [19] studed the convergence of Newton-Homotopy contnuaton method (NHCM). Wu [20] compared the tradtonal Adoman Decomposton method wth the Adoman-homotopy contnuaton method (AHCM). Further, Wu [21] nvestgated the crtera of adjustable auxlary homotopy functon and ts gudelnes and Wu [22] developed secant-homotopy contnuaton method (SHCM) from tradtonal secant method. Palancz et al. [23] descrbed HCM n a smpler way. HCM was defned as a method that deforms contnuously from the known roots of the start system nto the roots of the target system. Contnuaton graphs were used to llustrate the mathematcal problems. A smple equaton was used to demonstrate the homotopy contnuaton concepts. Then, Palancz et al. [23] extended the concepts by dscussng nonlnear geodetc problems such as resecton, GPS postonng, as well as affne transformaton. Rahman et al. [24] concerned wth the use of homotopy functons H(x, t) = tf(x) + (1 t)[(x x 0 ) + (F(x) F(x 0 )] (25) to track the approxmate solutons. The authors chose G(x) as a lnear combnaton of fxed pont and Newton functons. In most of above research, the focus was on the auxlary homotopy functon as well as homotopy contnuaton method and not the homotopy functon. The authors [1-2,4,6,14-24] were more comfortable to use standard homotopy functon rather than others. Ths paper wll ntroduce a new homotopy functon whch wll be called the Quadratc Bezer Homotopy Functon (QBHF).
5 Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons Standard Homotopy Functon All homotopy functon H(x, t) mentoned on above used the standard homotopy functon. Let us consder the standard homotopy functon where H(x, t) = (1 t)g(x) + tf(x) (26) G(x) = F(x) = g 1 (x 1, x 2,, x n ) g 2 (x 1, x 2,, x n ). g n (x 1, x 2,, x n ) f 1 (x 1, x 2,, x n ) f 2 (x 1, x 2,, x n ). f n (x 1, x 2,, x n ) and t s an arbtrary parameter whch can vary from 0 to 1,.e. t [0, 1]. Thus, we wll have H(x, 0) = G(x). (29) (27) (28) H(x, 1) = F(x). (30) The homotopy functon cannot stand alone; t must be followed by a method whch s called homotopy contnuaton method. Accordng to Burden and Fares [1], the formula of Newton HCM s as follows where x +1 = x [D x H(x, t)] 1 H(x, t), = 1, 2,..., k. (31) D x H(x, t) =. H 1 H 1 x 1 H 2 H 2 x 1 H n x 1 x 2 x H n x 2 D x H(x, t) s called the Jacoban matrx. To facltate better understandng, let us consder the 2-dmensonal of homotopy functon whch s n = 1. H(x, t) = (1 t)g(x) + tf(x) (32) where g(x) s an auxlary homotopy functon and f(x) s a gven functon whch s scalar. H 1 x n H 2 x n H n x n Example 2.1. Consder the followng smple equaton defned by Kotsreas [14]. f(x) = (x )(x2 4) = 0 (33) and the auxlary homotopy functon s g(x) = x 2 1. So that, the homotopy functon (30) wll be H(x, t) = (1 t)(x 2 1) + t(x )(x2 4) (34)
6 164 Hafzudn Mohamad Nor, Ahmad Izan Md. Ismal and Ahmad Abdul Majd Snce we need to solve H(x, t) = 0, there are a set equatons of H (x, t /k ) = 0 and there are a set solutons for x where = 0, 1, 2,, k and k = number of teratons. If there are k teratons, the number of equaton nvolved s k+1. Let k =10, so that the equaton vares from 0 untl 1. Graphcally, t can be represented as Fgure 1. Fgure 1: Homotopy Path of Equaton (34) Fgure 1 shows the movement of H(x 0, 0) = x 2 1 = g(x) to H(x 10, 1) = (x )(x2 4) = f(x) wth t beng unformly ncreased by 0.1 n equaton (34). x 0 = 1 wll move to the x 10 = and x 10 = when x 0 = 1. Both approxmatons wll have the same value of f(x 10 ).e. f(x 10 ) = (35) However, ths approxmaton can be mproved by usng a new homotopy functon whch wll be called the Quadratc Bezer Homotopy Functon. Ths wll be dscussed n the next secton. 3 Quadratc Bezer Homotopy Functon Suppose that we want to solve followng a system of n polynomal equatons F(x) = 0. (36) where x = {x 1, x 2, x 3,, x n 1, x n }. We ntroduce a new homotopy functon vz H 2 (x, t) = (1 t) 2 G(x) + 2t(1 t)[(1 t)g(x) + tf(x)] + t 2 F(x). (37) Ths new homotopy functon (37) can also be wrtten as H 2 (x, t) = (1 t) 2 G(x) + 2t(1 t)h(x, t) + t 2 F(x) (38)
7 Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons 165 where H(x, t) s the standard homotopy functon. Ths new homotopy functon fulflls the two boundary condtons.e. (29) and (30) are stll satsfed when we substtute t = 0 and t = 1 respectvely nto (38). It s nterestng to note that there s a smlar functon of homotopy functon between (26) and (38) when t = 1 2 where H(x, 1 2 ) = H 2(x, 1 2 ) = 1 2 G(x) F(x). (39) Snce we want to solve F(x) = 0, therefore H 2 (x, t) s set to zero by varyng the parameter t from 0 to 1. In other words, we start from auxlary functon, G(x 0 ) = 0 and fnsh when F( x) = 0. As dscussed before, the soluton moves from x 0 untl x and the curves wll move from H 2 (x 0, 0) untl H 2 ( x, 1). The dea of ths new homotopy functon comes from De Casteljau Algorthm [25]. It s known that, De Casteljau Algorthm descrbes the movement of pont n a curve. Homotopy s a movement of a curve to another curve [14,23]. Therefore, we beleve that there s relaton between the De Casteljau algorthm and homotopy concepts. In short, lnear and quadratc curves for De Casteljau and homotopy can be formed as n Table 1. Table 1: Lnear and Quadratc for De Casteljau and Homotopy De Casteljau, P(t) Homotopy, H(x, t) Lnear (1 t)p 0 + tp 1 (1 t)g(x) + tf(x) Quadratc (1 t) 2 P 0 + 2t(1 t)p 1 + t 2 P 2 (1 t) 2 G(x)+ 2t(1 t)[(1 t)g(x) + tf(x)] + t 2 F(x). Let s observe how we obtan (38) wth three reference curves. The recursve constructon of quadratc Bezer homotopy functon s llustrated n Fgure 2. We note that A(x, t) = (1 t)g(x) + th(x, t), B(x, t) = (1 t)h(x, t) + tf(x) Therefore H 2 (x, t) = (1 t)a + tb (40) Then, we have H 2 (x, t) = (1 t)[(1 t)g(x) + th(x, t)] + t [(1 t)h(x, t) + tf(x)] = (1 t) 2 G(x) + 2t(1 t)h(x, t) + t 2 f(x) = H 0 B0(t) 2 + H 1 B1(t) 2 + H 2 B2(t) 2 2 = H B 2 (t) (41) =0
8 166 Hafzudn Mohamad Nor, Ahmad Izan Md. Ismal and Ahmad Abdul Majd Fgure 2: Recursve Constructon of Quadratc Bezer Homotopy Functon where H 0 = G(x) for t = 0 H 1 = H(x, t) for t (0, 1) H 2 = F(x) for t = 1. B 2 (t) s a Bernsten functon whch s defned as [25] ( ) B 2 2 (t) = (1 ) 2 t 2! =! (2 )! (1 )2 t (42) where : 0, 1, 2, t [0, 1]. An nterestng property of Bernsten functon for standard homotopy functon and QBHF s that the summaton s equal to one. Lnear : Quadratc : 1 B 1(t) =0 = (1 t) + t = 1, 1 B 2(t) = (1 t)2 + 2t(1 t) + t 2 =0 = 1. (43) (44) Both (43) and (44) show that the sum of bnomal expanson always fulfll one of the convex hull property [25]. Another convex hull property s B 2 (t) 0, : 0, 1, 2, t [0, 1]. (45)
9 Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons 167 Ths contnuaton technque cannot stand alone n that t must be combned wth other methods such as Newton, secant, Adoman method and so on. By these combnatons, the name of the newly developed method wll then change to Newton-Homotopy, Secant- Homotopy, Adoman-Homotopy and so on. Now, we wll consder several examples that compares the standard and new homotopy functons. The method chosen s Newton- Homotopy contnuaton method (NHCM). The formula of classcal Newton method s well-known. The formula of NHCM s x +1 = x [D x H 2 (x, t)] 1 H 2 (x, t), = 1, 2,...,k. (46) where H 2 (x, t) s Quadratc Bezer homotopy functon as (38). 4 Numercal Experments and Dscusson Example 4.1. Consder the followng system of equatons [2] : f 1 (x, y) = x 2 2x y = 0, f 2 (x, y) = x 2 + 4y 2 4 = 0. (47) The auxlary homotopy functon s g 1 (x) = x, g 2 (y) = y and the ntal value (x 0, y 0 ) = (0, 0)are used for NHCM. The results are shown n Table 2 by varyng the number of teratons. Table 2: Comparson between Standard and New Homotopy Functons for Equaton (47) Number of teratons Standard Homotopy Functon 10 f 1 = f 2 = f 1 = f 2 = f 1 = f 2 = Quadratc Bezer Homotopy Functon CPU Tme, second f 1 = f 2 = f 1 = f 2 = f 1 = f 2 = where ( x, ỹ) = ( , ) Example 4.2. Consder the followng example [26]: f 1 (x, y, z) = x 2 + y 2 + z 2 1 = 0 f 2 (x, y, z) = 2x 2 + y 2 4z = 0 f 3 (x, y, z) = 3x 2 4y 2 + z 2 = 0 (48) The auxlary homotopy functon, g 1 (x) = x, g 2 (y) = y and g 3 (z) = z and ntal value (x 0, y 0, z 0 ) = (0, 0, 0) are used for NHCM. The results are shown n Table 3.
10 168 Hafzudn Mohamad Nor, Ahmad Izan Md. Ismal and Ahmad Abdul Majd Table 3: Comparson between Standard and New Homotopy Functons for Equaton (48) Number of teratons Standard Homotopy Functon 10 f 1 = f 2 = f 3 = f 1 = f 2 = f 3 = f 1 = f 2 = f 3 = Quadratc Bezer Homotopy Functon f 1 = f 2 = f 3 = f 1 = f 2 = f 3 = f 1 = f 2 = f 3 = where ( x, ỹ, z) = ( , , ) CPU Tme, second Example 4.3. Consder the followng example [6]: f 1 (w, x, y, z) = x + 10y = 0 f 2 (w, x, y, z) = 5(z w) = 0 f 3 (w, x, y, z) = (y 2z) 2 = 0 f 4 (w, x, y, z) = 10(x w) 2 = 0 (49) The auxlary homotopy functon, g 1 (w) = w 1, g 2 (x) = x 4, g 3 (y) = y 1, g 4 (z) = z 2 and ntal value s (w 0, x 0, y 0, z 0 ) = (1, 4, 1, 2) are used. The results are shown n Table 4. The results n Table of Eq. (47), (48), and (49) show that Quadratc Bezer Homotopy Functon has better performance than the standard homotopy functon for solvng the consdered system of nonlnear algebrac equaton. Ths has been ascertaned by usng the followng stoppng crtera F( X k+1 ) < ε (50) where ε = CPU tme s assumed not to be an mportant consderaton. 5 Concluson From the partcular set of examples chosen, the use of Quadratc Bezer Homotopy Functon (QBHF) s better than the use of standard homotopy functon. It should be noted though that for the partcular set of examples consdered, the accuracy of approxmate solutons ncreases when the numbers of teratons ncrease. Acknowledgments Part of ths research has been supported by a scholarshp from the School of Mathematcal Scences USM and Kementeran Pengajan Tngg Malaysa.
11 Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons 169 Table 4: Comparson between Standard and New Homotopy Functons for Equaton (49) Number of teratons Standard Homotopy Functon 10 f 1 = f 2 = f 3 = f 4 = f 1 = f 2 = f 3 = f 4 = f 1 = f 2 = f 3 = f 4 = Quadratc Bezer Homotopy Functon f 1 = f 2 = f 3 = f 4 = f 1 = f 2 = f 3 = f 4 = f 1 = f 2 = f 3 = f 4 = CPU Tme, second where ( w, x, ỹ, z) = ( , , , ) and the actual soluton s (w, x,y, z) = (0,0,0,0) as stated n Morgan [6] References [1] R. L. Burden, J. D. Fares, Numercal Analyss, 9 th Internatonal Edton, Brooks/Cole, Cencag Learnng [2] Rafq, A. and Awas, M. Convergence on the homotopy contnuaton method. Int. J. of Appl. Math. And Mech (6) : [3] Alexander, J. C. and Yorke, J. A. The homotopy contnuaton method: numercally mplementable topologcal procedures, Trans. Amer. Math. Soc : [4] Garca, C. B. and Zangwll, W. I. Fndng all solutons to polynomal systems and other systems of equatons, Mathematcal Programmng : [5] Melhem, R. C. and Rhenboldt, W. C. A comparson of methods for determnng turnng ponts of nonlnear equatons, Computng : [6] Morgan, A. P. A method for computng all solutons to systems of polynomal equatons, ACM Transacton on Mathematcal Software (1) :1-17. [7] Watson, L. T. Numercal lnear algebra aspects of globally convergent homotopy methods, Techncal Report [8] Watson, L. T. Globally convergent homotopy methods: A tutoral, Elsever Scence Publshng Co. Inc. 1989:
12 170 Hafzudn Mohamad Nor, Ahmad Izan Md. Ismal and Ahmad Abdul Majd [9] Abbott, J. P. An effcent algorthm for the determnaton of certan bfurcaton ponts, J. of Computer and Appled Mathematcs : [10] Moore, G. and Spence, A. The calculaton of turnng ponts of nonlnear equatons, SIAM J. Number Analyss : [11] Seydel, R. Numercal computaton of branch ponts n nonlnear equatons, Numercal Math : [12] Smpson, R. B., Smpson method for numercal determnaton of bfurcaton states of nonlnear systems of equatons, SIAM Journal Numercal Analyss : [13] Rhenboldt, W. C. Computaton of crtcal boundares on equlbrum manfolds, Unversty of Pttsburgh, Insttute for Computatonal Mathematcs and Appled, Techncal Report, ICMA-80-20, SIAM Journal Numercal Analyss : [14] Kotsreas, I. S. Homotopes and polynomal system solvng I: Basc Prncples. ACM- SIGSAM Bulletn : [15] Jalal, F. and Seader,J. D. Use of homotopy-contnuaton method n stablty analyss of multphase reactng systems, Computers and Chemcal Engneerng : [16] Grtton, K. S., Seader, J. D. and Ln,W. Global homotopy contnuaton procedures for seekng all roots of a nonlnear equaton, Computers and Chemcal Engneerng : [17] Allgower, E. L. and Georg, K. Introducton to numercal contnuaton methods, Socety of Industral and Appled Mathematcs. 2003: [18] Wu, T. M. A modfed formula of ancent Chnese algorthm by the homotopy contnuaton technque, Appled Mathematcs and Computaton : [19] Wu, T. M. A study of convergence on the Newton-Homotopy contnuaton method. Appled Mathematcs and Computaton : [20] Wu, T. M. A new formula of solvng nonlnear equatons by Adoman and homotopy methods. Appled Mathematcs and Computaton : [21] Wu, T. M. Solvng nonlnear equatons by the Newton Homotopy contnuaton method wth adjustable auxlary homotopy functon, Appled Mathematcs and Computaton : [22] Wu, T. M. The Secant-Homotopy contnuaton method. Chaos Soltons and Fractals : [23] Palancz, B., Awange, J. L., Zaletnyk, P. and Lews, R. H. Lnear homotopy soluton of nonlnear systems of equatons n geodesy, Sprnger-Verlag.2010 :79-95.
13 Quadratc Bezer Homotopy Functon for Solvng System of Polynomal Equatons 171 [24] Rahman, S. K., Jalal, F., Seader, J. D. and Whte, R. E. A new homotopy for seekng all real roots of a nonlnear equaton, Computers and Chemcal Engneerng : [25] Agoston, M. K. Computer Graphc and Computer Modelng, 3 rd Edton, Sprnger- Verlag,Cupertno CA 95014, [26] Noor, M. A. and Waseem, M. Some teratve methods for solvng a system of nonlnear equatons, Computers and Mathematcs wth applcatons :
A new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationSOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Kim Gaik Universiti Tun Hussein Onn Malaysia
SOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Km Gak Unverst Tun Hussen Onn Malaysa Kek Se Long Unverst Tun Hussen Onn Malaysa Rosmla Abdul-Kahar
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationFixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind
MATEMATIKA, 217, Volume 33, Number 2, 191 26 c Penerbt UTM Press. All rghts reserved Fxed pont method and ts mprovement for the system of Volterra-Fredholm ntegral equatons of the second knd 1 Talaat I.
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationCubic Trigonometric B-Spline Applied to Linear Two-Point Boundary Value Problems of Order Two
World Academy of Scence Engneerng and echnology Internatonal Journal of Mathematcal and omputatonal Scences Vol: No:0 00 ubc rgonometrc B-Splne Appled to Lnear wo-pont Boundary Value Problems of Order
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationCOMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD
COMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD Ákos Jósef Lengyel, István Ecsed Assstant Lecturer, Professor of Mechancs, Insttute of Appled Mechancs, Unversty of Mskolc, Mskolc-Egyetemváros,
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationChapter 4: Root Finding
Chapter 4: Root Fndng Startng values Closed nterval methods (roots are search wthn an nterval o Bsecton Open methods (no nterval o Fxed Pont o Newton-Raphson o Secant Method Repeated roots Zeros of Hgher-Dmensonal
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationReview of Taylor Series. Read Section 1.2
Revew of Taylor Seres Read Secton 1.2 1 Power Seres A power seres about c s an nfnte seres of the form k = 0 k a ( x c) = a + a ( x c) + a ( x c) + a ( x c) k 2 3 0 1 2 3 + In many cases, c = 0, and the
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationNonlinear Overlapping Domain Decomposition Methods
Nonlnear Overlappng Doman Decomposton Methods Xao-Chuan Ca 1 Department of Computer Scence, Unversty of Colorado at Boulder, Boulder, CO 80309, ca@cs.colorado.edu Summary. We dscuss some overlappng doman
More informationThe Analytical Solution of a System of Nonlinear Differential Equations
Int. Journal of Math. Analyss, Vol. 1, 007, no. 10, 451-46 The Analytcal Soluton of a System of Nonlnear Dfferental Equatons Yunhu L a, Fazhan Geng b and Mnggen Cu b1 a Dept. of Math., Harbn Unversty Harbn,
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationTHE STURM-LIOUVILLE EIGENVALUE PROBLEM - A NUMERICAL SOLUTION USING THE CONTROL VOLUME METHOD
Journal of Appled Mathematcs and Computatonal Mechancs 06, 5(), 7-36 www.amcm.pcz.pl p-iss 99-9965 DOI: 0.75/jamcm.06..4 e-iss 353-0588 THE STURM-LIOUVILLE EIGEVALUE PROBLEM - A UMERICAL SOLUTIO USIG THE
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationIrregular vibrations in multi-mass discrete-continuous systems torsionally deformed
(2) 4 48 Irregular vbratons n mult-mass dscrete-contnuous systems torsonally deformed Abstract In the paper rregular vbratons of dscrete-contnuous systems consstng of an arbtrary number rgd bodes connected
More informationDEGREE REDUCTION OF BÉZIER CURVES USING CONSTRAINED CHEBYSHEV POLYNOMIALS OF THE SECOND KIND
ANZIAM J. 45(003), 195 05 DEGREE REDUCTION OF BÉZIER CURVES USING CONSTRAINED CHEBYSHEV POLYNOMIALS OF THE SECOND KIND YOUNG JOON AHN 1 (Receved 3 August, 001; revsed 7 June, 00) Abstract In ths paper
More informationNumerical Solutions of a Generalized Nth Order Boundary Value Problems Using Power Series Approximation Method
Appled Mathematcs, 6, 7, 5-4 Publshed Onlne Jul 6 n ScRes. http://www.scrp.org/journal/am http://.do.org/.436/am.6.77 umercal Solutons of a Generalzed th Order Boundar Value Problems Usng Power Seres Approxmaton
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationNew Method for Solving Poisson Equation. on Irregular Domains
Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More information2. PROBLEM STATEMENT AND SOLUTION STRATEGIES. L q. Suppose that we have a structure with known geometry (b, h, and L) and material properties (EA).
. PROBEM STATEMENT AND SOUTION STRATEGIES Problem statement P, Q h ρ ρ o EA, N b b Suppose that we have a structure wth known geometry (b, h, and ) and materal propertes (EA). Gven load (P), determne the
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationOn the Repeating Group Finding Problem
The 9th Workshop on Combnatoral Mathematcs and Computaton Theory On the Repeatng Group Fndng Problem Bo-Ren Kung, Wen-Hsen Chen, R.C.T Lee Graduate Insttute of Informaton Technology and Management Takmng
More informationSignificance of Dirichlet Series Solution for a Boundary Value Problem
IOSR Journal of Engneerng (IOSRJEN) ISSN (e): 5-3 ISSN (p): 78-879 Vol. 6 Issue 6(June. 6) V PP 8-6 www.osrjen.org Sgnfcance of Drchlet Seres Soluton for a Boundary Value Problem Achala L. Nargund* and
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationChapter 3 Differentiation and Integration
MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton
More informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationA NUMERICAL COMPARISON OF LANGRANGE AND KANE S METHODS OF AN ARM SEGMENT
Internatonal Conference Mathematcal and Computatonal ology 0 Internatonal Journal of Modern Physcs: Conference Seres Vol. 9 0 68 75 World Scentfc Publshng Company DOI: 0.4/S009450059 A NUMERICAL COMPARISON
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationThe KMO Method for Solving Non-homogenous, m th Order Differential Equations
The KMO Method for Solvng Non-homogenous, m th Order Dfferental Equatons Davd Krohn Danel Marño-Johnson John Paul Ouyang March 14, 2013 Abstract Ths paper shows a smple tabular procedure for fndng the
More informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
More informationSolving Fractional Nonlinear Fredholm Integro-differential Equations via Hybrid of Rationalized Haar Functions
ISSN 746-7659 England UK Journal of Informaton and Computng Scence Vol. 9 No. 3 4 pp. 69-8 Solvng Fractonal Nonlnear Fredholm Integro-dfferental Equatons va Hybrd of Ratonalzed Haar Functons Yadollah Ordokhan
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationInternational Conference on Advanced Computer Science and Electronics Information (ICACSEI 2013) equation. E. M. E. Zayed and S. A.
Internatonal Conference on Advanced Computer Scence and Electroncs Informaton (ICACSEI ) The two varable (G'/G/G) -expanson method for fndng exact travelng wave solutons of the (+) dmensonal nonlnear potental
More informationResearch Article Cubic B-Spline Collocation Method for One-Dimensional Heat and Advection-Diffusion Equations
Appled Mathematcs Volume 22, Artcle ID 4587, 8 pages do:.55/22/4587 Research Artcle Cubc B-Splne Collocaton Method for One-Dmensonal Heat and Advecton-Dffuson Equatons Joan Goh, Ahmad Abd. Majd, and Ahmad
More informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationJoint Statistical Meetings - Biopharmaceutical Section
Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More information