Part IB Numerical Analysis
|
|
- Ethel Garrison
- 5 years ago
- Views:
Transcription
1 Prt IB Numericl Anlysis Theorems with proof Bsed on lectures by G. Moore Notes tken by Dexter Chu Lent 2016 These notes re not endorsed by the lecturers, nd I hve modified them (often significntly) fter lectures. They re nowhere ner ccurte representtions of wht ws ctully lectured, nd in prticulr, ll errors re lmost surely mine. Polynomil pproximtion Interpoltion by polynomils. Divided differences of functions nd reltions to derivtives. Orthogonl polynomils nd their recurrence reltions. Lest squres pproximtion by polynomils. Gussin qudrture formule. Peno kernel theorem nd pplictions. [6] Computtion of ordinry differentil equtions Euler s method nd proof of convergence. Multistep methods, including order, the root condition nd the concept of convergence. Runge-Kutt schemes. Stiff equtions nd A-stbility. [5] Systems of equtions nd lest squres clcultions LU tringulr fctoriztion of mtrices. Reltion to Gussin elimintion. Column pivoting. Fctoriztions of symmetric nd bnd mtrices. The Newton-Rphson method for systems of non-liner lgebric equtions. QR fctoriztion of rectngulr mtrices by Grm-Schmidt, Givens nd Householder techniques. Appliction to liner lest squres clcultions. [5] 1
2 Contents IB Numericl Anlysis (Theorems with proof) Contents 0 Introduction 3 1 Polynomil interpoltion The interpoltion problem The Lgrnge formul The Newton formul A useful property of divided differences Error bounds for polynomil interpoltion Orthogonl polynomils Sclr product Orthogonl polynomils Three-term recurrence reltion Exmples Lest-squres polynomil pproximtion Approximtion of liner functionls Liner functionls Gussin qudrture Expressing errors in terms of derivtives 12 5 Ordinry differentil equtions Introduction One-step methods Multi-step methods Runge-Kutt methods Stiff equtions Introduction Liner stbility Implementtion of ODE methods Locl error estimtion Solving for implicit methods Numericl liner lgebr Tringulr mtrices LU fctoriztion A = LU for specil A Liner lest squres 20 2
3 0 Introduction IB Numericl Anlysis (Theorems with proof) 0 Introduction 3
4 1 Polynomil interpoltion IB Numericl Anlysis (Theorems with proof) 1 Polynomil interpoltion 1.1 The interpoltion problem 1.2 The Lgrnge formul Theorem. The interpoltion problem hs exctly one solution. Proof. We define p P n [x] by Evluting t x i gives p(x j ) = p(x) = f k l k (x). f k l k (x j ) = f k δ jk = f j. So we get existence. For uniqueness, suppose p, q P n [x] re solutions. Then the difference r = p q P n [x] stisfies r(x j ) = 0 for ll j, i.e. it hs n + 1 roots. However, non-zero polynomil of degree n cn hve t most n roots. So in fct p q is zero, i.e. p = q. 1.3 The Newton formul Theorem (Recurrence reltion for Newton divided differences). For 0 j < k n, we hve f[x j,, x k ] = f[x j+1,, x k ] f[x j,, x k 1 ] x k x j. Proof. The key to proving this is to relte the interpolting polynomils. Let q 0, q 1 P k j 1 [x] nd q 2 P k j stisfy q 0 (x i ) = f i i = j,, k 1 q 1 (x i ) = f i q 2 (x i ) = f i i = j + 1,, k i = j,, k We now clim tht q 2 (x) = x x j x k x j q 1 (x) + x k x x k x j q 0 (x). We cn check directly tht the expression on the right correctly interpoltes the points x i for i = j,, k. By uniqueness, the two expressions gree. Since f[x j,, x k ], f[x j+1,, x k ] nd f[x j,, x k 1 ] re the leding coefficients of q 2, q 1, q 0 respectively, the result follows. 4
5 1 Polynomil interpoltion IB Numericl Anlysis (Theorems with proof) 1.4 A useful property of divided differences Lemm. Let g C m [, b] hve continuous mth derivtive. Suppose g is zero t m + l distinct points. Then g (m) hs t lest l distinct zeros in [, b]. Proof. This is repeted ppliction of Rolle s theorem. We know tht between every two zeros of g, there is t lest one zero of g C m 1 [, b]. So by differentiting once, we hve lost t most 1 zeros. So fter differentiting m times, g (m) hs lost t most m zeros. So it still hs t lest l zeros. Theorem. Let {x i } n i=0 [, b] nd f Cn [, b]. Then there exists some ξ (, b) such tht f[x 0,, x n ] = 1 n! f (n) (ξ). Proof. Consider e = f p n C n [, b]. This hs t lest n + 1 distinct zeros in [, b]. So by the lemm, e (n) = f (n) p (n) n must vnish t some ξ (, b). But then p (n) n = n!f[x 0,, x n ] constntly. So the result follows. 1.5 Error bounds for polynomil interpoltion Theorem. Assume {x i } n i=0 [, b] nd f C[, b]. Let x [, b] be noninterpoltion point. Then where e n ( x) = f[x 0, x 1,, x n, x]ω( x), ω(x) = n (x x i ). Proof. We think of x = x n+1 s new interpoltion point so tht i=0 p n+1 (x) p n (x) = f[x 0,, x n, x]ω(x) for ll x R. In prticulr, putting x = x, we hve p n+1 ( x) = f( x), nd we get the result. Theorem. If in ddition f C n+1 [, b], then for ech x [, b], we cn find ξ x (, b) such tht e n (x) = 1 (n + 1)! f (n+1) (ξ x )ω(x) Proof. The sttement is trivil if x is n interpoltion point pick rbitrry ξ x, nd both sides re zero. Otherwise, this follows directly from the lst two theorems. Corollry. For ll x [, b], we hve f(x) p n (x) 1 (n + 1)! f (n+1) ω(x) 5
6 1 Polynomil interpoltion IB Numericl Anlysis (Theorems with proof) Lemm (3-term recurrence reltion). The Chebyshev polynomils stisfy the recurrence reltions T n+1 (x) = 2xT n (x) T n 1 (x) with initil conditions T 0 (x) = 1, T 1 (x) = x. Proof. cos((n + 1)θ) + cos((n 1)θ) = 2 cos θ cos(nθ). Theorem (Miniml property for n 1). On [ 1, 1], mong ll polynomils 1 p P n [x] with leding coefficient 1, 2 T n 1 n minimizes p. Thus, the 1 minimum vlue is 2. n 1 Proof. We proceed by contrdiction. Suppose there is polynomil q n P n with leding coefficient 1 such tht q n < 1 2 n 1. Define new polynomil r = 1 2 n 1 T n q n. This is, by ssumption, non-zero. Since both the polynomils hve leding coefficient 1, the difference must 1 hve degree t most n 1, i.e. r P n 1 [x]. Since 2 T n 1 n (X k ) = ± 1 2, nd n 1 q n (X n ) < 1 2 by ssumption, r lterntes in sign between these n + 1 points. n 1 But then by the intermedite vlue theorem, r hs to hve t lest n zeros. This is contrdiction, since r hs degree n 1, nd cnnot be zero. Corollry. Consider w = n (x x i ) P n+1 [x] i=0 for ny distinct points = {x i } n i=0 [ 1, 1]. Then min ω = 1 2 n. This minimum is chieved by picking the interpoltion points to be the zeros of T n+1, nmely ( ) 2k + 1 x k = cos 2n + 2 π, k = 0,, n. Theorem. For f C n+1 [ 1, 1], the Chebyshev choice of interpoltion points gives f p n n (n + 1)! f (n+1). 6
7 2 Orthogonl polynomils IB Numericl Anlysis (Theorems with proof) 2 Orthogonl polynomils 2.1 Sclr product 2.2 Orthogonl polynomils Theorem. Given vector spce V of functions nd n inner product,, there exists unique monic orthogonl polynomil for ech degree n 0. In ddition, {p k } n form bsis for P n[x]. Proof. This is big induction proof over both prts of the theorem. We induct over n. For the bse cse, we pick p 0 (x) = 1, which is the only degree-zero monic polynomil. Now suppose we lredy hve {p n } n stisfying the induction hypothesis. Now pick ny monic q n+1 P n+1 [x], e.g. x n+1. We now construct p n+1 from q n+1 by the Grm-Schmidt process. We define p n+1 = q n+1 This is gin monic since q n+1 is, nd we hve p n+1, p m = 0 q n+1, p k p k, p k p k. for ll m n, nd hence p n+1, p = 0 for ll p P n [x] = p 0,, p n. To obtin uniqueness, ssume both p n+1, ˆp n+1 P n+1 [x] re both monic orthogonl polynomils. Then r = p n+1 ˆp n+1 P n [x]. So r, r = r, p n+1 ˆp n+1 = r, p n+1 r, ˆp n+1 = 0 0 = 0. So r = 0. So p n+1 = ˆp n 1. Finlly, we hve to show tht p 0,, p n+1 form bsis for P n+1 [x]. Now note tht every p P n+1 [x] cn be written uniquely s p = cp n+1 + q, where q P n [x]. But {p k } n is bsis for P n[x]. So q cn be uniquely decomposed s liner combintion of p 0,, p n. Alterntively, this follows from the fct tht ny set of orthogonl vectors must be linerly independent, nd since there re n + 2 of these vectors nd P n+1 [x] hs dimension n + 2, they must be bsis. 2.3 Three-term recurrence reltion Theorem. Monic orthogonl polynomils re generted by with initil conditions p k+1 (x) = (x α k )p k (x) β k p k 1 (x) p 0 = 1, p 1 (x) = (x α 0 )p 0, where α k = xp k, p k p k, p k, β k = p k, p k p k 1, p k 1. 7
8 2 Orthogonl polynomils IB Numericl Anlysis (Theorems with proof) Proof. By inspection, the p 1 given is monic nd stisfies p 1, p 0 = 0. Using q n+1 = xp n in the Grm-Schmidt process gives p n+1 = xp n p n+1 = xp n xp n, p k p k, p k p k p n, xp k p k, p k p k We notice tht p n, xp k nd vnishes whenever xp k hs degree less thn n. So we re left with = xp n xp n, p n p n, p n p n p n, xp n 1 p n 1, p n 1 p n 1 = (x α n )p n p n, xp n 1 p n 1, p n 1 p n 1. Now we notice tht xp n 1 is monic polynomil of degree n so we cn write this s xp n 1 = p n + q. Thus p n, xp n 1 = p n, p n + q = p n, p n. Hence the coefficient of p n 1 is indeed the β we defined. 2.4 Exmples 2.5 Lest-squres polynomil pproximtion Theorem. If {p n } n re orthogonl polynomils with respect to,, then the choice of c k such tht p = c k p k minimizes f p 2 is given by nd the formul for the error is c k = f, p k p k 2, f p 2 = f 2 Proof. We consider generl polynomil We substitute this in to obtin p = f p, f p = f, f 2 c k p k. f, p k 2 p k 2. c k f, p k + 8 c 2 k p k 2.
9 2 Orthogonl polynomils IB Numericl Anlysis (Theorems with proof) Note tht there re no cross terms between the different coefficients. We minimize this qudrtic by setting the prtil derivtives to zero: 0 = c k f p, f p = 2 f, p k + 2c k p k 2. To check this is indeed minimum, note tht the Hessin mtrix is simply 2I, which is positive definite. So this is relly minimum. So we get the formul for the c k s s climed, nd putting the formul for c k gives the error formul. 9
10 3 Approximtion of liner functionls IB Numericl Anlysis (Theorems with proof) 3 Approximtion of liner functionls 3.1 Liner functionls 3.2 Gussin qudrture Proposition. There is no choice of ν weights nd nodes such tht the pproximtion of w(x)f(x) dx is exct for ll f P 2ν[x]. Proof. Define Then we know q(x) = ν (x c k ) P ν [x]. w(x)q 2 (x) dx > 0, since q 2 is lwys non-negtive nd hs finitely mny zeros. However, So this cnnot be exct for q 2. ν b k q 2 (c n ) = 0. Theorem (Ordinry qudrture). For ny distinct {c k } ν [, b], let {l k} ν be the Lgrnge crdinl polynomils with respect to {c k } ν. Then by choosing the pproximtion L(f) = b k = w(x)l k (x) dx, w(x)f(x) dx ν b k f(c k ) is exct for f P ν 1 [x]. We cll this method ordinry qudrture. Theorem. For ν 1, the zeros of the orthogonl polynomil p ν re rel, distinct nd lie in (, b). Proof. First we show there is t lest one root. Notice tht p 0 = 1. Thus for ν 1, by orthogonlity, we know w(x)p ν (x)p 1 (x) dx = w(x)p ν (x) dx = 0. So there is t lest one sign chnge in (, b). We hve lredy got the result we need for ν = 1, since we only need one zero in (, b). Now for ν > 1, suppose {ξ j } m j=1 re the plces where the sign of p ν chnges in (, b) (which is subset of the roots of p ν ). We define q(x) = m (x ξ j ) P m [x]. j=1 10
11 3 Approximtion of liner functionls IB Numericl Anlysis (Theorems with proof) Since this chnges sign t the sme plce s p ν, we know qp ν mintins the sme sign in (, b). Now if we hd m < ν, then orthogonlity gives q, p ν = w(x)q(x)p ν (x) dx = 0, which is impossible, since qp ν does not chnge sign. Hence we must hve m = ν. Theorem. In the ordinry qudrture, if we pick {c k } ν to be the roots of p ν (x), then get we exctness for f P 2ν 1 [x]. In ddition, {b n } ν re ll positive. Proof. Let f P 2ν 1 [x]. Then by polynomil division, we get f = qp ν + r, where q, r re polynomils of degree t most ν 1. We pply orthogonlity to get w(x)f(x) dx = Also, since ech c k is root of p ν, we get ν b k f(c k ) = w(x)(q(x)p ν (x) + r(x)) dx = ν b k (q(c k )p ν (c k ) + r(c k )) = w(x)r(x) dx. ν b k r(c k ). But r hs degree t most ν 1, nd this formul is exct for polynomils in P ν 1 [x]. Hence we know w(x)f(x) dx = w(x)r(x) dx = ν b k r(c k ) = ν b k f(c k ). To show the weights re positive, we simply pick s specil f. Consider f {l 2 k }ν P 2ν 2[x], for l k the Lgrnge crdinl polynomils for {c k } ν. Since the qudrture is exct for these, we get 0 < w(x)l 2 k(x) dx = ν b j l 2 k(c j ) = j=1 ν b j δ jk = b k. j=1 Since this is true for ll k = 1,, ν, we get the desired result. 11
12 4 Expressing errors in terms of IBderivtives Numericl Anlysis (Theorems with proof) 4 Expressing errors in terms of derivtives Theorem (Peno kernel theorem). If λ nnihiltes polynomils of degree k or less, then λ(f) = 1 k! for ll f C k+1 [, b], where K(θ)f (k+1) (θ) dθ 12
13 5 Ordinry differentil equtions IB Numericl Anlysis (Theorems with proof) 5 Ordinry differentil equtions 5.1 Introduction 5.2 One-step methods Theorem (Convergence of Euler s method). (i) For ll t [0, T ], we hve lim y n y(t) = 0. h 0 nh t (ii) Let λ be the Lipschitz constnt of f. Then there exists c 0 such tht e n ch eλt 1 λ for ll 0 n [T/h], where e n = y n y(t n ). Proof. There re two prts to proving this. We first look t the locl trunction error. This is the error we would get t ech step ssuming we got the previous steps right. More precisely, we write y(t n+1 ) = y(t n ) + h(f, t n, y(t n )) + R n, nd R n is the locl trunction error. For the Euler s method, it is esy to get R n, since f(t n, y(t n )) = y (t n ), by definition. So this is just the Tylor series expnsion of y. We cn write R n s the integrl reminder of the Tylor series, R n = By some creful nlysis, we get tn+1 t n (t n+1 θ)y (θ) dθ. R n ch 2, where c = 1 2 y. This is the esy prt, nd tends to go rther smoothly even for more complicted methods. Once we hve bounded the locl trunction error, we ptch them together to get the ctul error. We cn write e n+1 = y n+1 y(t n+1 ) ) = y n + hf(t n, y n ) (y(t n ) + hf(t n, y(t n )) + R n ( ) = (y n y(t n )) + h f(t n, y n ) f(t n, y(t n )) R n Tking the infinity norm, we get e n+1 y n y(t n ) + h f(t n, y n ) f(t n, y(t n )) + R n e n + hλ e n + ch 2 = (1 + λh) e n + ch 2. 13
14 5 Ordinry differentil equtions IB Numericl Anlysis (Theorems with proof) This is vlid for ll n 0. We lso know e 0 = 0. Doing some lgebr, we get Finlly, we hve n 1 e n ch 2 (1 + hλ) j ch λ ((1 + hλ)n 1). j=0 (1 + hλ) e λh, since 1 + λh is the first two terms of the Tylor series, nd the other terms re positive. So (1 + hλ) n e λhn e λt. So we obtin the bound e n ch eλt 1. λ Then this tends to 0 s we tke h 0. So the method converges. 5.3 Multi-step methods Theorem. An s-step method hs order p (p 1) if nd only if nd s ρ l = 0 s ρ l l k = k for k = 1,, p, where 0 0 = 1. Proof. The locl trunction error is s ρ l y(t n+l ) h s σ l l k 1 s σ l y (t n+l ). We now expnd the y nd y bout t n, nd obtin ( s ) ( s ) h k s ρ l y(t n ) + ρ l l k k σ l l k 1 y (k) (t n ). k! This is O(h p+1 ) under the given conditions. Theorem. A multi-step method hs order p (with p 1) if nd only if s x 0. Proof. We expnd ρ(e x ) xσ(e x ) = O(x p+1 ) ρ(e x ) xσ(e x ) = s ρ l e lx x 14 s σ l e lx.
15 5 Ordinry differentil equtions IB Numericl Anlysis (Theorems with proof) We now expnd the e lx in Tylor series bout x = 0. This comes out s ( s s ) 1 s ρ l + ρ l l k k σ l l k 1 x k. k! So the result follows. Theorem (Dhlquist equivlence theorem). A multi-step method is convergent if nd only if (i) The order p is t lest 1; nd (ii) The root condition holds. Lemm. An s-step bckwrd differentition method of order s is obtined by choosing s 1 ρ(w) = σ s l ws l (w 1) l, l=1 with σ s chosen such tht ρ s = 1, nmely σ s = Proof. We need to construct ρ so tht ( s l=1 ) 1 1. l ρ(w) = σ s w s log w + O( w 1 s+1 ). This is esy, if we write ( ) 1 log w = log w ( = log 1 w 1 ) w ( ) l 1 w 1 =. l w l=1 Multiplying by σ s w s gives the desired result. 5.4 Runge-Kutt methods 15
16 6 Stiff equtions IB Numericl Anlysis (Theorems with proof) 6 Stiff equtions 6.1 Introduction 6.2 Liner stbility Theorem (Mximum principle). Let g be nlytic nd non-constnt in n open set Ω C. Then g hs no mximum in Ω. 16
17 7 Implementtion of ODE methods IB Numericl Anlysis (Theorems with proof) 7 Implementtion of ODE methods 7.1 Locl error estimtion 7.2 Solving for implicit methods 17
18 8 Numericl liner lgebr IB Numericl Anlysis (Theorems with proof) 8 Numericl liner lgebr 8.1 Tringulr mtrices 8.2 LU fctoriztion 8.3 A = LU for specil A Theorem. A sufficient condition for the existence for both the existence nd uniqueness of A = LU is tht det(a k ) 0 for k = 1,, n 1. Proof. Strightforwrd induction. Theorem. If det(a k ) 0 for ll k = 1,, n, then A R n n hs unique fctoriztion of the form A = LDÛ, where D is non-singulr digonl mtrix, nd both L nd Û re unit tringulr. Proof. From the previous theorem, A = LU exists. Since A is non-singulr, U is non-singulr. So we cn write this s U = DÛ, where D consists of the digonls of U nd Û = D 1 U is unit. Theorem. Let A R n n be non-singulr nd det(a k ) 0 for ll k = 1,, n. Then there is unique symmetric fctoriztion A = LDL T, with L unit lower tringulr nd D digonl nd non-singulr. Proof. From the previous theorem, we cn fctorize A uniquely s We tke the trnspose to obtin A = LDÛ. A = A T = Û T DL T. This is fctoriztion of the form unit lower - digonl - unit upper. By uniqueness, we must hve Û = LT. So done. Theorem. Let A R n n be positive-definite mtrix. Then det(a k ) 0 for ll k = 1,, n. Proof. First consider k = n. To show A is non-singulr, it suffices to show tht Ax = 0 implies x = 0. But we cn multiply the eqution by x T to obtin x T Ax = 0. By positive-definiteness, we must hve x = 0. So done. Now suppose A k y = 0 for k < n nd y = R k. Then y T A k y = 0. We invent new x R n by tking y nd pd it with zeros. Then x T Ax = 0. By positive-definiteness, we know x = 0. Then in prticulr y = 0. 18
19 8 Numericl liner lgebr IB Numericl Anlysis (Theorems with proof) Theorem. A symmetric mtrix A R n n is positive-definite iff we cn fctor it s A = LDL T, where L is unit lower tringulr, D is digonl nd D kk > 0. Proof. First suppose such fctoriztion exists, then x T Ax = x T LDL T x = (L T x) T D(L T x). We let y = L T x. Note tht y = 0 if nd only if x = 0, since L is invertible. So x T Ax = y T Dy = ykd 2 kk > 0 if y 0. Now if A is positive definite, it hs n LU fctoriztion, nd since A is symmetric, we cn write it s A = LDL T, where L is unit lower tringulr nd D is digonl. Now we hve to show D kk > 0. We define y k such tht L T y k = e k, which exist, since L is invertible. Then clerly y k 0. Then we hve So done. D kk = e T k De k = y T k LDL T y k = y T k Ay k > 0. Proposition. If bnd mtrix A hs bnd width r nd n LU fctoriztion A = LU, then L nd U re both bnd mtrices of width r. Proof. Strightforwrd verifiction. 19
20 9 Liner lest squres IB Numericl Anlysis (Theorems with proof) 9 Liner lest squres Theorem. A vector x R n minimizes Ax b 2 if nd only if A T (Ax b) = 0. Proof. A solution, by definition, minimizes f(x) = Ax b, Ax b = x T AAx 2x T A T b + b T b. Then s function of x, the prtil derivtives of this must vnish. We hve So necessry condition is f(x) = 2A T (Ax b). A T (Ax b). Now suppose our x stisfies A T (Ax b) = 0. Then for ll x R n, we write x = x + y, nd then we hve Ax b 2 = A(x + y) b = Ax b + 2y T A T (Ax b) + Ay 2 = Ax b + Ay 2 Ax b. So x must minimize the Eucliden norm. Corollry. If A R m n is full-rnk mtrix, then there is unique solution to the lest squres problem. Proof. We know ll minimizers re solutions to (A T A)x = A T b. The mtrix A being full rnk mens y 0 R n implies Ay 0 R m. Hence A T A R n n is positive definite (nd in prticulr non-singulr), since x T A T Ax = (Ax) T (Ax) = Ax 2 > 0 for x 0. So we cn invert A T A nd find unique solution x. Proposition. A mtrix A R m n cn be trnsformed into upper-tringulr form by pplying n Householder reflections, nmely H n H 1 A = R, where ech H n introduces zero into column k nd leves the other zeroes lone. Lemm. Let, b R m, with b, but = b. Then if we pick u = b, then H u = b. 20
21 9 Liner lest squres IB Numericl Anlysis (Theorems with proof) Proof. We just do it: H u = where we used the fct tht = b. 2( T b) 2 2 T ( b) = ( b) = b, b + b 2 Lemm. If the first k 1 components of u re zero, then (i) For every x R m, H u x does not lter the first k 1 components of x. (ii) If the lst (m k + 1) components of y R m re zero, then H u y = y. Lemm. Let, b R m, with k. m b ḳ.. b m, but Suppose we pick m m 2 j = b 2 j. j=k j=k u = (0, 0,, 0, k b k,, m b m ) T. Then we hve H u = ( 1,, k 1 b k,, b m ). 21
Part IB Numerical Analysis
Prt IB Numericl Anlysis Bsed on lectures by G. Moore Notes tken by Dexter Chu Lent 2016 These notes re not endorsed by the lecturers, nd I hve modified them (often significntly) fter lectures. They re
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 informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationOrthogonal Polynomials
Mth 4401 Gussin Qudrture Pge 1 Orthogonl Polynomils Orthogonl polynomils rise from series solutions to differentil equtions, lthough they cn be rrived t in vriety of different mnners. Orthogonl polynomils
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More information1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),
1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on
More informationCAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam.
Exmintion 1 Posted 23 October 2002. Due no lter thn 5pm on Mondy, 28 October 2002. Instructions: 1. Time limit: 3 uninterrupted hours. 2. There re four questions, plus bonus. Do not look t them until you
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 informationOrthogonal Polynomials and Least-Squares Approximations to Functions
Chpter Orthogonl Polynomils nd Lest-Squres Approximtions to Functions **4/5/3 ET. Discrete Lest-Squres Approximtions Given set of dt points (x,y ), (x,y ),..., (x m,y m ), norml nd useful prctice in mny
More information1 Linear Least Squares
Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving
More informationDiscrete Least-squares Approximations
Discrete Lest-squres Approximtions Given set of dt points (x, y ), (x, y ),, (x m, y m ), norml nd useful prctice in mny pplictions in sttistics, engineering nd other pplied sciences is to construct curve
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
More informationChapter 3 Polynomials
Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling
More informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
More informationLecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 6: Singulr Integrls, Open Qudrture rules, nd Guss Qudrture (Compiled 6 August 7) In this lecture we discuss the
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 informationAdvanced Computational Fluid Dynamics AA215A Lecture 3 Polynomial Interpolation: Numerical Differentiation and Integration.
Advnced Computtionl Fluid Dynmics AA215A Lecture 3 Polynomil Interpoltion: Numericl Differentition nd Integrtion Antony Jmeson Winter Qurter, 2016, Stnford, CA Lst revised on Jnury 7, 2016 Contents 3 Polynomil
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 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 informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationHW3, Math 307. CSUF. Spring 2007.
HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem
More informationB.Sc. in Mathematics (Ordinary)
R48/0 DUBLIN INSTITUTE OF TECHNOLOGY KEVIN STREET, DUBLIN 8 B.Sc. in Mthemtics (Ordinry) SUPPLEMENTAL EXAMINATIONS 01 Numericl Methods Dr. D. Mckey Dr. C. Hills Dr. E.A. Cox Full mrks for complete nswers
More informationNumerical Methods I Orthogonal Polynomials
Numericl Methods I Orthogonl Polynomils Aleksndr Donev Cournt Institute, NYU 1 donev@cournt.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fll 2014 Nov 6th, 2014 A. Donev (Cournt Institute) Lecture IX
More informationMatrices, Moments and Quadrature, cont d
Jim Lmbers MAT 285 Summer Session 2015-16 Lecture 2 Notes Mtrices, Moments nd Qudrture, cont d We hve described how Jcobi mtrices cn be used to compute nodes nd weights for Gussin qudrture rules for generl
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More informationMath 270A: Numerical Linear Algebra
Mth 70A: Numericl Liner Algebr Instructor: Michel Holst Fll Qurter 014 Homework Assignment #3 Due Give to TA t lest few dys before finl if you wnt feedbck. Exercise 3.1. (The Bsic Liner Method for Liner
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationElementary Linear Algebra
Elementry Liner Algebr Anton & Rorres, 1 th Edition Lecture Set 5 Chpter 4: Prt II Generl Vector Spces 163 คณ ตศาสตร ว ศวกรรม 3 สาขาว ชาว ศวกรรมคอมพ วเตอร ป การศ กษา 1/2555 163 คณตศาสตรวศวกรรม 3 สาขาวชาวศวกรรมคอมพวเตอร
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
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 informationNumerical Analysis. Doron Levy. Department of Mathematics Stanford University
Numericl Anlysis Doron Levy Deprtment of Mthemtics Stnford University December 1, 2005 D. Levy Prefce i D. Levy CONTENTS Contents Prefce i 1 Introduction 1 2 Interpoltion 2 2.1 Wht is Interpoltion?............................
More informationConstruction of Gauss Quadrature Rules
Jim Lmbers MAT 772 Fll Semester 2010-11 Lecture 15 Notes These notes correspond to Sections 10.2 nd 10.3 in the text. Construction of Guss Qudrture Rules Previously, we lerned tht Newton-Cotes qudrture
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
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 informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
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 informationChapter 1. Basic Concepts
Socrtes Dilecticl Process: The Þrst step is the seprtion of subject into its elements. After this, by deþning nd discovering more bout its prts, one better comprehends the entire subject Socrtes (469-399)
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 informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationSturm-Liouville Eigenvalue problem: Let p(x) > 0, q(x) 0, r(x) 0 in I = (a, b). Here we assume b > a. Let X C 2 1
Ch.4. INTEGRAL EQUATIONS AND GREEN S FUNCTIONS Ronld B Guenther nd John W Lee, Prtil Differentil Equtions of Mthemticl Physics nd Integrl Equtions. Hildebrnd, Methods of Applied Mthemtics, second edition
More informationHere we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.
Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous
More informationComplex integration. L3: Cauchy s Theory.
MM Vercelli. L3: Cuchy s Theory. Contents: Complex integrtion. The Cuchy s integrls theorems. Singulrities. The residue theorem. Evlution of definite integrls. Appendix: Fundmentl theorem of lgebr. Discussions
More informationNumerical quadrature based on interpolating functions: A MATLAB implementation
SEMINAR REPORT Numericl qudrture bsed on interpolting functions: A MATLAB implementtion by Venkt Ayylsomyjul A seminr report submitted in prtil fulfillment for the degree of Mster of Science (M.Sc) in
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationContents. Outline. Structured Rank Matrices Lecture 2: The theorem Proofs Examples related to structured ranks References. Structure Transport
Contents Structured Rnk Mtrices Lecture 2: Mrc Vn Brel nd Rf Vndebril Dept. of Computer Science, K.U.Leuven, Belgium Chemnitz, Germny, 26-30 September 2011 1 Exmples relted to structured rnks 2 2 / 26
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 informationNumerical Integration. 1 Introduction. 2 Midpoint Rule, Trapezoid Rule, Simpson Rule. AMSC/CMSC 460/466 T. von Petersdorff 1
AMSC/CMSC 46/466 T. von Petersdorff 1 umericl Integrtion 1 Introduction We wnt to pproximte the integrl I := f xdx where we re given, b nd the function f s subroutine. We evlute f t points x 1,...,x n
More informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
More informationEuler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )
Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s
More informationSOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set
SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σ-finite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such
More informationNumerical Integration. Newton Cotes Formulas. Quadrature. Newton Cotes Formulas. To approximate the integral b
Numericl Integrtion Newton Cotes Formuls Given function f : R R nd two rel numbers, b R, < b, we clculte (pproximtely) the integrl I(f,, b) = f (x) dx K. Frischmuth (IfM UR) Numerics for CSE 08/09 8 /
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
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 information440-2 Geometry/Topology: Differentiable Manifolds Northwestern University Solutions of Practice Problems for Final Exam
440-2 Geometry/Topology: Differentible Mnifolds Northwestern University Solutions of Prctice Problems for Finl Exm 1) Using the cnonicl covering of RP n by {U α } 0 α n, where U α = {[x 0 : : x n ] RP
More information1 Ordinary Differential Equations
1 Ordinry Differentil Equtions 1. Mthemticl Bckground 1..1 Smoothness Definition 1.1 A function f defined on [, b] is continuous t x [, b] if lim x x f(x) = f(x ). Remrk Note tht this implies existence
More informationQuantum Physics II (8.05) Fall 2013 Assignment 2
Quntum Physics II (8.05) Fll 2013 Assignment 2 Msschusetts Institute of Technology Physics Deprtment Due Fridy September 20, 2013 September 13, 2013 3:00 pm Suggested Reding Continued from lst week: 1.
More information(4.1) D r v(t) ω(t, v(t))
1.4. Differentil inequlities. Let D r denote the right hnd derivtive of function. If ω(t, u) is sclr function of the sclrs t, u in some open connected set Ω, we sy tht function v(t), t < b, is solution
More informationLecture Note 4: Numerical differentiation and integration. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 4: Numericl differentition nd integrtion Xioqun Zng Sngi Jio Tong University Lst updted: November, 0 Numericl Anlysis. Numericl differentition.. Introduction Find n pproximtion of f (x 0 ),
More informationLecture Notes: Orthogonal Polynomials, Gaussian Quadrature, and Integral Equations
18330 Lecture Notes: Orthogonl Polynomils, Gussin Qudrture, nd Integrl Equtions Homer Reid My 1, 2014 In the previous set of notes we rrived t the definition of Chebyshev polynomils T n (x) vi the following
More informationRecitation 3: Applications of the Derivative. 1 Higher-Order Derivatives and their Applications
Mth 1c TA: Pdric Brtlett Recittion 3: Applictions of the Derivtive Week 3 Cltech 013 1 Higher-Order Derivtives nd their Applictions Another thing we could wnt to do with the derivtive, motivted by wht
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
More informationSemigroup of generalized inverses of matrices
Semigroup of generlized inverses of mtrices Hnif Zekroui nd Sid Guedjib Abstrct. The pper is divided into two principl prts. In the first one, we give the set of generlized inverses of mtrix A structure
More informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
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 informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationSTUDY GUIDE FOR BASIC EXAM
STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There
More informationIntroduction to Numerical Analysis
Introduction to Numericl Anlysis Doron Levy Deprtment of Mthemtics nd Center for Scientific Computtion nd Mthemticl Modeling (CSCAMM) University of Mrylnd June 14, 2012 D. Levy CONTENTS Contents 1 Introduction
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 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 informationAnalytical Methods Exam: Preparatory Exercises
Anlyticl Methods Exm: Preprtory Exercises Question. Wht does it men tht (X, F, µ) is mesure spce? Show tht µ is monotone, tht is: if E F re mesurble sets then µ(e) µ(f). Question. Discuss if ech of the
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
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 informationElements of Matrix Algebra
Elements of Mtrix Algebr Klus Neusser Kurt Schmidheiny September 30, 2015 Contents 1 Definitions 2 2 Mtrix opertions 3 3 Rnk of Mtrix 5 4 Specil Functions of Qudrtic Mtrices 6 4.1 Trce of Mtrix.........................
More informationIII. Lecture on Numerical Integration. File faclib/dattab/lecture-notes/numerical-inter03.tex /by EC, 3/14/2008 at 15:11, version 9
III Lecture on Numericl Integrtion File fclib/dttb/lecture-notes/numerical-inter03.tex /by EC, 3/14/008 t 15:11, version 9 1 Sttement of the Numericl Integrtion Problem In this lecture we consider the
More informationModern Methods for high-dimensional quadrature
Modern Methods for high-dimensionl qudrture WS 213/14 A. Griewnk, H. eövey V: Die. 11-13 RUD 25, 1.13 Mi. 9-11 RUD 25, 1.13 UE: Die. 13-15 RUD 25, 1.13 http://www2.mthemtik.huberlin.de/ gggle/w1314/mqi/uebung/qudrture.pdf
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 informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationVariational Techniques for Sturm-Liouville Eigenvalue Problems
Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment
More informationChapter 3. Inner Products and Norms
Chpter 3 Inner Products nd Norms The geometry of Eucliden spce relies on the fmilir properties of length nd ngle. The bstrct concept of norm on vector spce formlizes the geometricl notion of the length
More informationLinear Algebra 1A - solutions of ex.4
Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix
More informationg i fφdx dx = x i i=1 is a Hilbert space. We shall, henceforth, abuse notation and write g i f(x) = f
1. Appliction of functionl nlysis to PEs 1.1. Introduction. In this section we give little introduction to prtil differentil equtions. In prticulr we consider the problem u(x) = f(x) x, u(x) = x (1) where
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More informationLecture 17. Integration: Gauss Quadrature. David Semeraro. University of Illinois at Urbana-Champaign. March 20, 2014
Lecture 17 Integrtion: Guss Qudrture Dvid Semerro University of Illinois t Urbn-Chmpign Mrch 0, 014 Dvid Semerro (NCSA) CS 57 Mrch 0, 014 1 / 9 Tody: Objectives identify the most widely used qudrture method
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
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 bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationOrdinary differential equations
Ordinry differentil equtions Introduction to Synthetic Biology E Nvrro A Montgud P Fernndez de Cordob JF Urchueguí Overview Introduction-Modelling Bsic concepts to understnd n ODE. Description nd properties
More informationLinearity, linear operators, and self adjoint eigenvalue problems
Linerity, liner opertors, nd self djoint eigenvlue problems 1 Elements of liner lgebr The study of liner prtil differentil equtions utilizes, unsurprisingly, mny concepts from liner lgebr nd liner ordinry
More informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
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 informationPARTIAL FRACTION DECOMPOSITION
PARTIAL FRACTION DECOMPOSITION LARRY SUSANKA 1. Fcts bout Polynomils nd Nottion We must ssemble some tools nd nottion to prove the existence of the stndrd prtil frction decomposition, used s n integrtion
More informationMATRICES AND VECTORS SPACE
MATRICES AND VECTORS SPACE MATRICES AND MATRIX OPERATIONS SYSTEM OF LINEAR EQUATIONS DETERMINANTS VECTORS IN -SPACE AND -SPACE GENERAL VECTOR SPACES INNER PRODUCT SPACES EIGENVALUES, EIGENVECTORS LINEAR
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More information