Relevant bibliographies by topics / Bernstein polynomials

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Bernstein polynomials'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bernstein polynomials.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bernstein polynomials"

1

Goodman, T. N. T., and S. L. Lee. "Convolution operators with trigonometric spline kernels." Proceedings of the Edinburgh Mathematical Society 31, no. 2 (June 1988): 285–99. http://dx.doi.org/10.1017/s0013091500003412.

Full text
Abstract:
The Bernstein polynomials are algebraic polynomial approximation operators which possess shape preserving properties. These polynomial operators have been extended to spline approximation operators, the Bernstein-Schoenberg spline approximation operators, which are also shape preserving like the Bernstein polynomials [8].
APA, Harvard, Vancouver, ISO, and other styles
2

Han, Xuli. "The Trigonometric Polynomial Like Bernstein Polynomial." Scientific World Journal 2014 (2014): 1–17. http://dx.doi.org/10.1155/2014/174716.

Full text
Abstract:
A symmetric basis of trigonometric polynomial space is presented. Based on the basis, symmetric trigonometric polynomial approximants like Bernstein polynomials are constructed. Two kinds of nodes are given to show that the trigonometric polynomial sequence is uniformly convergent. The convergence of the derivative of the trigonometric polynomials is shown. Trigonometric quasi-interpolants of reproducing one degree of trigonometric polynomials are constructed. Some interesting properties of the trigonometric polynomials are given.
APA, Harvard, Vancouver, ISO, and other styles
3

Janaki, G., and R. Sarulatha. "On Sequences of Geophine Triples Involving Padovan and Bernstein Polynomial with Propitious Property." Indian Journal Of Science And Technology 17, no. 16 (April 19, 2024): 1690–94. http://dx.doi.org/10.17485/ijst/v17i16.160.

Full text
Abstract:
Objective: To bring forth a new conception in the time-honoured field of Diophantine triples, namely “Geophine triple”. To examine the feasibility of proliferating an unending sequence of Geophine triples from Geophine pairs with the property comprising Padovan and Bernstein polynomial. Method: Established Geophine triples employing Padovan and Bernstein polynomial by the method of polynomial manipulations. Findings: An unending sequences of Geophine triples and with the property and are promulgated from Geophine pairs, precisely involving Padovan and Bernstein polynomials and few numerical representation of the sequences are computed using MATLAB. Novelty: This article carries an innovative approach of determining this definite type of triples using Geometric mean and thereby, two infinite sequences of Geophine triples with the property are ascertained. Also, few numerical representations of the sequences utilizing MATLAB program are figured out, thus broadening the scope of computational Number Theory. Keywords: Polynomial Diophantine triple, Geophine triple, Bernstein polynomial, Padovan polynomials, Pell’s equation, Special Polynomials
APA, Harvard, Vancouver, ISO, and other styles
4

Mahmudov, Nazim I. "Approximation by Genuineq-Bernstein-Durrmeyer Polynomials in Compact Disks in the Caseq>1." Abstract and Applied Analysis 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/959586.

Full text
Abstract:
This paper deals with approximating properties of the newly definedq-generalization of the genuine Bernstein-Durrmeyer polynomials in the caseq>1, which are no longer positive linear operators onC0,1. Quantitative estimates of the convergence, the Voronovskaja-type theorem, and saturation of convergence for complex genuineq-Bernstein-Durrmeyer polynomials attached to analytic functions in compact disks are given. In particular, it is proved that, for functions analytic inz∈ℂ:z<R,R>q, the rate of approximation by the genuineq-Bernstein-Durrmeyer polynomialsq>1is of orderq−nversus1/nfor the classical genuine Bernstein-Durrmeyer polynomials. We give explicit formulas of Voronovskaja type for the genuineq-Bernstein-Durrmeyer forq>1. This paper represents an answer to the open problem initiated by Gal in (2013, page 115).
APA, Harvard, Vancouver, ISO, and other styles
5

Hamadneh, Tareq, Mohammed Ali, and Hassan AL-Zoubi. "Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis." Mathematics 8, no. 2 (February 20, 2020): 283. http://dx.doi.org/10.3390/math8020283.

Full text
Abstract:
In this paper, we provide tight linear lower bounding functions for multivariate polynomials given over boxes. These functions are obtained by the expansion of polynomials into Bernstein basis and using the linear least squares function. Convergence properties for the absolute difference between the given polynomials and their lower bounds are shown with respect to raising the degree and the width of boxes and subdivision. Subsequently, we provide a new method for constructing an affine lower bounding function for a multivariate continuous rational function based on the Bernstein control points, the convex hull of a non-positive polynomial s, and degree elevation. Numerical comparisons with the well-known Bernstein constant lower bounding function are given. Finally, with these affine functions, the positivity of polynomials and rational functions can be certified by computing the Bernstein coefficients of their linear lower bounds.
APA, Harvard, Vancouver, ISO, and other styles
6

Goodman, T. N. T., and A. Sharma. "A property of Bernstein-Schoenberg spline operators." Proceedings of the Edinburgh Mathematical Society 28, no. 3 (October 1985): 333–40. http://dx.doi.org/10.1017/s0013091500017144.

Full text
Abstract:
Let Bnf; x) denote the Bernstein polynomial of degree n on [0,1] for a function f(x) defined on this interval. Among the many properties of Bernstein polynomials, we recall in particular that if f(x) is convex in [0,1] then (i) Bn(f;x) is convex in [0,1] and (ii) Bn(f;x)≧Bn+1(f;x), (n = l,2,…). Recently these properties have been the subject of study for Bernstein polynomials over triangles [1].
APA, Harvard, Vancouver, ISO, and other styles
7

Turan, Mehmet. "The Truncatedq-Bernstein Polynomials in the Caseq>1." Abstract and Applied Analysis 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/126319.

Full text
Abstract:
The truncatedq-Bernstein polynomialsBn,m,qf;x,n∈ℕ, and m∈ℕ0emerge naturally when theq-Bernstein polynomials of functions vanishing in some neighbourhood of 0 are considered. In this paper, the convergence of the truncatedq-polynomials on0,1is studied. To support the theoretical results, some numerical examples are provided.
APA, Harvard, Vancouver, ISO, and other styles
8

Cichella, Venanzio, Isaac Kaminer, Claire Walton, Naira Hovakimyan, and António Pascoal. "Consistency of Approximation of Bernstein Polynomial-Based Direct Methods for Optimal Control." Machines 10, no. 12 (November 28, 2022): 1132. http://dx.doi.org/10.3390/machines10121132.

Full text
Abstract:
Bernstein polynomial approximation of continuous function has a slower rate of convergence compared to other approximation methods. “The fact seems to have precluded any numerical application of Bernstein polynomials from having been made. Perhaps they will find application when the properties of the approximant in the large are of more importance than the closeness of the approximation.”—remarked P.J. Davis in his 1963 book, Interpolation and Approximation. This paper presents a direct approximation method for nonlinear optimal control problems with mixed input and state constraints based on Bernstein polynomial approximation. We provide a rigorous analysis showing that the proposed method yields consistent approximations of time-continuous optimal control problems and can be used for costate estimation of the optimal control problems. This result leads to the formulation of the Covector Mapping Theorem for Bernstein polynomial approximation. Finally, we explore the numerical and geometric properties of Bernstein polynomials, and illustrate the advantages of the proposed approximation method through several numerical examples.
APA, Harvard, Vancouver, ISO, and other styles
9

Prolla, João B. "A generalized Bernstein approximation theorem." Mathematical Proceedings of the Cambridge Philosophical Society 104, no. 2 (September 1988): 317–30. http://dx.doi.org/10.1017/s030500410006549x.

Full text
Abstract:
A celebrated theorem of Weierstrass states that any continuous real-valued function f defined on the closed interval [0, 1] ⊂ ℝ is the limit of a uniformly convergent sequence of polynomials. One of the most elegant and elementary proofs of this classic result is that which uses the Bernstein polynomials of fone for each integer n ≥ 1. Bernstein's Theorem states that Bn(f) → f uniformly on [0, 1] and, since each Bn(f) is a polynomial of degree at most n, we have as a consequence Weierstrass' theorem. See for example Lorentz [9]. The operator Bn, defined on the space C([0, 1]; ℝ) with values in the vector subspace of all polynomials of degree at most n has the property that Bn(f) ≥ 0 whenever f ≥ 0. Thus Bernstein's Theorem also establishes the fact that each positive continuous real-valued function on [0, 1] is the limit of a uniformly convergent sequence of positive polynomials. This raises the following natural question: consider a compact Hausdorff space X and the convex cone C+(X):= {f ∈ C(X; ℝ); f ≥ 0}. Now the analogue of Bernstein's Theorem would be a theorem stating when a convex cone contained in C+(X) is dense in it. More generally, one raises the question of describing the closure of a convex cone contained in C(X; ℝ), and, in particular, the closure of A+:= {f ∈ A; f ≥ 0}, where A is a subalgebra of C(X; ℝ).
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Taekyun, Lee-Chae Jang, and Heungsu Yi. "A Note on the Modifiedq-Bernstein Polynomials." Discrete Dynamics in Nature and Society 2010 (2010): 1–12. http://dx.doi.org/10.1155/2010/706483.

Full text
Abstract:
We propose the modifiedq-Bernstein polynomials of degreenwhich are differentq-Bernstein polynomials of Phillips (1997). From these modifiedq-Bernstein polynomials of degreen, we derive some recurrence formulae for the modifiedq-Bernstein polynomials.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bernstein polynomials"

1

Oruç, Halil. "Generalized Bernstein polynomials and total positivity." Thesis, University of St Andrews, 1999. http://hdl.handle.net/10023/11183.

Full text
Abstract:
This thesis deals mainly with geometric properties of generalized Bernstein polynomials which replace the single Bernstein polynomial by a one-parameter family of polynomials. It also provides a triangular decomposition and 1-banded factorization of the Vandermonde matrix. We first establish the generalized Bernstein polynomials for monomials, which leads to a definition of Stirling polynomials of the second kind. These are q-analogues of Stirling numbers of the second kind. Some of the properties of the Stirling numbers are generalized to their q-analogues. We show that the generalized Bernstein polynomials are monotonic in degree n when the function ƒ is convex ... Shape preserving properties of the generalized Bernstein polynomials are studied by making use of the concept of total positivity. It is proved that monotonic and convex functions produce monotonic and convex generalized Bernstein polynomials. It is also shown that the generalized Bernstein polynomials are monotonic in the parameter q for the class of convex functions. Finally, we look into the degree elevation and degree reduction processes on the generalized Bernstein polynomials.
APA, Harvard, Vancouver, ISO, and other styles
2

Liang, Jie Ling. "Approximation by Bernstein polynomials at the point of discontinuity." Honors in the Major Thesis, University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/460.

Full text
Abstract:
Chlodovsky showed that if x₀ is a point of discontinuity of the first kind of the function f, then the Bernstein polynomials Bsubscript n](f, x₀) converge to the average of the one-sided limits on the right and on the left of the function f at the point x₀. In 2009, Telyakovskii in (5) extended the asymptotic formulas for the deviations of the Bernstein polynomials from the differentiable functions at the first-kind discontinuity points of the highest derivatives of even order and demonstrated the same result fails for the odd order case. Then in 2010, Tonkov in (6) found the right formulation and proved the result that was missing in the odd-order case. It turned out that the limit in the odd order case is related to the jump of the highest derivative. The proofs in these two cases look similar but have many subtle differences, so it is desirable to find out if there is a unifying principle for treating both cases. In this thesis, we obtain a unified formulation and proof for the asymptotic results of both Telyakovskii and Tonkov and discuss extension of these results in the case where the highest derivative of the function is only assumed to be bounded at the point under study.
B.S.
Bachelors
Sciences
Mathematics
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Ning. "Structured matrix methods for computations on Bernstein basis polynomials." Thesis, University of Sheffield, 2013. http://etheses.whiterose.ac.uk/3311/.

Full text
Abstract:
This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it is shown that structure preserving matrix methods yield excellent results. With respect to greatest common divisor computations, the most difficult part is the computation of its degree, and several methods for its determination are presented. These are based on the Sylvester resultant matrix, and it is shown that a new form of the Sylvester resultant matrix in the modified Bernstein basis yields the best results. The B´ezout resultant matrix in the modified Bernstein basis is also considered, and it is shown that the results from it are inferior to those from the Sylvester resultant matrix in the modified Bernstein basis.
APA, Harvard, Vancouver, ISO, and other styles
4

Herath, Dushanthi N. "Nonparametric Estimation of Receiver Operating Characteristic Surfaces Via Bernstein Polynomials." Thesis, University of North Texas, 2012. https://digital.library.unt.edu/ark:/67531/metadc177212/.

Full text
Abstract:
Receiver operating characteristic (ROC) analysis is one of the most widely used methods in evaluating the accuracy of a classification method. It is used in many areas of decision making such as radiology, cardiology, machine learning as well as many other areas of medical sciences. The dissertation proposes a novel nonparametric estimation method of the ROC surface for the three-class classification problem via Bernstein polynomials. The proposed ROC surface estimator is shown to be uniformly consistent for estimating the true ROC surface. In addition, it is shown that the map from which the proposed estimator is constructed is Hadamard differentiable. The proposed ROC surface estimator is also demonstrated to lead to the explicit expression for the estimated volume under the ROC surface . Moreover, the exact mean squared error of the volume estimator is derived and some related results for the mean integrated squared error are also obtained. To assess the performance and accuracy of the proposed ROC and volume estimators, Monte-Carlo simulations are conducted. Finally, the method is applied to the analysis of two real data sets.
APA, Harvard, Vancouver, ISO, and other styles
5

Piazzon, Federico. "Bernstein Markov Properties and Applications." Doctoral thesis, Università degli studi di Padova, 2016. http://hdl.handle.net/11577/3424517.

Full text
Abstract:
The Bernstein Markov Property for a compact set E and a positive finite mea- sure μ supported on E is a strong comparability assumption between L μ 2 and uni- form norms on E of polynomials (or other nested families of functions) as their degree tends to infinity. Admissible meshes are sequences of sampling sets A k ⊂ E whose cardinality is growing sub-exponentially with respect to k and for which there exists a positive finite constant C such that max E |p| ≤ C max A k |p| for any polynomial of degree at most k. These two mathematical objects have several applications and motivations from Approximation Theory and Pluripotential Theory, the study of plurisubharmonic functions in several complex variables. The properties of Bernstein Markov measures and admissible meshes for a given compact set E are very similar, indeed they may be seen as the continuous and the discrete approach to the same problem. This work is concerned on providing sufficient conditions for some different instances of the Bernstein Markov property and explicitly constructing admissible meshes. As first problem, we study sufficient conditions for a version of the Bernstein Markov property for rational functions on the complex plane and its relation with the polynomial Bernstein Markov property. In Chapter 5, we consider the case of a compact subset E of an algebraic pure m-dimensional subset A of C n and we prove a sufficient condition for the Bernstein Markov property for the traces of polynomials on E. To this aim, we provide two new results in Pluripotential Theory regarding the convergence and the comparability of the relative capacities, the relative and global extremal functions and the Chebyshev constants on a (possibly non-smooth) pure m-dimensional algebraic variety in C n , which are of independent interest. In the last part of the dissertation, we provide some construction procedures for admissible meshes on some classes of real compact sets. Finally, we present some algorithms, based on admissible meshes, for the numerical approximation of the most relevant objects in Pluripotential Theory, namely, the transfinite diameter, the Siciak Zaharjuta extremal function and the pluripotential equilibrium measure.
La proprietà di Bernstein Markov per un compatto E ed una misura positiva finita μ avente supporto in E è un’ assunzione di comparabilità asintotica tra le norme uniformi ed L μ 2 dei polinomi di grado al più k (o altre famiglie innestate di funzioni) al tendere all’ infinito di k. Le Admissible Meshes sono sequenze di sottoinsiemi finiti A k del compatto E la cui cardinalità cresce in modo subesponenziale rispetto a k e per i quali esiste una costante positiva C tale che max E |p| ≤ C max A k |p| per ogni polinomi di grado al più k. Questi due oggetti matematici hanno molte appliicazioni e motivazioni prove- nienti dalla Teoria dell’ Approssimazione e dalla Teoria del Pluripotenziale, lo stu- dio delle funzioni plurisubarmoniche in più variabili complesse. Le proprietà delle misure di Bernstein Markov e delle admissible meshes per un dato compatto E sono molto simili, infatti le due definizioni possono essere viste come gli approcci rispettivamente continuo e discreto dello stesso problema. Questo lavoro si concentra nel fornire condizioni sufficienti per la proprietà di Bernstein Markov in diverse situazioni e nella costruzione esplicita di admissible meshes. Come primo problema vengono studiate condizioni sufficienti per una versione della proprietà di Bernstein Markov per successioni di funzioni razionali nel piano complesso in relazione alla stessa proprietà per i polinomi. Nel Capitolo 5 viene considerato il caso di un compatto E sottoinsieme di una varietà algebrica A ⊂ C n di dimensione pura m < n ed irriducibile e quindi provata una condizione sufficiente per la proprietà di Bernstein Markov per le tracce dei polinomi su E. A questo scopo vengono provati due risultati nuovi in Teoria del Pluripoten- ziale riguardanti la convergenza e la comparabilità della capacità relativa (di Monge Ampère), delle funzioni plurisubarmoniche estremali globali e relative e delle co- stanti di Chebyshev per sottoinsiemi E j di un dato compatto E della varietà alge- brica A, anche nel caso A sia singolare. Tali risultati sono di interesse indipendente. Nell’ultima parte della tesi vengono provate ed illustrate alcune procedure per la costruzione di admissible meshes per alcune classi di compatti reali. In ultimo vengono presentati alcuni nuovi algoritmi, basati sulle admissible meshes, per l’ approssimazione numerica delle più rilevanti grandezze in Teoria del Pluripotenziale: il diametro transfinito, la funzione estremale di Siciak-Zaharjuta e la misura di equilibrio pluripotenziale.
APA, Harvard, Vancouver, ISO, and other styles
6

Bourne, Martin. "Structure-preserving matrix methods for computations on univariate and bivariate Bernstein polynomials." Thesis, University of Sheffield, 2017. http://etheses.whiterose.ac.uk/20860/.

Full text
Abstract:
Curve and surface intersection finding is a fundamental problem in computer-aided geometric design (CAGD). This practical problem motivates the undertaken study into methods for computing the square-free factorisation of univariate and bivariate polynomials in Bernstein form. It will be shown how these two problems are intrinsically linked and how finding univariate polynomial roots and bivariate polynomial factors is equivalent to finding curve and surface intersection points. The multiplicities of a polynomial’s factors are maintained through the use of a square free factorisation algorithm and this is analogous to the maintenance of smooth intersections between curves and surfaces, an important property in curve and surface design. Several aspects of the univariate and bivariate polynomial factorisation problem will be considered. This thesis examines the structure of the greatest common divisor (GCD) problem within the context of the square-free factorisation problem. It is shown that an accurate approximation of the GCD can be computed from inexact polynomials even in the presence of significant levels of noise. Polynomial GCD computations are ill-posed, in that noise in the coefficients of two polynomials which have a common factor typically causes the polynomials to become coprime. Therefore, a method for determining the approximate greatest common divisor (AGCD) is developed, where the AGCD is defined to have the same degree as the GCD and its coefficients are sufficiently close to those of the exact GCD. The algorithms proposed assume no prior knowledge of the level of noise added to the exact polynomials, differentiating this method from others which require derived threshold values in the GCD computation. The methods of polynomial factorisation devised in this thesis utilise the Sylvester matrix and a sequence of subresultant matrices for the GCD finding component. The classical definition of the Sylvester matrix is extended to compute the GCD of two and three bivariate polynomials defined in Bernstein form, and a new method of GCD computation is devised specifically for bivariate polynomials in Bernstein form which have been defined over a rectangular domain. These extensions are necessary for the computation of the factorisation of bivariate polynomials defined in the Bernstein form.
APA, Harvard, Vancouver, ISO, and other styles
7

Kebede, Sebsibew. "On Bernstein-Sato ideals and Decomposition of D-modules over Hyperplane Arrangements." Licentiate thesis, Stockholms universitet, Matematiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-129493.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Harden, Lisa A. Govil N. K. "On the growth of polynomials and entire functions of exponential type." Auburn, Ala., 2004. http://repo.lib.auburn.edu/EtdRoot/2004/FALL/Mathematics/Thesis/hardeli_58_Thesis.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hamadneh, Tareq [Verfasser]. "Bounding Polynomials and Rational Functions in the Tensorial and Simplicial Bernstein Forms / Tareq Hamadneh." Konstanz : Bibliothek der Universität Konstanz, 2018. http://d-nb.info/1151075027/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Stahlke, Colin. "Bernstein-Polynom und Tjurinazahl von [mu]-konstant-Deformationen der Singularitäten xa̲ + yb̲." Bonn : [s.n.], 1998. http://catalog.hathitrust.org/api/volumes/oclc/41464676.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Bernstein polynomials"

1

Grinshpun, Z. S. Ortogonalʹnye mnogochleny Bernshteĭna-sege. Alma-Ata: Gylym, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Freund, Roland W. New Bernstein type inequalitites for polynomials on ellipses. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tenbusch, Axel. Nonparametric curve estimation with Bernstein estimates. Osnabrück: Universitätsverlag Rasch, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Freund, Roland W. On Bernstein type inequalities and a weighted Chebyshev approximation problem on ellipses. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rassias, Themistocles, ed. Extremal Problems and Inequalities of Markov-Bernstein Type for Algebraic Polynomials: (Mathematical Analysis and its Applications). London, UK: San Diego: Elsevier Science & Technology, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bernstein polynomials. 2nd ed. New York, N.Y: Chelsea Pub. Co., 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lorentz, G. G. Bernstein Polynomials. American Mathematical Society, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bernstein-Type Inequalities for Polynomials and Rational Functions. Elsevier Science & Technology, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shape-Preserving Approximation by Real and Complex Polynomials. Birkhäuser Boston, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gal, Sorin G. Approximation by Complex Bernstein and Convolution Type Operators. World Scientific Publishing Co Pte Ltd, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Bernstein polynomials"

1

Phillips, George M. "Bernstein Polynomials." In CMS Books in Mathematics, 247–90. New York, NY: Springer New York, 2003. http://dx.doi.org/10.1007/0-387-21682-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

DeVore, Ronald A., and George G. Lorentz. "Bernstein Polynomials." In Grundlehren der mathematischen Wissenschaften, 303–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-02888-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lorentz, G. G. "Deferred Bernstein Polynomials." In Mathematics from Leningrad to Austin, 819–23. Boston, MA: Birkhäuser Boston, 1997. http://dx.doi.org/10.1007/978-1-4612-5329-7_75.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lubinsky, Doron S., and Edward B. Saff. "Bernstein's formula and bernstein extremal polynomials." In Strong Asymptotics for Extremal Polynomials Associated with Weights on ℝ, 111–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0082426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bustamante, Jorge. "Iterates of Bernstein Polynomials." In Bernstein Operators and Their Properties, 359–69. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55402-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lyche, Tom, and Jean-Louis Merrien. "Bézier Curves and Bernstein Polynomials." In Exercises in Computational Mathematics with MATLAB, 131–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43511-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bustamante, Jorge. "Bernstein Polynomials as Linear Operators." In Bernstein Operators and Their Properties, 161–73. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55402-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bustamante, Jorge. "Linear Combinations of Bernstein Polynomials." In Bernstein Operators and Their Properties, 371–95. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55402-0_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Berens, Hubert, and George G. Lorentz. "Inverse Theorems for Bernstein Polynomials." In Mathematics from Leningrad to Austin, 947–62. Boston, MA: Birkhäuser Boston, 1997. http://dx.doi.org/10.1007/978-1-4612-5329-7_86.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Levin, Eli, and Doron S. Lubinsky. "Formulae Involving Bernstein-Szegő Polynomials." In SpringerBriefs in Mathematics, 117–22. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72947-3_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bernstein polynomials"

1

Wu, Xuezhi, and Wenjuan Zhong. "Fuzzy q-Bernstein polynomials." In 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE, 2012. http://dx.doi.org/10.1109/fskd.2012.6233924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schmeisser, Gerhard. "Real zeros of Bernstein polynomials." In Third CMFT Conference. WORLD SCIENTIFIC, 1999. http://dx.doi.org/10.1142/9789812833044_0038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Yongqiao, and Xudong Liu. "Multivariate Probability Calibration with Isotonic Bernstein Polynomials." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/353.

Full text
Abstract:
Multivariate probability calibration is the problem of predicting class membership probabilities from classification scores of multiple classifiers. To achieve better performance, the calibrating function is often required to be coordinate-wise non-decreasing; that is, for every classifier, the higher the score, the higher the probability of the class labeling being positive. To this end, we propose a multivariate regression method based on shape-restricted Bernstein polynomials. This method is universally flexible: it can approximate any continuous calibrating function with any specified error, as the polynomial degree increases to infinite. Moreover, it is universally consistent: the estimated calibrating function converges to any continuous calibrating function, as the training size increases to infinity. Our empirical study shows that the proposed method achieves better calibrating performance than benchmark methods.
APA, Harvard, Vancouver, ISO, and other styles
4

GRANGER, MICHEL. "BERNSTEIN-SATO POLYNOMIALS AND FUNCTIONAL EQUATIONS." In Algebraic Approach to Differential Equations. WORLD SCIENTIFIC, 2010. http://dx.doi.org/10.1142/9789814273244_0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ben Sassi, Mohamed Amin, and Sriram Sankaranarayanan. "Stability and stabilization of polynomial dynamical systems using Bernstein polynomials." In HSCC '15: 18th International Conference on Hybrid Systems: Computation and Control. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2728606.2728639.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cetin, Elif, Hatice Ozbay, Muge Togan, I. Naci Cangul, Theodore E. Simos, George Psihoyios, Ch Tsitouras, and Zacharias Anastassi. "Properties of n-th Degree Bernstein Polynomials." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. AIP, 2011. http://dx.doi.org/10.1063/1.3636745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Açíkgöz, Mehmet, Serkan Araci, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "On the Generating Function for Bernstein Polynomials." In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3497855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Simsek, Yilmaz, Mehmet Acikgoz, Abdelmejid Bayad, V. Lokesha, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "q-Frobenius-Euler Polynomials Related to the (q-)Bernstein Type Polynomials." In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3497862.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Janchitrapongvej, Kanok, Chaipichit Cumpim, and Pongpan Rattanathanawan. "Chrominance gain slope equalizer based on bernstein polynomials." In 2013 10th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON 2013). IEEE, 2013. http://dx.doi.org/10.1109/ecticon.2013.6559653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nava, Jaime, Olga Kosheleva, and Vladik Kreinovich. "Why bernstein polynomials are better: Fuzzy-inspired justification." In 2012 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2012. http://dx.doi.org/10.1109/fuzz-ieee.2012.6251341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bernstein polynomials' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography