On the optimal stability of the Bernstein basis

  • Farouki R
  • Goodman T
168Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

We show that the Bernstein polynomial basis on a given interval is “optimally stable,” in the sense that no other nonnegative basis yields systematically smaller condition numbers for the values or roots of arbitrary polynomials on that interval. This result follows from a partial ordering of the set of all nonnegative bases that is induced by nonnegative basis transformations. We further show, by means of some low–degree examples, that the Bernstein form is not uniquely optimal in this respect. However, it is the only optimally stable basis whose elements have no roots on the interior of the chosen interval. These ideas are illustrated by comparing the stability properties of the power, Bernstein, and generalized Ball bases.

Cite

CITATION STYLE

APA

Farouki, R., & Goodman, T. (1996). On the optimal stability of the Bernstein basis. Mathematics of Computation, 65(216), 1553–1566. https://doi.org/10.1090/s0025-5718-96-00759-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free