MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
|
|
- Domenic Miller
- 6 years ago
- Views:
Transcription
1 MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give eperimet. The epositio will begi with the study of simple aalytic procedures of costructio of empirical fuctioal depedeces usig the Method of Least Squares.. THE METHOD OF LEAST SQUARES. Let s suppose that as a result of a eecutio of a series of measuremets i a give eperimet, the followig data table was obtaied. Table f() y y y 3... y It is required to fid a formula that aalytically epresses this fuctioal depedece. Of course, we ca use Iterpolatio Methods, for istace, Lagrage s Iterpolatio Polyomial or Newto s Divided Differece Iterpolatio Formula, whose values at the iterpolatio odes,,...,, will match with Table s correspodig values of f(). Nevertheless, occasioally, this fuctio-ad-iterpolatio-value matchig at the give odes could ot mea a matchig of characters of behavior betwee f() ad the iterpolatio fuctio. The demad that these values should match at the odes is much more ujustified, if the values of f(), obtaied as a result of the give measuremets, are doubtful. We will formulate the problem so that from the begiig ad, for sure, the character of the give fuctio is actually cosidered, that is, we will fid the fuctio of type y = F() () at the poits,,...,, that best fits Table s y, y,..., y values. The type of fuctio F that best fits these data ca be defied as follows: usig Table, plot the poits of f o a coordiate plae ad sketch a smooth curve which reflects better the distributio character of the give poits (see Fig. ). The obtaied curve establishes the type of fuctio that best fits these data, that is, the best curve fittig for the give data. (It is frequetly oe of the simple aalytic fuctios) y 0 Fig..
2 It is fair to metio that a rigorous fuctioal depedece for Table s eperimetal data is seldom observed, sice each of the ivolved magitudes ca deped o may radom factors. Nevertheless, formula () (which is called empirical formula or regressio equatio of y o ) is of such a poit of iterest that allows to fid the values of f for values of that are ot i Table, fittig i that way the results of the measuremets for the correspodig y-magitude. This approach is justified due to the practical utility of the obtaied formula. We will eamie oe of the most widespread methods to fid formula (). We will assume that the approimatio fuctio F at,,...,, has values y, y,..., y. () The demad of proimity of Table s y, y,..., y values with values () is justified as follows: let s eamie the group of Table s values ad group () as the coordiates of two poits i a -dimesioal space. Uder this assumptio, the problem of fuctioal approimatio ca be formulated as follows: fid a fuctio F such that the distace betwee the poits M(y, y,..., y ) ad M( y is miimum. Usig the metric, y,..., y ) of a Euclidea Space, it is requir ed that the magitude ( y y ) + ( y y ) ( y y ) is miimum, which is equivalet to say that the sum of squares ( y y ) + ( y y ) ( y y ) (3) (4) is miimum. Thus, the problem of approimatig fuctio f ca ow be formulated as follows: for a fuctio f give i Table, fid a fuctio F of a certai type such that the sum of squares (4) is miimum. This problem is called Approimatio of f usig The Method of Least squares. As fuctios of approimatio, depedig o the graphical character of the poits of fuctio f, are usually used the followig oes:. y = a + b (Liear Regressio).. y = a + b + c (Regressio of Degree Two ). 3. y = a m (Power Fuctio or Geometric Regressio). 4. y = a.e m (Epoetial Fuctio). 5. y = /(a + b) (Liear Ratioal Fuctio). 6. y = a.l + b (Logarithmic Fuctio ). 7. y = (a/) + b (Hyperbola). 8. y = /(a + b) (Ratioal Fuctio). Where a, b, c, m are parameters. Whe the type of approimatio fuctio is established, the problem is reduced to fid ig the values of these parameters.
3 3 Let s eamie the method of fidig the parameters of a approimatio fuctio i the geeral case of a approimatio fuctio with three parameters, y i y = F(, a, b, c). (5) Thus F( i, a, b, c) =, i =,,...,. The sum of the square differeces for the correspodig values of f ad F ca be writte as i i i= [ y F(, a, b, c)] = Φ ( a, b, c). This sum is a fuctio Φ(a, b, c) of three variables: the parameters a, b, c. Thus, the problem is reduced to searchig a miimum. We will use the ecessary coditio for the eistece of a optimum: that is, i= i= i = Φ/ a = 0, Φ/ b = 0, Φ/ c = 0, ' [ y F(, a, b, c)] F (, a, b, c) = 0, i i a i ' [ y F(, a, b, c)] F (, a, b, c) = 0, (6) i i b i ' [ y F(, a, b, c)] F (, a, b, c) = 0. i i c i Resolvig this system of three equatio s with three ukows; the parameters a, b, c, we will obtai a cocrete type of the search fuctio F(, a, b, c). Note that the chage of the umber of parameters does ot alter the essece of approachig the problem, ad it is epressed oly i the chage of the umber of equatios of system (6). It is atural to epect that the values of the foud fuctio F(, a, b, c) at the poits,,..., will be differet of Table s y, y,..., y values. The values of the differeces y i - F( i, a, b, c) = ε i (i =,,...,) (7) are called deflectios (or deviatios) of the measured y-values i relatio to those oes calculated usig formula (5). For the foud empirical formula (5) ad i accordace with Table, the sum of the square deflectios ca be epressed as σ = ε i, (8) i= which, accordig to The Method of Least Squares for the give type of approimatio fuctio ad the values foud for parameters a, b, c, must be miimum.
4 4 Of two differet approimatios of the same tabulated fuctio usig The Method of Least Squares, it is cosidered better that oe for which the sum (8) has a miimum value.. FINDING THE TYPE OF APPROXIMATION FUNCTIONS CALLED LINEAR REGRESSION AND REGRESSION OF DEGREE TWO. Let s determie the approimatio fuctio called Liear Regressio, The partial derivatives with respect to the parameters are The system of type (6) ca be writte as F(, a, b) = a + b. (9) F/ a =, F/ b =. (y i - a i - b) i = 0, (y i - a i - b) = 0. (I the sum, ide i varies from to ). Thus we get: ad dividig each equatio by, Keepig i mid the followig desigatios: i y i - a i - b i = 0, (0) y i - a i - b = 0, i a + i b i yi =, i a + b = yi. i = M, y = M i y, i yi = My i = M,. () We coclude that the last system ca be writte as M a + M b M = y, () M a + b = M. y
5 5 The coefficiets M, M y, M, M y of system () are umbers that i each cocrete problem of approimatio ca easily be calculated usig formulae (), where i, y i are the values i Table. Let s determie the Secod Degree Approimatio Fuctio or Regressio of Degree Two, Its partial derivatives are Thus, the system of type (6) ca be writte as F(, a, b, c) = a + b + c. (3) F/ a =, F/ b =, F/ c =. (y i - a i - b i - c) i = 0, (y i - a i - b i - c) i = 0, (y i - a i - b i - c) = 0. After a series of trasformatios, we get a system of three liear equatios with ukows a, b, c. The system s coefficiets, as i the case of a liear regressio, are calculated usig Table s kow data, M a + M b + M c = M, 4 3 y 3 + y + + = y. M a + M b M c = M, (4) M a M b c M Here, we have used () ad also the followig desigatios: 4 3 i = M 4, M 3 y M i =, i i =. (5) y 3. FINDING THE OTHER TYPES OF APPROXIMATION FUNCTIONS. We will show that the problem of fidig approimatio fuctios F(, a, b) with two parameters of the type of the eight oes listed above ca be reduced to fidig the parameters of a liear fuctio. 3.. Power Fuctio (Geometric Regressio). Fid a approimatio fuctio of type F(, a, m) = a m. (6)
6 6 Suppose that i Table, both -values ad y-values are positive. Etractig the atural logarithm to (6), assumig a > 0, we get: l F = l a + m l. (7) Sice fuctio F is a approimatio fuctio for fuctio f, fuctio l F will be a approimatio for l f. Let s make the substitutio u = l. Thus, as it follows from (7), l F will be a fuctio of u, say Φ(u). Makig equatio (7) ca be epressed as m = A, l a = B, (8) Φ(u, A, B) = Au + B, (9) that is, the problem is reduced to fidig a approimatio fuctio of liear type. Keepig i mid the above coditios, i order to fid the required approimatio fuctio, we will proceed as follows:. I accordace with Table, costruct a ew table which cotais the atural logarithms of both ad y.. Usig this ew table, fid the parameters A ad B (see Paragraph ) of the approimatio fuctio of type (9). 3. Usig formulae (8), fid the values of parameters a, m, ad substitute them i (6). 3.. Epoetial Fuctio. Suppose that Table is such that its approimatio fuctio is of epoetial type: Etractig the atural logarithm to (0), we get: F(, a, m) = a ep(m), a > 0. (0) Accordig to (8), equatio () ca be epressed as l F = l a + m. () l F = A + B. () Cosequetly, to fid the approimatio fuctio of type (0), it is required to etract the atural logarithms to the values of f i Table ad cosiderig them alog with its -values, costruct for this ew table of values a fuctio of type (). After that ad
7 7 accordig to desigatios (8), it oly remais to obtai the values of the search parameters a, b, ad to substitute them i formula (0) Liear Ratioal Fuctio. Fid a approimatio fuctio of type Formula (3) ca be epressed as F(, a, b) = /(a + b). (3) /[F(, a, b)] = a + b. Keepig i mid the last epressio, to fid the values of parameters a, b ad i accordace with Table, it is required to costruct a ew table i which its -values remai uchaged, ad those oes of f are substituted by their reciprocals. After that ad i accordace with the ew obtaied table, oe ca fid the approimatio fuctio a + b. The search parameters a, b are the substituted i formula (3) Logarithmic Fuctio. Suppose that we wat to fid a approimatio fuctio of type F(, a, b) = a l + b. (4) I order to trasform (4) ito a liear fuctio, it is eough to make the substitutio l = u. So, to determie the values of a ad b, it is ecessary to etract the atural logarithm to Table s -values ad eamiig the obtaied results alog with those oes of fuctio f, fid, for the ew obtaied table, the approimatio fuctio of liear type. The coefficiets a, b of the search fuctio should be substituted i formula (4) Hyperbola. If the graph of poits plotted accordig to Table turs out to be the brach of a hyperbola, the approimatio fuctio has the form F(, a, b) = (a/)+ b. (5) For its trasformatio ito a liear fuctio, we make the substitutio u = /. Φ(u, a, b) = a u + b. (6) So, to determie the approimatio fuctio of type (6), Table s -values should be substituted by their reciprocals ad the, for the ew table, fid the approimatio (6) of liear type. The coefficiets a, b of the obtaied fuctio are the substituted i formula (5).
8 Ratioal Fuctio. Suppose that the approimatio fuctio has the form F(, a, b) = /(a + b). (7) Thus, we get: /[F(, a, b)] = a + (b/), so, the problem tur s out to be oe of the same form of the previous case. I fact, if i Table we chage the values of both ad y by their reciprocals the, accordig to the formulae z = /, u =/y, we fid for the ew table of values a approimatio fuctio of type u = bz + a. The values of a, b are the substituted i formula (7). Eample. Costruct a approimatio fuctio usig the Method of Least Squares for the fuctioal depedece give by the followig table: Table y The graph of poits is show i Fig.. To compare the quality of this approimatio, cosider, at the same time, two approimatio curves for the give fuctio: the liear regressio y = a + b ad the power fittig y = c m. After fidig the values for parameters a, b, c, ad m, the sum of the square deflectios (8) ca be foud to establish which of these two approimatios is better. y Fig.. I the case of the liear regressio, the values of parameters a, b are foud usig system (), whose coefficiets are calculated accordig to Table s data ad i accordace with desigatios (). I order to compute the coefficiets of the give
9 9 system, keep i mid Table ad costruct a auiliary table (Table 3) whose last row correspods to the values of the sums of the terms of the correspodig colum. Table 3. y y Dividig the obtaied sums by the umber of elemets = 8, i accordace with formulae (), we get: M M Let s form ow the system of type (): y = 3. 4, M = 75., = , M = y 4.056a + 3.4b = a + b =.75. Its solutio, applyig Cramer s Rule, is a = 0.9, b = Thus, the approimatio fuctio y = F(, a, b) ca be writte as y = (8) To determie the values of the parameters c, m of the power fittig, as it follows from Paragraph 3., a ew table with the atural logarithms of both the -values ad y-values must be costructed. Deote the values of the ew correspodig variables u ad z by u = l, z = l y. Accordig to the ew table s umerical data, form the system of equatios of type (): M A + M B M u u = uz (9) M A + B = M, u whose coefficiets are the umb ers calculated usig the ew table ad formulae (), while ukows A ad B are related to the search parameters by the correlatios A = m, B = l c. z
10 0 Table 4. u z uz u To fid the coefficiets of system (9), costruct a auiliary table (Table 4). Dividig the values of the last row of Table 4 by 8, we obtai: Let s form the system of type (9): Its solutio is M =., M = , M = , M = u z uz u.498a +.B = A + B = A =.656, B = Let s fid ow the values of parameters c ad m: m =.656, c = ep(-.359) = Therefore, the power fittig ca be epressed as y = (30) Table 5. y ε ε ε ε
11 To compare the quality of the approimatios (8) ad (30), calculate the sum of the square deflectios (see Table 5). It follows from Table 5 that the sum of the square deflectios for the liear regressio is σ = 0.0 ad for the power fittig is σ = Comparig the quality of these two approimatios, (i the sese of The Method of Least Squares) we ca coclude that the power fittig is better. The previous eample shows that to solve the approimatio problem of a fuctio usig The Method of Least Squares, it is required to carry out a sigificat amout of calculatios alog with the use of a large amout of umerical values, which are essetially origiated i the ow process of calculatio. It is evidet that, i this case, the most appropriate istrumet of calculatio should be a computer. Below, for the iterested reader, we have listed a Pascal program for simulatig the values of the parameters of a regressio equatio for each of the followig three types: y = a + b, y = a m, y = ae m. Pascal was chose as the programmig laguage because of its clarity ad readability. I Pascal, the iformatio occurrig betwee brackets {} is commetary ad is ot read by the computer. Oce the program is eecuted, you could eter, for eample, Table s data. We kow that with certai data trasformatios, the calculatio of the parameters of the power ad epoetial fittigs is reduced to calculatig the parameters of the liear regressio, that is, to solvig the system of type (). For this reaso, the fudametal steps of carryig this algorithm out ca be described as follows:. Eter the give data.. Choose the type of curve fittig. 3. Trasform the data ito the fuctioal depedece of liear type. 4. Obtai the parameters of the regressio equatio. 5. Trasform coversely the data ad fid the square deflectios of the foud values of the fuctio related to the data. 6. Prit the output results. {Curve Fittig} uses crt; var A,B,D,s,s,s,s3,s4 N,i,k X,Y,U,V : real; : iteger; : array[0..50] of real; begi clrscr; writel('eter the umber of ordered pairs i the table:'); readl(n); writel('eter the values of X:'); begi for i:= to N do readl(x[i]); ed; writel('eter the values of Y:'); begi for i:= to N do readl(y[i]); ed;
12 writel('choose the type of curve fittig:'); writel(': y=a*+b'); writel(': y=a*^m'); writel('3: y=a*ep(m*)'); writel('eter the umber of the required equatio:'); readl(k); s:=0; s:=0; s3:=0; for i:= to N do begi if k= the begi U[i]:=X[i]; V[i]:=Y[i]; ed; if k= the begi U[i]:=L(X[i]); V[i]:=L(Y[i]); ed; if k=3 the begi U[i]:=X[i]; V[i]:=L(Y[i]); ed; s:=s+u[i]; s:=s+v[i]; s3:=s3+u[i]*v[i]; s4:=s4+u[i]*u[i]; ed; D:=N*s4-s*s; A:=(N*s3-s*s)/D; B:=(s4*s-s*s3)/D; s:=0; for i:= to N do begi V[i]:=A*U[i]+B; if (k=) or (k=3) the V[i]:=Ep(V[i]); writel(v[i]); s:=s+sqr(y[i]-v[i]); ed; writel('equatio of the regressio curve:'); if k= the begi writel('y = ',A,'*X + ',B); writel('s = ',s); ed; if k= the begi writel('y = ',Ep(B),'*X^',A); writel('s = ',s); ed; if k=3 the begi writel('y = ',Ep(B),'*ep(',A,'*X)'); writel('s = ',s); ed; ed. I the previous Pascal program, to save the data, we use the -dimesioal arrays X ad Y. The trasformed data are the saved, respectively, i the arrays U ad V. Eecutig the calculatios for Table s data whe usig this program, to the request Choose the type of curve fittig ad, keepig i mid that, the uderlied commad i the program allows the output of the values of the calculated fuctio i accordace with the obtaied regressio equatio, we get:
13 Equatio of the regressio curve: Y = *X S = For k =, the program gives: Equatio of the regressio curve: Y = *X^ S = , ad for k = 3: Equatio of the regressio curve: Y = *ep( *X) S = Eercise: Fit Table 6 s data usig the approimatio fuctios of liear, power, epoetial, ad logarithmic types. Determie which fittig is better ad why. Table y Solutio: k = : Y = *X S = k = : Y = *X^ S = k = 3: Y = *ep( *X) S =
The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationIt just came to me that I 8.2 GRAPHS AND CONVERGENCE
44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationME 261: Numerical Analysis Lecture-9&10: Numerical Interpolation
ME 6: Numerical Aalysis Lecture-9&: Numerical Iterpolatio Md. Taver Hossai Departmet o Mechaical Egieerig BUET http://tatusher.uet.ac.d To estimate itermediate values etwee precise data poits most commoly
More informationANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES
ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationMath 3201 Notes Chapter 4: Rational Expressions & Equations
Learig Goals: See p. tet.. Equivalet Ratioal Epressios ( classes) Read Goal p. 6 tet. Math 0 Notes Chapter : Ratioal Epressios & Equatios. Defie ad give a eample of a ratioal epressio. p. 6. Defie o-permissible
More informationArea As A Limit & Sigma Notation
Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationEECS 442 Computer vision. Multiple view geometry Affine structure from Motion
EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationEECS 442 Computer vision. Multiple view geometry Affine structure from Motion
EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationMatrix representation of a solution of a combinatorial problem of the group theory
Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationWhich movie we can suggest to Anne?
ECOLE CENTRALE SUPELEC MASTER DSBI DECISION MODELING TUTORIAL COLLABORATIVE FILTERING AS A MODEL OF GROUP DECISION-MAKING You kow that the low-tech way to get recommedatios for products, movies, or etertaiig
More informationLinearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)
1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION
I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationAppendix A. Use of Operators in ARPS
A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationA General Framework for Accurate Statistical Timing Analysis Considering Correlations
A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of
More informationFINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)
FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationThe Graphs of Polynomial Functions
Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationThe Platonic solids The five regular polyhedra
The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationINSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 1, 5-22 INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES NENAD U. STOJANOVIĆ Abstract. If above each side of a regular polygo
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationCharacterizing graphs of maximum principal ratio
Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first
More informationMajor CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70
NOTE:. Attempt all seve questios. Major CSL 02 2. Write your ame ad etry o o every sheet of the aswer script. Time 2 Hrs Max Marks 70 Q No Q Q 2 Q 3 Q 4 Q 5 Q 6 Q 7 Total MM 6 2 4 0 8 4 6 70 Q. Write a
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationLenses and imaging. MIT 2.71/ /10/01 wk2-a-1
Leses ad imagig Huyges priciple ad why we eed imagig istrumets A simple imagig istrumet: the pihole camera Priciple of image formatio usig leses Quatifyig leses: paraial approimatio & matri approach Focusig
More information