Fast multidimensional Bernstein-Lagrange algorithms
نویسندگان
چکیده
منابع مشابه
Fast multidimensional Bernstein-Lagrange algorithms
In this paper we present two fast algorithms for the Bézier curves and surfaces of an arbitrary dimension. The first algorithm evaluates the Bernstein-Bézier curves and surfaces at a set of specific points by using the fast Bernstein-Lagrange transformation. The second algorithm is an inversion of the first one. Both algorithms reduce the initial problem to computation of some discrete Fourier ...
متن کاملBridging Bernstein and Lagrange polynomials
Linear combinations of iterates of Bernstein polynomials exponentially converging to the Lagrange interpolating polynomial are given. The results are applied in CAGD to get an exponentially fast weighted progressive iterative approximation technique to fit data with finer and finer precision. AMS subject classifications: 41A25, 41A36
متن کاملFast Algorithms for Multidimensional Harmonic Retrieval
Classic multidimensional harmonic retrieval is the estimation problem in a variety of practical applications, including sensor array processing, radar, mobile communications, multiple-input multiple-output (MIMO) channel estimation and nuclear magnetic resonance spectroscopy. Numerous parametric subspace approaches have been proposed recently to solve this problem, among which the so-called ESP...
متن کاملFast simplicial finite element algorithms using Bernstein polynomials
Fast algorithms for applying finite element mass and stiffness operators to the B-form of polynomials over d-dimensional simplices are derived. These rely on special properties of the Bernstein basis and lead to stiffness matrix algorithms with the same asymptotic complexity as tensor-product techniques in rectangular domains. First, special structure leading to fast application of mass matrice...
متن کاملBernstein Bases are Optimal , but , sometimes , Lagrange Bases are Better
Experimental observations of rootfinding by generalized companion matrix pencils expressed in the Lagrange basis show that the method can sometimes be numerically stable, and indeed sometimes be much more stable than rootfinding of polynomials expressed in even the Bernstein basis. This paper details some of those experiments and provides a theoretical justification for this. We prove that a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Informatica
سال: 2012
ISSN: 2083-3628,1732-1360
DOI: 10.2478/v10065-012-0002-6