✦ LIBER ✦

Dual bases of a Bernstein polynomial basis on simplices

✍ Scribed by Wu Dong-Bing

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 367 KB
Volume: 10
Category: Article
ISSN: 0167-8396
DOI: 10.1016/0167-8396(93)90025-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Derivatives of Bernstein Polyn

A Note on Derivatives of Bernstein Polynomials

✍ D.X. Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 92 KB

Variation Diminishing Properties of Bern

Variation Diminishing Properties of Bernstein Polynomials on a Tetrahedron

✍ A. Bhatt; A. Ojha 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Goodman has recently studied certain variation diminishing properties of Bernstein polynomials on triangles. Introducing analogous definitions for the variation of a trivariate function, we study in the present paper corresponding results for the Bernstein polynomials defined on a tetrahedron. We ha

Construction of orthogonal bases for pol

Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains

✍ Rida T. Farouki; T.N.T. Goodman; Thomas Sauer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A scheme for constructing orthogonal systems of bivariate polynomials in the Bernstein-Bézier form over triangular domains is formulated. The orthogonal basis functions have a hierarchical ordering by degree, facilitating computation of least-squares approximations of increasing degree (with permane

K-moduli, moduli of smoothness, and Bern

K-moduli, moduli of smoothness, and Bernstein polynomials on a simplex

✍ H. Berens; Y. Xu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 525 KB

On-line identification of nonlinear syst

On-line identification of nonlinear systems using Volterra polynomial basis function neural networks

✍ Guoping P. Liu; Visakan Kadirkamanathan; Steve A. Billings 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 345 KB

An on-line identification scheme using Volterra polynomial basis function (VPBF) neural networks is considered for nonlinear control systems. This comprises a structure selection procedure and a recursive weight learning algorithm. The orthogonal least-squares algorithm is introduced for off-line st

A note on constrained degree reduction o

A note on constrained degree reduction of polynomials in Bernstein–Bézier form over simplex domain

✍ Lizheng Lu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Kim and Ahn proved that the best constrained degree reduction of a polynomial over d-dimensional simplex domain in L 2 -norm equals the best approximation of weighted Euclidean norm of the Bernstein-Bézier coefficients of the given polynomial. In this paper, we presented a counterexample to show tha