Interpolation (Shape Functions)
|
|
- Erik Bryan
- 5 years ago
- Views:
Transcription
1 Mètodes Numèrics: A First Course on Finite Elements Interpolation (Shape Functions) Following: Curs d Elements Finits amb Aplicacions (J. Masdemont) Dept. Matemàtiques ETSEIB - UPC BarcelonaTech
2 Interpolation Problem The general solution of problem using Finite Elements has the following steps: Finite Elements Stp1: Discretize in elements Stp2: Write the variational equations Stp3: Build the Linear System Impose the BC Stp4: Get nodes solution Stp5: Extent solution to the Domain
3 Interpolation Problem 1D Let s assume that we have measured an unknown magnitude u = u(x) on a set of data points x = [x 1, x 2,., x N ] obtaining a set of values u = [u 1, u 2,., u N ]
4 Interpolation Problem 1D Let s assume that we have measured an unknown magnitude u = u(x) on a set of data points x = [x 1, x 2,., x N ] obtaining a set of values u = [u 1, u 2,., u N ] How can we guess the value of a new point?
5 Interpolation Problem 1D Let s assume that we have measured an unknown magnitude u = u(x) on a set of data points x = [x 1, x 2,., x N ] obtaining a set of values u = [u 1, u 2,., u N ] Actual function f x = x 3 3x 2 3sin(5x)
6 Interpolation Problem 1D To Interpolate a set of data measured points (x i, u i ) means to build a function P n (x) (usually a polynomial) passing through these points. That is u i = P n x i, i = 1 N Theorem: The interpolation problem has a unique solution when n = N 1. Idea of the proof: P n x = a 0 + a 1 x + a 2 x a n x n n + 1 N unknowns u i = P n x i, i = 1 N N linear equations Unique solution if the system is compatible determined. That means the interpolation polynomial has degree one less than the number of points
7 Shape Functions 1D
8 Shape Functions 1D Lagrange Polynomials (Shape functions) One (N-1) degree Polynomial for each measure point x i, i = 1,, N ψ i x = x x 1 x x 2.. x xi. x x N 1 x x N x i x 1 x i x 2.. xi x i. x i x N 1 x i x N Properties: 1.- Lagrange Polynomials are a base of the set P n [x] 2.- ψ i x j = 0 if i j 3.- ψ i x i = 1 Interpolation Polynomial (a linear combination of the shape functions) P n x = u 1 ψ 1 x + u 2 ψ 2 x + + u N ψ N x
9 Shape Functions 1D N = 2 only two points: x = x 1, x 2 and their measures u = u 1, u 2 ψ 1 x = x x 2 x 1 x 2 x = 1, 2 It is a straight line
10 Shape Functions 1D N = 2 only two points: x = x 1, x 2 and their measures u = u 1, u 2 ψ 1 x = x x 2 x 1 x 2 ψ 2 x = x x 1 x 2 x 1 x = 1, 2
11 Shape Functions 1D N = 2 only two points: x = x 1, x 2 and their measures u = u 1, u 2 ψ 1 x = x x 2 x 1 x 2 ψ 2 x = x x 1 x 2 x 1 u 2 P 1 x Interpolation Polynomial P 1 x = u 1 ψ 1 x + u 2 ψ 2 x u It is also a straight line (linear interpolation)
12 Shape Functions 1D N = 2 only two points: x = x 1, x 2 and their measures u = u 1, u 2 ψ 1 x = x x 2 x 1 x 2 ψ 2 x = x x 1 x 2 x 1 Interpolation Polynomial P 1 x = u 1 ψ 1 x + u 2 ψ 2 x Example: In the case x = 1, 2 and u = 0.7, 1.8 ψ 1 x = x 2 = (x 2) 1 2 ψ 2 x = x 1 = (x 1) 2 1 How to approximate the value for x = 1.5? P = 0.7ψ ψ = = 1. 25
13 Shape Functions 1D N = 3 three points: x = x 1, x 2, x 3 and measures u = u 1, u 2, u 3 ψ 1 x = x x 2 x x 3 x 1 x 2 x 1 x 3 ψ 2 x = x x 1 x x 3 x 2 x 1 x 2 x 3 ψ 3 x = x x 1 x x 2 x 3 x 1 x 3 x 2
14 Shape Functions 1D N = 3 three points: x = x 1, x 2, x 3 and measures u = u 1, u 2, u 3 ψ 1 x = x x 2 x x 3 x 1 x 2 x 1 x 3 ψ 2 x = x x 1 x x 3 x 2 x 1 x 2 x 3 ψ 3 x = x x 1 x x 2 x 3 x 1 x 3 x 2 Interpolation Polynomial P 2 x = u 1 ψ 1 x + u 2 ψ 2 x + u 3 ψ 3 x Now it is a parabola (quadratic interpolation)
15 Shape Functions 1D Example: Consider x = 1,0,1 and u = 1.2, 0.7, 1.8. Compute u(0.2)? x 0 x 1 ψ 1 x = = 1 x(x 1) 2 x + 1 x 1 ψ 2 x = = (x + 1) (x 1) x + 1 x 0 ψ 3 x = = 1 x(x + 1) 2 P = 1.2ψ ψ ψ =
16 Shape Functions 1D Matlab code: x = 0:0.25:1; % measure points f x.^3-3*x.^2-3*sin(5*x); %inline exemple function y = f(x); %measured values figure() plot(x,y,'o','marker','o','markerfacecolor','red'); title('measured values'); % plot only measured values figure() plot(x,y,'o','marker','o','markerfacecolor','red'); hold on; xx = 0:0.01:1; % take many points for a better plot yy = f(xx); plot(xx, yy,'-.') title('true function'); % plot the function hold off
17 Shape Functions 1D Matlab code (continuation): figure() % Polyfit degree 4 function (interpolator) plot(x,y,'o','marker','o','markerfacecolor','red'); hold on; plot(xx, yy, '-.') p = polyfit(x,y,4); yyy = polyval(p, xx); plot(xx, yyy, '-.b') title('degree 4 approximation'); hold off
18 Shape Functions 1D Interpolation Results:
19 Shape Functions 1D Approximation: In case n < (N 1) there is NO solution (incompatible system) because the polynomial can not pass through all the points. In that case: mean square approx P n x = min( P n x f x )
20 Shape Functions 1D Higher interpolation: When N is big (>8) there is a better solution than using a polynomial of high degree. Runge s Phenomenon: f x = x 2 The red curve is the Runge function f x. The blue curve is a 5th-order interpolating polynomial (using six equally spaced interpolating points). The green curve is a 9th-order interpolating polynomial (using ten equally spaced interpolating points).
21 Shape Functions 1D Two possible approaches: Polygonal curve: Take the points in pairs and build a line segment (1 st order interp) in each case. Continuous but not derivable. Matlab code: %% Polygonal figure() x=0:0.1:1; y=f(x); plot(x,y,'o','marker','o','markerfacecolor','red'); hold on; plot(xx,yy,'-.') xxx=0:0.01:1; yyy=interp1(x,y,xx); %only substitution is possible plot(xxx,yyy,'b') hold off
22 Shape Functions 1D Two possible approaches: Spline curve (cubic): Take the points in groups of 2 and build a third order Polynomial (cubic interp) in each case imposing C 2 continuity. Matlab code (continuation): %% Spline figure() x=0:0.1:1; y=f(x); plot(x,y,'o','marker','o','markerfacecolor','red'); hold on; plot(xx,yy,'-.') xxx = 0:0.01:1; yyy = spline(x,y,xx); %only substitution is possible plot(xxx,yyy,'b') hold off
23 Shape Functions 2D
24 Shape Functions 2D How can we extend the interpolation problem to 2D? That is, how can we approximate the value of f x, y using a 2D polynomial P n x, y? We restrict to fixed shapes: Triangular element Numbered counterclockwise 3 e 1 2 Quadrilateral element
25 Triangular Shape Functions We need the equivalent to the Lagrange polynomials (2-dim) ψ i e x, y = c 1 + c 2 x + c 3 y (three unknowns) such that, it s value is 1 for vertex i, and 0 for the other two: For the first vertex: 1 = ψ 1 e x 1, y 1 = c 1 + c 2 x 1 + c 3 y 1 0 = ψ 1 e x 2, y 2 = c 1 + c 2 x 2 + c 3 y 2 0 = ψ 1 e x 3, y 3 = c 1 + c 2 x 3 + c 3 y 3 (x 3, y 3 ) (x 1, y 1 ) (x 2, y 2 ) 1 x 1 y 1 1 x 2 y 2 1 x 3 y 3 A c b c 1 c 2 c 3 = c = A\b (matlab solution)
26 Triangular Shape Functions Explicitly ψ i e x, y = c 1,i + c 2,i x + c 3,i y, i = 1,2,3 c 1,i = x jy k x k y j 2A e c 2,i = y j y k 2A e c 3,i = x k x j 2A e where i, j, k = 1,2,3 cyclic and A e is the Area of Ω e Remember: Area= 1 2 det 1 x 1 y 1 1 x 2 y 2 1 x 3 y 3 (x 3, y 3 ) (x 1, y 1 ) (x 2, y 2 )
27 Triangular Shape Functions Once we have the shape functions ψ i e x, y, i = 1,2,3 (geometrically they are planes passing through one of the edges) finally, the interpolation value of a point ( x, y) is f x, y = f x 1, y 1 ψ 1 e ( x, y) + f x 2, y 2 ψ 2 e ( x, y) + f x 3, y 3 ψ 3 e ( x, y) The terms α i e = ψ i e ( x, y) are known as Barycentric Coordinates of ( x, y) (We ll see more in the practical sessions)
28 Triangular Shape Functions Example: The temperature of a thin triangular plate has been measured at the vertices T v 1 = 40 o, T v 2 = 90 o, T v 3 = 10 o. If the coordinates of the vertices are: v 1 = 0,0, v 2 = 5,0, v 3 = 2,3, estimate the temperature at the point p = (3,1)? Solution: ψ 1 e x, y = 1 0.2x 0.2y ψ 2 e x, y = 0 0.2x y ψ 3 e x, y = 0 0x y T p = 40α α α 3 = o Exercise: Compute the shape functions associated to the triangle v 1 = 1,1, v 2 = 3,2, v 3 = 2,4. Solution: ψ e 1 x, y = 1 (8 2x y) 5 ψ e 2 x, y = 1 ( 2 + 3x y) 5 α 1 = ψ e 1 3,1 α 2 = ψ e 2 3,1 α 3 = ψ e 3 3,1 ψ e 3 x, y = 1 ( 1 x + 2y) 5
29 Quadrilateral Shape Functions A similar situation is found when a rectangular element is used. ψ e i x, y = c 1 + c 2 x + c 3 y + c 4 xy (four unknowns) such that, it s value is 1 for vertex i, and 0 for the other three: For the first vertex: 1 = ψ e 1 x 1, y 1 = c 1 + c 2 x 1 + c 3 y 1 +c 4 x 1 y 1 0 = ψ e 1 x 2, y 2 = c 1 + c 2 x 2 + c 3 y 2 +c 4 x 2 y 2 0 = ψ e 1 x 3, y 3 = c 1 + c 2 x 3 + c 3 y 3 +c 4 x 3 y 3 0 = ψ e 1 x 4, y 4 = c 1 + c 2 x 4 + c 3 y 4 +c 4 x 4 y 4 (x 4, y 4 ) (x 3, y 3 ) Analogously for the other vertices (This is not correct for general quadrilateral elements) (x 1, y 1 ) (x 2, y 2 )
30 Quadrilateral Shape Functions General expressions for Rectangles: If we denote by a = x 2 x 1 b = y 2 y 1 Then ψ 1 e x, y = 1 ab (x x 2)(y y 2 ) (x (x 2, y 2 ) 1, y 2 ) b a (x 1, y 1 ) (x 2, y 1 ) ψ 2 e x, y = 1 ab (x x 1)(y y 2 ) ψ 3 e x, y = 1 ab (x x 1)(y y 1 ) ψ 4 e x, y = 1 ab (x x 2)(y y 1 )
31 Quadrilateral Shape Functions The reference bilinear quadrilateral element Ω R : [-1,1]x[-1,1] We can use matlab to compute the coeff. ψ j e x i, y i = c 1j + c 2j x i + c 3j y i +c 4j x i y i = δ ij punts=[ -1,-1; 1,-1; 1,1; -1,1]; A=[ones(4,1), punts(:,1), punts(:,2), punts(:,1).*punts(:,2)] b=[1;0;0;0]; C1= A\b %coeff of the fisrt shape function % exercise: do it for the other shape functions
32 Quadrilateral Shape Functions The shape functions for the reference element Ω R, are: Or equivalently:
33 Quadrilateral Shape Functions Example: The temperature of at the vertices of the reference quadrilateral has been measured as T v 1 = 10 o, T v 2 = 20 o, T v 3 = 30 o, T v 4 = 40 o. Estimate the temperature at the point p = ( 0.3,0.5)? Solution: ψ 1 R p =0.1625; ψ 2 R p =0.0875; ψ 3 R p =0.2625; ψ 4 R p = ; T p = T 1 ψ 1 R p + T 2 ψ 2 R p + T 3 ψ 3 R p + T 4 ψ 4 R p = o
34 Quadrilateral Shape Functions For a General Quadrilateral element usually the shape function is NOT a 2 degree polynomial. Because of that it is not easy to compute these functions, but we still can compute the Barycentric Coordinates. How to compute α i k = ψ i k (P)?
35 Quadrilateral Shape Functions Change from the Reference quadrilateral to [0,1]x[0,1] λ = ξ + 1 2, μ = η (-1,1) (1,1) (0,1) (1,1) η ξ (-1,-1) (-1,1) μ λ (0,0) (1,0) Shape functions on [0,1]x[0,1]: ψ 1 λ, μ = (1 λ)(1 μ) ψ 2 λ, μ = λ(1 μ) ψ 3 λ, μ = λμ ψ 4 λ, μ = (1 λ)μ
36 Quadrilateral Shape Functions General Quadrilateral: Isoparametric transformation (x, y) = ψ 1 ξ, η v 1 + ψ 2 ξ, η v 2 + ψ 3 ξ, η v 3 + ψ 4 ξ, η v 4 Change to another quadrilateral using the shape functions, for simplicity we will use here the rectangle [0,1]x[0,1]: (0,1) (1,1) P(λ, μ) v 4 μ = 1 P(λ, μ) v 3 λ = 1 μ λ λ = 0 (0,0) (1,0) v 2 v 1 μ = 0 P(λ, μ) = (1 λ)(1 μ) v 1 + λ(1 μ) v 2 + λμ v λ μ v 4 α 1 α 2 α 3 α 4
37 Quadrilateral Shape Functions We can compute them using λ, μ ε 0,1, as a parametrization of the quadrilateral edges. P = (1 λ)(1 μ) v 1 + λ(1 μ) v 2 + λμ v λ μ v 4 Rearranging the terms, the previous equation can be written as: a + λb + μc + λμd = 0 where a = v 1 P, b = v 2 v 1, c = v 4 v 1, d = v 1 v 2 + v 3 v 4
38 Quadrilateral Shape Functions We impose that the vector w = Q λ, 1 Q λ, 0 and the vector u = P Q λ, 0 are parallel, i.e. w u = 0 λ = 0 From the isometric transformation we obtain: w = v 4 v 1 + λ v 3 v 4 + v 1 v 2 = c + λd u = P v 1 + λ v 1 v 2 = (a + λb) v 1 v 4 μ = 1 μ = 0 Q(λ, 1) w v 3 P(λ, μ) u Q(λ, 0) λ = 1 v 2
39 Quadrilateral Shape Functions If this two vectors are parallel a + λb c + λd = 0 or b d λ 2 + a d + b c λ + a c = 0 which is a quadratic equation that can be solved for λ. Hint: All the 2D vectors are extended with a zero third component in order to define the cross product. Analogously a similar equation is found for μ.
40 Quadrilateral Shape Functions Example: Given a quadrilateral defined by vertices v 1 = 0,0, v 2 = 5, 1, v 3 = 4,5, v 4 = (1,4) compute the barycentric coordinates of point p=(3,2). Sol. λ = , μ = 0.5 α = (examples using Matlab will be shown in practices)
Curve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
More informationApplied Numerical Analysis Quiz #2
Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the
More informationLeast squares regression
Curve Fitting Least squares regression Interpolation Two categories of curve fitting. 1. Linear least squares regression, determining the straight line that best fits data points. 2. Interpolation, determining
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationBilinear Quadrilateral (Q4): CQUAD4 in GENESIS
Bilinear Quadrilateral (Q4): CQUAD4 in GENESIS The Q4 element has four nodes and eight nodal dof. The shape can be any quadrilateral; we ll concentrate on a rectangle now. The displacement field in terms
More informationInterpolation and Polynomial Approximation I
Interpolation and Polynomial Approximation I If f (n) (x), n are available, Taylor polynomial is an approximation: f (x) = f (x 0 )+f (x 0 )(x x 0 )+ 1 2! f (x 0 )(x x 0 ) 2 + Example: e x = 1 + x 1! +
More informationCHAPTER Order points and then develop a divided difference table:
1 CHAPTER 17 17.1 Order points and then develop a divided difference table: x y First Second Third Fourth Fifth Sixth 5 5.75 -.45 0.75 -.E-17 1.51788E-18 7.54895E-19 -.5719E-19 1.8 16.415 -.075 0.75-1.7E-17
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationBSM510 Numerical Analysis
BSM510 Numerical Analysis Polynomial Interpolation Prof. Manar Mohaisen Department of EEC Engineering Review of Precedent Lecture Polynomial Regression Multiple Linear Regression Nonlinear Regression Lecture
More informationInput: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?
Applied Numerical Analysis Interpolation Lecturer: Emad Fatemizadeh Interpolation Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. 0 1 4 1-3 3 9 What for x = 1.? Interpolation
More informationShape Function Generation and Requirements
Shape Function Generation and Requirements Requirements Requirements (A) Interpolation condition. Takes a unit value at node i, and is zero at all other nodes. Requirements (B) Local support condition.
More informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationBuilding a finite element program in MATLAB Linear elements in 1d and 2d
Building a finite element program in MATLAB Linear elements in 1d and 2d D. Peschka TU Berlin Supplemental material for the course Numerische Mathematik 2 für Ingenieure at the Technical University Berlin,
More informationAdditional exercises with Numerieke Analyse
Additional exercises with Numerieke Analyse March 10, 017 1. (a) Given different points x 0, x 1, x [a, b] and scalars y 0, y 1, y, z 1, show that there exists at most one polynomial p P 3 with p(x i )
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More informationTriangular Plate Displacement Elements
Triangular Plate Displacement Elements Chapter : TRIANGULAR PLATE DISPLACEMENT ELEMENTS TABLE OF CONTENTS Page. Introduction...................... Triangular Element Properties................ Triangle
More informationOf course, we discussed this topic in Math So this partially a review. Apolynomialofdegreed in two variable x and y is defined by. α ij x i y j.
Math 5620 Spring 2019 Notes of 4/5/19 Polynomials in Two Variables Of course, we discussed this topic in Math 5610. So this partially a review. Apolynomialofdegreed in two variable x and y is defined by
More informationInterpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter
Key References: Interpolation 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter 6. 2. Press, W. et. al. Numerical Recipes in C, Cambridge: Cambridge University Press. Chapter 3
More informationNotes on Cellwise Data Interpolation for Visualization Xavier Tricoche
Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche urdue University While the data (computed or measured) used in visualization is only available in discrete form, it typically corresponds
More informationCurve Fitting. Objectives
Curve Fitting Objectives Understanding the difference between regression and interpolation. Knowing how to fit curve of discrete with least-squares regression. Knowing how to compute and understand the
More information3. Numerical integration
3. Numerical integration... 3. One-dimensional quadratures... 3. Two- and three-dimensional quadratures... 3.3 Exact Integrals for Straight Sided Triangles... 5 3.4 Reduced and Selected Integration...
More informationTaylor Series and Numerical Approximations
Taylor Series and Numerical Approximations Hilary Weller h.weller@reading.ac.uk August 7, 05 An introduction to the concept of a Taylor series and how these are used in numerical analysis to find numerical
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationScientific Computing I
Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Neckel Winter 2013/2014 Module 8: An Introduction to Finite Element Methods, Winter 2013/2014 1 Part I: Introduction to
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationScientific Computing: Numerical Integration
Scientific Computing: Numerical Integration Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Fall 2015 Nov 5th, 2015 A. Donev (Courant Institute) Lecture
More information2. Polynomial interpolation
2. Polynomial interpolation Contents 2. POLYNOMIAL INTERPOLATION... 1 2.1 TYPES OF INTERPOLATION... 1 2.2 LAGRANGE ONE-DIMENSIONAL INTERPOLATION... 2 2.3 NATURAL COORDINATES*... 15 2.4 HERMITE ONE-DIMENSIONAL
More informationIn practice one often meets a situation where the function of interest, f(x), is only represented by a discrete set of tabulated points,
1 Interpolation 11 Introduction In practice one often meets a situation where the function of interest, f(x), is only represented by a discrete set of tabulated points, {x i, y i = f(x i ) i = 1 n, obtained,
More informationOWELL WEEKLY JOURNAL
Y \»< - } Y Y Y & #»»» q ] q»»»>) & - - - } ) x ( - { Y» & ( x - (» & )< - Y X - & Q Q» 3 - x Q Y 6 \Y > Y Y X 3 3-9 33 x - - / - -»- --
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationBHAR AT HID AS AN ENGIN E ERI N G C O L L E G E NATTR A MPA LL I
BHAR AT HID AS AN ENGIN E ERI N G C O L L E G E NATTR A MPA LL I 635 8 54. Third Year M E C H A NICAL VI S E M ES TER QUE S T I ON B ANK Subject: ME 6 603 FIN I T E E LE ME N T A N A L YSIS UNI T - I INTRODUCTION
More informationIntegration using Gaussian Quadrature
Integration using Gaussian Quadrature Tutorials November 25, 2017 Department of Aeronautics, Imperial College London, UK Scientific Computing and Imaging Institute, University of Utah, USA 2 Chapter 1
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier
More informationCIVL4332 L1 Introduction to Finite Element Method
CIVL L Introduction to Finite Element Method CIVL L Introduction to Finite Element Method by Joe Gattas, Faris Albermani Introduction The FEM is a numerical technique for solving physical problems such
More informationLehrstuhl Informatik V. Lehrstuhl Informatik V. 1. solve weak form of PDE to reduce regularity properties. Lehrstuhl Informatik V
Part I: Introduction to Finite Element Methods Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Necel Winter 4/5 The Model Problem FEM Main Ingredients Wea Forms and Wea
More informationLecture 28 The Main Sources of Error
Lecture 28 The Main Sources of Error Truncation Error Truncation error is defined as the error caused directly by an approximation method For instance, all numerical integration methods are approximations
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationSTOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1
53 17. Lecture 17 Nonlinear Equations Essentially, the only way that one can solve nonlinear equations is by iteration. The quadratic formula enables one to compute the roots of p(x) = 0 when p P. Formulas
More informationCN#4 Biconditional Statements and Definitions
CN#4 s and Definitions OBJECTIVES: STUDENTS WILL BE ABLE TO WRITE AND ANALYZE BICONDITIONAL STATEMENTS. Vocabulary biconditional statement definition polygon triangle quadrilateral When you combine a conditional
More informationQ1. Discuss, compare and contrast various curve fitting and interpolation methods
Q1. Discuss, compare and contrast various curve fitting and interpolation methods McMaster University 1 Curve Fitting Problem statement: Given a set of (n + 1) point-pairs {x i,y i }, i = 0,1,... n, find
More informationUNIVERSITY OF HAWAII COLLEGE OF ENGINEERING DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING
UNIVERSITY OF HAWAII COLLEGE OF ENGINEERING DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ACKNOWLEDGMENTS This report consists of the dissertation by Ms. Yan Jane Liu, submitted in partial fulfillment
More information100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX
100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX.1 Norms If we have an approximate solution at a given point and we want to calculate the absolute error, then we simply take the magnitude
More informationCalculus - II Multivariable Calculus. M.Thamban Nair. Department of Mathematics Indian Institute of Technology Madras
Calculus - II Multivariable Calculus M.Thamban Nair epartment of Mathematics Indian Institute of Technology Madras February 27 Revised: January 29 Contents Preface v 1 Functions of everal Variables 1 1.1
More informationMatrix Theory. A.Holst, V.Ufnarovski
Matrix Theory AHolst, VUfnarovski 55 HINTS AND ANSWERS 9 55 Hints and answers There are two different approaches In the first one write A as a block of rows and note that in B = E ij A all rows different
More informationLagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University
Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves
More informationMA3457/CS4033: Numerical Methods for Calculus and Differential Equations
MA3457/CS4033: Numerical Methods for Calculus and Differential Equations Course Materials P A R T II B 14 2014-2015 1 2. APPROXIMATION CLASS 9 Approximation Key Idea Function approximation is closely related
More informationDepartment of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections 3.1, 3.3, and 3.5
Department of Mathematics, University of Wisconsin-Madison Math 11 Worksheet Sections 3.1, 3.3, and 3.5 1. For f(x) = 5x + (a) Determine the slope and the y-intercept. f(x) = 5x + is of the form y = mx
More informationTHE FINITE ELEMENT METHOD 2017 Dept. of Solid Mechanics
THE FINITE ELEMENT METHOD 07 Dept. of Solid Mechanics EXAMINATION: 07-05-9 A maximum of 60 points can be achieved in this examination. To pass at least 0 points are required. Permitted aid: Pocket calculator.
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationSections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS
Sections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS Quiz results Average 73%: high h score 100% Problems: Keeping track of negative signs x = + = + Function notation f(x)
More information8.5 Addition and Subtraction of Polynomials
8.5. Addition and Subtraction of Polynomials www.ck12.org 8.5 Addition and Subtraction of Polynomials Learning Objectives Write a polynomial expression in standard form. Classify polynomial expression
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationHIGH ORDER NUMERICAL METHODS FOR TIME DEPENDENT HAMILTON-JACOBI EQUATIONS
June 6, 7 :7 WSPC/Lecture Notes Series: 9in x 6in chapter HIGH ORDER NUMERICAL METHODS FOR TIME DEPENDENT HAMILTON-JACOBI EQUATIONS Chi-Wang Shu Division of Applied Mathematics, Brown University Providence,
More informationNumerical Marine Hydrodynamics
Numerical Marine Hydrodynamics Interpolation Lagrange interpolation Triangular families Newton s iteration method Equidistant Interpolation Spline Interpolation Numerical Differentiation Numerical Integration
More informationNumerical methods for PDEs FEM convergence, error estimates, piecewise polynomials
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Dr. Noemi Friedman Contents of the course Fundamentals
More informationQ 0 x if x 0 x x 1. S 1 x if x 1 x x 2. i 0,1,...,n 1, and L x L n 1 x if x n 1 x x n
. - Piecewise Linear-Quadratic Interpolation Piecewise-polynomial Approximation: Problem: Givenn pairs of data points x i, y i, i,,...,n, find a piecewise-polynomial Sx S x if x x x Sx S x if x x x 2 :
More informationMA102: Multivariable Calculus
MA102: Multivariable Calculus Rupam Barman and Shreemayee Bora Department of Mathematics IIT Guwahati Differentiability of f : U R n R m Definition: Let U R n be open. Then f : U R n R m is differentiable
More informationIntro Polynomial Piecewise Cubic Spline Software Summary. Interpolation. Sanzheng Qiao. Department of Computing and Software McMaster University
Interpolation Sanzheng Qiao Department of Computing and Software McMaster University January, 2014 Outline 1 Introduction 2 Polynomial Interpolation 3 Piecewise Polynomial Interpolation 4 Natural Cubic
More informationIntro Polynomial Piecewise Cubic Spline Software Summary. Interpolation. Sanzheng Qiao. Department of Computing and Software McMaster University
Interpolation Sanzheng Qiao Department of Computing and Software McMaster University July, 2012 Outline 1 Introduction 2 Polynomial Interpolation 3 Piecewise Polynomial Interpolation 4 Natural Cubic Spline
More informationNew class of finite element methods: weak Galerkin methods
New class of finite element methods: weak Galerkin methods Xiu Ye University of Arkansas at Little Rock Second order elliptic equation Consider second order elliptic problem: a u = f, in Ω (1) u = 0, on
More informationChapter 2 Interpolation
Chapter 2 Interpolation Experiments usually produce a discrete set of data points (x i, f i ) which represent the value of a function f (x) for a finite set of arguments {x 0...x n }. If additional data
More information, a 1. , a 2. ,..., a n
CHAPTER Points to Remember :. Let x be a variable, n be a positive integer and a 0, a, a,..., a n be constants. Then n f ( x) a x a x... a x a, is called a polynomial in variable x. n n n 0 POLNOMIALS.
More informationApplied/Numerical Analysis Qualifying Exam
Applied/Numerical Analysis Qualifying Exam August 9, 212 Cover Sheet Applied Analysis Part Policy on misprints: The qualifying exam committee tries to proofread exams as carefully as possible. Nevertheless,
More informationFinite element function approximation
THE UNIVERSITY OF WESTERN ONTARIO LONDON ONTARIO Paul Klein Office: SSC 4028 Phone: 661-2111 ext. 85227 Email: paul.klein@uwo.ca URL: www.ssc.uwo.ca/economics/faculty/klein/ Economics 613/614 Advanced
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationOptimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50
Sherif Khalifa Sherif Khalifa () Optimization 1 / 50 Y f(x 0 ) Y=f(X) X 0 X Sherif Khalifa () Optimization 2 / 50 Y Y=f(X) f(x 0 ) X 0 X Sherif Khalifa () Optimization 3 / 50 A necessary condition for
More informationOn the convexity of C 1 surfaces associated with some quadrilateral finite elements
Advances in Computational Mathematics 13 (2000) 271 292 271 On the convexity of C 1 surfaces associated with some quadrilateral finite elements J. Lorente-Pardo a, P. Sablonnière b and M.C. Serrano-Pérez
More information4B. Line Integrals in the Plane
4. Line Integrals in the Plane 4A. Plane Vector Fields 4A-1 Describe geometrically how the vector fields determined by each of the following vector functions looks. Tell for each what the largest region
More informationInt Math 3 Midterm Review Handout (Modules 5-7)
Int Math 3 Midterm Review Handout (Modules 5-7) 1 Graph f(x) = x and g(x) = 1 x 4. Then describe the transformation from the graph of f(x) = x to the graph 2 of g(x) = 1 2 x 4. The transformations are
More informationLecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationApplied Numerical Analysis Homework #3
Applied Numerical Analysis Homework #3 Interpolation: Splines, Multiple dimensions, Radial Bases, Least-Squares Splines Question Consider a cubic spline interpolation of a set of data points, and derivatives
More informationThe Plane Stress Problem
The Plane Stress Problem Martin Kronbichler Applied Scientific Computing (Tillämpad beräkningsvetenskap) February 2, 2010 Martin Kronbichler (TDB) The Plane Stress Problem February 2, 2010 1 / 24 Outline
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationSome notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation
Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation See your notes. 1. Lagrange Interpolation (8.2) 1 2. Newton Interpolation (8.3) different form of the same polynomial as Lagrange
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationMath 1 Unit 1 EOC Review
Math 1 Unit 1 EOC Review Name: Solving Equations (including Literal Equations) - Get the variable to show what it equals to satisfy the equation or inequality - Steps (each step only where necessary):
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 informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationAnalysis III (BAUG) Assignment 3 Prof. Dr. Alessandro Sisto Due 13th October 2017
Analysis III (BAUG Assignment 3 Prof. Dr. Alessandro Sisto Due 13th October 2017 Question 1 et a 0,..., a n be constants. Consider the function. Show that a 0 = 1 0 φ(xdx. φ(x = a 0 + Since the integral
More informationCALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use.
CALCULUS: Math 2C, Fall 200 Final Exam: Solutions. [25 pts] Do the following series converge or diverge? State clearly which test you use. (a) (d) n(n + ) ( ) cos n n= n= (e) (b) n= n= [ cos ( ) n n (c)
More information1. Write a program based on computing divided differences one diagonal at a time as shown below: f x 1,x 2
Math Homework 6. Write a program based on computing divided differences one diagonal at a time as shown below: f x f x f x f x,x f x f x,x f x f x,x,x f x,x... f x You will need nested loops for this.
More informationMATH ASSIGNMENT 07 SOLUTIONS. 8.1 Following is census data showing the population of the US between 1900 and 2000:
MATH4414.01 ASSIGNMENT 07 SOLUTIONS 8.1 Following is census data showing the population of the US between 1900 and 2000: Years after 1900 Population in millions 0 76.0 20 105.7 40 131.7 60 179.3 80 226.5
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationRemarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable?
Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable? Thomas Apel, Hans-G. Roos 22.7.2008 Abstract In the first part of the paper we discuss minimal
More informationTaylor Series and stationary points
Chapter 5 Taylor Series and stationary points 5.1 Taylor Series The surface z = f(x, y) and its derivatives can give a series approximation for f(x, y) about some point (x 0, y 0 ) as illustrated in Figure
More information7. Choice of approximating for the FE-method scalar problems
7. Choice of approimating for the FE-method scalar problems Finite Element Method Differential Equation Weak Formulation Approimating Functions Weighted Residuals FEM - Formulation Weak form of heat flow
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More information1. Vectors and Matrices
E. 8.02 Exercises. Vectors and Matrices A. Vectors Definition. A direction is just a unit vector. The direction of A is defined by dir A = A, (A 0); A it is the unit vector lying along A and pointed like
More informationGeometric Interpolation by Planar Cubic Polynomials
1 / 20 Geometric Interpolation by Planar Cubic Polynomials Jernej Kozak, Marjeta Krajnc Faculty of Mathematics and Physics University of Ljubljana Institute of Mathematics, Physics and Mechanics Avignon,
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationInterpolation via Barycentric Coordinates
Interpolation via Barycentric Coordinates Pierre Alliez Inria Some material from D. Anisimov Outline Barycenter Convexity Barycentric coordinates For Simplices For point sets Inverse distance (Shepard)
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationQuadratic function and equations Quadratic function/equations, supply, demand, market equilibrium
Exercises 8 Quadratic function and equations Quadratic function/equations, supply, demand, market equilibrium Objectives - know and understand the relation between a quadratic function and a quadratic
More informationSolutions 2. January 23, x x
Solutions 2 January 23, 2016 1 Exercise 3.1.1 (a), p. 149 Let us compute Lagrange polynomials first for our case x 1 = 0, x 2 = 2, x 3 = 3: In [14]: from sympy import * init_printing(use_latex=true) x=symbols(
More informationNumerical integration - I. M. Peressi - UniTS - Laurea Magistrale in Physics Laboratory of Computational Physics - Unit V
Numerical integration - I M. Peressi - UniTS - Laurea Magistrale in Physics Laboratory of Computational Physics - Unit V deterministic methods in 1D equispaced points (trapezoidal, Simpson...), others...
More informationCode No: RT41033 R13 Set No. 1 IV B.Tech I Semester Regular Examinations, November - 2016 FINITE ELEMENT METHODS (Common to Mechanical Engineering, Aeronautical Engineering and Automobile Engineering)
More information