Reverse Engineering Gene Networks with Microarray Data
|
|
- Linette Goodwin
- 5 years ago
- Views:
Transcription
1 Reverse Engineering Gene Networks with Microrry Dt Roert M Mllery Avisors: Dr Steve Cox n Dr Mrk Emree August 25, 2003 Astrct We consier the question of how to solve inverse prolems of the form e At x(0) = x(t) for n unkown mtrix A, given mesurements of x(t) t ifferent time points Prolems of this form hve pplictions in reverse engineering gene networks In prticulr, we exmine the cses where A is circulnt n Toeplitz We re lso le to exten our finings of the circulnt cse to some generliztions of circulnt mtrices Introuction DNA Microrrys cn e use to etermine mesurements of cellulr gene proucts t given point in time These concentrtions of gene prouct provie clues to the overll interction of the genes in the gene network eing stuie We cn mesure the perturtions x 1,,x n of the gene mrna expression concentrtions from the stey stte, which re governe y the eqution x(t) t = Ax(t), (1) where x(t) = (x 1 (t),, x n (t)) T In other wors, the rtes of chnge of the gene prouct concentrtions re etermine y the evitions from the stey stte of ll the gene proucts present If A is unstructure, then A contins n 2 egrees of freeom, so we woul expect tht n 2 concentrtion mesurements woul suffice to etermine A uniquely However, mesuring the given gene prouct concentrtions t prticulr time is oth time consuming n expensive Gene networks cn e on the orer of 10,000 genes, so tking 10 8 mesurements is impossile Hence, we woul like to impose some structure on A tht will llow us to tke fewer gene concentrtion mesurements, enling us to etermine A more esily This will provie solution to our gene network which is esy to fin n cn provie strting point for etermining the exct structure of the gene network In prticulr, we will first stuy the cse where A is circulnt n the cse where A is Toeplitz It is expecte tht if A is circulnt, then A cn e uniquely etermine from mesurement of the n gene proucts t single point in time This seems intuitive since circulnt A contins only n egrees of freeom If A is Toeplitz, we expect A my e etermine y the mesurement of the n gene proucts 1
2 t two points in time since Toeplitz A contins 2n 1 egrees of freeom Once A is etermine, the gene prouct concentrtions for ny time t re given y x(t) = e At x 0, (2) where x 0 = x(0) is the vector of gene prouct evitions from the stey stte cuse y perturtion to the system t t = 0 Circulnt Mtrices Circulnt mtrices re those squre mtrices C of the form c 1 c 2 c 3 c n c n c 1 c 2 c n 1 C = circ(c 1, c 2,, c n ) = c n 1 c n c 1 c n 2 c 2 c 3 c 1 It is instructive to consier wht grph of four gene network represente y eqution (1) looks like when A is circulnt Let A = circ(,, c, ) Then eqution (1) ecomes x 1 (t) c x 1 (t) x 2(t) c x x 3 (t) = 2 (t) c x 3 (t) x 4 (t) c x 4 (t) Figure 1 elow represents the grph of 4 gene network Genes x 1,,x 4 re represente y the circles numere 1 through 4 Interctions etween genes re inicte y rrows rwn etween the genes, with weights to escrie the mount of effect one gene hs on nother We sy, for exmple tht gene 1 feels itself with weight of, gene 2 with weight of, gene 3 with weight of c, n gene 4 with weight of 1 c c Fig 1 Grph of four gene network with circulnt A Circulnt mtrices hve nice properties tht provie n elegnt solution to our prolem In prticulr, ll circulnt mtrices of orer n re igonlizle y the Fourier mtrix F n, where F n = 1 n 1 ω ω 2 ω n 1 1 ω 2 ω 4 ω 2(n 1), 1 ω ( n 1) ω 2(n 1) ω (n 1)(n 1) 2
3 n ω = e 2πi n [1] From now on we will simply use F to enote the Fourier mtrix of orer n Hence, if A is circulnt, we hve tht A = F ΛF, where Λ = ig(λ 1,, λ n ) n λ 1,, λ n re the eigenvlues of A repete ccoring to multiplicity Also, we hve tht F is unitry [1], ie FF = F F = I Let us consier the mtrix exponentil in (2), utilizing its Tylor series representtion We hve tht e At = I + At + 1 2! A2 t ! A3 t 3 + = F F + F ΛFt + 1 2! (F ΛF) 2 t ! (F ΛF) 3 t 3 + = F (I + Λt + 1 2! Λ2 t ! Λ3 t 3 + )F = F e Λt F (3) Now, let us suppose tht we tke mesurement of the mrna concentrtions t specific time t m > 0 This mens tht we know x(t m ) n woul like to show tht we cn solve for A in (2) Hence, from (3) we hve tht x(t m ) = e Atm x 0 = F e Λtm Fx 0 Multiplying oth sies y F, n efining ˆx(t) = F x(t) to e the Discrete Fourier Trnsform of x(t), we get ˆx(t m ) = FF e Λtm Fx 0 = e Λtm ˆx 0 (4) Since Λt m is igonl mtix, e Λtm = ig(e λ1tm,, e λntm ), n we otin tht e λ1tm e ˆx(t m ) = λ2tm 0 ˆx e λntm In other wors, ˆx j (t m ) = e λjtm ˆx j (0) for ll j {1,, n} (5) Eqution (5) cn e solve for ech λ j, n circulnt mtrix A = F ΛF stisfying x(t m ) = e Atm x 0 cn e etermine since A is circulnt for ny vlues of λ 1,,λ n We woul like to show tht A is unique since we esire to etermine A with only one mesurement Assume tht e A1tm x 0 = e A2tm x 0 for two circulnts A 1 n A 2 Suppose tht A 1 = F Λ 1 F n A 2 = F Λ 2 F for igonl mtrices Λ 1 = ig(λ 1,,λ n ) n Λ 2 = ig(µ 1,, µ n ) We get tht F e Λ1tm Fx 0 = F e Λ2tm Fx 0 Hence e Λ1tm ˆx 0 = e Λ2tmˆx 0 It follows tht e λjtm = e µjtm for ll j {1,, n} (6) Let j {1,,n} e given Let λ j t m = + i n µ j t m = c + i,,, c, From (6) we get tht e +i = e c+i This implies e e i = e c e i In other wors, e (cos + i sin) = e c (cos + i sin) Equting the rel n imginry prts, we otin e cos = e c cos n e sin = e c sin Since sin 2 + cos 2 = sin 2 + cos 2 = 1, we hve tht e 2 = e 2c Thus,, c implies = c Also, it cn e seen tht n must iffer y multiple of 2π since cos = cos, n sin = sin, ie = + 2πk j, k j Hence, µ j t m = + ( + 2πk j )i Diviing y t m, we get µ j = +i t m + 2πkj t m i We conclue tht µ j = λ j + 2πk j t m i, for some k j (7) 3
4 In other wors, solving eqution (5) for ech λ j oes not necessrily prouce unique solution Hence, one time mesurement will not suffice to etermine λ 1,, λ n ue to the perioicity inherent in the exponentil function However, in the cse tht ech e λjtm is rel vlue, we cn solve for λ j uniquely Whenever A is symmetric, we re gurntee rel eigenvlues [2] Thus, when A is symmetric circulnt, one time mesurement will suffice to etermine A uniquely This les to the following sttement Theorem 1: Let x 0 = x(0) e given When A is symmetric circulnt, e At x 0 = x(t) cn e solve uniquely for A with vlue of x(t) t single time t m In orer to ssure tht we re le to etermine λ 1,, λ n uniquely in the non-symmetric cse, it is necessry to tke secon mesurement of x(t) t lter time However, there re restrictions on when the secon time mesurement cn occur Suppose tht we tke mesurements of x(t) t ifferent times t 1 n t 2 Then we know tht ˆx j (t 1 ) = e λjt1ˆx j (0) n ˆx j (t 2 ) = e λjt2ˆx j (0), for j = 1,,n Suppose tht we fin two ifferent vlues µ n σ tht stisfy oth equtions for λ j We hve tht e µt1 = e σt1 n e µt2 = e σt2 From the results of eqution (7), we see tht µ = σ + 2πn t 1 i n µ = σ + 2πm t 2 i, for some n, m Since µ σ, m n n re nonzero integers Thus, 2πn t 1 = 2πm t 2, which implies t 2 = m, for nonzero integers m, n (8) t 1 n Hence, if t 2 /t 1 /, then µ = σ n we hve tht λ j my e solve for uniquely with vlues of x(t 1 ) n x(t 2 ) We otin the following theorem Theorem 2: Let x 0 = x(0) e given When A is generl circulnt, e At x 0 = x(t) cn e solve uniquely for A with vlues of x(t) t two istinct times t 1 n t 2, provie tht the rtio of t 2 to t 1 is n irrtionl numer The question remins whether tking more thn two time mesurements of x(t) will llow us to etermine A uniquely without tking mesurement of x(t) t n irrtionl time Suppose tht we know x(t 1 ), x(t 2 ),, x(t m ), where t 1,, t m Let A = F ΛF, where Λ = ig(λ 1,, λ n ) Let λ j {λ 1,, λ n } e given Then e λjt1ˆx j (0) = ˆx j (t 1 ), e λjt2ˆx j (0) = ˆx j (t 2 ),, e λjtm ˆx j (0) = ˆx j (t m ) Suppose tht there exist two complex numers µ n σ tht stisfy these equtions for λ j Then y eqution (7) σ = µ + 2πk1 t 1 i = µ + 2πk2 Then we hve tht σ = µ + 2πk11 1 t 2 i = = µ + 2πkm t m i, k 1,,k m Let t j = j / j, j, j +, for j = 1,,n i = µ + 2πk22 2 i = = µ + 2πkmm m i Let γ = lcm( 1,, m ) e the lest common multiple of 1,, m We hve tht σ = µ + 2πk11 γ i = µ + 2πk22 γ i = = µ + 2πkmm γ i, where k γ for = 1,,m Let δ = lcm( γ1 1,, γm m ) Then these m equlities reuce to the equlity σ = µ + 2π γ ki, where k δ is ritrry Hence, the m mesurements t rtionl times t 1,, t m o not etermine λ j uniquely Therefore, we my revise Theorem 2 Theorem 2 : Let x 0 = x(0) e given In orer to uniquely solve the inverse prolem e At x 0 = x(t) for circulnt A, it is necessry n sufficient tke mesurements of x(t) t two istinct times t 1 n t 2, such tht the rtio of t 2 to t 1 is n irrtionl numer Thus, y tking one time mesurement in the cse tht circulnt A is symmetric or two time mesurements in the generl cse, we re le to etermine A uniquely As si efore, this solution to eqution (1) for A circulnt cn provie strting point from which to etermine etter moel for the gene network Block Circulnt Mtrices with Circulnt Blocks An interesting n similr result to our solution for A circulnt hols when A is ssume to e lock 4
5 circulnt mtrix with circulnt locks These re mtrices of the form C 1 C 2 C m C m C 1 C m 1 A m,n =, C 2 C 3 C 1 where ech C j, j = 1,,m, is circulnt mtrix of orer n For nottionl ese we will sy tht n m m lock circulnt mtrix with n n circulnt locks is of the clss BCCB m,n [1] It is importnt to note tht mtrix in BCCB m,n is not necessrily circulnt, n the topology of generl four gene network with A BCCB m,n iffers from the topology of the circulnt cse in Figure 1 Consier the mtrix c c A = BCCB c 2,2 c Figure 2 elow shows the grph of the four gene network etermine y A from eqution (1) 1 2 c c 4 3 Fig 2 Grph of four gene network with A in BCCB 2,2 Also, suppose tht mtrix A hs orer p When solving eqution (2) for mtrix A tht is lock circulnt with circulnt locks, we must tke into consiertion oth the numer of locks n the size of the circulnt locks Suppose tht p = mn n p = qr, m, n, q, r + We cn fin ifferent solutions for A se on whether we tke A BCCB m,n or A BCCB q,r For exmple, the mtrices c e f c e f c f e c f e e f c c e f A 1 = BCCB f e c 3,2 n A 2 = BCCB e f c 2,3 c e f f e c c f e e f c re oth 6 6 lock circulnt mtrices with circulnt locks However, they re clerly not equivlent n o not represent the sme gene network This fct my prove useful when reverse engineering the gene network using numer of mesurements of the gene prouct concentrtions One type of BCCB mtrix my serve s etter moel to strt from thn nother when reverse engineering the gene network Let us suppose tht A BCCB m,n Thus, A is mtrix of orer mn Then, we know tht A is in 5
6 BCCB m,n if n only if it my e igonlize y the unitry mtrix F m F n = 1 n F n F n F n F n F n ωf n ω 2 F n ω m 1 F n F n ω 2 F n ω 4 F n ω 2(m 1) F n, F n ω (m 1) F n ω 2(m 1) F n ω (m 1)(m 1) F n where F m n F n re the Fourier mtrices of orer m n n respectively, F m F n is their irect or Kronecker prouct, n ω = e 2πi n s efine ove [1] Hence, we hve tht A = (F m F n ) Λ(F m F n ) where Λ = ig(λ 1, λ 2,, λ mn ) We cn now otin n nlog to eqution (3) for A BCCB m,n, nmely e At = (F m F n ) e Λt (F m F n ) (9) Now, consier the eqution x(t) = e At x 0 When A BCCB m,n we hve x(t m ) = (F m F n ) e Λt (F m F n ) Left multiplying oth sies y (F m F n ) n efining x(t) = (F m F n )x(t), we get (F m F n ) x(t) = (F m F n )(F m F n ) e Λt (F m F n )x 0 Since F m F n is unitry, x(t) = e Λt x 0, n (10) x j (t) = e λjt x j (0) for ll j {1,,mn} (11) By the sme rgument s in the cse where A is circulnt, we hve the following two corollries to Theorem 1 n Theorem 2 Corollry 1: Let x 0 = x(0) e given When A is symmetric lock circulnt mtrix with circulnt locks, e At x 0 = x(t) cn e solve uniquely for A with vlue of x(t) t single time t m Corollry 2: Let x 0 = x(0) e given Suppose tht A is lock circulnt mtrix with circulnt locks In orer to uniquely solve the inverse prolem e At x 0 = x(t) for A, it is necessry n sufficient tke mesurements of x(t) t two istinct times t 1 n t 2, such tht the rtio of t 2 to t 1 is n irrtionl numer Level-N Circulnts We cn mke further extension of our circulnt cse, consiering mtrices A tht re level-n circulnts A level-1 circulnt is just n orinry circulnt A level-2 circulnt is one tht is in BCCB A level-3 circulnt is lock circulnt whose locks re level-2 circulnts In generl, level-n circulnt is lock circulnt whose locks re level-(n 1) circulnts The following mtrix C is n exmple of the smllest level-3 circulnt c e f g h c f e h g c g h e f c h g f e C = e f g h c f e h g c g h e f c h g f e c 6
7 g g 5 6 e h 8 e f c c h f e f h 1 2 c h c 7 f e g 4 3 g Fig 1 Grph of the eight gene network represente y C ove, the smllest level-3 circulnt We will use C(N) m1,,m N to enote the clss of level-n circulnts consisting of n m N m N lock circulnt whose locks re m (N 1) m (N 1) lock level-(n-1) circulnts n elong to C(N 1) m1,,m (N 1) For exmple, the mtrix C ove elongs to the clss of level-n circulnts enote y C(3) 2,2,2 Suppose tht mtrix A in eqution (1) elongs to C(N) m1,,m N Similr to the circulnt n level-2 circulnt cse, A my e igonlize y the mtrix F mn F m(n 1) F m1 [1] Hence, we hve tht Defining x(t) = (F mn F m1 )x(t), we see tht A = (F mn F m1 ) Λ(F mn F m1 ) (12) x(t) = e Λt x 0 n hence, (13) x j (t) = e λjt x j (0) (14) Hence we hve the following generliztions for Theroem 1 n Theorem 2 Theorem 1 : Let x 0 = x(0) n positive integer N e given When A is symmetric level-n circulnt mtrix, e At x 0 = x(t) cn e solve uniquely for A with vlue of x(t) t single time t m Theorem 2 : Let x 0 = x(0) n positive integer N e given Suppose tht A is level-n circulnt mtrix In orer to uniquely solve the inverse prolem e At x 0 = x(t) for A, it is necessry n sufficient tke mesurements of x(t) t two istinct times t 1 n t 2, such tht the rtio of t 2 to t 1 is n irrtionl numer When reverse engineering gene network with n genes, it will prove useful to consier the vrious level-n circulnts which hve the orer n Suppose tht we hve gene network with 100 genes Then, we cn solve our inverse prolem for level-3 circulnts elonging to vrious clsses, incluing, C(3) 2,2,25,C(3) 2,25,2, C(3) 5,5,4, n C(3) 2,5,10 We coul lso solve our prolem for level-4 circulnt of the clss C(4) 5,5,2,2 Also, suppose tht n hs prime fctoriztion given y n = p 1 1 p 2 2 p l l We see tht the lrgest numer of levels our level-n circulnt coul hve woul e N = l In the cse where n = 100, 4 is the 7
8 lrgest possile vlue for N Toeplitz Mtrices Toeplitz mtrices re those m n mtrices T of the form n (n 1) T = (n 2) m (m 1) (m 2) 0 Before preceing to the generl Toeplitz cse, we will first consier the solution to eqution (2) when A is n n n upper tringulr Toeplitz mtrix Define A = utoeplitz( 1, 2,, n ) to e the upper tringulr Toeplitz mtrix given y A = 1 2 n 0 1 n We ssert tht e At is lso n upper tringulr Toeplitz mtrix Consier the expnsion e At = I + At + 1 2! A2 t ! A3 t 3 + Given two upper tringulr Toeplitz mtrices, B = utoeplitz( 1,, n ) n G = utoeplitz(g 1,, g n ), their prouct BG is the upper tringulr Toeplitz n given y BG = utoeplitz( 1 g 1, 1 g g 1,, n g 1 + n 1 g g n ) Hence A j is upper tringulr Toeplitz for ll positive integers j The sum of upper tringulr Toeplitz mtrices is gin upper tringulr Toeplitz This implies e At is n upper tringulr Toeplitz mtrix Let iscrete time t m > 0 e given Then, let T = e Atm e the upper tringulr Toeplitz mtrix T = utoeplitz(u 1, u 2,,u n ) Assuming we know x(t) t t = 0 n t = t m, we wish to solve the inverse prolem e Atm x(0) = x(t m ) for A We cn esily solve the eqution Tx(0) = x(t m ) for T = e Atm Using T we will e le to clculte e At t ny time t m We hve u 1 u 2 u n x 1 (0) x 1 (t m ) 0 u 1 u n 1 x 2 (0) Tx(0) = = x 2 (t m ), n hence 0 0 u 1 x n (0) x n (t m ) u 1 x 1 (0) + u 2 x 2 (0) + + u n x n (0) u 1 x 2 (0) + u 2 x 3 (0) + + u n 1 x n (0) = u 1 x n 1 (0) + u 2 x n (t m ) u 1 x n (0) x 1 (t m ) x 2 (t m ) x n 1 (t m ) x n (t m ) (15) It is esily seen tht u 1 = xn(tm) x Thus, we cn solve for u n(0) 1 whenever x n (0) 0 Suppose x n (0) is nonzero Once we otin u 1, we re le to clculte u 2 = xn 1(tm) u1xn 1(0) x n(0) In generl, u 1 = x n(t m ) x n (0) u j = x n j+1(0) x n (0) n 1 j 1 x n (0) k=1 u k x n j+1 (16) 8
9 whenever x n (0) 0 Thus, we cn otin the full mtrix T = e Atm We woul like to show tht there exists unique A such tht e Atm = T n provie metho for etermining A Suppose tht e Atm = T where A = utoeplitz( 1, 2,, n ) n T = utoeplitz(u 1, u 2,, u n ) Let V = At m = utoeplitz(v 1, v 2,, v n ) We woul like to solve the prolem e V = T for V We hve tht I + V + 1 2! V ! V 3 + = T Consier the element u 1 of T We see tht 1 + v ! v ! v3 1 + = u 1, so u 1 = e v1 Since u 1 = xn(tm) x n(0) is rel, we my solve for v 1 uniquely We will nee the following lemm Lemm 1: Let V e the n n upper tringulr Toeplitz mtrix given y V = utoepliz(v 1, v 2,,v n ) Define V k to e the sumtrix of V given y V k = utoeplitz(v 1, v 2,, v k ), where k n Then, [e V k ] i,j = [e V ] i,j for i, j {1,,k} Proof: We hve tht v 1 v k v k+1 v n 0 ( V = v1 v 2 v k+1 Vk W 0 0 v 1 v = n k 0 V n k v 1 For j +, ( V j V j = k Ψ(V k, V n k, W) 0 V j n k where Ψ is some function of V k, V n k, n W Thus, we see tht ), where W = ), e V = I + V + 1 ( 2! V 2 e V k Ω(V + = k, V n k, W) 0 e V n k v k+1 v n v 2 v k+1 where Ω is some function of V k, V n k, n W Thus, for 1 k n, [e V ] i,j = [e V k ] i,j for i, j {1,,k} We now return to our question of etermining v 1, v 2,,v n in mtrix V Consier e V = T From Lemm 1 we see tht e V k = (e V ) k, for 1 k n In other wors, e V k = T k = utoeplitz(u 1,,u k ) We woul like to show tht u k = f(v 1,, v k 1 ) + v k e v1, where f is some function of v 1,, v k 1 v 1 v k T k = e V k = I ! v 1 v k 2 ), + 1 v 1 v k 3! v 1 Let us consier only the vlue of u k = [T k ] 1,k 0 v 1 0 v 1 u k = v k + 1 2! (2v 1v k + f 1 (v 1,,v k 1 )) + 1 3! (3v 1 2 v k + f 2 (v 1,, v k 1 )) + 1 4! (4v 1 3 v k + f 3 (v 1,, v k 1 )) + = v k (1 + v ! v ! v3 1 + ) + f(v 1,, v k 1 ) = f(v 1,, v k 1 ) + v k e v1 (17) References [1] P J Dvis Circulnt Mtrices Chelse Pulishing: New York, 1994 [2] S H Frieerg Liner Alger, 3r e Prentice Hll: Upper Sle River, NJ,
10 [3] G Heinig Inverse Prolems for Hnkel n Toeplitz Mtrices Liner Alger Appl 165 (1992), 1 23 [4] R M Reheffer Differentil Equtions Jones n Brtlett Pulishers: Boston,
APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line
APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationSturm-Liouville Theory
LECTURE 1 Sturm-Liouville Theory In the two preceing lectures I emonstrte the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series re just the tip of the iceerg of the theory
More informationLECTURE 3. Orthogonal Functions. n X. It should be noted, however, that the vectors f i need not be orthogonal nor need they have unit length for
ECTURE 3 Orthogonl Functions 1. Orthogonl Bses The pproprite setting for our iscussion of orthogonl functions is tht of liner lgebr. So let me recll some relevnt fcts bout nite imensionl vector spces.
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationf a L Most reasonable functions are continuous, as seen in the following theorem:
Limits Suppose f : R R. To sy lim f(x) = L x mens tht s x gets closer n closer to, then f(x) gets closer n closer to L. This suggests tht the grph of f looks like one of the following three pictures: f
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationMatrix & Vector Basic Linear Algebra & Calculus
Mtrix & Vector Bsic Liner lgebr & lculus Wht is mtrix? rectngulr rry of numbers (we will concentrte on rel numbers). nxm mtrix hs n rows n m columns M x4 M M M M M M M M M M M M 4 4 4 First row Secon row
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationChapter Five - Eigenvalues, Eigenfunctions, and All That
Chpter Five - Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
More informationConservation Law. Chapter Goal. 6.2 Theory
Chpter 6 Conservtion Lw 6.1 Gol Our long term gol is to unerstn how mthemticl moels re erive. Here, we will stuy how certin quntity chnges with time in given region (sptil omin). We then first erive the
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationQUADRATIC EQUATIONS OBJECTIVE PROBLEMS
QUADRATIC EQUATIONS OBJECTIVE PROBLEMS +. The solution of the eqution will e (), () 0,, 5, 5. The roots of the given eqution ( p q) ( q r) ( r p) 0 + + re p q r p (), r p p q, q r p q (), (d), q r p q.
More informationIf we have a function f(x) which is well-defined for some a x b, its integral over those two values is defined as
Y. D. Chong (26) MH28: Complex Methos for the Sciences 2. Integrls If we hve function f(x) which is well-efine for some x, its integrl over those two vlues is efine s N ( ) f(x) = lim x f(x n ) where x
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationNecessary and sufficient conditions for some two variable orthogonal designs in order 44
University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering n Informtion Sciences 1998 Necessry n sufficient conitions for some two vrile orthogonl esigns in orer
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationMath 211A Homework. Edward Burkard. = tan (2x + z)
Mth A Homework Ewr Burkr Eercises 5-C Eercise 8 Show tht the utonomous system: 5 Plne Autonomous Systems = e sin 3y + sin cos + e z, y = sin ( + 3y, z = tn ( + z hs n unstble criticl point t = y = z =
More informationChapter 6 Techniques of Integration
MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln
More informationM344 - ADVANCED ENGINEERING MATHEMATICS
M3 - ADVANCED ENGINEERING MATHEMATICS Lecture 18: Lplce s Eqution, Anltic nd Numericl Solution Our emple of n elliptic prtil differentil eqution is Lplce s eqution, lso clled the Diffusion Eqution. If
More informationDefinite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +
Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationC. C^mpenu, K. Slom, S. Yu upper boun of mn. So our result is tight only for incomplete DF's. For restricte vlues of m n n we present exmples of DF's
Journl of utomt, Lnguges n Combintorics u (v) w, x{y c OttovonGuerickeUniversitt Mgeburg Tight lower boun for the stte complexity of shue of regulr lnguges Cezr C^mpenu, Ki Slom Computing n Informtion
More information10 Vector Integral Calculus
Vector Integrl lculus Vector integrl clculus extends integrls s known from clculus to integrls over curves ("line integrls"), surfces ("surfce integrls") nd solids ("volume integrls"). These integrls hve
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More information2. VECTORS AND MATRICES IN 3 DIMENSIONS
2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationSpecial Numbers, Factors and Multiples
Specil s, nd Student Book - Series H- + 3 + 5 = 9 = 3 Mthletics Instnt Workooks Copyright Student Book - Series H Contents Topics Topic - Odd, even, prime nd composite numers Topic - Divisiility tests
More informationdx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.
Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationBasic Derivative Properties
Bsic Derivtive Properties Let s strt this section by remining ourselves tht the erivtive is the slope of function Wht is the slope of constnt function? c FACT 2 Let f () =c, where c is constnt Then f 0
More informationGeometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.
Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number
More informationSUPPLEMENTARY NOTES ON THE CONNECTION FORMULAE FOR THE SEMICLASSICAL APPROXIMATION
Physics 8.06 Apr, 2008 SUPPLEMENTARY NOTES ON THE CONNECTION FORMULAE FOR THE SEMICLASSICAL APPROXIMATION c R. L. Jffe 2002 The WKB connection formuls llow one to continue semiclssicl solutions from n
More information4. Approximation of continuous time systems with discrete time systems
4. Approximtion of continuous time systems with iscrete time systems A. heory (it helps if you re the course too) he continuous-time systems re replce by iscrete-time systems even for the processing of
More information5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship
5.4, 6.1, 6.2 Hnout As we ve iscusse, the integrl is in some wy the opposite of tking erivtive. The exct reltionship is given by the Funmentl Theorem of Clculus: The Funmentl Theorem of Clculus: If f is
More informationSection 4: Integration ECO4112F 2011
Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic
More informationAnswers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics
Answers n Solutions to (Some Even Numere) Suggeste Exercises in Chpter 11 o Grimli s Discrete n Comintoril Mthemtics Section 11.1 11.1.4. κ(g) = 2. Let V e = {v : v hs even numer o 1 s} n V o = {v : v
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationModule 6: LINEAR TRANSFORMATIONS
Module 6: LINEAR TRANSFORMATIONS. Trnsformtions nd mtrices Trnsformtions re generliztions of functions. A vector x in some set S n is mpped into m nother vector y T( x). A trnsformtion is liner if, for
More informationGNFA GNFA GNFA GNFA GNFA
DFA RE NFA DFA -NFA REX GNFA Definition GNFA A generlize noneterministic finite utomton (GNFA) is grph whose eges re lele y regulr expressions, with unique strt stte with in-egree, n unique finl stte with
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationSection 6.3 The Fundamental Theorem, Part I
Section 6.3 The Funmentl Theorem, Prt I (3//8) Overview: The Funmentl Theorem of Clculus shows tht ifferentition n integrtion re, in sense, inverse opertions. It is presente in two prts. We previewe Prt
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationx dx does exist, what does the answer look like? What does the answer to
Review Guie or MAT Finl Em Prt II. Mony Decemer th 8:.m. 9:5.m. (or the 8:3.m. clss) :.m. :5.m. (or the :3.m. clss) Prt is worth 5% o your Finl Em gre. NO CALCULATORS re llowe on this portion o the Finl
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationSurds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,
Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.
More informationElectric Potential. Electric Potential Video: Section 1 4. Electric Fields and WORK 9/3/2014. IB Physics SL (Year Two) Wednesday, September 3, 2014
9/3/014 lectric Potentil IB Physics SL (Yer Two) Wenesy, Septemer 3, 014 lectric Potentil Vieo: Section 1 4 lectric Fiels n WORK In orer to rin two like chres ner ech other work must e one. In orer to
More informationTHE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p
THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ
More informationp(t) dt + i 1 re it ireit dt =
Note: This mteril is contined in Kreyszig, Chpter 13. Complex integrtion We will define integrls of complex functions long curves in C. (This is bit similr to [relvlued] line integrls P dx + Q dy in R2.)
More informationPolynomials and Division Theory
Higher Checklist (Unit ) Higher Checklist (Unit ) Polynomils nd Division Theory Skill Achieved? Know tht polynomil (expression) is of the form: n x + n x n + n x n + + n x + x + 0 where the i R re the
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationINTEGRALS. Chapter Introduction
INTEGRALS 87 hpter 7 INTEGRALS Just s mountineer clims mountin ecuse it is there, so goo mthemtics stuent stuies new mteril ecuse it is there. JAMES B. BRISTOL 7. Introuction Differentil lculus is centre
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More information0.1 THE REAL NUMBER LINE AND ORDER
6000_000.qd //0 :6 AM Pge 0-0- CHAPTER 0 A Preclculus Review 0. THE REAL NUMBER LINE AND ORDER Represent, clssify, nd order rel numers. Use inequlities to represent sets of rel numers. Solve inequlities.
More informationHomework Solution - Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationThe Dirichlet Problem in a Two Dimensional Rectangle. Section 13.5
The Dirichlet Prolem in Two Dimensionl Rectngle Section 13.5 1 Dirichlet Prolem in Rectngle In these notes we will pply the method of seprtion of vriles to otin solutions to elliptic prolems in rectngle
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationBest Approximation in the 2-norm
Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationChapter 1: Fundamentals
Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,
More informationDEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.
398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts
More informationSOME INTEGRAL INEQUALITIES OF GRÜSS TYPE
RGMIA Reserch Report Collection, Vol., No., 998 http://sci.vut.edu.u/ rgmi SOME INTEGRAL INEQUALITIES OF GRÜSS TYPE S.S. DRAGOMIR Astrct. Some clssicl nd new integrl inequlities of Grüss type re presented.
More informationAP Calculus Multiple Choice: BC Edition Solutions
AP Clculus Multiple Choice: BC Edition Solutions J. Slon Mrch 8, 04 ) 0 dx ( x) is A) B) C) D) E) Divergent This function inside the integrl hs verticl symptotes t x =, nd the integrl bounds contin this
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
More informationVidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution
S.E. Sem. III [CMPN] Discrete Structures Prelim Question Pper Solution 1. () (i) Disjoint set wo sets re si to be isjoint if they hve no elements in common. Exmple : A = {0, 4, 7, 9} n B = {3, 17, 15}
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationHere we consider the matrix transformation for a square matrix from a geometric point of view.
Section. he Mgnifiction Fctor In Section.5 we iscusse the mtri trnsformtion etermine mtri A. For n m n mtri A the function f(c) = Ac provies corresponence etween vectors in R n n R m. Here we consier the
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More information5.3 The Fundamental Theorem of Calculus
CHAPTER 5. THE DEFINITE INTEGRAL 35 5.3 The Funmentl Theorem of Clculus Emple. Let f(t) t +. () Fin the re of the region below f(t), bove the t-is, n between t n t. (You my wnt to look up the re formul
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationMA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.
MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.
More information