DeepAI AI Chat
Log In Sign Up

Fast and accurate evaluation of dual Bernstein polynomials

by   Filip Chudy, et al.
Akademia Sztuk Pięknych we Wrocławiu

Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of these polynomials and their linear combinations. New simple recurrence relations of low order satisfied by dual Bernstein polynomials are given. In particular, a first-order non-homogeneous recurrence relation linking dual Bernstein and shifted Jacobi orthogonal polynomials has been obtained. When used properly, it allows to propose fast and numerically efficient algorithms for evaluating all n+1 dual Bernstein polynomials of degree n with O(n) computational complexity.


page 1

page 2

page 3

page 4


A dual watermaking scheme based on Sobolev type orthogonal moments for document authentication

A dual watermarking scheme based on Sobolev type orthogonal moments, Cha...

Efficient computation of Laguerre polynomials

An efficient algorithm and a Fortran 90 module (LaguerrePol) for computi...

Fast multiplication for skew polynomials

We describe an algorithm for fast multiplication of skew polynomials. It...

The conjugate gradient method with various viewpoints

Connections of the conjugate gradient (CG) method with other methods in ...

Generalized Convexity Properties and Shape Based Approximation in Networks Reliability

Some properties of generalized convexity for sets and for functions are ...

Balanced Binary Tree Schemes for Computing Zernike Radial Polynomials

Zernike radial polynomials play a significant role in application areas ...

A Riemann–Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals

We develop a numerical method for computing with orthogonal polynomials ...