Application of Jordan Canonical Form
|
|
- Alfred Stanley
- 5 years ago
- Views:
Transcription
1 CHAPTER 6 Applicatio of Jorda Caoical Form Notatios R is the set of real umbers C is the set of complex umbers Q is the set of ratioal umbers Z is the set of itegers N is the set of o-egative itegers Z + is the set of positive itegers Re(z, Im(z, z ad z are the real part, imagiary part, cojugate ad modulus of a complex umber z M m (F is the set of m matrices with etries i F F(x is the set of polyomials i x with coefficiets i x Row(A, Col(A ad Nul(A are the row, colum ad ull spaces of a matrix A, respectively rak(a is the rak of a matrix A I [ e e 2 e ] isthe idetitymatrix,wheree,e 2,,e are the colum vectors of I K(T, R(T ad rak(t are the kerel, rage ad rak of a liear trasformatio T gcd(f (x,f 2 (x,,f m (x is the greatest commo divisor of polyomials f (x,f 2 (x,,f m (x lcm(f (x,f 2 (x,,f m (x is the least commo multiple of polyomials f (x,f 2 (x,,f m (x Computatio of A I may applicatios, we eed to compute the -th power of a give square matrix A (cf [P] Here by computig A, we mea to give a closed formula for A that depeds oly o for a give A Our mai tools are Jorda Caoical Form ad characteristic/miimal polyomials There are essetially two approaches to the problem The first method uses directly the JCF of A For every complex square matrix A There exists a ivertible matrix P such that P AP J is a Jorda matrix The A PJP ad (6 A PJ P 97
2 98 6 APPLICATION OF JORDAN CANONICAL FORM It suffices to figure out the -th power of a Jorda matrix, which comes dow to computig the -th power of the Jorda block J λ,m : ( Jλ,m (λi +J 0,m λ k J0,m k k k0 m ( (62 λ k J0,m k k k0 ( ( ( λ I + λ J 0,m ++ λ m+ J0,m m 0 m by Biomial Theorem, sice J0,m k 0 for k m If we use the otatio E ij for the m m matrix with at i-th row ad j-th colum ad 0 everywhere else, the (63 J 0,m E 2 +E E m,m m i J k 0,m E,k+ +E 2,k+2 + +E m k,m m Jλ,m k0 m k0 ( λ k J0,m k k m k i m k0 ( k ( λ k E i,i+k k i j m E i,i+ m k i E i,i+k ( m k λ k E i,i+k i ( j i λ +i j E ij So Jλ,m is a upper triagular matrix whose etry at i-th row ad j-th colum is ( j i λ +i j for i j That is, ( ( 0 λ ( λ ( 2 λ 2 m λ m+ ( ( (64 Jλ,m 0 λ ( λ m 2 λ m+2 ( ( 0 λ λ λ For example, (65 J λ,2 [ λ λ] [( 0 λ ( ( 0 Example 6 Let us compute A for [ ] 8 4 (66 A 9 4 ( 0 ] [ λ λ λ λ ] λ The characteristic polyomial of A is (x 2 2 ad { (67 dimnul(a 2I k : k 0,,2, } {0,,2,2,}
3 COMPUTATION OF A 99 So the Youg tableau of A is give i Figure 7 It suffices to choose a vector v Nul(A 2I ad the [ (68 P 2 AP J 2,2 for P 2] [ (A 2Iv v ] We may choose v e The [ ] 6 P 9 0 (69 A PJ 2,2 P ad [ ] [ A PJ2,2P ][ [ ][ 6 2 (2 ][ ] [ (3+2 (2 + ] 9(2 ( 32 A equivalet way to compute A is to compute A v by decomposig v to a sum of geeralized eigevectors of A The colum vectors of the ivertible matrix P i (6 form a basis B of C which is a disjoit uio (60 B B B 2 B l of cycles of geeralized eigevectors Suppose that each B i is geerated by the vector v i correspodig to eigevalue λ i ad B i m i To compute A v, it suffices to write v as a liear combiatio of B: ] (6 l v c ij (A λ i I j v i i j0 l A v A c ij (A λ i I j v i i j0 where we may take j from 0 to for simplicity sice (A λ i I j v i 0 for j m i The term A (A λ i I j v i ca be computed by expadig A as (62 ( A (λ i I +(A λ i I λi k (A λ i I k k k0 ( λ k i (A λ i I k k k0
4 00 6 APPLICATION OF JORDAN CANONICAL FORM Therefore, (63 A v l A c ij (A λ i I j v i i i j0 ( l ( k l k0 i j,k 0 c ij λ k i λ k i (A λ i I k c ij (A λ i I j v i j0 ( (A λ i I j+k v i k Lettig j +k a ad k a j, we ca rewrite (63 as (64 A v l i j,k 0 i a0 c ij λ k i l a l i m i a0 j0 a j0 ( (A λ i I j+k v i k ( c ij λ +j a i (A λ i I a v i a j ( c ij λ +j a i (A λ i I a v i a j sice (A λ i I a v i 0 for a m i So we may use (64 to compute A v for all v To compute A itself, we observe that (65 A A I A [ e e 2 e m ] [ A e A e 2 A e m ] ad apply the above algorithm to each A e i Example 62 Let us redo Example 6 by computig A e i via writig e i as a liear combiatio of B {(A 2Iv,v}, where we choose v e The (66 e e e [ + 0] [ 6 9 9] 2 3 e + 9 (A 2Ie
5 COMPUTATION OF A 0 ad hece A e A e (2I +(A 2I e ( 2 k (A 2I k e k k0 ( 2 k (A 2I k e 2 e +(2 (A 2Ie k k0 [ ] [ [ ] 2 +(2 0 6 (3+2 9] 9(2 A e 2 A ( 2 3 e + 9 (A 2Ie (67 (2I +(A 2I ( 2 3 e + 9 (A 2Ie ( ( ( 2 k (A 2I k 2 k 3 e + 9 (A 2Ie k0 ( 2 I +(2 (A 2I ( 2 3 e + 9 (A 2Ie ( e + 9 (2 (A 2Ie 3 Therefore, 2+ 3 [ 0] + ( 2 9 (2 3 [ 6 9] [ (2 + ] ( 32 (68 A [ [ A e A ] (3+2 (2 e + ] 2 9(2 ( 32 The mai complexity of the above algorithm of computig A via JCF lies i the fidig of the ivertible matrix P, which is a time-cosumig process Our secodmethodsidesteps thewholeissue ofp, butit itroduces its ow complexity The mai idea is that if we have a ozero polyomial f(x such that f(a 0, we ca divide x by f(x to obtai (69 x q(xf(x+r(x where q(x ad r(x is the quotiet ad remaider of the divisio of x by f(x such that degr(x < degf(x; the (620 A q(af(a+r(a r(a sice f(a 0 Of course, q(x is irrelevat here The key of the above approach is the determiatio of the polyomial r(x We may take f(x to be ay ozero polyomial satisfyig f(a 0, ie, ay ozero polyomial that is divisible by the miimal polyomial of
6 02 6 APPLICATION OF JORDAN CANONICAL FORM A But the lesser the degree of f(x, the better the above algorithm works IfthemiimalpolyomialofAiskow, wetakef(xtobethemiimalpolyomial Otherwise, we usually take f(x to be the characteristic polyomial of A by Cayley-Hamilto To determie r(x, we write (69 as (62 x r(x q(x+ f(x f(x Let f(x (x λ d (x λ 2 d 2 (x λ m dm We may write r(x/f(x as partial fractios: (622 x r(x q(x+ f(x f(x q(x+ m d i i j c ij (x λ i j for some umbers c ij To determie c ij for each i, we multiply both sides of (622 by (x λ i d i ad take derivatives at λ i of order k 0,,,d i i sequece: ( x (x λ i d i (k (k d i (623 f(x λi j c ij (x λ i d i j λi where (624 h i (x q(x+ l i + ( h i (x(x λ i d i (k λi d l j Sice h i (x is C at λ i, it is easy to see that c lj (x λ l j (625 ( hi (x(x λ i d i (k λi 0 for all k < d i So ( x (x λ i d i (k (626 f(x λi (k d i c ij (x λ i d i j j λi (k!c i,di k for k 0,,,d i ad hece ( x (x λ i d i (627 c ij (d i j! f(x (di j λi I complex aalysis, c ij is the residue of the meromorphic fuctio (628 z (z λ i j f(z
7 at z λ i COMPUTATION OF A 03 Example 63 For example, suppose that f(x (x 2 (x 2 3 ad we write x (x (629 2 (x 2 3 q(x+ c x + c 2 (x 2 + c 2 x 2 + c 22 (x c 23 (x 2 3 To determie c ad c 2, we multiply both sides of (629 by (x 2 ad take derivatives at of order k 0,: ( x (k (x 2 3 ( (k x c (x +c 2 x (630 + ( h (x(x 2 (k x }{{} 0 where (63 h (x q(x+ c 2 x 2 + c 22 (x c 23 (x 2 3 So for k 0,, we obtai ( x 3 c 2 (x 2 x (632 ( x c (x 2 x 3 3 To determie c 2, c 22 ad c 23, we multiply both sides of (629 by (x 2 3 ad take derivatives at 2 of order k 0,,2: where ( x (k (x 2 ( c 2 (x 2 2 (k x2 +c 22 (x 2+c 23 x2 (633 + ( h 2 (x(x 2 3 (k x2 }{{} 0 where (634 h 2 (x q(x+ c x + c 2 (x 2 So for k 0,,2, we obtai ( x 2 c 23 2 (x x2 ( x (635 c 22 (x x2 2 ( 42 c 2 ( x 2 (x x2 2 (
8 04 6 APPLICATION OF JORDAN CANONICAL FORM Therefore, (636 ad hece (637 If f(a 0, the (638 x +3 (x 2 q(x (x 2 3 x (x 2 + ( x 2 + ( 42 2 (x (x 2 3 x q(xf(x (+3(x (x 2 3 (x 2 3 +( (x 2 (x 2 2 +( 42 (x 2 (x 2+2 (x 2 A (+3(A I(A 2I 3 (A 2I 3 +( (A I 2 (A 2I 2 +( 42 (A I 2 (A 2I+2 (A I 2 Example 64 Let us redo Example 6 usig the characteristic polyomial of A Let f(x det(xi A (x 2 2 ad let (639 for some umbers c ad c 2 The x (x 2 2 q(x+ c x 2 + c 2 (x 2 2 (640 c (x x2 (2 ad c 2 x x2 2 Therefore, (64 x q(xf(x+(2 (x 2+2 A (2 (A 2I+2 I (2 A+( 2 I [ ] [ ] ( ( [ (3+2 (2 + ] 9(2 ( 32 Example 65 Let us compute A for (642 A Let f(x det(xi A (x 2 (x 4 ad let (643 x (x 2 (x 4 q(x+ a x + a 2 (x 2 + b x 4
9 COMPUTATION OF A 05 for some umbers a,a 2 ad b The ( x a x 4 (644 x 3 ( x 9, a 2 x 4 x 3 ad ( x 2 b (x x4 4 9 Therefore, ( x q(xf(x ( A ( Actually, A is diagoalizable sice (x (x 4 3 (x (x 2 (A I(A 4I 3 (A 4I+ 4 9 (A I2 (646 dimnul(a I+dimNul(A 4I 2+ 3 ad the miimal polyomial of A is (x (x 4 So we may choose f(x (x (x 4 ad the above computatio ca be simplified: (647 ad hece (648 x (x (x 4 q(x+ a x + b x 4 q(x 3(x + 4 3(x 4 x q(xf(x 3 (x (x A 3 (A 4I+ 4 3 (A I As a applicatio of computatio of A, we study liear recurrece A liear recurrece is a sequece {a 0,a,,} satisfyig the coditio (649 a +l c a +l +c 2 a +l 2 ++c l a +b 2
10 06 6 APPLICATION OF JORDAN CANONICAL FORM forall, wherel,c,c 2,,c l,barecostats Ifb 0, itishomogeeous If b 0, it is o-homogeeous For example, a geometric sequece/progressio is a homogeeous liear recurrece give by (650 a + ra ad a arithmetic sequece/progressio is a o-homogeeous liear recurrece give by (65 a + a +b The most famous liear recurrece (other tha geometric/arithmetic is the Fiboacci sequece (652 a +2 a + +a (653 Solvig a liear recurrece ivolves fidig a closed formula for a To solve (649 for b 0, we write a +l c a +l +c 2 a +l 2 ++c l a a +l a +l a +l 2 a +l 2 a + a + Let us put both sides of (653 i the matrix form: c a c 2 c l c l +l a +l ( a + }{{} u + } {{ } A a +l a +l 2 a }{{} u This turs the liear recurrece (649 ito a geometric sequece {u } of vectors (655 u + Au for u i C l Obviously, a +l a +l 2 a (656 u Au A 2 u 2 A u 0 for u 0 a l a l 2 So it comes dow to the computatio of A with A give i (654 a 0
11 COMPUTATION OF A 07 Whe b 0, it suffices to add oe more compoet to the vectors u : c a c 2 c l c l b +l a +l a +l a +l 2 (657 a a }{{} }{{} u + }{{} u A The (658 u A u 0 for u 0 a l a l 2 The characteristic polyomial of A for b 0 ca be computed by expadig the determiat of xi A by the first row: (659 x c c 2 c l c l x 0 0 det(xi A det x a 0 x x (x c det ( c 2det x x x + +( l+2 ( c l det x x l c x l c 2 x l 2 c l x x x Similarly, we ca compute the characteristic polyomial of A for b 0: (660 det(xi A (x l c x l c 2 x l 2 c l (x where A is give i (657
12 08 6 APPLICATION OF JORDAN CANONICAL FORM Regardless of b 0 or b 0, we eed to compute A for the correspodig A Note that we are oly iterested i the compoet a i u so we oly eed to kow the l-th row of A Let J P AP be the JCF of A for some ivertible matrix P The (66 u A u 0 PJ P u 0 which is (662 if b 0 ad (663 a +l a +l 2 a a +l a +l 2 a PJ P PJ P a l a l 2 a 0 a l a l 2 if b 0, where a 0,a,,a l are the first l terms of the sequece which are usually give For every Jorda block J 0,m, J0,m is give by (64 We observe that the etries of J0,m, as fuctios of, are i the vector space of { ( ( } Spa λ, λ,, λ m+ m (664 {( } Spa λ k : k 0,,2,,m k For each k, ( k is a polyomial i of degree k, ie, ( ( ( k + { (665 Spa,, 2,, k} k k! Therefore, the space (664 is the same as { ( ( } Spa λ, λ,, λ m+ m (666 Spa { λ,λ,, m λ } { } Spa k λ : k 0,,2,,m which cotais all the etries of J λ,m Suppose that (667 det(xi A (x λ d (x λ 2 d 2 (x λ m dm a 0
13 COMPUTATION OF A 09 with λ,λ 2,,λ m distict Every Jorda block of J is i the form of J λi,a for some a d i So the etries of J, as fuctios of, are i the space { Spa λ,λ,, d λ, (668 λ 2,λ 2,, d2 λ 2, λ m,λ m,, dm λ m } Clearly, the etries of PJ P are also i the above space sice P is a costat matrix It follows that a lies i (668, ie, (669 a m i d i j0 c ij j λ i for some c ij C These c ij ca be determied the by the values of a 0,a,,a l I summary, we ca solve a liear recurrece i the followig steps: ( Determie the characteristic polyomial of the recurrece give by (659 or 660 (2 Fid all the roots of the characteristic polyomial as i (667 (3 Write a as a liear combiatio of the fuctios (670 λ,λ,, d λ, λ 2,λ 2,, d 2 λ 2, λ m,λ m,, dm λ m as (669 (4 Determie the coefficiets c ij of this liear combiatio (669 by settig 0,,,l Alteratively, we may compute a by computig A directly usig its characteristic polyomial Example 66 Let us solve the Fiboacci sequece {a : 0,,} give by a +2 a + +a for 0, a 0 0 ad a We ca write (67 It follows that (672 { a+2 a + +a a + a + [ ] a+ a [ ] a+2 a + }{{} u + [ ] [ a [ ][ ] a+ a }{{}}{{} A u a 0 ]
14 0 6 APPLICATION OF JORDAN CANONICAL FORM The characteristic polyomial of the recurrece is (673 det(xi A x 2 x (x λ (x λ 2 for λ ad λ So a, as a fuctio of, lies i the space spaed by λ ad λ 2 Therefore, ( (674 a c λ +c 2 λ + ( c +c for some costats c ad c 2 Settig 0,, we have { c +c 2 0 c 5 (675 λ c +λ 2 c 2 c 2 5 ad hece ( (676 a 5 + ( Alteratively, we may compute A directly via its characteristic polyomial f(x x 2 x That is, we write (677 x f(x q(x+ b x λ + b 2 x λ 2 for some polyomial q(x ad some costats b ad b 2 The (678 b x x λ 2 λ ad b 2 x λ λ λ 2 x λ λ 2 λ2 λ 2 λ By (677, we obtai (679 x q(xf(x+b (x λ 2 +b 2 (x λ ad hece (680 A q(af(a+b (A λ 2 I+b 2 (A λ I b (A λ 2 I+b 2 (A λ I (b +b 2 A (b λ 2 +b 2 λ I [ ] [ (b +b 2 (b λ 2 +b 2 λ ] [ ] b +b 2 b λ 2 b 2 λ
15 Therefore, (68 COMPUTATION OF A [ ] [ ] a+ A a a a 0 [ ][ ] b +b 2 b λ 2 b 2 λ 0 [ ] b +b 2 So a b +b 2 with b ad b 2 give i (678, which also gives us (676 Example 67 Let us solve the recurrece {a : 0,,2,} give by (682 a +2 3a + 2a +5 for 2 ad a 0 a We write a +2 3a + 2a +5 (683 a + a + a +2 a }{{}}{{} u + A It follows that (684 a + a a a 0 The characteristic polyomial of the recurrece is a + a }{{} u (685 det(xi A (x 3 3x+2(x (x 2 (x 2 So a, as a fuctio of, lies i the space spaed by, ( ad 2 Therefore, (686 a c +c 2 +c 3 (2 for some costats c,c 2 ad c 3 Settig 0,,2, we have c +c 3 c 4 (687 c +c 2 +2c 3 c 2 5 c +2c 2 +4c 3 6 c 3 5 ad hece (688 a 4 5+5(2 Alteratively, we may compute A directly via its characteristic polyomial f(x (x 2 (x 2 That is, we write (689 x f(x q(x+ b x + b 2 (x 2 + b 2 x 2
16 2 6 APPLICATION OF JORDAN CANONICAL FORM for some polyomial q(x ad some costats b ij The ( x b, b 2 x 2 x x 2 ad (690 x b 2 (x By (689, we obtai (69 x q(xf(x+b (x (x 2+b 2 (x 2+b 2 (x 2 ad hece (692 Therefore, (693 A q(af(a+b (A I(A 2I+b 2 (A 2I+b 2 (A I 2 b (A I(A 2I+b 2 (A 2I+b 2 (A I 2 b b b b b b 2 5 b 2 +b 2 2b 2 b 2 5(b +b 2 a + a A a a 0 b 2 +b 2 2b 2 b 2 5(b +b 2 5b b 2 +5b 2 a 5b b 2 +5b (2 2 Solutios of Liear ODEs with Costat Coefficiets As aother applicatio of JCF ad miimal polyomial, let us cosider the solutios of the followig system of first order liear ordiary differetial
17 2 SOLUTIONS OF LINEAR ODES WITH CONSTANT COEFFICIENTS 3 equatios (ODEs with costat coefficiets: dx dt a x +a 2 x 2 ++a x +b dx 2 (694 dt a 2x +a 22 x 2 ++a 2 x +b 2 dx dt a x +a 2 x 2 ++a x +b where x,x 2,,x are ukow fuctios i t ad a ij ad b i are costats Usig matrix otatios, we may put it i the form (695 dx dt Ax+b or x Ax+b for A [ a ij ],x x x 2 ad b b 2 We call the system homogeeous if b 0 ad o-homogeeous otherwise Note that we ca always covert a o-homogeeous system of liear ODEs to a homogeeous oe by itroducig a extra ukow fuctio x + ad turs (694 to (696 x dx dt a x +a 2 x 2 ++a x +b x + dx 2 dt a 2x +a 22 x 2 ++a 2 x +b 2 x + dx a x +a 2 x 2 ++a x +b x + dt dx + 0 dt which is homogeeous For a solutio of (696 give by (697 (x,x 2,,x,x + (f (t,f 2 (t,,f (t,f + (t f + (t c must be a costat If f + (t, the (698 (x,x 2,,x (f (t,f 2 (t,,f (t is a solutio of (694 More precisely, { x : dx } dt Ax+b (699 { [ ] d x x : dt x + [ A b 0 0 ][ x x + ] } ad x + b b
18 4 6 APPLICATION OF JORDAN CANONICAL FORM Therefore, to solve the o-homogeeous system (694, it suffices to solve (696 ad choose its solutios with x + as the solutios of the origial system So we oly eed to solve a homogeeous system x Ax The solutio of x Ax satisfyig the iitial coditio x(t 0 v is very explicitly give by (600 x e (t t 0A v where e B exp(b is defied by (60 e B m0 m! Bm for a square matrix B So it comes dow to the computatio of e (t t 0A, which ca be achieved by the JCF or the miimal polyomial of A It is easy to see that e A has the followig properties: (602 e λi e λ I e D e λ e λ 2 e A (e A e A+B e A e B if AB BA e A v e λ v if Av λv P e A P exp(p AP λ for D λ 2 e λ λ Agai, there are two ways to compute the solutio e (t t 0A v of x Ax The first approach uses the JCF of A ad the secod approach uses the miimal or characteristic polyomial of A For simplicity, let us assume that t 0 0 We may always replace t by t t 0 i e ta v to obtai e (t t 0A v Suppose that P AP J is the JCF of A for a ivertible matrix P Let B be the ordered basis of C cosistig of the colum vectors of P As i (60, B B B 2 B l is a disjoit uio of cycles of geeralized eigevectors We write v as a liear combiatio of vectors i B as i (6: (603 v l c ij (A λ i I j v i i j0 where v,v 2,,v l are the vectors geeratig the cycles B,B 2,,B l i B
19 2 SOLUTIONS OF LINEAR ODES WITH CONSTANT COEFFICIENTS 5 We compute e ta v by writig e ta e λiti e t(a λii for each i: l e ta v e ta c ij (A λ i I j v i (604 i i j0 l e λiti e t(a λ ii c ij (A λ i I j v i i j0 l e λit e t(a λ ii c ij (A λ i I j v i l i i e λ it ( k0 j,k 0 j0 t k k! (A λ ii k c ij (A λ i I j v i j0 l e λ c it ij t k (A λ i I j+k v i k! Eve that we sum from j,k 0 to, there are oly fiitely may terms amog(a λ i I j+k v i thatareozerosice(a λ i I m i v i 0form i B i I the special case that A is diagoalizable, m i for all i That is, (A λ i Iv i 0 ad the l e ta v c i0 e λit v i c e λt v +c 2 e λ2t v 2 ++c l e λlt v l (605 i for v c v +c 2 v 2 ++c l v l where we let c i c i0 ad v,v 2,,v l are eigevectors of A that spa C Example 68 Let us solve the system of liear ODEs give by dx (606 dt 8x { 4x 2 x (0 with dx 2 dt 9x x 4x 2 (0 2 We put the system i the matrix form x Ax with [ ] 8 4 (607 A 9 4 which is the same 2 2 matrix i Example 6 From the computatio there, we kow that [ (608 P 2 AP J 2,2 for P 2] [ [ ] ] 6 (A 2Ie e 9 0 The solutio of (606 is give by [ ] [ ] (609 x e ta x (0 e x 2 (0 ta }{{} v
20 6 6 APPLICATION OF JORDAN CANONICAL FORM We write v as a liear combiatio of e ad (A 2Ie : [ (60 v ] [ + 3 0] [ 6 9 9] 3 e + 9 (A 2Ie The (6 So the solutio is (62 e ta v e ta ( 3 e + 9 (A 2Ie ( e 2tI+t(A 2I 3 e + 9 (A 2Ie ( e 2t e t(a 2I 3 e + 9 (A 2Ie ( ( e 2t t k k! (A 2Ik 3 e + 9 (A 2Ie k0 ( e 2t (+t(a 2I 3 e + 9 (A 2Ie ( ( e 2t 3 e t (A 2Ie 3 [ ( e2t +e 3 0] 2t 9 + t [ [ ] 6 (+2te 2t 3 9] (+3te 2t { x (+2te 2t x 2 (+3te 2t The difficulty with the above approach is the fidig of the matrix P, just as i the computatio of A Our secod approach will avoid this issue As before, we choose a ozero polyomial f(x such that f(a 0 ad try to divide e tx by f(x We may take f(x to be the characteristic or miimal polyomial of A Although e tx is ot a polyomial, we ca still divide e tx by f(x such that (63 e tx q(xf(x+r(x where r(x is a polyomial of degr(x < degf(x ad q(x is a etire fuctio, ie, a fuctio that has complex derivatives everywhere for all x C Whe we replace x by A, we still have (64 e ta q(af(a+r(a r(a So it suffices to fid r(x As before, it ca be computed usig partial fractios: (65 e tx r(x q(x+ f(x f(x q(x+ m d i i j c ij (x λ i j
21 2 SOLUTIONS OF LINEAR ODES WITH CONSTANT COEFFICIENTS 7 for f(x (x λ d (x λ 2 d 2 (x λ m dm with λ,λ 2,,λ m distict As before, to determie c ij for each i, we multiply both sides of (65 by (x λ i d i ad take derivatives at λ i of order k 0,,,d i, which yields (66 c ij (d i j! ( e tx (x λ i d i f(x (di j λi Example 69 Let us redo Example 68 usig the characteristic polyomial of A, which is f(x (x 2 2 Suppose that (67 e tx (x 2 2 q(x+ c x 2 + c 2 (x 2 2 for some etire fuctio q(x ad some costats c ad c 2 We multiply both sides by (x 2 2 ad take derivatives of order k 0, at 2: (68 c (e tx x2 te 2t ad c 2 (e tx e 2t x2 Therefore, (69 e tx q(x(x 2 2 +c (x 2+c 2 q(x(x 2 2 +te 2t (x 2+e 2t Replacig x by A, we obtai (620 e ta q(a(a 2I 2 +te 2t (A 2I+e 2t I te 2t (A 2I+e 2t The the solutio of (606 is [ ] x e x ta v te 2t (A 2Iv+e 2t v 2 [ ] [ ] (62 te 2t 6 4 +e 9 6][ 2t [ ] (+2te 2t (+3te 2t which agrees with (62 Example 60 Let us solve the system of liear ODEs give by dx dt 2x 2 x 3 x (0 0 dx (622 2 dt x +3x 2 +x 3 with x 2 (0 dx x 3 (0 3 dt x +x 2 +2x 3 We put it i the matrix form x Ax for 0 2 (623 A 3 2
22 8 6 APPLICATION OF JORDAN CANONICAL FORM The characteristic polyomial of A is f(x (x (x 2 2 Suppose that (624 e tx (x (x 2 2 q(x+ a x + b x 2 + b 2 (x 2 2 for some etire fuctio q(x ad some costats a,b ad b 2 The ( e tx 2 a e (x 2 x t, ( e tx (625 b te 2t e 2t, ad x ( x2 e tx b 2 e 2t Therefore, (626 x x2 e tx q(xf(x+a(x 2 2 +b (x (x 2+b 2 (x e ta q(af(a+a(a 2I 2 +b (A I(A 2I+b 2 (A I a(a 2I 2 +b (A I(A 2I+b 2 (A I e t (A 2I 2 +(t e 2t (A I(A 2I+e 2t (A I Therefore, the solutio of (622 is x x 2 e ta x (0 x 2 (0 x 3 x 3 (0 }{{} v e t (A 2I 2 v+(t e 2t (A I(A 2Iv (627 +e 2t (A Iv e t (t e 2t e 2t 2 0 et (+2te 2t (+2te 2t e t +2e 2t
1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationEigenvalues and Eigenvectors
5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields
More information1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y
Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationIn algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:
74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationApplications in Linear Algebra and Uses of Technology
1 TI-89: Let A 1 4 5 6 7 8 10 Applicatios i Liear Algebra ad Uses of Techology,adB 4 1 1 4 type i: [1,,;4,5,6;7,8,10] press: STO type i: A type i: [4,-1;-1,4] press: STO (1) Row Echelo Form: MATH/matrix
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More information8. Applications To Linear Differential Equations
8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.
More informationAH Checklist (Unit 3) AH Checklist (Unit 3) Matrices
AH Checklist (Uit 3) AH Checklist (Uit 3) Matrices Skill Achieved? Kow that a matrix is a rectagular array of umbers (aka etries or elemets) i paretheses, each etry beig i a particular row ad colum Kow
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationGenerating Functions. 1 Operations on generating functions
Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationMAT 271 Project: Partial Fractions for certain rational functions
MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationFor a 3 3 diagonal matrix we find. Thus e 1 is a eigenvector corresponding to eigenvalue λ = a 11. Thus matrix A has eigenvalues 2 and 3.
Closed Leotief Model Chapter 6 Eigevalues I a closed Leotief iput-output-model cosumptio ad productio coicide, i.e. V x = x = x Is this possible for the give techology matrix V? This is a special case
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationThe Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005
The Jorda Normal Form: A Geeral Approach to Solvig Homogeeous Liear Sstems Mike Raugh March 2, 25 What are we doig here? I this ote, we describe the Jorda ormal form of a matrix ad show how it ma be used
More informationLECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)
LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum
More informationIntroduction To Discrete Mathematics
Itroductio To Discrete Mathematics Review If you put + pigeos i pigeoholes the at least oe hole would have more tha oe pigeo. If (r + objects are put ito boxes, the at least oe of the boxes cotais r or
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationTopics in Eigen-analysis
Topics i Eige-aalysis Li Zajiag 28 July 2014 Cotets 1 Termiology... 2 2 Some Basic Properties ad Results... 2 3 Eige-properties of Hermitia Matrices... 5 3.1 Basic Theorems... 5 3.2 Quadratic Forms & Noegative
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More information1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx
Problem A. Calculate ta(.) to 4 decimal places. Solutio: The power series for si(x)/ cos(x) is x + x 3 /3 + (2/5)x 5 +. Puttig x =. gives ta(.) =.3. Problem 2A. Let f : R R be a cotiuous fuctio. Show that
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMATH 10550, EXAM 3 SOLUTIONS
MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationMath 210A Homework 1
Math 0A Homework Edward Burkard Exercise. a) State the defiitio of a aalytic fuctio. b) What are the relatioships betwee aalytic fuctios ad the Cauchy-Riema equatios? Solutio. a) A fuctio f : G C is called
More informationIIT JAM Mathematical Statistics (MS) 2006 SECTION A
IIT JAM Mathematical Statistics (MS) 6 SECTION A. If a > for ad lim a / L >, the which of the followig series is ot coverget? (a) (b) (c) (d) (d) = = a = a = a a + / a lim a a / + = lim a / a / + = lim
More informationCSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)
CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios
More informationLinear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy
Liear Differetial Equatios of Higher Order Basic Theory: Iitial-Value Problems d y d y dy Solve: a( ) + a ( )... a ( ) a0( ) y g( ) + + + = d d d ( ) Subject to: y( 0) = y0, y ( 0) = y,..., y ( 0) = y
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More information( ) ( ) ( ) ( ) ( + ) ( )
LSM Nov. 00 Cotet List Mathematics (AH). Algebra... kow ad use the otatio!, C r ad r.. kow the results = r r + + = r r r..3 kow Pascal's triagle. Pascal's triagle should be eteded up to = 7...4 kow ad
More informationx c the remainder is Pc ().
Algebra, Polyomial ad Ratioal Fuctios Page 1 K.Paulk Notes Chapter 3, Sectio 3.1 to 3.4 Summary Sectio Theorem Notes 3.1 Zeros of a Fuctio Set the fuctio to zero ad solve for x. The fuctio is zero at these
More informationSection A assesses the Units Numerical Analysis 1 and 2 Section B assesses the Unit Mathematics for Applied Mathematics
X0/70 NATIONAL QUALIFICATIONS 005 MONDAY, MAY.00 PM 4.00 PM APPLIED MATHEMATICS ADVANCED HIGHER Numerical Aalysis Read carefully. Calculators may be used i this paper.. Cadidates should aswer all questios.
More informationSolutions to Final Exam
Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow
More informationLecture 8: October 20, Applications of SVD: least squares approximation
Mathematical Toolkit Autum 2016 Lecturer: Madhur Tulsiai Lecture 8: October 20, 2016 1 Applicatios of SVD: least squares approximatio We discuss aother applicatio of sigular value decompositio (SVD) of
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More informationChapter 4 : Laplace Transform
4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic
More informationMath 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1
Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please
More informationTheorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.
Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse
More informationAbstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers
Abstract Some elemetary observatios o Narayaa polyomials ad related topics II: -Narayaa polyomials Joha Cigler Faultät für Mathemati Uiversität Wie ohacigler@uivieacat We show that Catala umbers cetral
More informationPROBLEMS AND SOLUTIONS 2
PROBEMS AND SOUTIONS Problem 5.:1 Statemet. Fid the solutio of { u tt = a u xx, x, t R, u(x, ) = f(x), u t (x, ) = g(x), i the followig cases: (b) f(x) = e x, g(x) = axe x, (d) f(x) = 1, g(x) =, (f) f(x)
More informationSection Let A =. Then A has characteristic equation λ. 2 4λ + 3 = 0 or (λ 3)(λ 1) = 0. Hence the eigenvalues of A are λ 1 = 3 and λ 2 = 1.
Sectio 63 4 3 Let A The A has characteristic equatio λ 2 4λ + 3 or (λ 3)(λ ) Hece the eigevalues of A are λ 3 ad λ 2 λ 3 The correspodig eigevectors satisfy (A λ I 2 )X, or 3 3 or equivaletly x 3y Hece
More informationSequences, Sums, and Products
CSCE 222 Discrete Structures for Computig Sequeces, Sums, ad Products Dr. Philip C. Ritchey Sequeces A sequece is a fuctio from a subset of the itegers to a set S. A discrete structure used to represet
More informationGenerating Functions II
Geeratig Fuctios II Misha Lavrov ARML Practice 5/4/2014 Warm-up problems 1. Solve the recursio a +1 = 2a, a 0 = 1 by usig commo sese. 2. Solve the recursio b +1 = 2b + 1, b 0 = 1 by usig commo sese ad
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationINEQUALITIES BJORN POONEN
INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad
More information5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.
40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig
More informationPAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu
More informationLECTURE NOTES, 11/10/04
18.700 LECTURE NOTES, 11/10/04 Cotets 1. Direct sum decompositios 1 2. Geeralized eigespaces 3 3. The Chiese remaider theorem 5 4. Liear idepedece of geeralized eigespaces 8 1. Direct sum decompositios
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationSOLVING LINEAR RECURSIONS OVER ALL FIELDS
SOLVING LINEAR RECURSIONS OVER ALL FIELDS KEITH CONRAD 1. Itroductio A sequece {a } = a 0, a 1, a,... i a field K satisfies a liear recursio if there are c 1,..., c d K such that 1.1 a = c 1 a 1 + c a
More informationMATH10212 Linear Algebra B Proof Problems
MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More informationGenerating Functions for Laguerre Type Polynomials. Group Theoretic method
It. Joural of Math. Aalysis, Vol. 4, 2010, o. 48, 257-266 Geeratig Fuctios for Laguerre Type Polyomials α of Two Variables L ( xy, ) by Usig Group Theoretic method Ajay K. Shula* ad Sriata K. Meher** *Departmet
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationSimilarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall
Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationINTEGRATION BY PARTS (TABLE METHOD)
INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary
More informationSolutions to Homework 1
Solutios to Homework MATH 36. Describe geometrically the sets of poits z i the complex plae defied by the followig relatios /z = z () Re(az + b) >, where a, b (2) Im(z) = c, with c (3) () = = z z = z 2.
More informationChapter 6. Advanced Counting Techniques
Chapter 6 Advaced Coutig Techiques 6.: Recurrece Relatios Defiitio: A recurrece relatio for the sequece {a } is a equatio expressig a i terms of oe or more of the previous terms of the sequece: a,a2,a3,,a
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More information