Addendum to "On the L1-Condition Number of the Univariate Bernstein Basis"

The paper mentioned above is a contribution of the authors to Volume 18 (2002) of this journal, see . Recently, J. Domsta pointed out to us that the proof of Theorem 4.2 in that paper contains an error. The purpose of this addendum is to present a correct argument for it.     

Optimally Stable Multivariate Bases

We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.     

Two chain rules for divided differences and Faà di Bruno's formula

In this paper we derive two formulas for divided differences of a function of a function. Both formulas lead to other divided difference formulas, such as reciprocal and quotient rules. The two formulas can also be used to derive Faà di Bruno's formula and other formulas for higher derivatives of composite functions. We also derive a divided difference version of Faà di Bruno's determinant formula.

     

A note on correctors with an arbitrary number of nonstep points

In this note maximal order,k step correctors with one nonstep point for the solution ofy=f(x,y),y(x ₀)=y ₀, introduced by Gragg and Stetter [1] are extended to an arbitrary numbers of nonstep points. These correctors have order 2k + 2s, are proved stable fork8,s2, and unstable for largek.     

Local Approximation from Spline Spaces on Box Meshes

Foundations of Computational Mathematics - This paper analyzes the approximation properties of spaces of piecewise tensor product polynomials over box meshes with a focus on application to...     

Divided differences of inverse functions and partitions of a convex polygon

We derive a formula for an -th order divided difference of the inverse of a function. The formula has a simple and surprising structure: it is a sum over partitions of a convex polygon with vertices. The formula provides a numerically stable method of computing divided differences of -th roots. It also provides a new way of enumerating all partitions of a convex polygon of a certain type, i.e., with a specified number of triangles, quadrilaterals, and so on, which includes Catalan numbers as a special case.

     

On a class of weak Tchebycheff systems

In this paper we study the approximation power, the existence of a normalized B-basis and the structure of a degree-raising process for spaces of the formrequiring suitable assumptions on the functions u and v. The results about degree raising are detailed for special spaces of this form which have been recently introduced in the area of CAGD.     

Asymptotic convergence of degree‐raising

It is well known that the degree‐raised Bernstein–Bézier coefficients of degree n of a polynomial g converge to g at the rate 1/n. In this paper we consider the polynomial A _n(g) of degree ⩼ n interpolating the coefficients. We show how A _n can be viewed as an inverse to the Bernstein polynomial operator and that the derivatives A _n(g)(^r) converge uniformly to g(^r) at the rate 1/n for all r. We also give an asymptotic expansion of Voronovskaya type for A _n(g) and discuss some shape preserving properties of this polynomial. This revised version was published online in June 2006 with corrections to the Cover Date.