A Saturation Theorem for Modified Bernstein Polynomials in $L_p $-Spaces

1979 ◽  
Vol 10 (2) ◽  
pp. 321-330 ◽  
Author(s):  
C. P. May
Keyword(s):  
Bernstein Polynomials ◽  
Saturation Theorem

scholarly journals Numerical Analysis of Viscoelastic Rotating Beam with Variable Fractional Order Model Using Shifted Bernstein–Legendre Polynomial Collocation Algorithm

2021 ◽  
Vol 5 (1) ◽  
pp. 8
Author(s):  
Cundi Han ◽  
Yiming Chen ◽  
Da-Yan Liu ◽  
Driss Boutat
Keyword(s):  
Numerical Analysis ◽  
Fractional Order ◽  
Governing Equation ◽  
Numerical Solutions ◽  
Bernstein Polynomials ◽  
Matrix Product ◽  
Algebraic Equations ◽  
Rotating Beam ◽  
The Matrix ◽  
The Time Domain

This paper applies a numerical method of polynomial function approximation to the numerical analysis of variable fractional order viscoelastic rotating beam. First, the governing equation of the viscoelastic rotating beam is established based on the variable fractional model of the viscoelastic material. Second, shifted Bernstein polynomials and Legendre polynomials are used as basis functions to approximate the governing equation and the original equation is converted to matrix product form. Based on the configuration method, the matrix equation is further transformed into algebraic equations and numerical solutions of the governing equation are obtained directly in the time domain. Finally, the efficiency of the proposed algorithm is proved by analyzing the numerical solutions of the displacement of rotating beam under different loads.

scholarly journals Two matrix methods for solution of nonlinear and linear Lane-Emden type equations with mixed condition by operational matrix

2015 ◽  
Vol 4 (3) ◽  
pp. 420 ◽  
Author(s):  
Behrooz Basirat ◽  
Mohammad Amin Shahdadi
Keyword(s):  
Bernstein Polynomials ◽  
Operational Matrix ◽  
Numerical Procedure ◽  
Operational Matrices ◽  
Algebraic Equations ◽  
Mixed Condition ◽  
Matrix Methods ◽  
Numerical Examples ◽  
Linear Algebraic Equations ◽  
The Given

<p>The aim of this article is to present an efficient numerical procedure for solving Lane-Emden type equations. We present two practical matrix method for solving Lane-Emden type equations with mixed conditions by Bernstein polynomials operational matrices (BPOMs) on interval [<em>a; b</em>]. This methods transforms Lane-Emden type equations and the given conditions into matrix equation which corresponds to a system of linear algebraic equations. We also give some numerical examples to demonstrate the efficiency and validity of the operational matrices for solving Lane-Emden type equations (LEEs).</p>

Kantorovich-Bernstein polynomials

1990 ◽  
Vol 6 (4) ◽  
pp. 421-435 ◽  
Author(s):  
Zeev Ditzian ◽  
Xinlong Zhou
Keyword(s):  
Bernstein Polynomials

scholarly journals Hybrid Bernstein Block-Pulse Functions Method for Second Kind Integral Equations with Convergence Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei
Keyword(s):  
Integral Equation ◽  
Approximate Solution ◽  
Convergence Analysis ◽  
Bernstein Polynomials ◽  
Linear Equations ◽  
The Other ◽  
New Combination ◽  
System Of Linear Equations ◽  
Numerical Examples ◽  
Block Pulse Functions

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.

scholarly journals A de Casteljau Algorithm for -Bernstein-Stancu Polynomials

2011 ◽  
Vol 2011 ◽  
pp. 1-13 ◽  
Author(s):  
Grzegorz Nowak
Keyword(s):  
Bernstein Polynomials ◽  
Classical Case ◽  
Geometric Progression ◽  
De Casteljau Algorithm ◽  
Stancu Operators

This paper is concerned with a generalization of the -Bernstein polynomials and Stancu operators, where the function is evaluated at intervals which are in geometric progression. It is shown that these polynomials can be generated by a de Casteljau algorithm, which is a generalization of that relating to the classical case and -Bernstein case.

Sign in / Sign up

Export Citation Format

Share Document