The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 21 of 895
Back to Result List

Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials

  • In this paper, multivariate polynomials in the Bernstein basis over a simplex (simplicial Bernstein representation) are considered. Two matrix methods for the computation of the polynomial coefficients with respect to the Bernstein basis, the so-called Bernstein coefficients, are presented. Also matrix methods for the calculation of the Bernstein coefficients over subsimplices generated by subdivision of the standard simplex are proposed and compared with the use of the de Casteljau algorithm. The evaluation of a multivariate polynomial in the power and in the Bernstein basis is considered as well. All the methods solely use matrix operations such as multiplication, transposition, and reshaping; some of them rely also on the bidiagonal factorization of the lower triangular Pascal matrix or the factorization of this matrix by a Toeplitz matrix. The latter one enables the use of the Fast Fourier Transform hereby reducing the amount of arithmetic operations.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Jihad TitiORCiD, Jürgen GarloffORCiDGND
DOI:https://doi.org/10.1016/j.amc.2017.07.026
ISSN:0096-3003
Parent Title (English):Applied Mathematics and Computation
Document Type:Article
Language:English
Year of Publication:2017
Release Date:2019/05/17
Tag:Bernstein coefficient; Polynomial evaluation; Range enclosure; Simplicial Bernstein representation; Simplicial subdivision
Issue:315
First Page:246
Last Page:256
Note:
Volltextzugriff für Angehörige der Hochschule Konstanz möglich
DDC functional group:500 Naturwissenschaften und Mathematik
Open Access?:Nein
Relevance:Peer reviewed Publikation entsprechend Liste der AG4
Licence (English):License LogoLizenzbedingungen Elsevier