Hat Function. defined on a triangulation of the domain D basis B i, i I, for piecewise linear functions 1 at center p i, 0 at other vertices p j.


 Shannon Warner
 1 years ago
 Views:
Transcription
1 Hat Function defined on a triangulation of the domain D basis B i, i I, for piecewise linear functions 1 at center p i, 0 at other vertices p j B i Hölllig (IMNG) FEM with BSplines 01. Januar / 10
2 Hat Function approximation, determined by Lagrange data u h = i I u i B i, u i = u h (p i ) piecewise constant gradient, determined via directional derivatives grad B i (p i p j, p i p k,...) = (1, 1,...) Hölllig (IMNG) FEM with BSplines 01. Januar / 10
3 Assembly of a Ritz Galerkin System for Hat Functions sum contributions from each triangle T = [p i, p j, p k ] g i,k = grad B i grad B k, f i = T T T T f B i p i p j T p k Hölllig (IMNG) FEM with BSplines 01. Januar / 10
4 Assembly of a Ritz Galerkin System for Hat Functions compute gradients via directional derivatives grad B i grad B j ( ) p j p i p k p j = R, R = grad B k G: add submatrix, corresponding to inner vertices, det P 2 RP 1 (P t ) 1 R t F : add subvector, corresponding to inner vertices, det P 2 f (T ) } {{ } average Hölllig (IMNG) FEM with BSplines 01. Januar / 10
5 Hat Functions on a Regular Grid B i : piecewise linear, pyramidlike (0, 1) (1, 1) ( 1, 0) h 1 (1, 0) ( 1, 1) (0, 1) RitzGalerkin matrix D grad B i grad B k g i,i = 4, g (i1 ±1,i 2 ),i = g (i1,i 2 ±1),i = 1 generalized banded system 4u i u i (1,0) u i+(1,0) u i (0,1) u i+(0,1) = h 2 f i Hölllig (IMNG) FEM with BSplines 01. Januar / 10
6 Poisson Solver with Hat Functions intput p(k, :): vertices, first n inside t(k, 1 : 3): indices for triangles f : data at vertices output u(1 : n): solution at interior vertices Hölllig (IMNG) FEM with BSplines 01. Januar / 10
7 Poisson Solver with Hat Functions add contributions from triangles T = [p α, p β, p γ ] T fb κ = area(t ) f T /3 T grad B κ grad B κ = area(t ) (g κ g t κ ) area(t ) = det P /2, P = (p β p α, p γ p β ) computation of gradients g α g β g γ P = Hölllig (IMNG) FEM with BSplines 01. Januar / 10
8 h = 1/10; p = [0; 0]; for k=1:round(1/h); if k>1/h1/2; n = size(p,2); end; nk = round(2*pi*k); tk = [1:nk]*2*pi/nk; p = [p (k*h)*[cos(tk); sin(tk)]]; end; Hölllig (IMNG) FEM with BSplines 01. Januar / 10 Poisson Solver with Hat Functions % demo: poisson_hat % solution of delta u = 1 on unit disc % with zero boundary values % Delaunay triagulation based on regularly % spaced points with approximate distance h
9 Poisson Solver with Hat Functions t = delaunay(p(1,:),p(2,:)); trimesh(t,p(1,:),p(2,:), color,[0,0,0]); axis equal;axis off;figure % fesolution nt = size(t,1); u = poisson_hat(p,t,n,ones(nt,1)); [x,y] = meshgrid([1:h:1]); z = griddata(p(1,1:n),p(2,1:n),u,x,y); mesh(x,y,z); Hölllig (IMNG) FEM with BSplines 01. Januar / 10
10 Poisson Solver with Hat Functions Hölllig (IMNG) FEM with BSplines 01. Januar / 10
11 Poisson Solver with Hat Functions function u = poisson_hat(p,t,n,f) % POISSON_HAT: Poissonsolver with hatfunctions % p(:,k): vertices of triangulation % t(j,1:3): indices of triangles % n: number of interior vertices (first) % f(j): forces on triangles % u(1:n): solution at interior vertices % initialize RitzGalerkin system lp = size(p,2); G = zeros(lp,lp); F = zeros(lp,1); % hatfunction gradients times triangle vectors R = [1, 0; 1, 1; 0, 1]; Hölllig (IMNG) FEM with BSplines 01. Januar / 10
12 Poisson Solver with Hat Functions % loop over triangles for k = 1:size(t,1); % indices of vertices and triangle vectors indk = t(k,:); P = [p(:,indk(2))p(:,indk(1)),... p(:,indk(3))p(:,indk(2))]; % area of triangle dp = abs(det(p))/2; % add int_t f B_i for i in indk F(indk) = F(indk) + dp*f(k)/3; % add int_t g_i g_i for i,i in indk % compute g s from [g_a; g_b; g_c]*p = R G(indk,indk) = G(indk,indk) +... dp*r*inv(p)*inv(p )*R ; end; % solve RitzGalerkin sytem for relevant nodes u = G(1:n,1:n) \ F(1:n); Hölllig (IMNG) FEM with BSplines 01. Januar / 10
13 Solver comparision grid width unknowns iteration count: Jacobi: GaußSeidel (checkerboard): SOR, ω = 1.25 (checkerboard): SOR, ω = 1.5 (checkerboard): SOR, ω = 1.75 (checkerboard): SOR, ω = 1.9 (checkerboard): SOR, ω = 1.94 (checkerboard): cg: Hölllig (IMNG) FEM with BSplines 01. Januar / 10
14 Solving Poisson s equation with MATLAB function with boundary data no argument: number of boundary segments one argument (segment numbers): start, end, left, right values two arguments (segment and parameter): points on boundary create triangulation with initmesh function for boundary conditions solve with assempde refine with refinemesh Hölllig (IMNG) FEM with BSplines 01. Januar / 10
15 Solving Poisson s equation with MATLAB Step 1: function for boundary function [x,y]=circle_with_hole(bs,s) % no input: number of boundarysegments if nargin==0,x=4;return;end % boundary structure d=[ % start parameter value % end parameter value % left hand region % right hand region ]; % one input argument: structure of boundary if nargin==1,x=d(:,bs(:) );return;end Hölllig (IMNG) FEM with BSplines 01. Januar / 10
16 if ~isempty(s), k=find(bs==1);% boundary segment 1: circle x(k)=mcx+rc*cos((pi)*s(k));y(k)=mcy+rc*sin((pi)*s(k)); k=find(bs==2);% boundary segment 2: circle x(k)=mcx+rc*cos((pi)*s(k)+pi);y(k)=mcy+rc*sin((pi)*s(k)+pi); k=find(bs==3);% boundary segment 3: hole x(k)=mhx+rh*cos((pi)*s(k));y(k)=mhy+rh*sin((pi)*s(k)); k=find(bs==4);% boundary segment 4: hole x(k)=mhx+rh*cos((pi)*s(k)+pi);y(k)=mhy+rh*sin((pi)*s(k)+pi); end Hölllig (IMNG) FEM with BSplines 01. Januar / 10 Solving Poisson s equation with MATLAB % two input arguments: points on boundary mcx=0;mcy=0;rc=4;% midpoint and radius of circle mhx=0;mhy=0;rh=1;% midpoint and radius of hole x=zeros(size(s));y=x; if numel(bs)==1,bs=bs*ones(size(s));end; % expand bs
17 Solving Poisson s equation with MATLAB Step 2: initial mesh [p,e,t]=initmesh( circle with hole, hmax,.5); pdemesh(p,e,t); Hölllig (IMNG) FEM with BSplines 01. Januar / 10
18 Solving Poisson s equation with MATLAB Step 3: boundary conditions function [q,g,h,r]=boundary(p,e,u,time) %Boundary condition data % Neumannconditions, zero values for DirichletBoundary q=zeros(1,length(e)); g=zeros(1,length(e)); % DirichletBoundary: hu=r h=ones(1,2*length(e)); r=zeros(1,2*length(e)); Hölllig (IMNG) FEM with BSplines 01. Januar / 10
19 Solving Poisson s equation with MATLAB Step 4: solve and plot U=ASSEMPDE(B,P,E,T,C,A,F) solves div(c grad u) + au = f on triangulation with points p, edges e, and triangles t with boundaryconditionfunction b u=assempde( boundary,p,e,t,1,0,1); pdesurf(p,t,u); Hölllig (IMNG) FEM with BSplines 01. Januar / 10
20 Solving Poisson s equation with MATLAB Step 5: refine triangulation [p,e,t]=refinemesh( circle with hole,p,e,t); pdemesh(p,e,t); and solve again: u=assempde( boundary,p,e,t,1,0,1); Hölllig (IMNG) FEM with BSplines 01. Januar / 10
21 Voronoi Diagram defined for a set S of points p k R d Voronoi polygon V k : set of points which are closer to p k than to any of the other points p j S Voronoi diagram V (S): union of the subsets of hyperplanes bounding the Voronoi polygons p i Hölllig (IMNG) FEM with BSplines 01. Januar / 10
22 Voronoi Spheres Points p k R d with their closed Voronoi polygons V k intersecting in a single point v lie on a sphere with center v. In general, exactly d + 1 Voronoi polygons share a common point. Proof: V i and V j intersect in a a hyperplane containing v p i, p j have same distance to v, i.e., all points p k have the same distance to v Hölllig (IMNG) FEM with BSplines 01. Januar / 10
23 Delaunay Triangulation triangulation with vertices p k R d such that no vertex is contained in the circumscribed sphere of any simplex construction via Voronoidiagram: in general, points p k with their closed Voronoi polygons V k intersecting in a single point v form a simplex (neighboring points define an edge) nonuniqueness, if more than d + 1 points lie on a sphere which does not contain any other points Hölllig (IMNG) FEM with BSplines 01. Januar / 10
24 Sphere Criterion For a Delaunay simplex with vertices p k, the circumscribed sphere does not enclose any other vertices of the triangulation. The criterion can be used to construct a Delaunay triangulation directly. Proof: none of the Voronoi polygons of the other vertices contains the center v of the circumscribed sphere Voronoi polygons of the vertices p k have the common intersection v p i in circumscribed sphere, closest to v v belongs to Voronoi polygon V i, i.e., is not the intersection of the V k s Hölllig (IMNG) FEM with BSplines 01. Januar / 10
Introduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationCircle Name: Radius: Diameter: Chord: Secant:
12.1: Tangent Lines Congruent Circles: circles that have the same radius length Diagram of Examples Center of Circle: Circle Name: Radius: Diameter: Chord: Secant: Tangent to A Circle: a line in the plane
More informationConstrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume *
Constrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume * Xiaosong Yang 1, Pheng Ann Heng 2, Zesheng Tang 3 1 Department of Computer Science and Technology, Tsinghua University, Beijing
More informationComputer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include
More informationH.Calculating Normal Vectors
Appendix H H.Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use the OpenGL lighting facility, which is described in Chapter
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science  Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: WireFrame Representation Object is represented as as a set of points
More informationG.H. Raisoni College of Engineering, Nagpur. Department of Information Technology
Practical List 1) WAP to implement line generation using DDA algorithm 2) WAP to implement line using Bresenham s line generation algorithm. 3) WAP to generate circle using circle generation algorithm
More informationInvestigating Area Under a Curve
Mathematics Investigating Area Under a Curve About this Lesson This lesson is an introduction to areas bounded by functions and the xaxis on a given interval. Since the functions in the beginning of the
More information1. A student followed the given steps below to complete a construction. Which type of construction is best represented by the steps given above?
1. A student followed the given steps below to complete a construction. Step 1: Place the compass on one endpoint of the line segment. Step 2: Extend the compass from the chosen endpoint so that the width
More informationSeminar. Path planning using Voronoi diagrams and BSplines. Stefano Martina stefano.martina@stud.unifi.it
Seminar Path planning using Voronoi diagrams and BSplines Stefano Martina stefano.martina@stud.unifi.it 23 may 2016 This work is licensed under a Creative Commons AttributionShareAlike 4.0 International
More informationWe can display an object on a monitor screen in three different computermodel forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant
More informationDivideandConquer. Three main steps : 1. divide; 2. conquer; 3. merge.
DivideandConquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divideandconquer strategy can be described as follows. Procedure
More informationORIENTATIONS. Contents
ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit nsimplex which
More informationMedial Axis Construction and Applications in 3D Wireless Sensor Networks
Medial Axis Construction and Applications in 3D Wireless Sensor Networks Su Xia, Ning Ding, Miao Jin, Hongyi Wu, and Yang Yang Presenter: Hongyi Wu University of Louisiana at Lafayette Outline Introduction
More informationContents. 2 Lines and Circles 3 2.1 Cartesian Coordinates... 3 2.2 Distance and Midpoint Formulas... 3 2.3 Lines... 3 2.4 Circles...
Contents Lines and Circles 3.1 Cartesian Coordinates.......................... 3. Distance and Midpoint Formulas.................... 3.3 Lines.................................. 3.4 Circles..................................
More informationc 2002 I.P. Ivrissimtzis, M.A. Sabin, N.A. Dodgson
Technical Report UCAMCLTR544 ISSN 4762986 Number 544 Computer Laboratory On the support of recursive subdivision I.P. Ivrissimtzis, M.A. Sabin, N.A. Dodgson September 2002 An updated, improved version
More information1 3 4 = 8i + 20j 13k. x + w. y + w
) Find the point of intersection of the lines x = t +, y = 3t + 4, z = 4t + 5, and x = 6s + 3, y = 5s +, z = 4s + 9, and then find the plane containing these two lines. Solution. Solve the system of equations
More informationMA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
More informationComputational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON
Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf
More informationSpline Toolbox Release Notes
Spline Toolbox Release Notes Note The Spline Toolbox 3.1 was released in Webdownloadable form after Release 12.1 was released, but before Release 13. The Spline Toolbox 3.1.1 that is part of Release 13
More informationMean Value Coordinates
Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its
More informationSurface Area of Rectangular & Right Prisms Surface Area of Pyramids. Geometry
Surface Area of Rectangular & Right Prisms Surface Area of Pyramids Geometry Finding the surface area of a prism A prism is a rectangular solid with two congruent faces, called bases, that lie in parallel
More informationVisualization of 2D Domains
Visualization of 2D Domains This part of the visualization package is intended to supply a simple graphical interface for 2 dimensional finite element data structures. Furthermore, it is used as the low
More informationThe GeoMedia Fusion Validate Geometry command provides the GUI for detecting geometric anomalies on a single feature.
The GeoMedia Fusion Validate Geometry command provides the GUI for detecting geometric anomalies on a single feature. Below is a discussion of the Standard Advanced Validate Geometry types. Empty Geometry
More informationGeoGebra. 10 lessons. Gerrit Stols
GeoGebra in 10 lessons Gerrit Stols Acknowledgements GeoGebra is dynamic mathematics open source (free) software for learning and teaching mathematics in schools. It was developed by Markus Hohenwarter
More informationThe Essentials of CAGD
The Essentials of CAGD Chapter 2: Lines and Planes Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentialscagd c 2000 Farin & Hansford
More information28 ClosestPoint Problems 
28 ClosestPoint Problems  Geometric problems involving points on the plane usually involve implicit or explicit treatment of distances
More informationA gentle introduction to the Finite Element Method. Francisco Javier Sayas
A gentle introduction to the Finite Element Method Francisco Javier Sayas 2008 An introduction If you haven t been hiding under a stone during your studies of engineering, mathematics or physics, it is
More informationGeometry and Topology from Point Cloud Data
Geometry and Topology from Point Cloud Data Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Dey (2011) Geometry and Topology from Point Cloud Data WALCOM 11 1 / 51
More informationHow High a Degree is High Enough for High Order Finite Elements?
This space is reserved for the Procedia header, do not use it How High a Degree is High Enough for High Order Finite Elements? William F. National Institute of Standards and Technology, Gaithersburg, Maryland,
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationCHAPTER 8, GEOMETRY. 4. A circular cylinder has a circumference of 33 in. Use 22 as the approximate value of π and find the radius of this cylinder.
TEST A CHAPTER 8, GEOMETRY 1. A rectangular plot of ground is to be enclosed with 180 yd of fencing. If the plot is twice as long as it is wide, what are its dimensions? 2. A 4 cm by 6 cm rectangle has
More informationNatural Neighbour Interpolation
Natural Neighbour Interpolation DThe Natural Neighbour method is a geometric estimation technique that uses natural neighbourhood regions generated around each point in the data set. The method is particularly
More informationBiggar High School Mathematics Department. National 5 Learning Intentions & Success Criteria: Assessing My Progress
Biggar High School Mathematics Department National 5 Learning Intentions & Success Criteria: Assessing My Progress Expressions & Formulae Topic Learning Intention Success Criteria I understand this Approximation
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationTopological Data Analysis Applications to Computer Vision
Topological Data Analysis Applications to Computer Vision Vitaliy Kurlin, http://kurlin.org Microsoft Research Cambridge and Durham University, UK Topological Data Analysis quantifies topological structures
More informationFigure 2.1: Center of mass of four points.
Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEYINTERSCIENCE A John Wiley & Sons, Inc.,
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationFinite Elements for 2 D Problems
Finite Elements for 2 D Problems General Formula for the Stiffness Matrix Displacements (u, v) in a plane element are interpolated from nodal displacements (ui, vi) using shape functions Ni as follows,
More informationUnknown Angle Problems with Inscribed Angles in Circles
: Unknown Angle Problems with Inscribed Angles in Circles Student Outcomes Use the inscribed angle theorem to find the measures of unknown angles. Prove relationships between inscribed angles and central
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin email: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider twopoint
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationB2.53R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.
B2.53R3: COMPUTER GRAPHICS NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAROFF ANSWER
More informationVector Notation: AB represents the vector from point A to point B on a graph. The vector can be computed by B A.
1 Linear Transformations Prepared by: Robin Michelle King A transformation of an object is a change in position or dimension (or both) of the object. The resulting object after the transformation is called
More informationSOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve
SOLUTIONS Problem. Find the critical points of the function f(x, y = 2x 3 3x 2 y 2x 2 3y 2 and determine their type i.e. local min/local max/saddle point. Are there any global min/max? Partial derivatives
More informationLesson 53: Concurrent Lines, Medians and Altitudes
Playing with bisectors Yesterday we learned some properties of perpendicular bisectors of the sides of triangles, and of triangle angle bisectors. Today we are going to use those skills to construct special
More informationGRAPHING (2 weeks) Main Underlying Questions: 1. How do you graph points?
GRAPHING (2 weeks) The Rectangular Coordinate System 1. Plot ordered pairs of numbers on the rectangular coordinate system 2. Graph paired data to create a scatter diagram 1. How do you graph points? 2.
More informationEstimated Pre Calculus Pacing Timeline
Estimated Pre Calculus Pacing Timeline 20102011 School Year The timeframes listed on this calendar are estimates based on a fiftyminute class period. You may need to adjust some of them from time to
More informationCurriculum Map by Block Geometry Mapping for Math Block Testing 20072008. August 20 to August 24 Review concepts from previous grades.
Curriculum Map by Geometry Mapping for Math Testing 20072008 Pre s 1 August 20 to August 24 Review concepts from previous grades. August 27 to September 28 (Assessment to be completed by September 28)
More informationa. all of the above b. none of the above c. B, C, D, and F d. C, D, F e. C only f. C and F
FINAL REVIEW WORKSHEET COLLEGE ALGEBRA Chapter 1. 1. Given the following equations, which are functions? (A) y 2 = 1 x 2 (B) y = 9 (C) y = x 3 5x (D) 5x + 2y = 10 (E) y = ± 1 2x (F) y = 3 x + 5 a. all
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationChapter 6 Notes: Circles
Chapter 6 Notes: Circles IMPORTANT TERMS AND DEFINITIONS A circle is the set of all points in a plane that are at a fixed distance from a given point known as the center of the circle. Any line segment
More informationChapter 4: NonParametric Classification
Chapter 4: NonParametric Classification Introduction Density Estimation Parzen Windows KnNearest Neighbor Density Estimation KNearest Neighbor (KNN) Decision Rule Gaussian Mixture Model A weighted combination
More informationNorth Carolina Math 2
Standards for Mathematical Practice 1. Make sense of problems and persevere in solving them. 2. Reason abstractly and quantitatively 3. Construct viable arguments and critique the reasoning of others 4.
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More informationIntroduction to ANSYS ICEM CFD
Lecture 6 Mesh Preparation Before Output to Solver 14. 0 Release Introduction to ANSYS ICEM CFD 1 2011 ANSYS, Inc. March 22, 2015 Mesh Preparation Before Output to Solver What will you learn from this
More informationChapters 6 and 7 Notes: Circles, Locus and Concurrence
Chapters 6 and 7 Notes: Circles, Locus and Concurrence IMPORTANT TERMS AND DEFINITIONS A circle is the set of all points in a plane that are at a fixed distance from a given point known as the center of
More informationAdding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors
1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number
More informationGeometry Chapter 1 Vocabulary. coordinate  The real number that corresponds to a point on a line.
Chapter 1 Vocabulary coordinate  The real number that corresponds to a point on a line. point  Has no dimension. It is usually represented by a small dot. bisect  To divide into two congruent parts.
More informationLevel Set Framework, Signed Distance Function, and Various Tools
Level Set Framework Geometry and Calculus Tools Level Set Framework,, and Various Tools Spencer Department of Mathematics Brigham Young University Image Processing Seminar (Week 3), 2010 Level Set Framework
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the FordFulkerson
More informationMachine Learning and Data Mining. Regression Problem. (adapted from) Prof. Alexander Ihler
Machine Learning and Data Mining Regression Problem (adapted from) Prof. Alexander Ihler Overview Regression Problem Definition and define parameters ϴ. Prediction using ϴ as parameters Measure the error
More informationLargest FixedAspect, AxisAligned Rectangle
Largest FixedAspect, AxisAligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 19982016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
More informationBALTIC OLYMPIAD IN INFORMATICS Stockholm, April 1822, 2009 Page 1 of?? ENG rectangle. Rectangle
Page 1 of?? ENG rectangle Rectangle Spoiler Solution of SQUARE For start, let s solve a similar looking easier task: find the area of the largest square. All we have to do is pick two points A and B and
More information4.1 Learning algorithms for neural networks
4 Perceptron Learning 4.1 Learning algorithms for neural networks In the two preceding chapters we discussed two closely related models, McCulloch Pitts units and perceptrons, but the question of how to
More informationSPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM
SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the
More informationFEM Software Automation, with a case study on the Stokes Equations
FEM Automation, with a case study on the Stokes Equations FEM Andy R Terrel Advisors: L R Scott and R C Kirby Numerical from Department of Computer Science University of Chicago March 1, 2006 Masters Presentation
More informationEXPONENTS. To the applicant: KEY WORDS AND CONVERTING WORDS TO EQUATIONS
To the applicant: The following information will help you review math that is included in the Paraprofessional written examination for the Conejo Valley Unified School District. The Education Code requires
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationSolutions for Review Problems
olutions for Review Problems 1. Let be the triangle with vertices A (,, ), B (4,, 1) and C (,, 1). (a) Find the cosine of the angle BAC at vertex A. (b) Find the area of the triangle ABC. (c) Find a vector
More informationEdExcel Decision Mathematics 1
EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationCIRCLE COORDINATE GEOMETRY
CIRCLE COORDINATE GEOMETRY (EXAM QUESTIONS) Question 1 (**) A circle has equation x + y = 2x + 8 Determine the radius and the coordinates of the centre of the circle. r = 3, ( 1,0 ) Question 2 (**) A circle
More informationHigher Education Math Placement
Higher Education Math Placement Placement Assessment Problem Types 1. Whole Numbers, Fractions, and Decimals 1.1 Operations with Whole Numbers Addition with carry Subtraction with borrowing Multiplication
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationDXF Import and Export for EASE 4.0
DXF Import and Export for EASE 4.0 Page 1 of 9 DXF Import and Export for EASE 4.0 Bruce C. Olson, Dr. Waldemar Richert ADA Copyright 2002 Acoustic Design Ahnert EASE 4.0 allows both the import and export
More informationSurface Reconstruction from Point Clouds
Autonomous Systems Lab Prof. Roland Siegwart BachelorThesis Surface Reconstruction from Point Clouds Spring Term 2010 Supervised by: Andreas Breitenmoser François Pomerleau Author: Inna Tishchenko Abstract
More informationChapter 1: Essentials of Geometry
Section Section Title 1.1 Identify Points, Lines, and Planes 1.2 Use Segments and Congruence 1.3 Use Midpoint and Distance Formulas Chapter 1: Essentials of Geometry Learning Targets I Can 1. Identify,
More informationLesson 2: Circles, Chords, Diameters, and Their Relationships
Circles, Chords, Diameters, and Their Relationships Student Outcomes Identify the relationships between the diameters of a circle and other chords of the circle. Lesson Notes Students are asked to construct
More informationc 2007 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 29, No. 3, pp. 338 354 c 27 Society for Industrial and Applied Mathematics BIVARIATE SPLINES OF VARIOUS DEGREES FOR NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS XIANLIANG
More informationGeometry Enduring Understandings Students will understand 1. that all circles are similar.
High School  Circles Essential Questions: 1. Why are geometry and geometric figures relevant and important? 2. How can geometric ideas be communicated using a variety of representations? ******(i.e maps,
More informationON TORI TRIANGULATIONS ASSOCIATED WITH TWODIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.
ON TORI TRIANGULATIONS ASSOCIATED WITH TWODIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional
More informationA fast and robust algorithm to count topologically persistent holes in noisy clouds
A fast and robust algorithm to count topologically persistent holes in noisy clouds Vitaliy Kurlin Durham University Department of Mathematical Sciences, Durham, DH1 3LE, United Kingdom vitaliy.kurlin@gmail.com,
More informationLinear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
More informationRobust NURBS Surface Fitting from Unorganized 3D Point Clouds for Infrastructure AsBuilt Modeling
81 Robust NURBS Surface Fitting from Unorganized 3D Point Clouds for Infrastructure AsBuilt Modeling Andrey Dimitrov 1 and Mani GolparvarFard 2 1 Graduate Student, Depts of Civil Eng and Engineering
More informationAlgorithmica 9 1989 SpringerVerlag New York Inc.
Algorithmica (1989) 4:97108 Algorithmica 9 1989 SpringerVerlag New York Inc. Constrained Delaunay Triangulations 1 L. Paul Chew 2 Abstract. Given a set of n vertices in the plane together with a set
More informationCentroid: The point of intersection of the three medians of a triangle. Centroid
Vocabulary Words Acute Triangles: A triangle with all acute angles. Examples 80 50 50 Angle: A figure formed by two noncollinear rays that have a common endpoint and are not opposite rays. Angle Bisector:
More informationGEOMETRY COMMON CORE STANDARDS
1st Nine Weeks Experiment with transformations in the plane GCO.1 Know precise definitions of angle, circle, perpendicular line, parallel line, and line segment, based on the undefined notions of point,
More information10.4 Surface Area of Prisms, Cylinders, Pyramids, Cones, and Spheres. 10.4 Day 1 Warmup
10.4 Surface Area of Prisms, Cylinders, Pyramids, Cones, and Spheres 10.4 Day 1 Warmup 1. Which identifies the figure? A rectangular pyramid B rectangular prism C cube D square pyramid 3. A polyhedron
More informationINTRODUCTION TO THE FINITE ELEMENT METHOD
INTRODUCTION TO THE FINITE ELEMENT METHOD G. P. Nikishkov 2004 Lecture Notes. University of Aizu, AizuWakamatsu 9658580, Japan niki@uaizu.ac.jp 2 Updated 20040119 Contents 1 Introduction 5 1.1 What
More informationVoronoi with Obstacles, Delaunay Constrained Triangulation and Delaunay 3D
Voronoi with Obstacles, Delaunay Constrained Triangulation and Delaunay 3D Marc Comino Trinidad December 13, 2014 Table of contents Shortestpath Voronoi Diagram Visibility Shortestpath Voronoi Diagram
More informationComputational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (twodimensional), R 2 Space (threedimensional), R 3 Space (higherdimensional), R d A point in the plane, 3dimensional space,
More informationGeometric Modelling & Curves
Geometric Modelling & Curves Geometric Modeling Creating symbolic models of the physical world has long been a goal of mathematicians, scientists, engineers, etc. Recently technology has advanced sufficiently
More informationCOVERAGE ENSURING FOR WIRELESS NETWORK SERVICE AREA WITH OBSTACLES
Session 7. Intelligent Transport Systems (Electronics) Proceedings of the 9th International Conference Reliability and Statistics in Transportation and Communication (RelStat 09), 21 24 October 2009, Riga,
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationKEANSBURG SCHOOL DISTRICT KEANSBURG HIGH SCHOOL Mathematics Department. HSPA 10 Curriculum. September 2007
KEANSBURG HIGH SCHOOL Mathematics Department HSPA 10 Curriculum September 2007 Written by: Karen Egan Mathematics Supervisor: Ann Gagliardi 7 days Sample and Display Data (Chapter 1 pp. 447) Surveys and
More informationOffline Model Simplification for Interactive Rigid Body Dynamics Simulations Satyandra K. Gupta University of Maryland, College Park
NSF GRANT # 0727380 NSF PROGRAM NAME: Engineering Design Offline Model Simplification for Interactive Rigid Body Dynamics Simulations Satyandra K. Gupta University of Maryland, College Park Atul Thakur
More information