BERNSTEIN POLYNOMIALS



Similar documents
Recurrence. 1 Definitions and main statements

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Support Vector Machines

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

Generalizing the degree sequence problem

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Fast degree elevation and knot insertion for B-spline curves

1 Example 1: Axis-aligned rectangles

Ring structure of splines on triangulations

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

This circuit than can be reduced to a planar circuit

where the coordinates are related to those in the old frame as follows.

8 Algorithm for Binary Searching in Trees

21 Vectors: The Cross Product & Torque

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

Joe Pimbley, unpublished, Yield Curve Calculations

An Alternative Way to Measure Private Equity Performance

The Mathematical Derivation of Least Squares

Loop Parallelization

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

SIMPLE LINEAR CORRELATION

On Leonid Gurvits s proof for permanents

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

PERRON FROBENIUS THEOREM

A Probabilistic Theory of Coherence

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

Forecasting the Direction and Strength of Stock Market Movement

Mean Value Coordinates for Closed Triangular Meshes

An Overview of Financial Mathematics

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Cluster algebras were introduced by Fomin and Zelevinsky (1)

In our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Using Series to Analyze Financial Situations: Present Value

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

1. Math 210 Finite Mathematics

Cautiousness and Measuring An Investor s Tendency to Buy Options

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Simple Interest Loans (Section 5.1) :

Section 2 Introduction to Statistical Mechanics

The OC Curve of Attribute Acceptance Plans

Natural hp-bem for the electric field integral equation with singular solutions

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

What is Candidate Sampling

CHAPTER 14 MORE ABOUT REGRESSION

Forecasting Irregularly Spaced UHF Financial Data: Realized Volatility vs UHF-GARCH Models

Logistic Regression. Steve Kroon

How To Calculate The Accountng Perod Of Nequalty

8.4. Annuities: Future Value. INVESTIGATE the Math Annuities: Future Value

Matrix Multiplication I

Section 5.4 Annuities, Present Value, and Amortization

Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3

General Auction Mechanism for Search Advertising

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t

Least Squares Fitting of Data

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004

Rotation and Conservation of Angular Momentum

Enabling P2P One-view Multi-party Video Conferencing

Numerical Methods 數 值 方 法 概 說. Daniel Lee. Nov. 1, 2006

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks

Extending Probabilistic Dynamic Epistemic Logic

Part 1: quick summary 5. Part 2: understanding the basics of ANOVA 8

YIELD CURVE FITTING 2.0 Constructing Bond and Money Market Yield Curves using Cubic B-Spline and Natural Cubic Spline Methodology.

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

Sngle Snk Buy at Bulk Problem and the Access Network

Level Annuities with Payments Less Frequent than Each Interest Period

Introduction to Differential Algebraic Equations

AN EFFECTIVE MATRIX GEOMETRIC MEAN SATISFYING THE ANDO LI MATHIAS PROPERTIES

POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and

Lecture 3: Force of Interest, Real Interest Rate, Annuity

A Master Time Value of Money Formula. Floyd Vest

Allocating Collaborative Profit in Less-than-Truckload Carrier Alliance

) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance

Solving Factored MDPs with Continuous and Discrete Variables

When Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services

Transcription:

On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful mathematcal tools as they are smply defned, can be calculated quckly on computer systems and represent a tremendous varety of functons. They can be dfferentated and ntegrated easly, and can be peced together to form splne curves that can approxmate any functon to any accuracy desred. Most students are ntroducted to polynomals at a very early stage n ther studes of mathematcs, and would probably recall them n the form below: p(t a n t n + a n 1 t n 1 + + a 1 t + a 0 whch represents a polynomal as a lnear combnaton of certan elementary polynomals { (1, t, t 2,..., t n}. In general, any polynomal functon that has degree less than or equal to n, can be wrtten n ths way, and the reasons are smply The set of polynomals of degree less than or equal to n forms a vector space: polynomals can be added together, can be multpled by a scalar, and all the vector space propertes hold. The set of functons { 1, t, t 2,..., t n} form a bass for ths vector space that s, any polynomal of degree less than or equal to n can be unquely wrtten as a lnear combnatons of these functons. Ths bass, commonly called the power bass, s only one of an nfnte number of bases for the space of polynomals. In these notes we dscuss another of the commonly used bases for the space of polynomals, the Bernsten bass, and dscuss ts many useful propertes.

Bernsten Polynomals The Bernsten polynomals of degree n are defned by for 0, 1,..., n, where B,n (t ( n ( n t (1 t n n!!(n! There are n + 1 nth-degree Bernsten polynomals. For mathematcal convenence, we usually set B,n 0, f < 0 or > n. These polynomals are qute easy to wrte down: the coeffcents can be obtaned from Pascal s trangle; the exponents on the t term ncrease by one as ncreases; and the exponents on the (1 t term decrease by one as ncreases. In the smple cases, we obtan The Bernsten polynomals of degree 1 are and can be plotted for 0 t 1 as B 0,1 (t 1 t B 1,1 (t t 2

The Bernsten polynomals of degree 2 are B 0,2 (t (1 t 2 B 1,2 (t 2t(1 t B 2,2 (t t 2 and can be plotted for 0 t 1 as The Bernsten polynomals of degree 3 are B 0,3 (t (1 t 3 B 1,3 (t 3t(1 t 2 B 2,3 (t 3t 2 (1 t B 3,3 (t t 3 and can be plotted for 0 t 1 as 3

!"# "$%& 4

A Recursve Defnton of the Bernsten Polynomals The Bernsten polynomals of degree n can be defned by blendng together two Bernsten polynomals of degree n 1. That s, the kth nth-degree Bernsten polynomal can be wrtten as B k,n (t (1 tb k,n 1 (t + tb k 1,n 1 (t To show ths, we need only use the defnton of the Bernsten polynomals and some smple algebra: ( ( n 1 n 1 (1 tb k,n 1 (t + tb k 1,n 1 (t (1 t t k (1 t n 1 k + t t k 1 (1 t n 1 (k 1 k k 1 ( ( n 1 n 1 t k (1 t n k + t k (1 t n k k k 1 [( ( ] n 1 n 1 + t k (1 t n k k k 1 ( n t k (1 t n k k B k,n (t The Bernsten Polynomals are All Non-Negatve A functon f(t s non-negatve over an nterval [a, b] f f(t 0 for t [a, b]. In the case of the Bernsten polynomals of degree n, each s non-negatve over the nterval [0, 1]. To show ths we use the recursve defnton property above and mathematcal nducton. It s easly seen that the functons B 0,1 (t 1 t and B 1,1 (t t are both non-negatve for 0 t 1. If we assume that all Bernsten polynomals of degree less than k are non-negatve, then by usng the recursve defnton of the Bernsten polynomal, we can wrte B,k (t (1 tb,k 1 (t + tb 1,k 1 (t and argue that B,k (t s also non-negatve for 0 t 1, snce all components on the rght-hand sde of the equaton are non-negatve components for 0 t 1. By nducton, all Bernsten polynomals are non-negatve for 0 t 1. In ths process, we have also shown that each of the Bernsten polynomals s postve when 0 < t < 1. 5

The Bernsten Polynomals form a Partton of Unty A set of functons f (t s sad to partton unty f they sum to one for all values of t. The k+1 Bernsten polynomals of degree k form a partton of unty n that they all sum to one. To show that ths s true, t s easest to frst show a slghtly dfferent fact: for each k, the sum of the k + 1 Bernsten polynomals of degree k s equal to the sum of the k Bernsten polynomals of degree k 1. That s, k B,k (t k 1 B,k 1 (t Ths calculaton s straghtforward, usng the recursve defnton and cleverly rearrangng the sums: k B,k (t k [(1 tb,k 1 (t + tb 1,k 1 (t] (1 t ] [ k ] B,k 1 (t + B k,k 1 (t + t B 1,k 1 (t + B 1,k 1 (t [ k 1 k 1 (1 t B,k 1 (t + t k B 1,k 1 (t 1 k 1 k 1 (1 t B,k 1 (t + t B,k 1 (t k 1 B,k 1 (t (where we have utlzed B k,k 1 (t B 1,k 1 (t 0. Once we have establshed ths equalty, t s smple to wrte 1 B,n (t n 1 B,n 1 (t n 2 B,n 2 (t 1 B,1 (t (1 t + t 1 The partton of unty s a very mportant property when utlzng Bernsten polynomals n geometrc modelng and computer graphcs. In partcular, for any set of ponts P 0, P 1,..., P n, n three-dmensonal space, and for any t, the expresson P(t P 0 B 0,n (t + P 1 B 1,n (t + + P n B n,n (t 6

s an affne combnaton of the set of ponts P 0, P 1,..., P n and f 0 t 1, t s a convex combnaton of the ponts. Degree Rasng Any of the lower-degree Bernsten polynomals (degree < n can be expressed as a lnear combnaton of Bernsten polynomals of degree n. In partcular, any Bernsten polynomal of degree n 1 can be wrtten as a lnear combnaton of Bernsten polynomals of degree n. We frst note that ( n tb,n (t t +1 (1 t n ( n t +1 (1 t (n+1 (+1 +1 B +1,n+1 (t + + 1 n + 1 B +1,n+1(t and ( n (1 tb,n (t t (1 t n+1 +1 B,n+1 (t n + 1 n + 1 B,n+1(t and fnally 1 B,n (t + 1 B +1,n (t t (1 t n + t +1 (1 t n (+1 +1 t (1 t n 1 ((1 t + t t (1 t n 1 1 1 B,n 1 (t Usng ths fnal equaton, we can wrte an arbtrary Bernsten polynomal n terms of Bernsten polynomals 7

of hgher degree. That s, 1 B,n 1 (t n [ 1 (n ] B,n (t + 1 B +1,n (t B,n (t + ( + 1 n +1 B +1,n (t whch expresses a Bernsten polynomal of degree n 1 n terms of a lnear combnaton of Bernsten polynomals of degree n. We can easly extend ths to show that any Bernsten polynomal of degree k (less than n can be wrtten as a lnear combnaton of Bernsten polynomals of degree n e.g., a Bernsten polynomal of degree n 2 can be expressed as a lnear combnaton of two Bernsten polynomals of degree n 1, each of whch can be expressed as a lnear combnaton of two Bernsten polynomals of degree n, etc. Convertng from the Bernsten Bass to the Power Bass Snce the power bass {1, t, t 2,..., t n } forms a bass for the space of polynomals of degree less than or equal to n, any Bernsten polynomal of degree n can be wrtten n terms of the power bass. Ths can be drectly calculated usng the defnton of the Bernsten polynomals and the bnomal theorem, as follows: B k,n (t k k t k (1 t n k t k n k n k ( 1 k ( n k ( 1 t ( n k t +k ( n k ( 1 k k k ( ( n ( 1 k t k where we have used the bnomal theorem to expand (1 t n k. k k To show that each power bass element can be wrtten as a lnear combnaton of Bernsten Polynomals, t 8

we use the degree elevaton formulas and nducton to calculate: t k t(t k 1 t ( k 1 k 1 k 1 1 k 1 1 k k 1 ( n 1 k 1 k 1 k 1 n 1 k 1 ( k B,n 1 (t tb 1,n 1 (t n B,n(t kb,n (t, where the nducton hypothess was used n the second step. Dervatves Dervatves of the nth degree Bernsten polynomals are polynomals of degree n 1. Usng the defnton of the Bernsten polynomal we can show that ths dervatve can be wrtten as a lnear combnaton of Bernsten polynomals. In partcular d dt B k,n(t n(b k 1,n 1 (t B k,n 1 (t for 0 k n. Ths can be shown by drect dfferentaton d dt B k,n(t d dt ( n t k (1 t n k k kn! k!(n k! tk 1 (1 t n k + n(n 1! (k 1!(n k! tk 1 (1 t n k + ( (n 1! n (k 1!(n k! tk 1 (1 t n k + n (B k 1,n 1 (t B k,n 1 (t (n kn! k!(n k! tk (1 t n k 1 n(n 1! k!(n k 1! tk (1 t n k 1 (n 1! k!(n k 1! tk (1 t n k 1 9

That s, the dervatve of a Bernsten polynomal can be expressed as the degree of the polynomal, multpled by the dfference of two Bernsten polynomals of degree n 1. The Bernsten Polynomals as a Bass Why do the Bernsten polynomals of order n form a bass for the space of polynomals of degree less than or equal to n? 1. They span the space of polynomals any polynomal of degree less than or equal to n can be wrtten as a lnear combnaton of the Bernsten polynomals. Ths s easly seen f one realzes that The power bass spans the space of polynomals and any member of the power bass can be wrtten as a lnear combnaton of Bernsten polynomals. 2. They are lnearly ndependent that s, f there exst constants c 0, c 1,..., c n so that the dentty 0 c 0 B 0,n (t + c 1 B 1,n (t + + c n B n,n (t holds for all t, then all the c s must be zero. If ths were true, then we could wrte 0 c 0 B 0,n (t + c 1 B 1,n (t + + c n B n,n (t ( ( n ( ( n c 0 ( 1 t + c 1 ( 1 1 t + + c n 0 1 1 [ 1 ( ( ] [ ( ( ] n 1 n n c 0 + c t 1 + + c t n 1 1 n n Snce the power bass s a lnearly ndependent set, we must have that ( ( n ( 1 n t n n c 0 0 1 ( ( n 1 c 0 1 1. ( ( n n c 0 n n whch mples that c 0 c 1 c n 0 (c 0 s clearly zero, substtutng ths n the second equaton 10

gves c 1 0, substtutng these two nto the thrd equaton gves... 11

A Matrx Representaton for Bernsten Polynomals In many applcatons, a matrx formulaton for the Bernsten polynomals s useful. These are straghtforward to develop f one only looks at a lnear combnaton n terms of dot products. Gven a polynomal wrtten as a lnear combnaton of the Bernsten bass functons B(t c 0 B 0,n (t + c 1 B 1,n (t + + c n B n,n (t It s easy to wrte ths as a dot product of two vectors B(t [ B 0,n (t B 1,n (t B n,n (t ] c 0 c 1. c n We can convert ths to B(t [ 1 t t 2 ] t n b 0,0 0 0 0 b 1,0 b 1,1 0 0 b 2,0 b 2,1 b 2,2 0....... c 0 c 1 c 2. b n,0 b n,1 b n,2 b n,n c n where the b,j are the coeffcents of the power bass that are used to determne the respectve Bernsten polynomals. We note that the matrx n ths case s lower trangular. In the quadratc case (n 2, the matrx representaton s [ ] 1 0 0 B(t 1 t t 2 2 2 0 1 2 1 c 0 c 1 c 2 12

and n the cubc case (n 3, the matrx representaton s B(t [ 1 t t 2 ] t 3 1 0 0 0 3 3 0 0 3 6 3 0 1 3 3 1 c 0 c 1 c 2 c 3 All contents copyrght (c 1996, 1997, 1998, 1999, 2000 Computer Scence Department, Unversty of Calforna, Davs All rghts reserved. 13