Continuity of Bçezier patches. Jana Pçlnikovça, Jaroslav Plaçcek, Juraj ç Sofranko. Faculty of Mathematics and Physics. Comenius University
|
|
- Randall Washington
- 5 years ago
- Views:
Transcription
1 Continuity of Bezier patches Jana Plnikova, Jaroslav Placek, Juraj Sofranko Faculty of Mathematics and Physics Comenius University Bratislava Abstract The paper is concerned about the question of smooth glueing of triangular Bezier patches. In the begining polar forms are brieæy explained. After that they are applied on parametric continuity. We'll obtain a geometric interpretation of C and C 2 smoothly joined Bezier patches. In the next part we'll deal in geometric continuity. We will show relations between derivatives of two maps which are forced by the condition of their geometric continuity. In the place of shape parameters matrices occur. The rest of the paper is devoted to investigating of this matrices and reparametrization functions. It seems that the matrices are not arbitrary, but very strong conditions are put on them. Basic deænitions. Bezier patches Let points t ;t ;t 2 2 E 2 are non-colinear. Then for each u 2 E 2 there exist unique triplet of numbers èuè; èuè; 2 èuè2 R, satisfying u = èuèt + èuèt + 2 èuèt 2 ; èuè+ èuè+ 2 èuè=: The numbers èuè; èuè; 2 èuè are called barycentric coordinates of the point uwith respect to the triangle t t t 2. In next let's suppose that the points t ;t ;t 2 are æxly given. Polynomial B 4 ijk : E2! R deæned B 4 ijk èuè = n ijk i èuè j èuè k 2èuè; i + j + k = n is called Bernsten polynomial. Notice, that all Bernstein polynomials of degree n èi.e. i + j + k = nè create basis of the space of polynomials of degree at most n.
2 Let B : E 2! E d is deæned : Bèuè = X i+j+k=n B 4 ijk èuèb ijk; b ijk are points from E d The restriction of this map to 4t t t 2 is called triangular Bezier patch of degree n. Points b ijk are control points a create a control net..2 Polar forms A map f : M! N is linear iæ it preserves linear combinations, i. e. fè P æ i u i è= P æ i fèu i è; u i 2 M; æ i 2 R f : M! N is aæne iæ it preserves aæne combinations of points : fè P æ i j i è= P æ i fèu i è; u i 2 M; P æ i =; æ i 2 R f :èmè n!n is multilinear èmultiaæneè iæ f is linear èaæneè in each argument when the others are æxed. f :èmè n!n is symmetric iæ its value doesn't depends on the order of arguments. It means fèu ;u 2 ;:::u n è=fèu ;u 2 ;:::u n è where è ; 2 ;::: n èisapermutation of the set è; 2;:::nè. Now we can approach a deænition of polar forms. Let F is polynomial E 2! E d of degree n. Then there exists unique map f :èe 2 è n!e d which ismultiaæne, symmetric and has a diagonal property, i.e. fèu;:::uè=fèuè. This map is called èaæneè blossom èpolar formè of F. For our cogitations linear blossoms are more usefull. For this purpose we must present this two special insertions E 2 to E 3 : u =èu ;u 2 è è ^u=èu ;u 2 ;è u =èu ;u 2 è è u=èu ;u 2 ;è Linear blossom èpolar formè of the polynomial F : E 2! E 3 is a map fæ : èe 3 è n! E d, which ismultilinear, symmetric and has a diagonal property, i.e. fæèu; u;::: uè = Fèuè. Such map always exist and is unique. Linear and aæne blossoms of the same polynomial F satisfy fæèu ; u 2 ;:::u n è=fèu ;u 2 ;:::u n è; u i 2 E 2
3 2 Parametric continuity Maps F; G : E 2! E d are parametric continuous of the order q in u 2 E 2 if their directional derivatives in u up to order q are the same. The theory of polar forms can be applied on parametric continuity of surfaces. But ærst let's mention their two important properties: Let F beabezier patch of degree n with control points b ijk for i + j + k = n with respect to 4t t t 2 and let f be its polar form. Then b ijk = fèt i tj tk 2è; i + j + k = n Furthermore if we denote D 2:::qF èuè q-th directional derivative off in u with respect to vectors ::: q, then the linear blossom of F : E 2! E d satisfy relation D 2:::q F èuè = n! èn,qè! f æèu n,q ^ ^2 ::: ^ q è Proofs of this properties you can ænd for example in ë3ë. We started to use a simpler and lucider multiplicative notation: Instead of fèu ;u 2 ;:::u n èwe are going to write fèu u 2 :::u n è. By the entry fèu n,k u u 2 :::u k èwewant tosay that argument u occurs èn, kè times there. Therefore, if we want to ænd out a value of a derivative of a polynomial, we don't need to derivate, but it is enough to look at a certain value of its blossom. From the previous theorem we get conditions for parametric continuity of two patches: Let F; G : E 2! E d are triangular Bezier patches and let u be a point from E 2. Then according to èè F and G are continuous in u of q-th order iæ èè f æ èu n,i ^ :::^ i è=g æ èu n,i ^ :::^ i è; i =;:::q 3 Geometric interpretation t o e t 2 6 e t e = t, t e e = t 2, t e 2 e 2 = e t, t t Figure : Mapped space
4 Let's denote barycentric coordinates of e t with respect to 4t t t 2 as ; ; 2 : e t = t + t + 2 t 2 where é. Let Bezier patches F; G map this point coæguration in this way: F : 4t t t 2! E 2 G : 4e t t 2 t! E 2 Further let b ijk are control points of the patch F and e b ijk are control points of the patch G. Let's investigate a continuity of this two patches along the common edge t t 2.Ifwe suppose C continuity, itisobvious, that derivatives in u 2 t t 2 with respect to e are the same í it's the same Bezier curve. So that it is enough to ænd only one more direction already, which is lineary independent with e, with respect to which the maps F; G poses the same derivative. Then the C continuity is satisæed because of the fact that D F èuè is linear in for a æxed u and so the other directional derivatives can be composed from the mentioned two. We can write : e t, t = èt, t è+ 2 èt 2,t è e 2 = e + 2 e D e2 Fèuè= D e Fèuè+ 2 D e Fèuè D e2 Gèuè=D e2 Fèuè D e2 Gèuè= D e Fèuè+ 2 D e Fèuè g æ èu n,^e 2 è= f æ èu n,^e è+ 2 f æ èu n,^e è ::: gèe t t i tj 2è= fèt t i tj 2è+ fèt i+ t j 2è+ 2 fèt i tj+ 2 è e bij = b ij + b i+j + 2 b ij+ ; i + j = n, ; u2 t t 2 And thanks to the blossoming we have simply obtained well-known geometric interpretation of the C continuity: Bezier patches F : 4t t t 2! E d ;G:4t e t t 2 are C smoothly joined along the common boundary iæ the control points b ij ;b i+j ; e b ij ;b ij+ lie in the same plane and create an aæne image of the quadrangle t t e t t 2 èlook at æg. 2è. After similar cogitations we can obtain not so known geometric interpretation of C 2 continuity: Bezier patches F : 4t t t 2! E d ;G : 4t e t t 2 are C 2 smoothly joined along the common boundary iæ moreover there exist points d i ; i =;:::n, such that verteces b 2ij ;b i+j ;d i ;b ij+ lie in the same plane and create an aæne image of the quadrangle t t e t t 2 and also points d i ; e b i+j ; e b 2jk ; e b ij+ are coplanar and create an aæne image of the quadrangle t t e t t 2 too èæg. 3è. 4 Geometric continuity Let F; G : E 2! E d are maps. Let u 2 E 2. Then F; G are in u geometric continuous of q-th order iæ there exist such parametrization of surfaces F; G, that
5 Figure 2: C continuity Figure 3: C 2 continuity they are parametric continuos of q-th order. It means: F = F èx; yè i.e. is a function of parameters x; y G = Gès; tè : Let's try to reparametrize the map F and express it by s; t. Soxand y will be written as functions: x = xès; tè; y = yès; tè. Let both maps are now expressed in the way, that they are parametric continuous in u =ès ;t è:
6 Continuity of ærst degree: F s èuè =G s èuè ^ F t èuè=g t èuè For continuity of second degree moreover F ss èuè =G ss èuè ^ F st èuè =G st èuè ^ F tt èuè =G tt èuè But F has to be derivated as a compound function. Let's denote a ij èuè = b ij èuè j u 2 E2 Then the relation between derivatives of F and G with respect to the original parameters can be expressed by connection G ss G st G tt A a 2 b 2 a b a 2 b 2 A F x G s = G t F y + a b a b F x F a2 2a b b 2 a a a b + a b b b a 2 2a b b 2 F xx Let G is the matrix of ærst derivatives of G, G is the matrix of its second derivatives and so on. Similary let F is the matrix of ærst derivatives of F, F is the matrix of its second derivatives and so on. Then the relations è2è, è3è and other can be written in a simpler way: G =æ F F xy F yy A è2è è3è G =æ 2 F +æ 22 F è4è G =æ 3 F +æ 23 F +æ 33 F ::: Surfaces F matrices and G are in u geometric continuous of q-th degree iæ there exist æ ij ; j =:::q; i=:::j satisfying the mentioned relations. We observe that the relations for the geometric continuity of surfaces are very similar to the ones for the geometric continuity of curves. But as shape parameters there are matrices æ ij instead of real numbers.
7 5 Geometric continuity of Bezier patches Now we are going to apply the results of the previous section on the Bezier patches. Let Bezier patches F; G are deæned on the quadrangle t t e t t 2 like this: F : 4t t t 2! E 2 G : 4e t t 2 t! E 2 Let F and G are regularly aparametrized in this way: F = F èr;sè G= Gès; tè where parameter r raises in the direction e, s raises in the direction e and t in the direction e 2 èlook æg.è. We suppose C continuity :Fè;sè=Gès; è: In the begining we require geometric continuity of the ærst order of the patches F and G along the common boundary t t 2. It means that for all u from this edge there exist a matrix æ, satisfying è2è. In this special case it can be written: De G D e2 G where a ij ;b ij are functions of the point u. = a b De F a b D e F Thanks to the fact that parameter s is common for both F and G, it holds D e Gèuè =D e Fèuè for all u 2 t t 2 and so a = and b = constantly. Let a = a b = b for simplicity. Then : æ = a b ; a = aèuè b = bèuè The result can be geometricaly interpreted : Bezier patches are in u geometric continuous of ærst degree iæ they have in uthe same tangent plane. Let's continue by investigating of geometric continuity of second degree of two Bezier patches. Besides the matrix æ, with the speciæed form, the matrices æ 22 and æ 2 must exist, such that G =æ 2 F +æ 22 F If we look at è3è, we can notice, that all elements of the matrix æ 22 are already known, because it is composed only of coeæcients occured in æ. And as for æ 2, it's possible to proceed like in the case of æ. Because the same parameter and the derivative of the same curve is considered, it holds D e e Gèuè =D e e Fèuè è a 2 = b 2 =
8 It will be a bit more complicated for the combined derivative: D e e 2 Gèuè =D e èd e2 Gèuèè = D e èad e F èuè+bd e F èuèè = ad e èd e F èuèè + bd e èd e F èuèè = ad e e F èuè+bd e e F èuè and after comparing with è3è we obtain a = b = constantly for all u 2 t t 2. The result of this observations is the next equation D e e G D e e 2 GA A D e F + D a b F D e2 e 2 G c d a 2 2ab b 2 D e e F D e e FA D e e F We could continue similary. After the small cogitation above the equation for the q-th derivative G èqè = æ q F +æ 2q F +æææ+æ qq F èqè è5è we realize that if the previous derivatives has been investigated, new coeæcients appear only in matix æ q í the q-th derivatives of the reparametrization functions are only there. Let's look at it more closely. Let the reparametrization functions x and y are polynomials of degree m èlook ë2ëè : X X xèu; vè = æ ij u i v j ^ yèu; vè= æ ij u i v j i+jm i+jm From the matrix æ 2 it follows x uv = a = and also y uv = b =. It means that nor xèu; vè neither yèu; vè contains combined member. Furthermore from æ it is x u = a =,i.e.xdoesn't depend on parameter u. In the case of y it is a bit diæerent: y u = b = constantly along the whole boundary t t 2. It means that yèu; vè contains u only as a linear member witch coeæcient. The result can be written: xèu; vè=xèvè= yèu; vè=u+ nx i= nx i= And then we obtain more speciæed form of æ j : æ q = B@ a q ::: b q a q, b q, CA = a q b q æ i v i æ i v i B@ ::: a q b q CA
9 Only last two members of æ q can get an arbitrary value. Let's look at the result. It seems that if the conditions of GC q, smooth joining of the patches F and G has been formulated and we want to reach smoothnes of q-th order, it can be determined by only two shape parameters in the matrix æ q. There's no possibility to manipulate with other matrices occured in the relation between G èqè and F èqè èlook è5èè. So the geometric continuity of curves and surfaces are very similar not only because of the form of the equation system è4è but also because of the constraints for the work with shape parameters. References ëë J. M. Hahn. Geometric continuos patch complexes. Computer Aided Geometric Design, è6è:55í67, 989. ë2ë J. Hoschek and L. Dieter. Fundamentals of Computer Aided Geometric Design, pages 33í37. A K Peters, Ltd, 993. ë3ë H. P. Seidel. Polar forms and triangular B-spline surfaces. Computing in Euclidean Geometry, pages 235í286, 992.
LECTURE Review. In this lecture we shall study the errors and stability properties for numerical solutions of initial value.
LECTURE 24 Error Analysis for Multi-step Methods 1. Review In this lecture we shall study the errors and stability properties for numerical solutions of initial value problems of the form è24.1è dx = fèt;
More informationKatholieke Universiteit Leuven Department of Computer Science
Interpolation with quintic Powell-Sabin splines Hendrik Speleers Report TW 583, January 2011 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A B-3001 Heverlee (Belgium)
More informationRational Bézier Patch Differentiation using the. Rational Forward Difference Operator
Rational Bézier Patch Differentiation using the Rational Forward Difference Operator Xianming Chen Richard Riesenfeld Elaine Cohen School of Computing University of Utah CGI 05 p.1/37 Introduction For
More informationCurves, Surfaces and Segments, Patches
Curves, Surfaces and Segments, atches The University of Texas at Austin Conics: Curves and Quadrics: Surfaces Implicit form arametric form Rational Bézier Forms and Join Continuity Recursive Subdivision
More informationLECTURE 9. In the example above, we have a total of n equations and m unknowns. However, for the most part we
LECTURE 9 Review of Matrix lgebra We shall now look at algorithms for solving systems of linear equations system of linear equations is a set of equations of the form è9è 8 é é: a x + a x + æææ+ a m x
More informationA New Invariance Property of Lyapunov Characteristic Directions S. Bharadwaj and K.D. Mease Mechanical and Aerospace Engineering University of Califor
A New Invariance Property of Lyapunov Characteristic Directions S. Bharadwaj and K.D. Mease Mechanical and Aerospace Engineering University of California, Irvine, California, 92697-3975 Email: sanjay@eng.uci.edu,
More informationAbstract. subplans to arrive at a more eæcient implementation. Our algorithm improves upon the
An OèT 3 è algorithm for the economic lot-sizing problem with constant capacities C.P.M. van Hoesel æ A.P.M. Wagelmans y Revised June 1994 Abstract We develop an algorithm that solves the constant capacities
More informationLECTURE 17. Algorithms for Polynomial Interpolation
LECTURE 7 Algorithms for Polynomial Interpolation We have thus far three algorithms for determining the polynomial interpolation of a given set of data.. Brute Force Method. Set and solve the following
More informationIf we remove the cyclotomic factors of fèxè, must the resulting polynomial be 1 or irreducible? This is in fact not the case. A simple example is give
AN EXTENSION OF A THEOREM OF LJUNGGREN Michael Filaseta and Junior Solan* 1. Introduction E.S. Selmer ë5ë studied the irreducibility over the rationals of polynomials of the form x n + " 1 x m + " 2 where
More informationRational Bézier Patch Differentiation using the Rational Forward Difference Operator
Rational Bézier Patch Differentiation using the Rational Forward Difference Operator Xianming Chen, Richard F. Riesenfeld, Elaine Cohen School of Computing, University of Utah Abstract This paper introduces
More informationalso has x æ as a local imizer. Of course, æ is typically not known, but an algorithm can approximate æ as it approximates x æ èas the augmented Lagra
Introduction to sequential quadratic programg Mark S. Gockenbach Introduction Sequential quadratic programg èsqpè methods attempt to solve a nonlinear program directly rather than convert it to a sequence
More informationpairs. Such a system is a reinforcement learning system. In this paper we consider the case where we have a distribution of rewarded pairs of input an
Learning Canonical Correlations Hans Knutsson Magnus Borga Tomas Landelius knutte@isy.liu.se magnus@isy.liu.se tc@isy.liu.se Computer Vision Laboratory Department of Electrical Engineering Linkíoping University,
More informationCS 294-2, Visual Grouping and Recognition èprof. Jitendra Malikè Sept. 8, 1999
CS 294-2, Visual Grouping and Recognition èprof. Jitendra Malikè Sept. 8, 999 Lecture è6 èbayesian estimation and MRFè DRAFT Note by Xunlei Wu æ Bayesian Philosophy æ Markov Random Fields Introduction
More informationVector Spaces ปร ภ ม เวกเตอร
Vector Spaces ปร ภ ม เวกเตอร 5.1 Real Vector Spaces ปร ภ ม เวกเตอร ของจ านวนจร ง Vector Space Axioms (1/2) Let V be an arbitrary nonempty set of objects on which two operations are defined, addition and
More informationIntroduction to Curves. Modelling. 3D Models. Points. Lines. Polygons Defined by a sequence of lines Defined by a list of ordered points
Introduction to Curves Modelling Points Defined by 2D or 3D coordinates Lines Defined by a set of 2 points Polygons Defined by a sequence of lines Defined by a list of ordered points 3D Models Triangular
More informationEconomics 472. Lecture 16. Binary Dependent Variable Models
University of Illinois Fall 998 Department of Economics Roger Koenker Economics 472 Lecture 6 Binary Dependent Variable Models Let's begin with a model for an observed proportion, or frequency. We would
More informationCurves. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Taku Komura
Curves Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Taku Komura How to create a virtual world? To compose scenes We need to define objects
More informationCMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier
CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier Modeling Creating 3D objects How to construct complicated surfaces? Goal Specify objects with few control points Resulting object should be visually
More information322 HENDRA GUNAWAN AND MASHADI èivè kx; y + zk çkx; yk + kx; zk: The pair èx; kæ; ækè is then called a 2-normed space. A standard example of a 2-norme
SOOCHOW JOURNAL OF MATHEMATICS Volume 27, No. 3, pp. 321-329, July 2001 ON FINITE DIMENSIONAL 2-NORMED SPACES BY HENDRA GUNAWAN AND MASHADI Abstract. In this note, we shall study ænite dimensional 2-normed
More informationS-Y0 U-G0 CANDIDATES
«< «X((«( (V«" j -- Y ? K «: :» V X K j 44 E GVE E E EY Y VE E 2 934 VE EEK E-EE E E 4 E -Y0 U-G0 E - Y - V Y ^ K - G --Y-G G - E K - : - ( > x 200 G < G E - : U x K K - " - z E V E E " E " " j j x V
More informationLecture 1. Introduction. The importance, ubiquity, and complexity of embedded systems are growing
Lecture 1 Introduction Karl Henrik Johansson The importance, ubiquity, and complexity of embedded systems are growing tremendously thanks to the revolution in digital technology. This has created a need
More informationMath 370 Homework 2, Fall 2009
Math 370 Homework 2, Fall 2009 (1a) Prove that every natural number N is congurent to the sum of its decimal digits mod 9. PROOF: Let the decimal representation of N be n d n d 1... n 1 n 0 so that N =
More informationWeighted G 1 -Multi-Degree Reduction of Bézier Curves
Vol. 7, No. 2, 216 Weighted G 1 -Multi-Degree Reduction of Bézier Curves Abedallah Rababah Department of Mathematics, Jordan University of Science and Technology Irbid 2211 Jordan Salisu Ibrahim Department
More informationBernstein polynomials of degree N are defined by
SEC. 5.5 BÉZIER CURVES 309 5.5 Bézier Curves Pierre Bézier at Renault and Paul de Casteljau at Citroën independently developed the Bézier curve for CAD/CAM operations, in the 1970s. These parametrically
More informationDeænition 1 A set S is ænite if there exists a number N such that the number of elements in S èdenoted jsjè is less than N. If no such N exists, then
Morphology of Proof An introduction to rigorous proof techniques Craig Silverstein September 26, 1998 1 Methodology of Proof an example Deep down, all theorems are of the form if A then B. They may be
More informationthe Unitary Polar Factor æ Ren-Cang Li Department of Mathematics University of California at Berkeley Berkeley, California 94720
Relative Perturbation Bounds for the Unitary Polar Factor Ren-Cang Li Department of Mathematics University of California at Berkeley Berkeley, California 9470 èli@math.berkeley.eduè July 5, 994 Computer
More informationLecture 16: 9.2 Geometry of Linear Operators
Lecture 16: 9.2 Geometry of Linear Operators Wei-Ta Chu 2008/11/19 Theorem 9.2.1 If T: R 2 R 2 is multiplication by an invertible matrix A, then the geometric effect of T is the same as an appropriate
More informationTetrahedral C m Interpolation by Rational Functions
Tetrahedral C m Interpolation by Rational Functions Guoliang Xu State Key Laboratory of Scientific and Engineering Computing, ICMSEC, Chinese Academy of Sciences Chuan I Chu Weimin Xue Department of Mathematics,
More informationBézier solutions of the wave equation
Bézier solutions of the wave equation J.V. Beltran and J. Monterde Dep. de Geometria i Topologia, Universitat de València, Burjassot (València), Spain. beltranv@uv.es, monterde@uv.es Abstract. We study
More informationThe method of teepet decent i probably the bet known procedure for ænding aymptotic behavior of integral of the form Z è1è Ièè = gèzè e f èzè dz; C wh
UNIFORM ASYMPTOTIC EXPANSIONS R. Wong Department of Mathematic City Univerity of Hong Kong Tat Chee Ave Kowloon, Hong Kong for NATOèASI Special Function 2000 1 The method of teepet decent i probably the
More informationThe total current injected in the system must be zero, therefore the sum of vector entries B j j is zero, è1;:::1èb j j =: Excluding j by means of è1è
1 Optimization of networks 1.1 Description of electrical networks Consider an electrical network of N nodes n 1 ;:::n N and M links that join them together. Each linkl pq = l k joints the notes numbered
More informationP.B. Stark. January 29, 1998
Statistics 210B, Spring 1998 Class Notes P.B. Stark stark@stat.berkeley.edu www.stat.berkeley.eduèçstarkèindex.html January 29, 1998 Second Set of Notes 1 More on Testing and Conædence Sets See Lehmann,
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationCONTROL POLYGONS FOR CUBIC CURVES
On-Line Geometric Modeling Notes CONTROL POLYGONS FOR CUBIC CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview B-Spline
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationHermite Interpolation with Euclidean Pythagorean Hodograph Curves
Hermite Interpolation with Euclidean Pythagorean Hodograph Curves Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 86 75 Praha 8 zbynek.sir@mff.cuni.cz Abstract.
More informationNOTES ON LINEAR ALGEBRA. 1. Determinants
NOTES ON LINEAR ALGEBRA 1 Determinants In this section, we study determinants of matrices We study their properties, methods of computation and some applications We are familiar with the following formulas
More informationGROUP THEORY PRIMER. New terms: so(2n), so(2n+1), symplectic algebra sp(2n)
GROUP THEORY PRIMER New terms: so(2n), so(2n+1), symplectic algebra sp(2n) 1. Some examples of semi-simple Lie algebras In the previous chapter, we developed the idea of understanding semi-simple Lie algebras
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 informationMATH Max-min Theory Fall 2016
MATH 20550 Max-min Theory Fall 2016 1. Definitions and main theorems Max-min theory starts with a function f of a vector variable x and a subset D of the domain of f. So far when we have worked with functions
More information1.1. The analytical denition. Denition. The Bernstein polynomials of degree n are dened analytically:
DEGREE REDUCTION OF BÉZIER CURVES DAVE MORGAN Abstract. This paper opens with a description of Bézier curves. Then, techniques for the degree reduction of Bézier curves, along with a discussion of error
More informationA proof of Calibration via Blackwell's. Dean P. Foster æ. Abstract. Over the past few years many proofs of calibration have been presented
A proof of Calibration via Blackwell's Approachability heore Dean P. Foster æ February 27, 1997 Abstract Over the past few years any proofs of calibration have been presented èfoster and Vohra è1991, 1997è,
More informationGrothendieck s Inequality
Grothendieck s Inequality Leqi Zhu 1 Introduction Let A = (A ij ) R m n be an m n matrix. Then A defines a linear operator between normed spaces (R m, p ) and (R n, q ), for 1 p, q. The (p q)-norm of A
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationNOTES ON LINEAR ODES
NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary
More informationW 1 æw 2 G + 0 e? u K y Figure 5.1: Control of uncertain system. For MIMO systems, the normbounded uncertainty description is generalized by assuming
Chapter 5 Robust stability and the H1 norm An important application of the H1 control problem arises when studying robustness against model uncertainties. It turns out that the condition that a control
More informationAbstract To characterize color values measured by color devices èe.g. scanners, color copiers and color camerasè in a deviceíindependent fashion these
White-point preserving color correction Graham D. Finlayson Department of Computer Science, University of York, York, United Kingdom YO1 5DD Mark S. Drew School of Computing Science, Simon Fraser University,
More informationSPRING Final Exam. May 5, 1999
IE 230: PROBABILITY AND STATISTICS IN ENGINEERING SPRING 1999 Final Exam May 5, 1999 NAME: Show all your work. Make sure that any notation you use is clear and well deæned. For example, if you use a new
More informationproblem of detection naturally arises in technical diagnostics, where one is interested in detecting cracks, corrosion, or any other defect in a sampl
In: Structural and Multidisciplinary Optimization, N. Olhoæ and G. I. N. Rozvany eds, Pergamon, 1995, 543í548. BOUNDS FOR DETECTABILITY OF MATERIAL'S DAMAGE BY NOISY ELECTRICAL MEASUREMENTS Elena CHERKAEVA
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to odd-numbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition
More informationBUDKER INSTITUTE OF NUCLEAR PHYSICS. B.V. Chirikov and V.V. Vecheslavov MULTIPLE SEPARATRIX CROSSING: CHAOS STRUCTURE. Budker INP NOVOSIBIRSK
BUDKER INSTITUTE OF NUCLEAR PHYSICS B.V. Chirikov and V.V. Vecheslavov MULTIPLE SEPARATRIX CROSSING: CHAOS STRUCTURE Budker INP 2000-1 NOVOSIBIRSK 2000 chaos structure B.V. Chirikov and V.V. Vecheslavov
More informationVector Spaces ปร ภ ม เวกเตอร
Vector Spaces ปร ภ ม เวกเตอร 1 5.1 Real Vector Spaces ปร ภ ม เวกเตอร ของจ านวนจร ง Vector Space Axioms (1/2) Let V be an arbitrary nonempty set of objects on which two operations are defined, addition
More informationUniversity of California. November 16, Abstract
On the Complexity of Sparse Elimination æ Ioannis Z Emiris Computer Science Division University of California Berkeley, CA 90, USA emiris@csberkeleyedu November 1, 199 Abstract Sparse elimination exploits
More informationEXAM. Exam #3. Math 2360, Spring April 24, 2001 ANSWERS
EXAM Exam #3 Math 2360, Spring 200 April 24, 200 ANSWERS i 40 pts Problem In this problem, we will work in the vectorspace P 3 = { ax 2 + bx + c a, b, c R }, the space of polynomials of degree less than
More informationMath 10C - Fall Final Exam
Math 1C - Fall 217 - Final Exam Problem 1. Consider the function f(x, y) = 1 x 2 (y 1) 2. (i) Draw the level curve through the point P (1, 2). Find the gradient of f at the point P and draw the gradient
More informationInterpolation and extrapolation
Interpolation and extrapolation Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University October 30, 207 Interpolation/extrapolation vs fitting Formulation of the problem: there
More informationUniversity of California, Berkeley. ABSTRACT
Jagged Bite Problem NP-Complete Construction Kris Hildrum and Megan Thomas Computer Science Division University of California, Berkeley fhildrum,mctg@cs.berkeley.edu ABSTRACT Ahyper-rectangle is commonly
More informationIn the previous chapters we have presented synthesis methods for optimal H 2 and
Chapter 8 Robust performance problems In the previous chapters we have presented synthesis methods for optimal H 2 and H1 control problems, and studied the robust stabilization problem with respect to
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationarxiv: v1 [math.na] 22 Jun 2010
On computing Bézier curves by Pascal matrix methods arxiv:1006.4327v1 [math.na] 22 Jun 2010 Licio Hernanes Bezerra a, Leonardo Koller Sacht b a Universidade Federal de Santa Catarina, Departamento de Matemática,
More informationThe Essentials of CAGD
The Essentials of CAGD Chapter 4: Bézier Curves: Cubic and Beyond Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000
More informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More information9 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.3 è1998è this paper we have considered shaping gain for two interesting quantization procedu
FACTA UNIVERSITATIS èniçsè Series: Electronics and Energetics vol. 11, No.3 è1998è, 91-99 NONLINEAR TRANSFORMATION OF ONEíDIMENSIONAL CONSTELLATION POINTS IN ORDER TO ERROR PROBABILITY DECREASING Zoran
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 2: Orthogonal Vectors and Matrices; Vector Norms Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 11 Outline 1 Orthogonal
More informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 29 September 205 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More information13 Path Planning Cubic Path P 2 P 1. θ 2
13 Path Planning Path planning includes three tasks: 1 Defining a geometric curve for the end-effector between two points. 2 Defining a rotational motion between two orientations. 3 Defining a time function
More informationDIAGONALIZATION BY SIMILARITY TRANSFORMATIONS
DIAGONALIZATION BY SIMILARITY TRANSFORMATIONS The correct choice of a coordinate system (or basis) often can simplify the form of an equation or the analysis of a particular problem. For example, consider
More informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
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 informationChapter 1: Systems of Linear Equations and Matrices
: Systems of Linear Equations and Matrices Multiple Choice Questions. Which of the following equations is linear? (A) x + 3x 3 + 4x 4 3 = 5 (B) 3x x + x 3 = 5 (C) 5x + 5 x x 3 = x + cos (x ) + 4x 3 = 7.
More information256 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.2 è1998è primarily concerned with narrow range of frequencies near ærst resonance èwhere s
FACTA UNIVERSITATIS èni ç Sè Series: Electronics and Energetics vol. 11, No.2 è1998è, 255-261 EFFICIENT CALCULATION OF RADAR CROSS SECTION FOR FINITE STRIP ARRAY ON DIELECTRIC SLAB Borislav Popovski and
More informationLECTURE 10: THE PARALLEL TRANSPORT
LECTURE 10: THE PARALLEL TRANSPORT 1. The parallel transport We shall start with the geometric meaning of linear connections. Suppose M is a smooth manifold with a linear connection. Let γ : [a, b] M be
More informationLecture 20: Lagrange Interpolation and Neville s Algorithm. for I will pass through thee, saith the LORD. Amos 5:17
Lecture 20: Lagrange Interpolation and Neville s Algorithm for I will pass through thee, saith the LORD. Amos 5:17 1. Introduction Perhaps the easiest way to describe a shape is to select some points on
More informationStrucOpt manuscript No. èwill be inserted by the editorè Detecting the stress æelds in an optimal structure II: Three-dimensional case A. Cherkaev and
StrucOpt manuscript No. èwill be inserted by the editorè Detecting the stress æelds in an optimal structure II: Three-dimensional case A. Cherkaev and _I. Kíucíuk Abstract This paper is the second part
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationCourse MA2C02, Hilary Term 2010 Section 4: Vectors and Quaternions
Course MA2C02, Hilary Term 2010 Section 4: Vectors and Quaternions David R. Wilkins Copyright c David R. Wilkins 2000 2010 Contents 4 Vectors and Quaternions 47 4.1 Vectors...............................
More informationDIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 5. The Second Fundamental Form of a Surface
DIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 5. The Second Fundamental Form of a Surface The main idea of this chapter is to try to measure to which extent a surface S is different from a plane, in other
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Taylor s Theorem Can often approximate a function by a polynomial The error in the approximation
More informationCHANGE OF BASIS AND ALL OF THAT
CHANGE OF BASIS AND ALL OF THAT LANCE D DRAGER Introduction The goal of these notes is to provide an apparatus for dealing with change of basis in vector spaces, matrices of linear transformations, and
More informationICALP g Mingji Xia
: : ICALP 2010 g Institute of Software Chinese Academy of Sciences 2010.7.6 : 1 2 3 Matrix multiplication : Product of vectors and matrices. AC = e [n] a ec e A = (a e), C = (c e). ABC = e,e [n] a eb ee
More informationOn Projective Planes
C-UPPSATS 2002:02 TFM, Mid Sweden University 851 70 Sundsvall Tel: 060-14 86 00 On Projective Planes 1 2 7 4 3 6 5 The Fano plane, the smallest projective plane. By Johan Kåhrström ii iii Abstract It was
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 information252 T.S.R. Fuad, J.D. Phillips,.R. Shen, J.D.H. Smith of Hermitian operators over an arbitrary æeld. Theorem 4.2 below, the main result of the current
Comment.Math.Univ.Carolinae 41,2 è2000è251í259 251 Simple multilinear algebras and hermitian operators T.S.R. Fuad, J.D. Phillips,.R. Shen, J.D.H. Smith Abstract. The paper studies multilinear algebras,
More informationOn the Computation of Rigid Body Motion
On the Computation of Rigid Body Motion CALIN BELTA and VIJAY KUMAR {calin kumar}@grasp.cis.upenn.edu General Robotics, Automation, Sensing and Perception Laboratory University of Pennsylvania, Philadelphia,
More informationA Symbolic Derivation of Beta-splines of Arbitrary Order
A Symbolic Derivation of Beta-splines of Arbitrary Order GADIEL SEROUSSI Hewlett-Packard Laboratories, 151 Page Mill Road Palo Alto, California 9434 BRIAN A BARSKY Computer Science Division, University
More informationJournal of Universal Computer Science, vol. 4, no. 1 (1998), submitted: 25/9/97, accepted: 1/11/97, appeared: 28/1/98 Springer Pub. Co.
Journal of Universal Computer Science, vol. 4, no. 1 (1998), 48-67 submitted: 25/9/97, accepted: 1/11/97, appeared: 28/1/98 Springer Pub. Co. Algebraic Solutions to a Class of Interval Equations Evgenija
More informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 0 October 2002 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More informationJohn P.F.Sum and Peter K.S.Tam. Hong Kong Polytechnic University, Hung Hom, Kowloon.
Note on the Maxnet Dynamics John P.F.Sum and Peter K.S.Tam Department of Electronic Engineering, Hong Kong Polytechnic University, Hung Hom, Kowloon. April 7, 996 Abstract A simple method is presented
More informationIntroduction Radiative habhas can be used as one of the calibrations of the aar electromagnetic calorimeter èemè. Radiative habha events èe, e +! e, e
SLíPUí865 UMSèHEPèè9 October 2 Kinematic Fit for the Radiative habha alibration of aar's Electromagnetic alorimeter æ Johannes M. auer Department of Physics and stronomy, University of Mississippi, University,
More informationDefinition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M.
5 Vector fields Last updated: March 12, 2012. 5.1 Definition and general properties We first need to define what a vector field is. Definition 5.1. A vector field v on a manifold M is map M T M such that
More information3.4 Conic sections. Such type of curves are called conics, because they arise from different slices through a cone
3.4 Conic sections Next we consider the objects resulting from ax 2 + bxy + cy 2 + + ey + f = 0. Such type of curves are called conics, because they arise from different slices through a cone Circles belong
More informationthe x's and the y's unlike the standard k-means clustering on the x's ë8ë. We then present results comparing EMRBF with standard RBF estimation method
EMRBF: A Statistical Basis for Using Radial Basis Functions for Process Control Lyle H. Ungar Department of Chemical Engineering University ofpennsylvania ungar@cis.upenn.edu Richard D. De Veaux Mathematics
More informationA.V. SAVKIN AND I.R. PETERSEN uncertain systems in which the uncertainty satisæes a certain integral quadratic constraint; e.g., see ë5, 6, 7ë. The ad
Journal of Mathematical Systems, Estimation, and Control Vol. 6, No. 3, 1996, pp. 1í14 cæ 1996 Birkhíauser-Boston Robust H 1 Control of Uncertain Systems with Structured Uncertainty æ Andrey V. Savkin
More informationDr. Allen Back. Sep. 8, 2014
in R 3 Dr. Allen Back Sep. 8, 2014 in R 3 in R 3 Def: For f (x, y), the partial derivative with respect to x at p 0 = (x 0, y 0 ) is f x = lim f (x 0 + h, y 0 ) f (x 0, y 0 ) h 0 h or f x = lim f (p 0
More informationBézier Curves and Splines
CS-C3100 Computer Graphics Bézier Curves and Splines Majority of slides from Frédo Durand vectorportal.com CS-C3100 Fall 2017 Lehtinen Before We Begin Anything on your mind concerning Assignment 1? CS-C3100
More informationwhere Sènè stands for the set of n æ n real symmetric matrices, and æ is a bounded open set in IR n,typically with a suæciently regular boundary, mean
GOOD AND VISCOSITY SOLUTIONS OF FULLY NONLINEAR ELLIPTIC EQUATIONS 1 ROBERT JENSEN 2 Department of Mathematical and Computer Sciences Loyola University Chicago, IL 60626, U.S.A. E-mail: rrj@math.luc.edu
More informationMath 265H: Calculus III Practice Midterm II: Fall 2014
Name: Section #: Math 65H: alculus III Practice Midterm II: Fall 14 Instructions: This exam has 7 problems. The number of points awarded for each question is indicated in the problem. Answer each question
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 informationconsistency is faster than the usual T 1=2 consistency rate. In both cases more general error distributions were considered as well. Consistency resul
LIKELIHOOD ANALYSIS OF A FIRST ORDER AUTOREGRESSIVE MODEL WITH EPONENTIAL INNOVATIONS By B. Nielsen & N. Shephard Nuæeld College, Oxford O1 1NF, UK bent.nielsen@nuf.ox.ac.uk neil.shephard@nuf.ox.ac.uk
More information