Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!
|
|
|
Study Smarter, Score Higher
Here are the top 5 related documents
...UNIVERSAL TORSORS AND COX RINGS
by
Brendan Hassett and Yuri Tschinkel
Abstract. We study the equations of universal torsors on rational surfaces.
Contents Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
...Connecting Rational Homotopy Type Singularities.
Robert Hardt and Tristan Rivi`re e October 20, 2005
Abstract : Let N be a compact simply connected smooth Riemannian manifold and p an arbitrary positive integer. For any map u from Rp+1 into N whose g...
...MATH 542 FALL 2008 HOMEWORK PROBLEM SET 1
These are due in class next Thursday 9/4. You may work together. Then write them up on your own. The rst two are exercises to get familiar with all of our new denitions. Try to be very rigorous with regard t...
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one
below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
5 Homework solutions 5.2.4 Since the trace is 4 and the determinant is 5, then the xed point is an unstable spiral (alternatively this follows because the eigenvalues are 2 + i and 2 i, since they are complex it spirals and since the real part is > 0 it is unstable). The phase portrait are spirals which head out of the origin spinning clockwise (to see that it is clockwise we can, for example, plot a few points on a single trajectory to get the shape, alternatively we can see that along the positive x-axis that y < 0 which tells us how we cross the positive x-axis). 5.2.5 Since the trace is 2 and the determinant is 1 then the xed point is a degenerate node (not a star because while we have repeated eigenvalues of 1, 1 we do not have a full set of eigenvectors). The only eigenvector is 2 and is indicated below (since our 1 eigenvalue is > 0 then it moves out). To get the behavior of the remaining part we can plot a few points along a solution (i.e., such as et 2t+1 ). The phase portrait is t shown below. 1 5.2.6 Since the trace is 5 and the determinant is 4 then the xed point is a stable node (alternatively since both eigenvalues are negative then solutions tend to the origin as t ). The fast eigenvector is 2 while the slow eigenvector is 1 . Using this 1 1 we have the following phase portrait. 5.2.7 Since the trace is 0 and the determinant is 9 then the xed point corresponds to a neutrally stable center (alternatively since the eigenvalues are 3i and 3i, since the real part is 0 there will be no exponential decay or growth and the solutions will be periodic). The phase portrait will consist of ellipses centered around the origin spinning clockwise (again to see that it spins clockwise we can plot a trajectory or again look at the positive x-axis and see that y < 0 which tells us how we cross that axis which will give us the direction). 2 5.2.8 Since the trace is 0 and the determinant is 1 then the xed point is a saddle (alternatively this follows since the eigenvalues are 1 and 1, i.e., real and di er in sign so that in one direction we move towards the origin and in another direction we move away from the origin). The eigenvector associated with 1 is 1 and the eigenvector 1 associated with 1 is 2 . This gives us the following phase portrait. 1 5.2.11 The matrix A= b 0 has characteristic polynomial (x )2 so that is the only eigenvalue of A and occurs as a repeated root. Looking for the eigenvectors we see that if x = x1 is an x2 eigenvector then (A I)x = 0, i.e., 0b 00 x1 x2 = 0 0 , which reduces to the condition that b x2 = 0 and since b = 0 we must conclude that x2 = 0. So we only have a one dimensional eigenspace and it consists of all vectors of the form x = x1 . 0 To solve the system we have the obvious solution x = ce t 1 . We now need to nd 0 a second solution. From a past homework assignment (i.e., see the solution to 5.2.5 from homework 4) we know that one candidate will be x = de t (t 1 + y) where y 0 is a vector satisfying (A I)y = 1 . One such y that will work (there are in fact 0 many) is 0 1/b . So we have that the general solution is x = ce t 1 t + de t . 0 1/b When it comes to sketching the phase portrait there are several possibilities depending on whether = , 0, + and b = , +. The key to all of them is noting that we know 3 explicitly what happens on the x-axis (i.e., the direction of the eigenvector) and then we just need to gure out how curves come into/out of the degenerate node, which can be done by plotting a few points/trajectories. The di erent possibilities are shown in the phase portraits below. * Consider the following system. 03 1 x = 4 1 1 x 2 7 5 We solve this using the same approach as 2 2 matrices, i.e., nd the eigenvalues and eigenvectors. The only di erence is that there is more bookkeeping involved. First to nd the eigenvalues we nd the characteristic polynomial, in this case x 3 1 1 det(xI A) = det 4 x 1 2 7 x + 5 = x(x 1)(x + 5) + 6 28 2(x 1) + 7x 12(x + 5) = x3 + 4x2 12x + 80. To solve a cubic we hope for the best in that there will be a nice solution (i.e., rational). For cubics with integer coe cients and a 1 in front of x3 then the possible nice roots are those which divide the constant term. In our case the candidates are 1, 2, 4, 5, 8, 10, 16, 20, 40, 80. We start going through these and nd that 4 is a root. Now using that we do some long division (i.e., divide x 4 into 4 x3 + 4x2 12x + 80) and discover x3 + 4x2 12x + 80 = (x 4)(x2 + 8x + 20). Finally to get the other roots we can use the quadratic equation so that the three roots are = 4, 4 2i, 4 + 2i. The next step is to nd the eigenvectors. For = 4 we are looking for a vector x so that (A 4I)x = 0, i.e., we want 0 4 3 1 x1 4 3 1 x2 = 0 . 0 2 7 9 x3 This is equivalent to the following three equations: 4x1 + 3x2 + x3 = 0 4x1 3x2 x3 = 0 2x1 + 7x2 9x3 = 0 If we now add twice the third equation to the rst equation (eliminating the x1 term) we have 17x2 17x3 = 0 showing that x2 = x3 . Putting this last relationship into any of the above equations we can conclude that x1 = x2 . So we have that the eigenvector in this case is 1 x = 1 . 1 For = 4 + 2i we are looking for a vector x so that (A ( 4 + 2i)I)x = 0, i.e., we want x1 4 2i 3 1 0 x2 = 0 . 4 5 2i 1 2 7 1 2i 0 x3 This is equivalent to the three following equations: (4 2i)x1 + 3x2 + x3 = 0 4x1 + (5 2i)x2 x3 = 0 2x1 + 7x2 + ( 1 2i)x3 = 0 If we now add the rst and second equation together (eliminating the x3 term) we have (8 2i)x1 + (8 2i)x2 = 0 showing that x2 = x1 . Putting this last relationship into any of the above equations we can conclude that x3 = ( 1 + 2i)x1 . So we have that the eigenvector in this case is 1 x = 1 . 1 + 2i 5 For = 4 2i we can repeat the above process or just use the fact that it will be the complex conjugate of the eigenvector we just found so that the eigenvector in this case is 1 x = 1 . 1 2i We now have that the general solution will be 1 1 1 x = c1 e4t 1 + c2 e( 4+2i)t 1 + c3 e( 4 2i)t 1 . 1 1 + 2i 1 2i However this solution is somewhat unsatisfying since it involves imaginary numbers. So we now work to rewrite it. One approach (a bit lengthy) is to do what we did in the previous homework (of course other approaches also work). Doing that we get the following: 1 1 c2 e( 4+2i)t 1 + c3 e( 4 2i)t 1 1 2i 1 + 2i c2 (cos(2t) + i sin(2t)) + c3 (cos(2t) i sin(2t)) c2 (cos(2t) + i sin(2t)) c3 (cos(2t) i sin(2t)) = e 4t c2 ( 1 + 2i)(cos(2t) + i sin(2t)) + c3 ( 1 2i)(cos(2t) i sin(2t)) (c2 + c3 ) cos(2t) + i(c2 c3 ) sin(2t) (c2 + c3 ) cos(2t) i(c2 c3 ) sin(2t) = e 4t (c2 + c3 )( cos(2t) 2 sin(2t)) + i(c2 c3 )(2 cos(2t) sin(2t)) cos(2t) sin(2t) +i(c2 c3 ) e 4t cos(2t) sin(2t) = (c2 + c3 ) e 4t cos(2t) 2 sin(2t) 2 cos(2t) sin(2t) =C2 =C3 So that we have that the general solution is 1 cos(2t) sin(2t) + C3 e 4t . cos(2t) sin(2t) x = C1 e4t 1 + C2 e 4t 1 cos(2t) 2 sin(2t) 2 cos(2t) sin(2t) To nd the particular solution we 1 0 = C1 0 need to nd C1 , C2 , C3 so that 1 1 0 + C2 1 + C3 0 . 1 1 1 2 6 In other words we need to have C1 + C2 =1 C1 C2 =0 C1 C2 + 2C3 = 0 Subtracting the second from the third shows that we need to have C3 = 0. Adding the rst two shows that 2C1 = 1 so that C1 = 1/2 and the second shows that C2 = C1 = 1/2. So we have that the particular solution is 1 cos(2t) 1 4t 1 4t 1 +e cos(2t) x= e 2 2 1 cos(2t) 2 sin(2t) 1 4t 1 4t cos(2t) 2e + 2e 1 4t 1 4t cos(2t) = . 2e 2e 1 4t 2e 1 2 e 4t cos(2t) e 4t sin(2t) Now consider the following system. 1 0 2 x = 0 1 2 x 2 2 0 First to nd the eigenvalues we nd the characteristic polynomial, in this case x 1 0 2 0 x+1 2 det(xI A) = det 2 2 x (x 1)(x + 1)x + 0 + 0 4(x + 1) 4(x 1) = x3 9x = x(x 3)(x + 3). So we have that the eigenvalues are = 3, 0, 3. The next step is to nd the eigenvectors. For = 3 we are looking for a vector x so that (A + 3I)x = 0, i.e., we want 4 0 2 x1 0 0 x2 = 0 . 2 2 2 2 3 x3 0 7 This is equivalent to the following three equations: 4x1 2x1 + 2x3 = 0 2x2 2x3 = 0 2x2 + 3x3 = 0 The second equation tells us that x2 = x3 while the rst equation tells us that x3 = 2x1 . So we have that the eigenvector in this case is 1 x = 2 . 2 For = 0 we are looking for a vector x so that Ax = 0, i.e., we want 1 0 2 x1 0 0 1 2 x2 = 0 . 2 2 0 0 x3 This is equivalent to the following three equations: x1 x2 2x1 2x2 + 2x3 = 0 2x3 = 0 =0 The rst equation tells us that x1 = 2x3 while the second equation tells us that x2 = 2x3 . So we have that the eigenvector in this case is 2 x = 2 . 1 For = 3 we are looking for a vector x so that (A 3I)x = 0, i.e., we want 2 0 2 x1 0 0 4 2 x2 = 0 . 2 2 3 x3 0 This is equivalent to the following three equations: 2x1 2x1 4x2 2x2 + 2x3 = 0 2x3 = 0 3x3 = 0 The rst equation tells us that x1 = x3 while the second equation tells us that x3 = 2x2 . So we have that the eigenvector in this case is 2 x = 1 . 2 8 We now have that the general solution will be 1 2 2 x = c1 e 3t 2 + c2 2 + c3 e3t 1 . 2 1 2 To nd the particular solution we need to nd c1 , c2 , c3 so that 1 1 2 2 0 = c1 2 + c2 2 + c3 1 0 2 1 2 In other words we need to have c1 2c2 2c3 = 1 2c1 2c2 + c3 = 0 2c1 + c2 2c3 = 0 If we now double the rst equation becomes c1 and add it to the second and third equations this 2c2 2c3 = 1 6c2 3c3 = 2 3c2 6c3 = 2 If we now multiply the second equation by 2 and add it to the third equation this becomes c1 2c2 2c3 = 1 6c2 3c3 = 2 9c2 = 2 It immediately follows that c2 = 2/9 substituting this into the second equation we see that c3 = 2/9 then substituting these values into the rst equation we see that c1 = 1/9. So we have that the particular solution is 1 2 2 1 3t 2 2 2 2 e3t 1 x= e 9 9 9 1 2 2 3t + 4 + 4e3t e 1 2e 3t + 4 2e3t . = 9 2e 3t 2 + 4e3t 9
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better,
faster and get an A in all your courses.
Below is a small sample set of documents:
Below is a small sample set of documents:
UCSD >> MATH >> 130a (Fall, 2008)
Homework 5 Due November 26 * 5.2.4, 5.2.5, 5.2.6, 5.2.7, 5.2.8 (the same problems as last time, but this time follow the books instructions: use Tr and Det to classify the xed point, and sketch the phase portrait.) * 5.2.11 * Solve each of the thre...
UCSD >> MATH >> 130a (Fall, 2008)
...
UCSD >> MATH >> 130a (Fall, 2008)
Homework 3 solutions 3.7.2 a) The graphs of r(x) = 2x3 (1 + x2 )2 and k(x) = 2x3 x2 1 are shown below. Note that since the derivatives of these functions are r (x) = 2x2 (3 x2 ) (1 + x2 )3 and k (x) = 2x2 (x2 3) (x2 1)2 respectively, it is simp...
UCSD >> MATH >> 130a (Fall, 2008)
Homework 6 solutions (1) (a) We have that the characteristic equation for the matrix is det 2 2 2 1 = (2 )(1 ) 4 = 2 6 = ( 3)( + 2), so that the eigenvalues are 3 and 2. To nd an eigenvector for 3 we can take a column of A + 2I, so 2 , and ...
UCSD >> MATH >> 130a (Fall, 2008)
Homework 0 solutions (1) We have the following using separation of variables: dy dx dy y2 dy y2 1 y = y 2 e3x = e3x dx = = e3x dx 1 3x e +C 3 1 1 3x 3e + C y= or e3x 3 +D Note: many people made mistakes in going between the last two lines. For i...
UCSD >> MATH >> 130a (Fall, 2008)
\"vdR~ SRR)RR\"mSRb0CmqR\"p0RpmhzR\"C\"RmrR\"mR G e QV Q f e \" YRm) euv\"mY\"hu\"vRSdY06v6\"lmom cPmciSmtV qt1PiAwS mXwhS mRvRmH mRpRR ...
UCSD >> MATH >> 130a (Fall, 2008)
x rp iF PUF x u IIYS GdGi ReGU V h @Wit GYdeqa gec h R V YGdYgW4YS 7 ddeYqdea P ci g P q s F D S i Fa V f R P S i U F S S V D u R F w ` X f U Pc S Xa P R a V g UqGG~GYydGYeq)GeYGkpeeGdU hqc x GdGY` QG~dGGddqgGhF Pc U X F D S U F D S S Uc P ...
UCSD >> MATH >> 130a (Fall, 2008)
( o Dh e B P ` f Dh T Rh r e P e B P ` f P x x P f D UuViUisQg\"UaQVY 8!yw QVQP \' 84UVUgQ88g!QVUQVige e P e B P ` f D h e B e P e B P ` f D w $ Qn\"UuVil\"gQn\"UuVih !% u V%c V\"c ug\"Uu ...
UCSD >> MATH >> 130a (Fall, 2008)
r tuqu ptp u hq y w u u t r yqp u i y V nrveXkw Pksso kvr1XkfkBpi tuqu ptp ju u hq y p p qp hq fp p y u u y vvr~evkl1BrRqrva~iy r1vnnlk8hf r kvq ut t i t y p hu yq u hq y u p h ut q u yt u y tuqu ptp u hq vr3pg#gk1vknve1evr...
UCSD >> MATH >> 130a (Fall, 2008)
Ve i ere V S S q T b T i S X br ` g d t i S X br ` S j b b T X V b V de T d b YsyYssY4cpYfyzUfhc&YUfsUWlkyYYvsylc` T V T X S i b T X S b ` i S j S d Vr V g d S S q T T t q T d be T `e g t i T d b ` T d S i t t d t b Xr t S T b xUyFymcciUlUYY...
UCSD >> MATH >> 130a (Fall, 2008)
D!@ j!9nD!5y lDunpjD! mD!pD!2urDY mDnHnD!Pjr}DYv!9iD!pmD Hpim&lD!cDHjxj}DYpjD!D!pmDcDxp! ...
UCSD >> MATH >> 130a (Fall, 2008)
p p y s t y p wp y s vt s i df d \'ec n E P 9 D 9 3 E 35 D 25 D E D P5 E 9 f i f d 9 n P E C 9 3 X 05 o 9 @ n 9 D S 0 P @ 0S E 2 0 j E5 a)w4bx6x84b8a`b88Q gec 8`|`A48IAb44bTb`y47 @ 0 7 9 n X 0 2 X 9 D 0 D D P @ 0S 3 2 E @ D D E D 3...
UCSD >> MATH >> 130a (Fall, 2008)
Sb iuour s uoApsur suwovY w FuoAh )uxsif x b d tf x t r x b x f t t b x b b d x f f f f v d x spsis ouxfA t x tf x h t t i uspui1ih if # #Y # }sS6ssux b brb f b b s9 6oA6h iupfspybF ues2uxd # ms ...
UCSD >> MATH >> 130a (Fall, 2008)
u D5 W#o } {IdItry\'U{Feq)qGx } I{Ferj7)HdeF(s5yeFEre d TX u p a S t x V tX x a i S a d T SX u Y p p o a d T a a S q pX T t x yX T S R 4 a m p S S a X R a TX a TX q y qX a t S m R S a d T a S R t x a o a a p sFi)eH1FFesFIdy\'dybyGcu ...
UCSD >> MATH >> 130a (Fall, 2008)
i 4p i 4p s 2r c c i f gf d dhec E Q G B T a B Rg EG V T DG T w R Q T bnokCHy WxhFWFhW9bHlD i p s 79 i 4p s 2r r i p s 79r c r c c i f gf d nhec r RBTpw TQ SQ u s 7 U9Wv9eg FDhWw9bHTlhQFWTYl fPfec hGThh9bFhvFbvH...
UCSD >> MATH >> 130a (Fall, 2008)
( ( x b W u x b W q w n u u q ( u q ( Y Q t n w y o) )g a y w w6ya ar# Q d Q t h y u q xu q Y b t s P q aigk vaCr% r8 r 8 eguSa|yayamyiXaugcCsSi w F b t F t u v q Q Y Q u p Q v b vW Q d Q t F k F bT Y ...
UCSD >> MATH >> 130a (Fall, 2008)
C u q y C i U C U G Ed ud E q E Gd Q u q C q G E R q bd G i G y R E q Ed ud d f i C U G G q U G E i i 44rYmYPhx4ht4r74&rP4WSH4rrP4r7Por\'p Gd C f i C SSe4eU PkD4Pv\'7r1d F7Pm5r\'14esrPD i fp Q u q u id G b u Ip i u I y qd q E G q U G E ...
UCSD >> MATH >> 130a (Fall, 2008)
gq3ewh3u5pegd d j h c c b j iv c h i x c s b d f d j h f j x j s b d f xv h j xv i x bv d jvr v dr s h f d b r s b f i s b h v d h f s b c h h i hr b c twqi 5wgww5pUwv p@b t&3g rr x b xv d c d...
UCSD >> MATH >> 130a (Fall, 2008)
a A 9 k V7 C S V k G E C W t d q u r q lX)FXiBFmXV o }t u o u i o h BS o hwt u Xi o a G 97 V V WUU W G V7 E Q G { G W RB)X4@)p8)BFC ~ ipRh h h d G d 7 ~ B@F)F6XPBFhTohFphFB V 9 W7 C YU W V G Q S V k Y H G...
UCSD >> MATH >> 130a (Fall, 2008)
Q U E Q T g d Q T b P U A P C H d E Y d g Y C i Y d U G Y d C a TP C s d uFVViRVVlDme`8iFVu8RQ G 58ig x G p #x G p Vuu8 7 x G p 88n 0p x iPY y x s sq ftvutrp nYC QC g d Q UEPYC Q d H C U x QC 8`FVk7d `uFVkRoFVQ us kV x G h...
UCSD >> MATH >> 130a (Fall, 2008)
@Vw4m@5@HE1sHVGHFd4d k ve 5YH4rVaY5yfwyHr5RY G w Gs G C E C w y m o l s G l y s y E l G E s y YHoPH5yHY4r5Y4sH\"5wE k H5G fHY5f@5w k H o o y o o y y w w e w w G y o G G o y w w e k wThG d k ve k He ...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 7 solutions 7.5.3 We have x + k(x2 4)x + x = 1 with k 1. This is very similar to the van der Pol equation and so we will mimic the analysis done for that. First we parametrize by letting F (x) = 1 x3 4x so that if we let w = x+kF (x), the...
UCSD >> MATH >> 130b (Winter, 2008)
Math 130B Prof. Rabin Homework Assignment 6 due February 19, 2008 (1) Consider the system (a chemical reaction model) x = (1/8) x + x2 y, y = (1/2) x2 y. Show that the set {(x, y) : x 1/16, 0 y 128, x + y 130} is positively invariant and ...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 2 solutions 6.6.1 To check if the system is reversible we replace y and x by y and x respectively (i.e., replace t by t and y by y, note that y thus becomes ()()y = y); if it reduces to what we started with then it is reversible. For ou...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 1 solutions 6.4.1 The xed points will occur when x = 0 and y = 0. So at the xed point we have that [either x = 0 or x + y = 3] and [either y = 0 or x + y = 2]. This leads to four possible combinations x = 0, y = 0 gives (x , y ) = (0, 0);...
UCSD >> MATH >> 130b (Winter, 2008)
Solutions to Midterm 1 By H akan Nordgren As always, the sketches are all in a separate pdf. Problem 1: Consider the non-linear system x y = x2 + y = xy 1. Locate the equilibrium points and use linearisation to determine their type. 2. Draw the null...
UCSD >> MATH >> 130b (Winter, 2008)
Solutions to Homework 8 By H akan Nordgren Problem 12.1: Draw the phase-portrait of the following system. x = y x2 y = x. Solution: The x-nullcline is the curve C1 = {(x, y) R2 : y = x2 }, and the y-nullcline is the curve C2 = {(x, y) R2 : x = ...
UCSD >> MATH >> 130b (Winter, 2008)
Solutions to Homework 5 By H akan Nordgren REMARK: I am still into x notation. Also, please note that these solutions are not complete. If you have any suggestions about how to make them more solid, please feel free to email me. Problem 10.4: Consid...
UCSD >> MATH >> 130b (Winter, 2008)
e ex w 699yrtgqvPqq g3gvyss9Pfq vt\"r)7d r s f r s sf s r s r r s r sr p h |cx z h t t io z k w i h t Aw io t gh57nX!d l t k w i h t Aw ygh57nX!d vw i H t yh!xX t T!d w n wt n hd w t no h d lk h w dh n h d kwi h w d io 57nXu...
UCSD >> MATH >> 130b (Winter, 2008)
a P } tf 7 3 } h fd ` YX V Qyi%e3W H vpH )h I d T h U$%$#d R r Y P x \" 9S Ig0g QYyY0e T H G P E 1 5 5 7 Y D ch I G0 ! 0ce x Y u Y D6 x p H d F D H t9ku\"!tpB@re\"cu...
UCSD >> MATH >> 130b (Winter, 2008)
e Xv}H}HvAo}v}H{5oASxS6}!dScx! k k G e e c}6oA}AAv}fvAo}vmSruS6SP}XvxI8}\"Pvh}Ao96fv} e ...
UCSD >> MATH >> 130b (Winter, 2008)
e TxE8#E8u io xE8} oiFzF!jaF` j l l `!oiiixvxioGx e e wF!FATu 9IAu tioS!vx e `kiF8 t!ioC!xx!x f !F!xu T`kiFiAu FFQxF5 ...
UCSD >> MATH >> 130b (Winter, 2008)
! h p U Vb V ab h Vb h U h V ` P2wdHdYdqqY0x v u P!6 6gng0ymd0wu v Pgd d ck 4n02YH!Ha ` b r e p u x a b x d k p h p X V ` t t p e p u Vb g0Dd0x v qq!iq6H02sP2p u P vP Pk P! H6md0wu x h u p t r e Ub h ` p X ` h p U u V ` ...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 5 solutions 7.3.1 1 a) The Jacobian at the origin is 1 1 , which has a characteristic equation 2 1 2 + 2. So the eigenvalues are 1 + i and 1 i which would make this point an unstable spiral. b) We have rr = xx + y y = x x y x(x2 + 5y 2 ...
UCSD >> MATH >> 130b (Winter, 2008)
2 vertices 1, 2 3 vertices 1, 3 3 vertices 2, 3 4 vertices 1, 4 4 vertices 3, 4 4 vertices 2, 3 5 vertices 1, 5 1.5 1.5 1.75 1.80902 1.75 1.80902 1.80902 1.5 0.690983 1 1 0 0 0 0 1.25 0.690983 1.25 1.5 1 0.690983 0.5 0 0 0 5 ver...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
Using discrepancy to control singular values for nonnegative matrices Steve Butler Abstract We will consider two parameters which can be associated with a nonnegative matrix: the second largest singular value of the normalized matrix, and the discre...
UCSD >> MATH >> 130b (Winter, 2008)
A property of positive semidenite matrices Steve Butler Recall that a matrix S is positive denite if for all x = 0 x Sx > 0 and positive semidenite if x Sx 0. For symmetric matrices being positive denite is equivalent to having all eigenvalues posi...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 5 Due November 26 * 5.2.4, 5.2.5, 5.2.6, 5.2.7, 5.2.8 (the same problems as last time, but this time follow the books instructions: use Tr and Det to classify the xed point, and sketch the phase portrait.) * 5.2.11 * Solve each of the thre...
UCSD >> MATH >> 130b (Winter, 2008)
Student comments Math 10A, Winter 2007 The following are the student comments about my teaching from CAPE (Course And Professor Evaluation) forms for the Math 10A (beginning calculus) course I taught in Winter 2007 at UC San Diego. These comments ar...
UCSD >> MATH >> 130b (Winter, 2008)
Jumping Sequences Steve Butler Ron Graham Nan Zang Abstract An integer sequence a(n) is called a jump sequence if a(1) = 1 and 1 a(n) < n for n 2. Such a sequence has the property that ak (n) = a(a( (a(n) ) goes to 1 in nitely many steps and ...
UCSD >> MATH >> 130b (Winter, 2008)
Midterm 1 solutions (1) Consider the dierential equation x = x4 . (a) If we specify the value of x(0), is the solution unique? How do you know? Solution: Since f (x) = x4 and f (x) = 4x3 are continuous in some interval around 0 then the existence an...
UCSD >> MATH >> 130b (Winter, 2008)
Generalizing some results to the normalized Laplacian Steve Butler September 6, 2006 1 Introduction Our graph terminology is standard, any undened terms can be found in standard graph theory texts, such as West [9]. We assume that our graphs are s...
UCSD >> MATH >> 130b (Winter, 2008)
Anti-covers of double edge coverings of graphs Steve Butler May 5, 2007 1 Introduction Spectral graph theory looks at the connections between the structure of a graph and the eigenvalues of various matrices associated with the graph. By examining ...
UCSD >> MATH >> 130b (Winter, 2008)
Tangent Line Transformations Steven Butler Steven Butler (butler@math.byu.edu) graduated from Brigham Young University with bachelors degrees in mathematics and economics in 2001. He is currently nishing his Masters degree in mathematics at BYU and ...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 4 solutions 5.2.1 a) Starting with x = 4x y and y = 2x + y we have x= x y = 4x y 2x + y = 4 1 21 =A x y = Ax. The characteristic polynomial is then given by det(A I) = det 4 1 2 1 = (4 )(1 ) (2)(1) = 2 5 + 6. The eigenvalue...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
TANGENT LINE TRANSFORMATIONS: OR THERE AND BACK AGAIN STEVEN K. BUTLER Introduction In the rst semester of Calculus students learn to take a curve and nd all of the curves tangent lines. Now consider the converse problem, if given all of the curves ...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 4 Due February 5 * 7.2.12, 7.2.13 (all parameters are positive), 7.2.14, 7.2.15, 7.2.17. * Show that the Jacobian matrix for a 2d gradient system is symmetric. Show that a 22 real symmetric matrix has real eigenvalues. Therefore, no xed poi...
UCSD >> MATH >> 130b (Winter, 2008)
Student name: Student PID: MATH 10A (Butler) Midterm 2, 5 March 2007 This test is closed book and closed notes, with the exception that you are allowed one 8 1 11 page of handwritten notes. You may use any shortcuts for derivatives 2 unless explicitl...
UCSD >> MATH >> 130b (Winter, 2008)
Hat Guessing Games Steven Butler Mohammad T. Hajiaghayi Tom Leighton Robert D. Kleinberg Abstract Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the ha...
UCSD >> MATH >> 130b (Winter, 2008)
Lecture notes from IPCO Summer School 2005 Fast Randomized Algorithms for Partitioning, Sparsication, and Solving Linear Systems Daniel A. Spielman Contents 1 Disclaimer 2 Overview 3 Solving Linear Systems 3.1 3.2 3.3 Direct Methods . . . . . . . . ...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 3 solutions 3.7.2 a) The graphs of r(x) = 2x3 (1 + x2 )2 and k(x) = 2x3 x2 1 are shown below. Note that since the derivatives of these functions are r (x) = 2x2 (3 x2 ) (1 + x2 )3 and k (x) = 2x2 (x2 3) (x2 1)2 respectively, it is simp...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 6 solutions (1) (a) We have that the characteristic equation for the matrix is det 2 2 2 1 = (2 )(1 ) 4 = 2 6 = ( 3)( + 2), so that the eigenvalues are 3 and 2. To nd an eigenvector for 3 we can take a column of A + 2I, so 2 , and ...
UCSD >> MATH >> 130b (Winter, 2008)
BOUNDING THE NUMBER OF GRAPHS CONTAINING VERY LONG INDUCED PATHS by Steven Kay Butler A thesis submitted to the faculty of Brigham Young University in partial fulllment of the requirements for the degree of Master of Science Department of Mathema...
UCSD >> MATH >> 130b (Winter, 2008)
Homework 8 solutions 7.6.19 a) By setting = t we have that x= d2 (x) d2 (x) d2 (x) = 2 = 2x . = d(t2 ) d( /)2 d( )2 So the Dung equation x + x + x3 = 0 becomes 2 x + x + x3 = 0. b) We let x(, ) = x0 ( ) + x1 ( ) + 2 x2 ( ) + O(3 ) and = 1 + 1 +...
UCSD >> MATH >> 130b (Winter, 2008)
The Clique Number of the Graph of Pairwise Sums and Products is 3 or 4 Jacob Fox, Yeu-Whai Kathy Lin, and Matthew Thibault licht@mit.edu, ykl@mit.edu, matt tbo@mit.edu Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 0213...
UCSD >> MATH >> 130b (Winter, 2008)
Math 130A Prof. Rabin Homework #0 due October 4, 2007 These problems will help you review some concepts from Math 20D and 20F. They will not be graded, but you should be prepared to discuss them at the rst section meeting. (1) Solve by separation ...
UCSD >> MATH >> 130b (Winter, 2008)
UNIVERSITY OF CALIFORNIA, SAN DIEGO Eigenvalues and Structures of Graphs A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Steven Kay Butler Committee in charge: Professor Prof...
UCSD >> MATH >> 130b (Winter, 2008)
Midterm 2 solutions (1) Consider the system x = x2 y, where a is a real parameter. (a) For what critical value a = ac does a bifurcation occur? Solution: Looking for bifurcations we can rst look for xed points. This will occur when x2 y = 0 and x ...
UCSD >> MATH >> 130b (Winter, 2008)
Spectral graph theory: Three common spectra Steve Butler September 2006 Abstract In this rst talk we will introduce three of the most commonly used types of matrices in spectral graph theory. They are the adjacency matrix, the combinatorial Laplacia...
UCSD >> MATH >> 130b (Winter, 2008)
Teaching Statement Steven Kay Butler Teaching requires a balancing between giving students enough knowledge and interest so that they have the abilities and interest to learn the material but not losing them in minutiae by trying to explain too much ...
UCSD >> MATH >> 130b (Winter, 2008)
A new discrepancy denition for hypergraphs Steve Butler 1 Discrepancy on simple graphs For an undirected graph we let A denote the adjacency matrix (i.e., given vertices u and v we have that Auv = 1 if u and v are adjacent and 0 otherwise), and D ...
UCSD >> MATH >> 130b (Winter, 2008)
...
UCSD >> MATH >> 130b (Winter, 2008)
Student name: Student PID: MATH 10A (Butler) Midterm I, 29 January 2007 This test is closed book and closed notes, with the exception that you are allowed 1 one 8 2 11 page of handwritten notes. No calculator is allowed for this test. When answering ...
What are you waiting for?