Finite Difference Approximations


 Arleen Singleton
 1 years ago
 Views:
Transcription
1 Capter Finite Difference Approximations Our goal is to approximate solutions to differential equations, i.e., to find a function (or some discrete approximation to tis function) tat satisfies a given relationsip between various of its derivatives on some given region of space and/or time, along wit some boundary conditions along te edges of tis domain. In general tis is a difficult problem, and only rarely can an analytic formula be found for te solution. A finite difference metod proceeds by replacing te derivatives in te differential equations wit finite difference approximations. Tis gives a large but finite algebraic system of equations to be solved in place of te differential equation, someting tat can be done on a computer. Before tackling tis problem, we first consider te more basic question of ow we can approximate te derivatives of a known function by finite difference formulas based only on values of te function itself at discrete points. Besides providing a basis for te later development of finite difference metods for solving differential equations, tis allows us to investigate several key concepts suc as te order of accuracy of an approximation in te simplest possible setting. Let u.x/ represent a function of one variable tat, unless oterwise stated, will always be assumed to be smoot, meaning tat we can differentiate te function several times and eac derivative is a welldefined bounded function over an interval containing a particular point of interest Nx. Suppose we want to approximate u 0. Nx/ by a finite difference approximation based only on values of u at a finite number of points near Nx. One obvious coice would be to use u. Nx C / u. Nx/ D C u. Nx/ (.) for some small value of. Tis is motivated by te standard definition of te derivative as te limiting value of tis expression as! 0. Note tat D C u. Nx/ is te slope of te line interpolating u at te points Nx and Nx C (see Figure.). Te expression (.) is a onesided approximation to u 0 since u is evaluated only at values of x Nx. Anoter onesided approximation would be D u. Nx/ u. Nx/ u. Nx / : (.) 3
2 4 Capter. Finite Difference Approximations slope D C u. Nx/ slope u 0. Nx/ slope D u. Nx/ slope D 0 u. Nx/ Nx Nx Nx C u.x/ Figure.. Various approximations to u 0. Nx/ interpreted as te slope of secant lines. Eac of tese formulas gives a first order accurate approximation to u 0. Nx/, meaning tat te size of te error is rougly proportional to itself. Anoter possibility is to use te centered approximation u. Nx C / u. Nx / D 0 u. Nx/ D.D Cu. Nx/ C D u. Nx//: (.3) Tis is te slope of te line interpolating u at Nx and Nx C and is simply te average of te two onesided approximations defined above. From Figure. it sould be clear tat we would expect D 0 u. Nx/ to give a better approximation tan eiter of te onesided approximations. In fact tis gives a second order accurate approximation te error is proportional to and ence is muc smaller tan te error in a first order approximation wen is small. Oter approximations are also possible, for example, D 3 u. Nx/ Œu. Nx C / C 3u. Nx/ 6u. Nx / C u. Nx / : (.4) 6 It may not be clear were tis came from or wy it sould approximate u 0 at all, but in fact it turns out to be a tird order accurate approximation te error is proportional to 3 wen is small. Our first goal is to develop systematic ways to derive suc formulas and to analyze teir accuracy and relative wort. First we will look at a typical example of ow te errors in tese formulas compare. Example.. Let u.x/ D sin.x/ and Nx D ; tus we are trying to approximate u 0./ D cos./ D 0: Table. sows te error Du. Nx/ u 0. Nx/ for various values of for eac of te formulas above. We see tat D C u and D u beave similarly altoug one exibits an error tat is rougly te negative of te oter. Tis is reasonable from Figure. and explains wy D 0 u, te average of te two, as an error tat is muc smaller tan bot.
3 0 D C Copyrigt 007 by te Society for Industrial and Applied Matematics 5 Table.. Errors in various finite difference approximations to u 0. Nx/. D C u. Nx/ D u. Nx/ D 0 u. Nx/ D 3 u. Nx/.0e e e e e e 0.57e e 0.50e e 06.0e e e e e e e 03.04e 03.53e e 09.0e e e e e We see tat D C u. Nx/ u 0. Nx/ 0:4; D 0 u. Nx/ u 0. Nx/ 0:09 ; D 3 u. Nx/ u 0. Nx/ 0:007 3 ; confirming tat tese metods are first order, second order, and tird order accurate, respectively. Figure. sows tese errors plotted against on a loglog scale. Tis is a good way to plot errors wen we expect tem to beave like some power of, since if te error E./ beaves like E./ C p ; ten logje./j log jc jcplog : So on a loglog scale te error beaves linearly wit a slope tat is equal to p, te order of accuracy D D Figure.. Te errors in Du. Nx/ from Table. plotted against on a loglog scale.
4 6 Capter. Finite Difference Approximations. Truncation errors Te standard approac to analyzing te error in a finite difference approximation is to expand eac of te function values of u in a Taylor series about te point Nx, e.g., u. Nx C / D u. Nx/ C u 0. Nx/ C u 00. Nx/ C 6 3 u 000. Nx/ C O. 4 /; (.5a) u. Nx / D u. Nx/ u 0. Nx/ C u 00. Nx/ 6 3 u 000. Nx/ C O. 4 /: (.5b) Tese expansions are valid provided tat u is sufficiently smoot. Readers unfamiliar wit te bigo notation O. 4 / are advised to read Section A. of Appendix A at tis point since tis notation will be eavily used and a proper understanding of its use is critical. Using (.5a) allows us to compute tat u. Nx C / D C u. Nx/ D u. Nx/ D u 0. Nx/ C u00. Nx/ C 6 u 000. Nx/ C O. 3 /: Recall tat Nx is a fixed point so tat u 00. Nx/; u 000. Nx/, etc., are fixed constants independent of. Tey depend on u of course, but te function is also fixed as we vary. For sufficiently small, te error will be dominated by te first term u00. Nx/ and all te oter terms will be negligible compared to tis term, so we expect te error to beave rougly like a constant times, were te constant as te value u00. Nx/. Note tat in Example., were u.x/ D sin x, weave u00./ D 0:407355, wic agrees wit te beavior seen in Table.. Similarly, from (.5b) we can compute tat te error in D u. Nx/ is D u. Nx/ u 0. Nx/ D u00. Nx/ C 6 u 000. Nx/ C O. 3 /; wic also agrees wit our expectations. Combining (.5a) and (.5b) sows tat u. Nx C / u. Nx / D u 0. Nx/ C 3 3 u 000. Nx/ C O. 5 / so tat D 0 u. Nx/ u 0. Nx/ D 6 u 000. Nx/ C O. 4 /: (.6) Tis confirms te second order accuracy of tis approximation and again agrees wit wat is seen in Table., since in te context of Example. we ave 6 u000. Nx/ D cos./ D 0: : 6 Note tat all te odd order terms drop out of te Taylor series expansion (.6) for D 0 u. Nx/. Tis is typical wit centered approximations and typically leads to a iger order approximation. To analyze D 3 u we need to also expand u. Nx / as u. Nx / D u. Nx/ u 0. Nx/ C./ u 00. Nx/ 6./3 u 000. Nx/ C O. 4 /: (.7)
5 .. Deriving finite difference approximations 7 Combining tis wit (.5a) and (.5b) sows tat D 3 u. Nx/ D u 0. Nx/ C 3 u.4/. Nx/ C O. 4 /; (.8) were u.4/ is te fourt derivative of u.. Deriving finite difference approximations Suppose we want to derive a finite difference approximation to u 0. Nx/ based on some given set of points. We can use Taylor series to derive an appropriate formula, using te metod of undetermined coefficients. Example.. Suppose we want a onesided approximation to u 0. Nx/ based on u. Nx/; u. Nx /, and u. Nx / of te form D u. Nx/ D au. Nx/ C bu. Nx / C cu. Nx /: (.9) We can determine te coefficients a; b, and c to give te best possible accuracy by expanding in Taylor series and collecting terms. Using (.5b) and (.7) in (.9) gives D u. Nx/ D.a C b C c/u. Nx/.b C c/u 0. Nx/ C.b C 4c/ u 00. Nx/ 6.b C 8c/3 u 000. Nx/ C: If tis is going to agree wit u 0. Nx/ to ig order, ten we need a C b C c D 0; b C c D =; (.0) b C 4c D 0: We migt like to require tat iger order coefficients be zero as well, but since tere are only tree unknowns a; b; and c, we cannot in general ope to satisfy more tan tree suc conditions. Solving te linear system (.0) gives so tat te formula is a D 3=; b D =; c D = D u. Nx/ D Œ3u. Nx/ 4u. Nx / C u. Nx / : (.) Tis approximation is used, for example, in te system of equations (.57) for a point boundary value problem wit a Neumann boundary condition at te left boundary. Te error in tis approximation is D u. Nx/ u 0. Nx/ D 6.b C 8c/3 u 000. Nx/ C D u 000. Nx/ C O. 3 /: (.)
6 8 Capter. Finite Difference Approximations Tere are oter ways to derive te same finite difference approximations. One way is to approximate te function u.x/ by some polynomial p.x/ and ten use p 0. Nx/ as an approximation to u 0. Nx/. If we determine te polynomial by interpolating u at an appropriate set of points, ten we obtain te same finite difference metods as above. Example.3. To derive te metod of Example. in tis way, let p.x/ be te quadratic polynomial tat interpolates u at Nx, Nx and Nx, and ten compute p 0. Nx/. Te result is exactly (.)..3 Second order derivatives Approximations to te second derivative u 00.x/ can be obtained in an analogous manner. Te standard second order centered approximation is given by D u. Nx/ D Œu. Nx / u. Nx/ C u. Nx C / D u 00. Nx/ C u Nx/ C O. 4 /: (.3) Again, since tis is a symmetric centered approximation, all te odd order terms drop out. Tis approximation can also be obtained by te metod of undetermined coefficients, or alternatively by computing te second derivative of te quadratic polynomial interpolating u.x/ at Nx ; Nx, and Nx C, as is done in Example.4 below for te more general case of unequally spaced points. Anoter way to derive approximations to iger order derivatives is by repeatedly applying first order differences. Just as te second derivative is te derivative of u 0, we can view D u. Nx/ as being a difference of first differences. In fact, since Copyrigt 007 by te Society for Industrial and Applied Matematics D u. Nx/ D D C D u. Nx/ D C.D u. Nx// D ŒD u. Nx C / D u. Nx C / D D u. Nx/: D u. Nx/ u. Nx/ u. Nx/ u. Nx / Q3 Alternatively, D. Nx/ D D D C u. Nx/, or we can also view it as a centered difference of centered differences, if we use a step size = in eac centered approximation to te first derivative. If we define OD 0 u.x/ D u x C u x ; ten we find tat OD 0. OD 0 u. Nx// D u. Nx C / u. Nx/ u. Nx/ u. Nx / D D u. Nx/:
7 .4. Higer order derivatives 9 Example.4. Suppose we want to approximate u 00.x / based on data values U, U, and U 3, at tree unequally spaced points x ; x, and x 3. Tis approximation will be used in Section.8. Let D x x and D x 3 x. Te approximation can be found by interpolating by a quadratic function and differentiating twice. Using te Newton form of te interpolating polynomial (see Section B..3), p.x/ D U Œx C U Œx ; x.x x / C U Œx ; x ; x 3.x x /.x x /; we see tat te second derivative is constant and equal to twice te second order divided difference, p 00.x / D U Œx ; x ; x 3, U3 U U U D. C / (.4) were c D. C / ; D c U C c U C c 3 U 3 ; c D ; c 3 D. C / : (.5) Tis would be our approximation to u 00.x /. Te same result can be found by te metod of undetermined coefficients. To compute te error in tis approximation, we can expand u.x / and u.x 3 / in Taylor series about x and find tat c u.x / C c u.x / C c 3 u.x 3 / u 00.x / D 3. /u.3/.x / C 3 C! 3 u.4/.x / C: C (.6) In general, if, te error is proportional to max. ; / and tis approximation is first order accurate. In te special case D (equally spaced points), te approximation (.4) reduces to te standard centered approximate D u.x / from (.3) wit te second order error sown tere..4 Higer order derivatives Finite difference approximations to iger order derivatives can also be obtained using any of te approaces outlined above. Repeatedly differencing approximations to lower order derivatives is a particularly simple approac. Example.5. As an example, ere are two different approximations to u 000. Nx/. Te first is uncentered and first order accurate: D C D u. Nx/ D.u. Nx C / 3u. Nx C / C 3u. Nx/ u. Nx // 3 D u 000. Nx/ C u0000. Nx/ C O. /:
8 0 Capter. Finite Difference Approximations Te next approximation is centered and second order accurate: D 0 D C D u. Nx/ D.u. Nx C / u. Nx C / C u. Nx / u. Nx // 3 D u 000. Nx/ C 4 u Nx/ C O. 4 /: Anoter way to derive finite difference approximations to iger order derivatives is by interpolating wit a sufficiently ig order polynomial based on function values at te desired stencil points and ten computing te appropriate derivative of tis polynomial. Tis is generally a cumbersome way to do it. A simpler approac tat lends itself well to automation is to use te metod of undetermined coefficients, as illustrated in Section. for an approximation to te first order derivative and explained more generally in te next section..5 A general approac to deriving te coefficients Te metod illustrated in Section. can be extended to compute te finite difference coefficients for computing an approximation to u.k/. Nx/, te kt derivative of u.x/ evaluated at Nx, based on an arbitrary stencil of n k C points x ; :::; x n. Usually Nx is one of te stencil points, but not necessarily. We assume u.x/ is sufficiently smoot, namely, at least n C times continuously differentiable in te interval containing Nx and all te stencil points, so tat te Taylor series expansions below are valid. Taylor series expansions of u at eac point x i in te stencil about u. Nx/ yield u.x i / D u. Nx/ C.x i Nx/u 0. Nx/ CC k!.x i Nx/ k u.k/. Nx/ C (.7) for i D ; :::; n. We want to find a linear combination of tese values tat agrees wit u.k/. Nx/ as well as possible. So we want c u.x / C c u.x / CCc n u.x n / D u.k/. Nx/ C O. p /; (.8) were p is as large as possible. (Here is some measure of te widt of te stencil. If we are deriving approximations on stencils wit equally spaced points, ten is te mes widt, but more generally it is some average mes widt, so tat max in jx i Nxj C for some small constant C.) Following te approac of Section., we coose te coefficients c j so tat.i /! nx c j.x j Nx/.i / D jd if i D k; 0 oterwise (.9) for i D ; :::; n. Provided te points x j are distinct, tis n n Vandermonde system is nonsingular and as a unique solution. If n k (too few points in te stencil), ten te rigtand side and solution are bot te zero vector, but for n > k te coefficients give a suitable finite difference approximation.
9 .5. A general approac to deriving te coefficients Q4 How accurate is te metod? Te rigtand side vector as a in te i D k C row, wic ensures tat tis linear combination approximates te kt derivative. Te 0 in te oter component of te rigtand side ensures tat te terms 0 c j.x j Nx/.i / A u.i /. Nx/ jd drop out in te linear combination of Taylor series for i k. For i < k tis is necessary to get even first order accuracy of te finite difference approximation. For i > k (wic is possible only if n > k C ), tis gives cancellation of iger order terms in te expansion and greater tan first order accuracy. In general we expect te order of accuracy of te finite difference approximation to be at least p n k. It may be even iger if iger order terms appen to cancel out as well (as often appens wit centered approximations, for example). In MATLAB it is very easy to set up and solve tis Vandermonde system. If xbar is te point Nx and x(:n) are te desired stencil points, ten te following function can be used to compute te coefficients: function c = fdcoeffv(k,xbar,x) A = ones(n,n); xrow = (x(:)xbar) ; % displacements as a row vector. for i=:n A(i,:) = (xrow.ˆ (i))./ factorial(i); end b = zeros(n,); % b is rigt and side, b(k+) = ; % so k t derivative term remains c = A\b; % solve system for coefficients c = c ; % row vector If u is a column vector of n values u.x i /, ten in MATLAB te resulting approximation to u.k/. Nx/ can be computed by c*u. Tis function is implemented in te MATLAB function fdcoeffv.m available on te Web page for tis book, wic contains more documentation and data cecking but is essentially te same as te above code. A row vector is returned since in applications we will often use te output of tis routine as te row of a matrix approximating a differential operator (see Section.8, for example). Unfortunately, for a large number of points tis Vandermonde procedure is numerically unstable because te resulting linear system can be very poorly conditioned. A more stable procedure for calculating te weigts is given by Fornberg [8], wo also gives a FORTRAN implementation. Tis modified procedure is implemented in te MATLAB function fdcoefff.m on te Web page. Finite difference approximations of te sort derived in tis capter form te basis for finite difference algoritms for solving differential equations. In te next capter we begin te study of tis topic.
Verifying Numerical Convergence Rates
1 Order of accuracy Verifying Numerical Convergence Rates We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, suc as te grid size or time step, and
More informationFINITE DIFFERENCE METHODS
FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to
More information7.6 Complex Fractions
Section 7.6 Comple Fractions 695 7.6 Comple Fractions In tis section we learn ow to simplify wat are called comple fractions, an eample of wic follows. 2 + 3 Note tat bot te numerator and denominator are
More informationIn other words the graph of the polynomial should pass through the points
Capter 3 Interpolation Interpolation is te problem of fitting a smoot curve troug a given set of points, generally as te grap of a function. It is useful at least in data analysis (interpolation is a form
More informationFinite Volume Discretization of the Heat Equation
Lecture Notes 3 Finite Volume Discretization of te Heat Equation We consider finite volume discretizations of te onedimensional variable coefficient eat equation, wit Neumann boundary conditions u t x
More informationLecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function
Lecture 10: Wat is a Function, definition, piecewise defined functions, difference quotient, domain of a function A function arises wen one quantity depends on anoter. Many everyday relationsips between
More informationDerivatives Math 120 Calculus I D Joyce, Fall 2013
Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te
More informationSection 3.3. Differentiation of Polynomials and Rational Functions. Difference Equations to Differential Equations
Difference Equations to Differential Equations Section 3.3 Differentiation of Polynomials an Rational Functions In tis section we begin te task of iscovering rules for ifferentiating various classes of
More informationLecture 10. Limits (cont d) Onesided limits. (Relevant section from Stewart, Seventh Edition: Section 2.4, pp. 113.)
Lecture 10 Limits (cont d) Onesided its (Relevant section from Stewart, Sevent Edition: Section 2.4, pp. 113.) As you may recall from your earlier course in Calculus, we may define onesided its, were
More informationMATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1  BASIC DIFFERENTIATION
MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1  BASIC DIFFERENTIATION Tis tutorial is essential prerequisite material for anyone stuing mecanical engineering. Tis tutorial uses te principle of
More informationACT Math Facts & Formulas
Numbers, Sequences, Factors Integers:..., 3, 2, 1, 0, 1, 2, 3,... Rationals: fractions, tat is, anyting expressable as a ratio of integers Reals: integers plus rationals plus special numbers suc as
More informationChapter 7 Numerical Differentiation and Integration
45 We ave a abit in writing articles publised in scientiþc journals to make te work as Þnised as possible, to cover up all te tracks, to not worry about te blind alleys or describe ow you ad te wrong idea
More informationInstantaneous Rate of Change:
Instantaneous Rate of Cange: Last section we discovered tat te average rate of cange in F(x) can also be interpreted as te slope of a scant line. Te average rate of cange involves te cange in F(x) over
More informationSAT Subject Math Level 1 Facts & Formulas
Numbers, Sequences, Factors Integers:..., 3, 2, 1, 0, 1, 2, 3,... Reals: integers plus fractions, decimals, and irrationals ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences: PEMDAS (Parenteses
More informationMath 113 HW #5 Solutions
Mat 3 HW #5 Solutions. Exercise.5.6. Suppose f is continuous on [, 5] and te only solutions of te equation f(x) = 6 are x = and x =. If f() = 8, explain wy f(3) > 6. Answer: Suppose we ad tat f(3) 6. Ten
More informationGeometric Stratification of Accounting Data
Stratification of Accounting Data Patricia Gunning * Jane Mary Horgan ** William Yancey *** Abstract: We suggest a new procedure for defining te boundaries of te strata in igly skewed populations, usual
More informationExercises for numerical integration. Øyvind Ryan
Exercises for numerical integration Øyvind Ryan February 25, 21 1. Vi ar r(t) = (t cos t, t sin t, t) Solution: Koden blir % Oppgave.1.11 b) quad(@(x)sqrt(2+t.^2),,2*pi) a. Finn astigeten, farten og akselerasjonen.
More informationf(a + h) f(a) f (a) = lim
Lecture 7 : Derivative AS a Function In te previous section we defined te derivative of a function f at a number a (wen te function f is defined in an open interval containing a) to be f (a) 0 f(a + )
More information1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution
1.6 Analyse Optimum Volume and Surface Area Estimation and oter informal metods of optimizing measures suc as surface area and volume often lead to reasonable solutions suc as te design of te tent in tis
More informationCHAPTER 7. Di erentiation
CHAPTER 7 Di erentiation 1. Te Derivative at a Point Definition 7.1. Let f be a function defined on a neigborood of x 0. f is di erentiable at x 0, if te following it exists: f 0 fx 0 + ) fx 0 ) x 0 )=.
More informationThe EOQ Inventory Formula
Te EOQ Inventory Formula James M. Cargal Matematics Department Troy University Montgomery Campus A basic problem for businesses and manufacturers is, wen ordering supplies, to determine wat quantity of
More informationThe modelling of business rules for dashboard reporting using mutual information
8 t World IMACS / MODSIM Congress, Cairns, Australia 37 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,
More informationTangent Lines and Rates of Change
Tangent Lines and Rates of Cange 922005 Given a function y = f(x), ow do you find te slope of te tangent line to te grap at te point P(a, f(a))? (I m tinking of te tangent line as a line tat just skims
More information1 Derivatives of Piecewise Defined Functions
MATH 1010E University Matematics Lecture Notes (week 4) Martin Li 1 Derivatives of Piecewise Define Functions For piecewise efine functions, we often ave to be very careful in computing te erivatives.
More informationSections 3.1/3.2: Introducing the Derivative/Rules of Differentiation
Sections 3.1/3.2: Introucing te Derivative/Rules of Differentiation 1 Tangent Line Before looking at te erivative, refer back to Section 2.1, looking at average velocity an instantaneous velocity. Here
More informationThe Derivative as a Function
Section 2.2 Te Derivative as a Function 200 Kiryl Tsiscanka Te Derivative as a Function DEFINITION: Te derivative of a function f at a number a, denoted by f (a), is if tis limit exists. f (a) f(a+) f(a)
More informationAverage and Instantaneous Rates of Change: The Derivative
9.3 verage and Instantaneous Rates of Cange: Te Derivative 609 OBJECTIVES 9.3 To define and find average rates of cange To define te derivative as a rate of cange To use te definition of derivative to
More informationNote nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1
Copyrigt c Sanjoy Dasgupta Figure. (a) Te feasible region for a linear program wit two variables (see tet for details). (b) Contour lines of te objective function: for different values of (profit). Te
More informationSurface Areas of Prisms and Cylinders
12.2 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS G.10.B G.11.C Surface Areas of Prisms and Cylinders Essential Question How can you find te surface area of a prism or a cylinder? Recall tat te surface area of
More information2 Limits and Derivatives
2 Limits and Derivatives 2.7 Tangent Lines, Velocity, and Derivatives A tangent line to a circle is a line tat intersects te circle at exactly one point. We would like to take tis idea of tangent line
More informationDetermine the perimeter of a triangle using algebra Find the area of a triangle using the formula
Student Name: Date: Contact Person Name: Pone Number: Lesson 0 Perimeter, Area, and Similarity of Triangles Objectives Determine te perimeter of a triangle using algebra Find te area of a triangle using
More informationCatalogue no. 12001XIE. Survey Methodology. December 2004
Catalogue no. 1001XIE Survey Metodology December 004 How to obtain more information Specific inquiries about tis product and related statistics or services sould be directed to: Business Survey Metods
More informationf(x + h) f(x) h as representing the slope of a secant line. As h goes to 0, the slope of the secant line approaches the slope of the tangent line.
Derivative of f(z) Dr. E. Jacobs Te erivative of a function is efine as a limit: f (x) 0 f(x + ) f(x) We can visualize te expression f(x+) f(x) as representing te slope of a secant line. As goes to 0,
More informationMath Test Sections. The College Board: Expanding College Opportunity
Taking te SAT I: Reasoning Test Mat Test Sections Te materials in tese files are intended for individual use by students getting ready to take an SAT Program test; permission for any oter use must be sougt
More informationThe differential amplifier
DiffAmp.doc 1 Te differential amplifier Te emitter coupled differential amplifier output is V o = A d V d + A c V C Were V d = V 1 V 2 and V C = (V 1 + V 2 ) / 2 In te ideal differential amplifier A c
More informationCollege Planning Using Cash Value Life Insurance
College Planning Using Cas Value Life Insurance CAUTION: Te advisor is urged to be extremely cautious of anoter college funding veicle wic provides a guaranteed return of premium immediately if funded
More informationCan a LumpSum Transfer Make Everyone Enjoy the Gains. from Free Trade?
Can a LumpSum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lumpsum transfer rules to redistribute te
More informationDifferential Calculus: Differentiation (First Principles, Rules) and Sketching Graphs (Grade 12)
OpenStaxCNX moule: m39313 1 Differential Calculus: Differentiation (First Principles, Rules) an Sketcing Graps (Grae 12) Free Hig Scool Science Texts Project Tis work is prouce by OpenStaxCNX an license
More informationM(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1)
Insertion and Deletion in VL Trees Submitted in Partial Fulfillment of te Requirements for Dr. Eric Kaltofen s 66621: nalysis of lgoritms by Robert McCloskey December 14, 1984 1 ackground ccording to Knut
More informationWriting Mathematics Papers
Writing Matematics Papers Tis essay is intended to elp your senior conference paper. It is a somewat astily produced amalgam of advice I ave given to students in my PDCs (Mat 4 and Mat 9), so it s not
More informationAn Interest Rate Model
An Interest Rate Model Concepts and Buzzwords Building Price Tree from Rate Tree Lognormal Interest Rate Model Nonnegativity Volatility and te Level Effect Readings Tuckman, capters 11 and 12. Lognormal
More informationComputer Science and Engineering, UCSD October 7, 1999 GoldreicLevin Teorem Autor: Bellare Te GoldreicLevin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an nbit
More informationA Multigrid Tutorial part two
A Multigrid Tutorial part two William L. Briggs Department of Matematics University of Colorado at Denver Van Emden Henson Center for Applied Scientific Computing Lawrence Livermore National Laboratory
More information13 PERIMETER AND AREA OF 2D SHAPES
13 PERIMETER AND AREA OF D SHAPES 13.1 You can find te perimeter of sapes Key Points Te perimeter of a twodimensional (D) sape is te total distance around te edge of te sape. l To work out te perimeter
More informationNew Vocabulary volume
. Plan Objectives To find te volume of a prism To find te volume of a cylinder Examples Finding Volume of a Rectangular Prism Finding Volume of a Triangular Prism 3 Finding Volume of a Cylinder Finding
More informationArea of a Parallelogram
Area of a Parallelogram Focus on After tis lesson, you will be able to... φ develop te φ formula for te area of a parallelogram calculate te area of a parallelogram One of te sapes a marcing band can make
More information4.1 Rightangled Triangles 2. 4.2 Trigonometric Functions 19. 4.3 Trigonometric Identities 36. 4.4 Applications of Trigonometry to Triangles 53
ontents 4 Trigonometry 4.1 Rigtangled Triangles 4. Trigonometric Functions 19 4.3 Trigonometric Identities 36 4.4 pplications of Trigonometry to Triangles 53 4.5 pplications of Trigonometry to Waves 65
More informationResearch on the Antiperspective Correction Algorithm of QR Barcode
Researc on te Antiperspective Correction Algoritm of QR Barcode Jianua Li, YiWen Wang, YiJun Wang,Yi Cen, Guoceng Wang Key Laboratory of Electronic Tin Films and Integrated Devices University of Electronic
More informationTheoretical calculation of the heat capacity
eoretical calculation of te eat capacity Principle of equipartition of energy Heat capacity of ideal and real gases Heat capacity of solids: DulongPetit, Einstein, Debye models Heat capacity of metals
More informationPressure. Pressure. Atmospheric pressure. Conceptual example 1: Blood pressure. Pressure is force per unit area:
Pressure Pressure is force per unit area: F P = A Pressure Te direction of te force exerted on an object by a fluid is toward te object and perpendicular to its surface. At a microscopic level, te force
More information 1  Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz
CS106B Spring 01 Handout # May 3, 01 Huffman Encoding and Data Compression Handout by Julie Zelenski wit minor edits by Keit Scwarz In te early 1980s, personal computers ad ard disks tat were no larger
More informationChapter 10: Refrigeration Cycles
Capter 10: efrigeration Cycles Te vapor compression refrigeration cycle is a common metod for transferring eat from a low temperature to a ig temperature. Te above figure sows te objectives of refrigerators
More informationNotes: Most of the material in this chapter is taken from Young and Freedman, Chap. 12.
Capter 6. Fluid Mecanics Notes: Most of te material in tis capter is taken from Young and Freedman, Cap. 12. 6.1 Fluid Statics Fluids, i.e., substances tat can flow, are te subjects of tis capter. But
More informationReinforced Concrete Beam
Mecanics of Materials Reinforced Concrete Beam Concrete Beam Concrete Beam We will examine a concrete eam in ending P P A concrete eam is wat we call a composite eam It is made of two materials: concrete
More informationThe Dynamics of Movie Purchase and Rental Decisions: Customer Relationship Implications to Movie Studios
Te Dynamics of Movie Purcase and Rental Decisions: Customer Relationsip Implications to Movie Studios Eddie Ree Associate Professor Business Administration Stoneill College 320 Wasington St Easton, MA
More informationProjective Geometry. Projective Geometry
Euclidean versus Euclidean geometry describes sapes as tey are Properties of objects tat are uncanged by rigid motions» Lengts» Angles» Parallelism Projective geometry describes objects as tey appear Lengts,
More informationCHAPTER 8: DIFFERENTIAL CALCULUS
CHAPTER 8: DIFFERENTIAL CALCULUS 1. Rules of Differentiation As we ave seen, calculating erivatives from first principles can be laborious an ifficult even for some relatively simple functions. It is clearly
More informationShell and Tube Heat Exchanger
Sell and Tube Heat Excanger MECH595 Introduction to Heat Transfer Professor M. Zenouzi Prepared by: Andrew Demedeiros, Ryan Ferguson, Bradford Powers November 19, 2009 1 Abstract 2 Contents Discussion
More informationis called the geometric transformation. In computers the world is represented by numbers; thus geometrical properties and transformations must
Capter 5 TRANSFORMATIONS, CLIPPING AND PROJECTION 5.1 Geometric transformations Treedimensional grapics aims at producing an image of 3D objects. Tis means tat te geometrical representation of te image
More informationA strong credit score can help you score a lower rate on a mortgage
NET GAIN Scoring points for your financial future AS SEEN IN USA TODAY S MONEY SECTION, JULY 3, 2007 A strong credit score can elp you score a lower rate on a mortgage By Sandra Block Sales of existing
More information2.1: The Derivative and the Tangent Line Problem
.1.1.1: Te Derivative and te Tangent Line Problem Wat is te deinition o a tangent line to a curve? To answer te diiculty in writing a clear deinition o a tangent line, we can deine it as te iting position
More information1 The Collocation Method
CS410 Assignment 7 Due: 1/5/14 (Fri) at 6pm You must wor eiter on your own or wit one partner. You may discuss bacground issues and general solution strategies wit oters, but te solutions you submit must
More informationAn inquiry into the multiplier process in ISLM model
An inquiry into te multiplier process in ISLM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 0062763074 Internet Address: jefferson@water.pu.edu.cn
More informationDistances in random graphs with infinite mean degrees
Distances in random graps wit infinite mean degrees Henri van den Esker, Remco van der Hofstad, Gerard Hoogiemstra and Dmitri Znamenski April 26, 2005 Abstract We study random graps wit an i.i.d. degree
More informationSWITCH T F T F SELECT. (b) local schedule of two branches. (a) ifthenelse construct A & B MUX. one iteration cycle
768 IEEE RANSACIONS ON COMPUERS, VOL. 46, NO. 7, JULY 997 Compileime Sceduling of Dynamic Constructs in Dataæow Program Graps Soonoi Ha, Member, IEEE and Edward A. Lee, Fellow, IEEE Abstract Sceduling
More informationOptimized Data Indexing Algorithms for OLAP Systems
Database Systems Journal vol. I, no. 2/200 7 Optimized Data Indexing Algoritms for OLAP Systems Lucian BORNAZ Faculty of Cybernetics, Statistics and Economic Informatics Academy of Economic Studies, Bucarest
More informationON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE
ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE Byeong U. Park 1 and Young Kyung Lee 2 Department of Statistics, Seoul National University, Seoul, Korea Tae Yoon Kim 3 and Ceolyong Park
More informationGuide to Cover Letters & Thank You Letters
Guide to Cover Letters & Tank You Letters 206 Strebel Student Center (315) 7923087 Fax (315) 7923370 TIPS FOR WRITING A PERFECT COVER LETTER Te resume never travels alone. Eac time you submit your resume
More informationBinary Search Trees. Adnan Aziz. Heaps can perform extractmax, insert efficiently O(log n) worst case
Binary Searc Trees Adnan Aziz 1 BST basics Based on CLRS, C 12. Motivation: Heaps can perform extractmax, insert efficiently O(log n) worst case Has tables can perform insert, delete, lookup efficiently
More informationComparison between two approaches to overload control in a Real Server: local or hybrid solutions?
Comparison between two approaces to overload control in a Real Server: local or ybrid solutions? S. Montagna and M. Pignolo Researc and Development Italtel S.p.A. Settimo Milanese, ITALY Abstract Tis wor
More informationSAMPLE DESIGN FOR THE TERRORISM RISK INSURANCE PROGRAM SURVEY
ASA Section on Survey Researc Metods SAMPLE DESIG FOR TE TERRORISM RISK ISURACE PROGRAM SURVEY G. ussain Coudry, Westat; Mats yfjäll, Statisticon; and Marianne Winglee, Westat G. ussain Coudry, Westat,
More informationWhat is Advanced Corporate Finance? What is finance? What is Corporate Finance? Deciding how to optimally manage a firm s assets and liabilities.
Wat is? Spring 2008 Note: Slides are on te web Wat is finance? Deciding ow to optimally manage a firm s assets and liabilities. Managing te costs and benefits associated wit te timing of cas in and outflows
More informationSolutions by: KARATUĞ OZAN BiRCAN. PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set in
KOÇ UNIVERSITY, SPRING 2014 MATH 401, MIDTERM1, MARCH 3 Instructor: BURAK OZBAGCI TIME: 75 Minutes Solutions by: KARATUĞ OZAN BiRCAN PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set
More informationLecture Notes 3 SteadyState Flow of Ground Water in Sedimentary Basins
Lecture Notes 3 SteadyState Flow of Ground Water in Sedimentary Basins TopograpyDriven Flow Among te several mecanisms tat drive te flow of ground water in sedimentary basins, topograpy ranks as one
More informationCyber Epidemic Models with Dependences
Cyber Epidemic Models wit Dependences Maocao Xu 1, Gaofeng Da 2 and Souuai Xu 3 1 Department of Matematics, Illinois State University mxu2@ilstu.edu 2 Institute for Cyber Security, University of Texas
More informationVolumes of Pyramids and Cones. Use the Pythagorean Theorem to find the value of the variable. h 2 m. 1.5 m 12 in. 8 in. 2.5 m
5 Wat You ll Learn To find te volume of a pramid To find te volume of a cone... And W To find te volume of a structure in te sape of a pramid, as in Eample Volumes of Pramids and Cones Ceck Skills You
More informationStrategic trading in a dynamic noisy market. Dimitri Vayanos
LSE Researc Online Article (refereed) Strategic trading in a dynamic noisy market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt and Moral
More informationSchedulability Analysis under Graph Routing in WirelessHART Networks
Scedulability Analysis under Grap Routing in WirelessHART Networks Abusayeed Saifulla, Dolvara Gunatilaka, Paras Tiwari, Mo Sa, Cenyang Lu, Bo Li Cengjie Wu, and Yixin Cen Department of Computer Science,
More informationSome Notes on Taylor Polynomials and Taylor Series
Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited
More informationTraining Robust Support Vector Regression via D. C. Program
Journal of Information & Computational Science 7: 12 (2010) 2385 2394 Available at ttp://www.joics.com Training Robust Support Vector Regression via D. C. Program Kuaini Wang, Ping Zong, Yaoong Zao College
More informationSAT Math MustKnow Facts & Formulas
SAT Mat MustKnow Facts & Formuas Numbers, Sequences, Factors Integers:..., 3, 2, 1, 0, 1, 2, 3,... Rationas: fractions, tat is, anyting expressabe as a ratio of integers Reas: integers pus rationas
More informationSimilar interpretations can be made for total revenue and total profit functions.
EXERCISE 37 Tings to remember: 1. MARGINAL COST, REVENUE, AND PROFIT If is te number of units of a product produced in some time interval, ten: Total Cost C() Marginal Cost C'() Total Revenue R() Marginal
More informationStrategic trading and welfare in a dynamic market. Dimitri Vayanos
LSE Researc Online Article (refereed) Strategic trading and welfare in a dynamic market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt
More informationWarm medium, T H T T H T L. s Cold medium, T L
Refrigeration Cycle Heat flows in direction of decreasing temperature, i.e., from igtemperature to low temperature regions. Te transfer of eat from a lowtemperature to igtemperature requires a refrigerator
More informationMultigrid computational methods are
M ULTIGRID C OMPUTING Wy Multigrid Metods Are So Efficient Originally introduced as a way to numerically solve elliptic boundaryvalue problems, multigrid metods, and teir various multiscale descendants,
More informationOPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS
OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS ERIC T. CHUNG AND BJÖRN ENGQUIST Abstract. In tis paper, we developed and analyzed a new class of discontinuous
More information2.28 EDGE Program. Introduction
Introduction Te Economic Diversification and Growt Enterprises Act became effective on 1 January 1995. Te creation of tis Act was to encourage new businesses to start or expand in Newfoundland and Labrador.
More information3 Polynomial Interpolation
3 Polynomial Interpolation Read sections 7., 7., 7.3. 7.3.3 (up to p. 39), 7.3.5. Review questions 7. 7.4, 7.8 7.0, 7. 7.4, 7.7, 7.8. All methods for solving ordinary differential equations which we considered
More informationSAT Math Facts & Formulas
Numbers, Sequences, Factors SAT Mat Facts & Formuas Integers:..., 3, 2, 1, 0, 1, 2, 3,... Reas: integers pus fractions, decimas, and irrationas ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences:
More informationArea of Trapezoids. Find the area of the trapezoid. 7 m. 11 m. 2 Use the Area of a Trapezoid. Find the value of b 2
Page 1 of. Area of Trapezoids Goal Find te area of trapezoids. Recall tat te parallel sides of a trapezoid are called te bases of te trapezoid, wit lengts denoted by and. base, eigt Key Words trapezoid
More informationImproved dynamic programs for some batcing problems involving te maximum lateness criterion A P M Wagelmans Econometric Institute Erasmus University Rotterdam PO Box 1738, 3000 DR Rotterdam Te Neterlands
More informationChapter 11. Limits and an Introduction to Calculus. Selected Applications
Capter Limits and an Introduction to Calculus. Introduction to Limits. Tecniques for Evaluating Limits. Te Tangent Line Problem. Limits at Infinit and Limits of Sequences.5 Te Area Problem Selected Applications
More informationTHE NEISS SAMPLE (DESIGN AND IMPLEMENTATION) 1997 to Present. Prepared for public release by:
THE NEISS SAMPLE (DESIGN AND IMPLEMENTATION) 1997 to Present Prepared for public release by: Tom Scroeder Kimberly Ault Division of Hazard and Injury Data Systems U.S. Consumer Product Safety Commission
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for inclass presentation
More informationA FLOW NETWORK ANALYSIS OF A LIQUID COOLING SYSTEM THAT INCORPORATES MICROCHANNEL HEAT SINKS
A FLOW NETWORK ANALYSIS OF A LIQUID COOLING SYSTEM THAT INCORPORATES MICROCHANNEL HEAT SINKS Amir Radmer and Suas V. Patankar Innovative Researc, Inc. 3025 Harbor Lane Nort, Suite 300 Plymout, MN 55447
More information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More informationAn Intuitive Framework for RealTime Freeform Modeling
An Intuitive Framework for RealTime Freeform Modeling Mario Botsc Leif Kobbelt Computer Grapics Group RWTH Aacen University Abstract We present a freeform modeling framework for unstructured triangle
More informationLinear Dependence Tests
Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks
More information2.12 Student Transportation. Introduction
Introduction Figure 1 At 31 Marc 2003, tere were approximately 84,000 students enrolled in scools in te Province of Newfoundland and Labrador, of wic an estimated 57,000 were transported by scool buses.
More information