Numerical Methods I Orthogonal Polynomials
|
|
- Cori Fox
- 5 years ago
- Views:
Transcription
1 Numericl Methods I Orthogonl Polynomils Aleksndr Donev Cournt Institute, NYU 1 donev@cournt.nyu.edu 1 MATH-GA / CSCI-GA , Fll 2014 Nov 6th, 2014 A. Donev (Cournt Institute) Lecture IX 11/ / 27
2 Outline 1 Review 2 Orthogonl Polynomils on [ 1, 1] 3 Spectrl Approximtion 4 Conclusions A. Donev (Cournt Institute) Lecture IX 11/ / 27
3 Review Lgrnge bsis on 10 nodes 2 A few Lgrnge bsis functions for 10 nodes φ 5 φ φ 3 A. Donev (Cournt Institute) Lecture IX 11/ / 27
4 Review Runge s phenomenon f (x) = (1 + x 2 ) 1 1 Runges phenomenon for 10 nodes 0 1 y x A. Donev (Cournt Institute) Lecture IX 11/ / 27
5 Function Spce Bsis Review Think of function s vector of coefficients in terms of set of n bsis functions: {φ 0 (x), φ 1 (x),..., φ n (x)}, for exmple, the monomil bsis φ k (x) = x k for polynomils. A finite-dimensionl pproximtion to given function f (x): f (x) = n c i φ i (x) i=1 Lest-squres pproximtion for m > n (usully m n): c f = rg min (x) f (x), c 2 which gives the orthogonl projection of f (x) onto the finite-dimensionl bsis. A. Donev (Cournt Institute) Lecture IX 11/ / 27
6 Lest-Squres Fitting Review Discrete cse: Think of fitting stright line or qudrtic through experimentl dt points. The function becomes the vector y = f X, nd the pproximtion is y i = n c j φ j (x i ) y = Φc, j=1 Φ ij = φ j (x i ). This mens tht finding the pproximtion consists of solving n overdetermined liner system Φc = y Note tht for m = n this is equivlent to interpoltion. MATLAB s polyfit works for m n. A. Donev (Cournt Institute) Lecture IX 11/ / 27
7 Norml Equtions Review Recll tht one wy to solve this is vi the norml equtions: (Φ Φ) c = Φ y A bsis set is n orthonorml bsis if (φ i, φ j ) = φ i (x k )φ j (x k ) = δ ij = k=0 { 1 if i = j 0 if i j Φ Φ = I (unitry or orthogonl mtrix) c = Φ y c i = φ X i f X = f (x k )φ i (x k ) k=0 A. Donev (Cournt Institute) Lecture IX 11/ / 27
8 Orthogonl Polynomils on [ 1, 1] Orthogonl Polynomils Consider function on the intervl I = [, b]. Any finite intervl cn be trnsformed to I = [ 1, 1] by simple trnsformtion. Using weight function w(x), define function dot product s: (f, g) = b w(x) [f (x)g(x)] dx For different choices of the weight w(x), one cn explicitly construct bsis of orthogonl polynomils where φ k (x) is polynomil of degree k (tringulr bsis): (φ i, φ j ) = b w(x) [φ i (x)φ j (x)] dx = δ ij φ i 2. A. Donev (Cournt Institute) Lecture IX 11/ / 27
9 Orthogonl Polynomils on [ 1, 1] Legendre Polynomils For equl weighting w(x) = 1, the resulting tringulr fmily of of polynomils re clled Legendre polynomils: φ 0 (x) =1 φ 1 (x) =x φ 2 (x) = 1 2 (3x2 1) φ 3 (x) = 1 2 (5x3 3x) φ k+1 (x) = 2k + 1 k + 1 xφ k(x) k k + 1 φ k 1(x) = 1 2 n n! These re orthogonl on I = [ 1, 1]: 1 1 φ i (x)φ j (x)dx = δ ij 2 2i + 1. d n [ (x 2 dx n 1 ) ] n A. Donev (Cournt Institute) Lecture IX 11/ / 27
10 Orthogonl Polynomils on [ 1, 1] Interpoltion using Orthogonl Polynomils Let s look t the interpolting polynomil φ(x) of function f (x) on set of m + 1 nodes {x 0,..., x m } I, expressed in n orthogonl bsis: φ(x) = i φ i (x) Due to orthogonlity, tking dot product with φ j (wek formultion): (φ, φ j ) = i (φ i, φ j ) = i δ ij φ i 2 = j φ j 2 This is equivlent to norml equtions if we use the right dot product: (Φ Φ) ij = (φ i, φ j ) = δ ij φ i 2 nd Φ y = (φ, φ j ) A. Donev (Cournt Institute) Lecture IX 11/ / 27
11 Orthogonl Polynomils on [ 1, 1] Guss Integrtion j φ j 2 = (φ, φ j ) j = Question: Cn we esily compute (φ, φ j ) = b w(x) [φ(x)φ j (x)] dx = ( φ j 2) 1 (φ, φj ) b w(x)p 2m (x)dx for polynomil p 2m (x) = φ(x)φ j (x) of degree t most 2m? Let s first consider polynomils of degree t most m b w(x)p m (x)dx =? A. Donev (Cournt Institute) Lecture IX 11/ / 27
12 Orthogonl Polynomils on [ 1, 1] Guss Weights Now consider the Lgrnge bsis {ϕ 0 (x), ϕ 1 (x),..., ϕ m (x)}, where you recll tht ϕ i (x j ) = δ ij. Any polynomil p m (x) of degree t most m cn be expressed in the Lgrnge bsis: p m (x) = p m (x i )ϕ i (x), b w(x)p m (x)dx = [ b ] p m (x i ) w(x)ϕ i (x)dx where the Guss weights w re given by w i = b w(x)ϕ i (x)dx. = w i p m (x i ), A. Donev (Cournt Institute) Lecture IX 11/ / 27
13 Orthogonl Polynomils on [ 1, 1] Bck to Interpoltion For ny polynomil p 2m (x) there exists polynomil quotient q m 1 nd reminder r m such tht: p 2m (x) = φ m+1 (x)q m 1 (x) + r m (x) b w(x)p 2m (x)dx = b [w(x)φ m+1 (x)q m 1 (x) + w(x)r m (x)] dx = (φ m+1, q m 1 ) + b w(x)r m (x)dx But, since φ m+1 (x) is orthogonl to ny polynomil of degree t most m, (φ m+1, q m 1 ) = 0 nd we thus get: b w(x)p 2m (x)dx = w i r m (x i ) A. Donev (Cournt Institute) Lecture IX 11/ / 27
14 Orthogonl Polynomils on [ 1, 1] Guss nodes Finlly, if we choose the nodes to be zeros of φ m+1 (x), then r m (x i ) = p 2m (x i ) φ m+1 (x i )q m 1 (x i ) = p 2m (x i ) b w(x)p 2m (x)dx = w i p 2m (x i ) nd thus we hve found wy to quickly project ny polynomil of degree up to m onto the bsis of orthogonl polynomils: (p m, φ j ) = w i p m (x i )φ j (x i ) A. Donev (Cournt Institute) Lecture IX 11/ / 27
15 Orthogonl Polynomils on [ 1, 1] Interpoltion using Guss weights Recll we wnt to compute j = where for Legendre polynomils ( φ j 2) 1 (φ, φj ), φ j 2 = 2 2j + 1. Now we know how to compute fst: (φ, φ j ) = w i φ(x i )φ j (x i ) = w i f (x i )φ j (x i ) ( ) 2j + 1 m j = w i f (x i )φ j (x i ), 2 where w i nd φ j (x i ) re coefficients tht cn be precomputed nd tbulted. A. Donev (Cournt Institute) Lecture IX 11/ / 27
16 Orthogonl Polynomils on [ 1, 1] Guss-Legendre polynomils For ny weighting function the polynomil φ k (x) hs k simple zeros ll of which re in ( 1, 1), clled the (order k) Guss-Legendre nodes, φ m+1 (x i ) = 0. The interpolting polynomil φ(x i ) = f (x i ) on the Guss nodes is the Guss-Legendre interpolnt φ GL (x). The orthogonlity reltion cn be expressed s sum insted of integrl: (φ i, φ j ) = w i φ i (x i )φ j (x i ) = δ ij φ i 2 We cn thus define new weighted discrete dot product f g = w i f i g i A. Donev (Cournt Institute) Lecture IX 11/ / 27
17 Orthogonl Polynomils on [ 1, 1] Discrete Orthogonlity of Polynomils The orthogonl polynomil bsis is discretely-orthogonl in the new dot product, φ i φ j = (φ i, φ j ) = δ ij (φ i φ i ) This mens tht the mtrix in the norml equtions is digonl: { Φ Φ = Dig φ 0 2,..., φ m 2} i = f φ i. φ i φ i The Guss-Legendre interpolnt is thus esy to compute: φ GL (x) = f φ i φ i φ i φ i (x). A. Donev (Cournt Institute) Lecture IX 11/ / 27
18 Orthogonl Polynomils on [ 1, 1] Chebyshev Interpoltion There re other fmilies of orthogonl polynomils tht re lso very useful in prctice (Guss-Lobto, Guss-Hermite, etc.). A notble exmple re the Chebyshev polynomils on [ 1, 1], with weight function 1 w(x) = 1 x 2 defined recursively vi: φ 0 = 1 φ 1 = x φ k+1 = 2xφ k φ k 1. Orthogonlity reltion, for i, j not both zero, (φ i, φ j ) = δ ij π 2 nd (φ 0, φ 0 ) = π. A. Donev (Cournt Institute) Lecture IX 11/ / 27
19 Orthogonl Polynomils on [ 1, 1] Chebyshev Nodes They cn lso be defined s the unique polynomils stisfying the trig reltion: φ k (cos θ) = cos (kθ). This mens tht their roots φ k (x i ) = 0, the Chebyshev nodes, re esy to find, ( ) 2i 1 x i = cos 2k π, i = 1,..., k, which hve simple geometric interprettion s the projection of uniformly spced points on the unit circle. The Chebyshev-Guss weights re lso esy to compute, w i = b w(x)ϕ i (x)dx = π k. Polynomil interpoltion using the Chebyshev nodes elimintes Runge s phenomenon. A. Donev (Cournt Institute) Lecture IX 11/ / 27
20 Spectrl Approximtion Hilbert Spce L 2 w Consider the Hilbert spce L 2 w of squre-integrble functions on [ 1, 1]: f L 2 w : (f, f ) = f 2 = 1 1 w(x) [f (x)] 2 dx <. Legendre polynomils form complete orthogonl bsis for L 2 w: f L 2 w : f (x) = f i φ i (x) f i = (f, φ i) (φ i, φ i ). The lest-squres pproximtion of f is spectrl pproximtion nd is obtined by simply truncting the infinite series: φ sp (x) = f i φ i (x). A. Donev (Cournt Institute) Lecture IX 11/ / 27
21 Spectrl Approximtion Spectrl pproximtion Continuous (spectrl pproximtion): φ sp (x) = Discrete (interpolting polynomil): φ GL (x) = (f, φ i ) (φ i, φ i ) φ i(x). f φ i φ i φ i φ i (x). If we pproximte the function dot-products with the discrete weighted products (f, φ i ) w j f (x j )φ i (x j ) = f φ i, j=0 we see tht the Guss-Legendre interpolnt is discrete spectrl pproximtion: φ GL (x) φ sp (x). A. Donev (Cournt Institute) Lecture IX 11/ / 27
22 Spectrl Approximtion Discrete spectrl pproximtion Using spectrl representtion hs mny dvntges for function pproximtion: stbility, rpid convergence, esy to dd more bsis functions. The convergence, for sufficiently smooth (nice) functions, is more rpid thn ny power lw ( d f (x) φ GL (x) C 1/2 N d f (k) 2), k=0 where the multiplier is relted to the Sobolev norm of f (x). For f (x) C 1, the convergence is lso pointwise with similr ccurcy (N d 1/2 in the denomintor). This so-clled spectrl ccurcy (limited by smoothness only) cnnot be chived by piecewise, i.e., locl, pproximtions (limited by order of locl pproximtion). A. Donev (Cournt Institute) Lecture IX 11/ / 27
23 Regulr grids Spectrl Approximtion =2; f x ) cos (2 exp ( x ) ) ; x f i n e=l i n s p c e ( 1,1,100); y f i n e=f ( x f i n e ) ; % Equi spced nodes : n=10; x=l i n s p c e ( 1,1, n ) ; y=f ( x ) ; c=p o l y f i t ( x, y, n ) ; y i n t e r p=p o l y v l ( c, x f i n e ) ; % Guss nodes : [ x,w]=glnodewt( n ) ; % See webpge f o r code y=f ( x ) ; c=p o l y f i t ( x, y, n ) ; y i n t e r p=p o l y v l ( c, x f i n e ) ; A. Donev (Cournt Institute) Lecture IX 11/ / 27
24 Spectrl Approximtion Guss-Legendre Interpoltion 2 Function nd pproximtions for n=10 2 Error of interpolnts/pproximnts for n= Actul Equi spced nodes Stndrd pprox Guss nodes Spectrl pprox 5 Stndrd pprox Spectrl pprox A. Donev (Cournt Institute) Lecture IX 11/ / 27
25 Spectrl Approximtion Globl polynomil interpoltion error Error for equispced nodes for n=8,16,32,..128 Error for Guss nodes for n=8,16,32, A. Donev (Cournt Institute) Lecture IX 11/ / 27
26 Spectrl Approximtion Locl polynomil interpoltion error Error for liner interpolnt for n=8,16,32, Error for cubic spline for n=8,16,32, A. Donev (Cournt Institute) Lecture IX 11/ / 27
27 Conclusions Conclusions/Summry Once function dot product is defined, one cn construct orthogonl bsis for the spce of functions of finite 2 norm. For functions on the intervl [ 1, 1], tringulr fmilies of orthogonl polynomils φ i (x) provide such bsis, e.g., Legendre or Chebyshev polynomils. If one discretizes t the Guss nodes, i.e., the roots of the polynomil φ m+1 (x), nd defines suitble discrete Guss-weighted dot product, one obtins discretely-orthogonl bsis suitble for numericl computtions. The interpolting polynomil on the Guss nodes is closely relted to the spectrl pproximtion of function. Spectrl convergence is fster thn ny power lw of the number of nodes nd is only limited by the globl smoothness of the function, unlike piecewise polynomil pproximtions limited by the choice of locl bsis functions. One cn lso consider piecewise-spectrl pproximtions. A. Donev (Cournt Institute) Lecture IX 11/ / 27
Discrete 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 informationNumerical Methods I Orthogonal Polynomials
Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)
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 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 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 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 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 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 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 informationNUMERICAL INTEGRATION
NUMERICAL INTEGRATION How do we evlute I = f (x) dx By the fundmentl theorem of clculus, if F (x) is n ntiderivtive of f (x), then I = f (x) dx = F (x) b = F (b) F () However, in prctice most integrls
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 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 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 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 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 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 informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 4: Piecewise Cubic Interpoltion Compiled 5 September In this lecture we consider piecewise cubic interpoltion
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 informationCOSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature
COSC 336 Numericl Anlysis I Numericl Integrtion nd Dierentition III - Guss Qudrture nd Adptive Qudrture Edgr Griel Fll 5 COSC 336 Numericl Anlysis I Edgr Griel Summry o the lst lecture I For pproximting
More informationp(x) = 3x 3 + x n 3 k=0 so the right hand side of the equality we have to show is obtained for r = b 0, s = b 1 and 2n 3 b k x k, q 2n 3 (x) =
Norwegin University of Science nd Technology Deprtment of Mthemticl Sciences Pge 1 of 5 Contct during the exm: Elen Celledoni, tlf. 73593541, cell phone 48238584 PLESE NOTE: this solution is for the students
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 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 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 informationMath Theory of Partial Differential Equations Lecture 2-9: Sturm-Liouville eigenvalue problems (continued).
Mth 412-501 Theory of Prtil Differentil Equtions Lecture 2-9: Sturm-Liouville eigenvlue problems (continued). Regulr Sturm-Liouville eigenvlue problem: d ( p dφ ) + qφ + λσφ = 0 ( < x < b), dx dx β 1 φ()
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 information3.4 Numerical integration
3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,
More informationLecture 14 Numerical integration: advanced topics
Lecture 14 Numericl integrtion: dvnced topics Weinn E 1,2 nd Tiejun Li 2 1 Deprtment of Mthemtics, Princeton University, weinn@princeton.edu 2 School of Mthemticl Sciences, Peking University, tieli@pku.edu.cn
More informationNumerical Integration
Numericl Integrtion Wouter J. Den Hn London School of Economics c 2011 by Wouter J. Den Hn June 3, 2011 Qudrture techniques I = f (x)dx n n w i f (x i ) = w i f i i=1 i=1 Nodes: x i Weights: w i Qudrture
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 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 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 informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More 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 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 informationDOING PHYSICS WITH MATLAB MATHEMATICAL ROUTINES
DOIG PHYSICS WITH MATLAB MATHEMATICAL ROUTIES COMPUTATIO OF OE-DIMESIOAL ITEGRALS In Cooper School of Physics, University of Sydney in.cooper@sydney.edu.u DOWLOAD DIRECTORY FOR MATLAB SCRIPTS mth_integrtion_1d.m
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 informationHow can we approximate the area of a region in the plane? What is an interpretation of the area under the graph of a velocity function?
Mth 125 Summry Here re some thoughts I ws hving while considering wht to put on the first midterm. The core of your studying should be the ssigned homework problems: mke sure you relly understnd those
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 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 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 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 informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationLecture 20: Numerical Integration III
cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed
More informationUniversity of Houston, Department of Mathematics Numerical Analysis II
University of Houston, Deprtment of Mtemtics Numericl Anlysis II 6 Glerkin metod, finite differences nd colloction 6.1 Glerkin metod Consider sclr 2nd order ordinry differentil eqution in selfdjoint form
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 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 information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationNOTES ON HILBERT SPACE
NOTES ON HILBERT SPACE 1 DEFINITION: by Prof C-I Tn Deprtment of Physics Brown University A Hilbert spce is n inner product spce which, s metric spce, is complete We will not present n exhustive mthemticl
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 informationDEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.
398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts
More 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 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 informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationFourier series. Preliminary material on inner products. Suppose V is vector space over C and (, )
Fourier series. Preliminry mteril on inner products. Suppose V is vector spce over C nd (, ) is Hermitin inner product on V. This mens, by definition, tht (, ) : V V C nd tht the following four conditions
More informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
More informationNumerical Methods I. Olof Widlund Transcribed by Ian Tobasco
Numericl Methods I Olof Widlund Trnscribed by In Tobsco Abstrct. This is prt one of two semester course on numericl methods. The course ws offered in Fll 011 t the Cournt Institute for Mthemticl Sciences,
More informationIntroduction to Finite Element Method
Introduction to Finite Element Method Introductory Course on Multiphysics Modelling TOMASZ G. ZIELIŃSKI bluebox.ippt.pn.pl/ tzielins/ Tble of Contents 1 Introduction 1 1.1 Motivtion nd generl concepts.............
More information6.5 Numerical Approximations of Definite Integrals
Arknss Tech University MATH 94: Clculus II Dr. Mrcel B. Finn 6.5 Numericl Approximtions of Definite Integrls Sometimes the integrl of function cnnot be expressed with elementry functions, i.e., polynomil,
More informationPart IB Numerical Analysis
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
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 informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationx j β j + λ (x ij x j )βj + λ β c2 and y aug = λi λi = X X + λi, X λi = y X.
Stt 648: Assignment Solutions (115 points) (3.5) (5 pts.) Writing the ridge expression s y i 0 x ij j x j j + i1 y i ( 0 + i1 y i 0 c i1 j1 x j j ) j1 j1 x j j j1 (x ij x j ) j j1 (x ij x j )j c j1 + λ
More informationMath 113 Exam 2 Practice
Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.-7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number
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 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 informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationIntroduction to Some Convergence theorems
Lecture Introduction to Some Convergence theorems Fridy 4, 005 Lecturer: Nti Linil Notes: Mukund Nrsimhn nd Chris Ré. Recp Recll tht for f : T C, we hd defined ˆf(r) = π T f(t)e irt dt nd we were trying
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 informationFunctional Analysis I Solutions to Exercises. James C. Robinson
Functionl Anlysis I Solutions to Exercises Jmes C. Robinson Contents 1 Exmples I pge 1 2 Exmples II 5 3 Exmples III 9 4 Exmples IV 15 iii 1 Exmples I 1. Suppose tht v α j e j nd v m β k f k. with α j,
More informationMatrix Eigenvalues and Eigenvectors September 13, 2017
Mtri Eigenvlues nd Eigenvectors September, 7 Mtri Eigenvlues nd Eigenvectors Lrry Cretto Mechnicl Engineering 5A Seminr in Engineering Anlysis September, 7 Outline Review lst lecture Definition of eigenvlues
More informationPartial Derivatives. Limits. For a single variable function f (x), the limit lim
Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles
More informationNumerical Integration
Chpter 1 Numericl Integrtion Numericl differentition methods compute pproximtions to the derivtive of function from known vlues of the function. Numericl integrtion uses the sme informtion to compute numericl
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 informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationHomework 4. (1) If f R[a, b], show that f 3 R[a, b]. If f + (x) = max{f(x), 0}, is f + R[a, b]? Justify your answer.
Homework 4 (1) If f R[, b], show tht f 3 R[, b]. If f + (x) = mx{f(x), 0}, is f + R[, b]? Justify your nswer. (2) Let f be continuous function on [, b] tht is strictly positive except finitely mny points
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationLecture 23: Interpolatory Quadrature
Lecture 3: Interpoltory Qudrture. Qudrture. The computtion of continuous lest squres pproximtions to f C[, b] required evlutions of the inner product f, φ j = fxφ jx dx, where φ j is polynomil bsis function
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 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 informationThe Riemann Integral
Deprtment of Mthemtics King Sud University 2017-2018 Tble of contents 1 Anti-derivtive Function nd Indefinite Integrls 2 3 4 5 Indefinite Integrls & Anti-derivtive Function Definition Let f : I R be function
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More informationDefinite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function
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 informationTHE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS
THE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS CARLOS SUERO, MAURICIO ALMANZAR CONTENTS 1 Introduction 1 2 Proof of Gussin Qudrture 6 3 Iterted 2-Dimensionl Gussin Qudrture 20 4
More informationUndergraduate Research
Undergrdute Reserch A Trigonometric Simpson s Rule By Ctherine Cusimno Kirby nd Sony Stnley Biogrphicl Sketch Ctherine Cusimno Kirby is the dughter of Donn nd Sm Cusimno. Originlly from Vestvi Hills, Albm,
More informationENGI 9420 Lecture Notes 7 - Fourier Series Page 7.01
ENGI 940 ecture Notes 7 - Fourier Series Pge 7.0 7. Fourier Series nd Fourier Trnsforms Fourier series hve multiple purposes, including the provision of series solutions to some liner prtil differentil
More informationLECTURE 19. Numerical Integration. Z b. is generally thought of as representing the area under the graph of fèxè between the points x = a and
LECTURE 9 Numericl Integrtion Recll from Clculus I tht denite integrl is generlly thought of s representing the re under the grph of fèxè between the points x = nd x = b, even though this is ctully only
More informationChapter 3 Solving Nonlinear Equations
Chpter 3 Solving Nonliner Equtions 3.1 Introduction The nonliner function of unknown vrible x is in the form of where n could be non-integer. Root is the numericl vlue of x tht stisfies f ( x) 0. Grphiclly,
More informationNumerical Analysis. Chassidy Bozeman. May 30, 2016
Numericl Anlysis Chssidy Bozemn My 30, 016 Contents 1 Theorems 1 1.1 561 Theorems............................................. 1 1. 56 Theorems............................................. Root Finding.1
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 informationSection 7.1 Integration by Substitution
Section 7. Integrtion by Substitution Evlute ech of the following integrls. Keep in mind tht using substitution my not work on some problems. For one of the definite integrls, it is not possible to find
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 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 informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More information1 The Riemann Integral
The Riemnn Integrl. An exmple leding to the notion of integrl (res) We know how to find (i.e. define) the re of rectngle (bse height), tringle ( (sum of res of tringles). But how do we find/define n re
More informationKey words. Numerical quadrature, piecewise polynomial, convergence rate, trapezoidal rule, midpoint rule, Simpson s rule, spectral accuracy.
O SPECTRA ACCURACY OF QUADRATURE FORMUAE BASED O PIECEWISE POYOMIA ITERPOATIO A KURGAOV AD S TSYKOV Abstrct It is well-known tt te trpezoidl rule, wile being only second-order ccurte in generl, improves
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 information