3 Pages

FIRST ORDER LINEAR DIFFERENTIAL EQUATIONS - Copy (2)

Course: MATH 1005, Winter 2010
School: Carleton CA
Rating:
 
 
 
 
 

Word Count: 234

Document Preview

Alaca MATH A. 1005F Fall 2008 1 FIRST ORDER LINEAR DIFFERENTIAL EQUATIONS A rst order linear dierential equation is an equation of the form y + P (x)y = Q(x) () where P (x) and Q(x) continuous functions on a given interval. Method of solution: We are looking for an integrating factor I (x) such that when we multiply both sides of the equation (*) by I (x), left hand side of the equation d would be (Iy ). dx I...

Register Now

Unformatted Document Excerpt

Coursehero >> Canada >> Carleton CA >> MATH 1005

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Alaca MATH A. 1005F Fall 2008 1 FIRST ORDER LINEAR DIFFERENTIAL EQUATIONS A rst order linear dierential equation is an equation of the form y + P (x)y = Q(x) () where P (x) and Q(x) continuous functions on a given interval. Method of solution: We are looking for an integrating factor I (x) such that when we multiply both sides of the equation (*) by I (x), left hand side of the equation d would be (Iy ). dx I (x)y + P (x)yI (x) = Q(x)I (x) d (Iy ) = QI dx Iy = y= How to nd I (x): I (x)(y + P (x)y ) = d ( I ( x) y ) . dx Q(x)I (x)dx 1 ( I x) Q(x)I (x)dx . I ( x) y + P ( x) I ( x) y = I ( x) y + I ( x) y P ( x) I ( x) = I ( x) = P (x)dx = ln |I | = eln |I | = e |I | = e dI I P (x)dx P (x) dx dI dx P (x) dx Since we do not need most general integrating factor, we take I (x) = e P (x) dx . A. Alaca MATH 1005F Fall 2008 2 Example: Solve the initial value problem y + y tan x = sin 2x, y (0) = 1. A. Alaca MATH 1005F Fall 2008 3 Example: Solve the dierential equation y + 2xy = 2x3 . Solution: P (x) = 2x, Q(x) = 2x3 . I ( x) = e P (x) dx =e 2x dx = ex . 2
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Carleton CA - MATH - 1005
A. AlacaMATH 1005Winter 20108Integrating factor for non-exact dierential equations It is sometimes possible to convert a non-exact DE into an exact DE by multiplying it an integrating factor I (x, y ): P (x, y ) + Q(x, y ) y = 0 () (non-exact.) (exact
Carleton CA - MATH - 1005
A. AlacaMATH 1005Winter 20101MATH 1005 WINTER 2010 LECTURE SLIDES Prepared by Aye Alaca s Last modied: January 1, 2010 These Slides replace neither the Text Book nor the LecturesPARTIAL DERIVATIVESA. AlacaMATH 1005Winter 20102Partial Derivatives
Carleton CA - MATH - 1005
A. AlacaMATH 1005Winter 20102SECOND-ORDER LINEAR DIFFERENTIAL EQUATIONS A Second-order linear dierential equation has the form P (x)y + Q(x)y + R(x)y = G(x) ()where P, Q, R and G are continuous functions. If G(x) = 0 for all x, then () is called homo
Carleton CA - MATH - 1005
A. AlacaMATH 1005Winter 20102INFINITE SEQUENCES AND SERIES A sequence is an ordered list having a rst element but no last element: a1, a2, a3, ., an, . a1 is the rst term, a2 is the second term, an is the nth term or general term. Each term an of an i
Carleton CA - MATH - 1005
A. AlacaMATH 1005Winter 2010 1Last modied: January 11, 2010 Table of Dierential equationsDiential Eqn. Separable DE. Homogeneous DE.General Form y = f ( x) g ( y ) y = f (x, y) = g(v), v = y/xMethod of Solution h(y) dy = f (x) dx, h(y) = 1/g(y) dv d
Carleton CA - MATH - 1005
A. AlacaMATH 1005Winter 201016The Method of Variation of Parameters For any equation of the form y + P (x)y + Q(x)y = G(x), (1)where P (x), Q(x) and G(x) are continuous functions of x, a particular solution can be obtained by variation of parameters.
Arkansas - ECON - 4033
University of Arkansas ECON 4033 History of Economic Analysis TTh 2:00-3:20 p.m., WCOB 3393/11/08 Exam BName (only on the back of the last page of these exam pages) Please put your name only on the outside of your blue book and only on the back of the l
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
1 ' 9-8002 )' ( / :: . : , : , V , . , , : : ) (. : ) ; : (
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
u.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.il
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
, )S . ,S ." + NIL s-.Relax . u ," .s- (BF) .O(|V|E|) : . 3 6 7 10 DFS All-Pairs Shortest Paths 2 5 7 9 12 (3) . .din(v)=dout(v) :V- v . .din(u)=dout(u) uv,w . . FW BFS (" 0/1 ) " (2) (1) : (*) . 1 4 7 8 11 (" )BFu.multinet.co.ilmin O(|V|4) : 3 .
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
u.multinet.co.il5: .1G .. .o iG = g1, g2, gn G :" .T-Wi . : , , . . Ok ,( .O k : O(n) O(nlogn) G O(n) O(nlogn) " G G " OL . . . " . ,( T Oi .a*wi=T" . ) T>0 Wi<T . oi c , " .T gi , ,,. ) OL Gk>GL Ok ...O(2n) .2 Fun : . : ,n=0 .".0IFFun . O(
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
u.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.il
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
u.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.ilu.multinet.co.il
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net?
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
- om ommunication aboratory : 6002m(t )vm (t )vmr (t )mr (t ) 1 2 . 1. .1 : 1.1 .1.1v h (t ) = A cos( 0 t + ) = A cos[ 0 (t + d )] = Re Ae j e j o t = Vh ( jf ) =cfw_A j j 0 t A j j 0 t ee +e e 2 2A j A
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
- DHCP DHCP OpNet: : DHCP DHCPDynamic Host Configuration Protocol Dynamic .TCP/IP -: )(IETF )(DHCWG - - ' DHCP DHCP s - . s
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
OpNet OpNet . , OpNet , : , , . OpNet , , , .
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Graphs ARE NOTIntro to Data Structures and Algorithms Graphs - Introduction, Slide 1GraphsG = (V,E)1 2 3456V[G] = cfw_1,2,3,4,5,6|V| = 6E[G] = cfw_1,2,cfw_1,5,cfw_2,5,cfw_3,6 Note: cfw_u,v = (u,v) = (v,u)(u,v): uvIntro to Data Structures and
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Algorithms - Exercise 2TA in charge: Omri1. Please read the section in Cormen about Human codes (section 16.3 in the second edition and 17.3 in the rst edition). You may be asked to explain the algorithm in class. 2. You are given a series of words (w1
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Algorithms - Exercise 3TA in charge: DvirYou should provide correctness proofs and running-time analysis for all your algorithms. 1. Recall the Longest Common Subsequence problem shown in class. Assume that the algorithm for solving the problem would ha
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
- ' 9002 5 : 90/70/101. " ". -0 . :)D ( p ( x) | q ( x) = 0 iff p ( x) = q ( x: - :Jensen's ) f ( X ) (convex- X ", :) Ecfw_ f ( X ) f (Ecfw_X ) f ( X ) (strictly convex : ) Ecfw_ f ( X ) = f (Ecfw_X : , X = Ecfw_X in probability X )
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
- : 1081-1-173 ', " (9002) 5 ( ). * : , ', f t t log t D p | q p x log q x log p x q x q x q x t f t convex x x q x Jensen ' s inequality with equality iff p x p x
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Algorithms - Exercise 9TA in charge: Dvir1. Assume that the fastest algorithm for multiplying two polynomials of degree n over a eld F works in time M (n), and that the fastest algorithm for computing the square of a given polynomial of degree n over F
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
)642432( " ' 1. : w: E Rp ts l ( p)G (V , E ) p,O (| E | | V |):O(| E | | V |) BFS:+" vs .w( v ) v+>:+==p (v ).i i= >=:+=:===d (u )i v e (u , v) d (v ) i, p (v ) u, w(v ) w(u ) w(e) d (v) u , w(v ) w(u ) w(e) w(v) w(u )
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
:" ". 2 ; - qf 2 F w .p 2 Qw: " (q0 w a) ` (qf : " (q0 w a) ` (p;) ).1 .2M = (Q. (qq0 a F ).j (q a Z )j 1 :Z 2 ;- a 2 f g ,q 2 Q Z) = , 2 (q Z ) 6= Z 2 ;- q 2 Q:.1 .2"a2T.L = L(G),P .G = (V T P S ) .M = (f q0 g T V q0 S ) : . (q0 a A) = f
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Graph TraversalsGiven: a graph G a source vertex s in V[G] Goal: visit all the vertices of G to determine some property: Is G connected? Does G have a cycle? is there a v u path in G? What is the shortest path? Will G disconnect if we remove a single ed
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarat
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarat
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarat
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarat
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "1 :=cfw_0,1 .1 * cfw_ .5- .1100 . . . . .: .2 . (1 . (2 .101 00 x - z=xy - =cfw_0,1 z .-1 y- -0 . ..r .3 .L(r) (1 .L(r) -
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "2 : , .1 =cfw_0,1 . L1 = cfw_ w | wcfw_0,1*, w=wR =cfw_0,1,# . .( x,y,z) L2 = cfw_ x#y#z | x,y,zcfw_0,1*, x+y=z =cfw_0,1 . L3 = cfw_ x1y1z1.xnynzn | x=xn.x1,y=yn.y1,z=zn.z1, x+y=z .(x1,xn,y1,yn,z1,zn - , x,y,z) n ,nN ,Ln .2 ,Ln O(n) . 2
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net? TA Marathon "http:/TAMarathon.net?
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 - L1 , L2 , . . . , Lk , * , : = Li Lj ij * = L1 L2 . . . . . Lk Li 1 i k Li . .i .ii .iii 1 i k 2 - L - L . : J = cfw_0w | wL cfw_1w | wL J , - ? . 3 A C - . B C A,B . - C A- B
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 . , . , . 2 . m 3 L , , " , " , - L
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
RICE: ' 1 RICE . 2 RICE . M - 1cfw_ = )L = cfw_ <M> | L(M 3 , RICE , : M - ) L(M | >a. FTM = cfw_ <M M" - ) L(M | >b. REGTM = cfw_ <M | >c. L = cfw_ <M M M" - ) L(M 5
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 9,.,1,0cfw_=DIGIT . . , ), 5432 ( . , ) ( 0 ) ( 2 : *1cfw_*0cfw_ = 0>|cfw_w | |w cfw_01+cfw_0,1*cfw_10+ = cfw_w | w = uuR.a .b 3 A
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
- : ' 1 1,0cfw_= . *101,11cfw_ = 2L 1010 L3 = cfw_w | w contains the substring 011 or 1010 L4 = cfw_w | w terminates with the substring 011 or *11,00cfw_ \ *1,0cfw_ = 5L 1 = 2 L6 = cfw_ wcfw_a,b* | w = xy , #a(x) mod 2 = 0 , #b(y) mod . . . . . 2 -
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 ~L , cfw_a,b L . . - L - a - b . 2 , , Nerode 1 . L = cfw_ aiba2ibb | i . 3 ~L , ) ( L,L * . 4 L . - ~L - . ~ L 5 Nerode : .i
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 : ) (. 0>L=cfw_a b | k 0>L=cfw_akbm | km 0>L=cfw_akbm | mk 0L=cfw_akbmcm-k | m>k *L=cfw_ssR | scfw_a,bk 2k. . . . . 2 - ) ( , Q, q0, F, , -|, , : ) : Q x (cfw_) x (cfw_) x (cfw_ )Q x (cfw_) x (cfw_ :
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 ) G = ( cfw_a,b,c,cfw_S,A,S,P : P : S aSb | A A aAc | ac ! 2 : ' ! a. L1=cfw_ w#wR# |w*, # 1 b. L2 = cfw_aibjaibj | i,j 0>c. L3=cfw_ ai bj ck dl |k>l>i>j ' ! 3 ) G = ( ,V,S,P +)(V +V *), (V 0 ) G = ( ,V,S,P
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
-: ' 1 1. ) (, 2. , 3. , 4. . ) G = ( cfw_a,b , cfw_S,A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,W,Y , S, P SA|Y ACW BbQ|Jb CKL|JQC D K L S MQ|a|b JQ| Ka|D Eb|F|G FbQ|QB|JB GE HI|F|JH|QG IH|b NM|ab Q WEFGHI Ybbb 2 . : )M = (cfw_a,b,cfw_q0
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 , : , 0a. L1 = cfw_an#b2n#c3n|n *0b. L2 = cfw_aib2i|i0cfw_bia2i|i *c. L3 =cfw_wwRw|w 0d. L4 = cfw_aib|i #,=cfw_a,b,c =cfw_a,b =cfw_a,b =cfw_a,b 2 , : " ) "( . 0a. L1 = cfw_aibjaibj|i,j 0b. L2 = cfw_aibiaj|i,j0cfw_aibjaj|i,j =cfw_a,b =cfw_a,b 3
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 . : 0 i. L1 = cfw_a2 | jj=cfw_a . : : *1,0cfw_w : 101w 2 , : 1 ), ( , - 1 . , P . PT .ii .i 3
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 : 1 L -0 -1 . 2 , L : 0 > L2 = cfw_ 0i1j0i+j1i-j | i,j 3 , L : A - = )L3 = cfw_ <A> | L(A 4 , L : G | >L4 = cfw_ <G 2 : A , - = )L = cfw_ < A > | L(A .iv .iii .i .ii 2 M1 , M : 1 M: >
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 . . . . L , . - L . . . . . : L , = )L = cfw_ <G> | L(G *1,0cfw_ G - L . 2
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 : ,cfw_A,G,I,J,K,J,K,J,K,J,I,J,I,K,H,J,H,K,H,K,I,H,I,G,I,G,H,C,H,E,H E,H,G,E,C,B,C,C,D,C,E,C,E,F,E,G,A,G,A,F,A,D,A,C,A,B,A 2. " , . , : , , ; . , .
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 2 1,2, . . ,V . ) (i,j - i>j - . i>j , , . ). O(V 3. . v2,.,vn
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
DFS: ' 2 -DFS DFS . ) O(V . ) , (u,v - DFS- v- u ) (u,v ) ( . , ). O(E+V 3 " . . ,
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
BFS: ' 2 - , - ) (. , s . BFS . s, BFS , . 3 " . s BFS " , - A B . SABCD 4.
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
": ' 1 - 0> w : d d . : d d. : , d " - ,s . : * u v " - s ) )( d(u)+w(u,v) > d(v * 0=) d(s - BFS) s DFS- s ( d " - . s
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
" : ' 1s.t 0 0 0000 0 " - s , . 2 ) PERT , (AND . " , PERT , OR " - s , . " ,
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 2 " , :2 2- 1 1 3 ) (u,v ) r(u,v ). w(u,v):= -log r(u,v - 1) 0r(u,v 0) . -log r(u,v . " - s- s=v0,v1,.,vk=t , t : )-log r(v0,v1)-log r(v1,v2)-.-log r(vk-1,vk ])-log [r(v0,v1) r(v1,v2). r(vk-1,vk ])log [r(v0,v1) r(v1,v2). r(vk-1,vk )r(v0,v1) r(v
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 2 0 , . u uin uout , u , uin - u - . uout , ) ( , - , sin , tout . 3 -, - p - - , s " - s .
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
" : ' 2)PATH(parents matrix P, vertex i, vertex j / Print vertices on path between i and jif p[i,j] NULL then )]PATH(P,i,p[i,j ]print p[i,j )PATH(P,p[i,j],j 3 ' ,u v i j- * , G , i~u v~j- . G ) O(V : )ADD-EDGE-TO-TRANSITIVE-CLOSURE(G*,u v 1. n .3 .4
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
": ' 2. " , - " ". : , . . , - , ". : , . . " , , . " ,
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 21. start s 1 M terminate- t 2 . M , . 2. , . 3 s , t s si ci tj t . dj , - s- t . 4s s .M - s- t s s
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
: ' 1 : , . . ab : , , ) (b,d) - (a,c 2/ . c/2 + d - ) (a,b- ) (c,d )2/ b/2 + mincfw_c/2 , d . ) (a,b .
Tel Aviv Uni. - ENGINEERIN - 50-22-43-2
HUFFMAN : ' 2. 0 = 2 n mod (-1) = 10 mod 2=. p . 1 = 3 n mod (-1) = 10 mod 4=. p 3. , B .D . , C,D 3 , - B 2 , - A 1 . . , - A . . , . 4 0 , 00 , - 100. - 1 - 10 - 000 , . - - 100 , 100 .