bernstein - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Mozilla Firefox.

Online Help

All Products    Maple    MapleSim


bernstein

Bernstein polynomial approximating a function

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

bernstein(n, f, x)

Parameters

n

-

integer

f

-

function (specified as a procedure or operator)

x

-

algebraic expression

Description

• 

This procedure returns the nth degree Bernstein polynomial in x approximating the function f(x) on the interval 0,1.  Note that f must be a function of one variable specified as a procedure or operator.

• 

Bernstein polynomials arise in the Stone-Weierstrass approximation theorem of analysis that says any continuous function (R->R) can be uniformly approximated on a closed interval by a sequence of polynomials.  The Bernstein polynomials are one such set for doing this.

• 

Given p≔n,i,x↦ni⋅xi⋅1−xn−i Bernstein is defined to be

Bernstein⁡n,f,x=∑i=0n⁡p⁡n,i,x⁢f⁡in

Examples

> 

bernstein⁡3,x↦1x+1,z

−120⁢z3+310⁢z2−34⁢z+1

(1)
> 

f := proc(t) if t < 1/2 then 4*t^2 else 2 - 4*t^2 end if end proc:

> 

bernstein⁡2&comma;f&comma;x

−4⁢x2+2⁢x

(2)

See Also

binomial

polynomials