bernstein - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.
Our website is currently undergoing maintenance, which may result in occasional errors while browsing. We apologize for any inconvenience this may cause and are working swiftly to restore full functionality. Thank you for your patience.

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 pn,i,xnixi1xni Bernstein is defined to be

Bernsteinn,f,x=i=0npn,i,xfin

Examples

bernstein3,x1x+1,z

120z3+310z234z+1

(1)

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

bernstein2&comma;f&comma;x

4x2+2x

(2)

See Also

binomial

polynomials