• No results found

The Razborov-Smolensky Polynomial Approximation Method

A Computational Method with MAPLE for a Piecewise Polynomial Approximation to the Trigonometric Functions

A Computational Method with MAPLE for a Piecewise Polynomial Approximation to the Trigonometric Functions

... The paper is organized as follows. In Section 2, we construct a complete MAPLE procedure by blocks of commands in the order that we can modify them easily. These blocks whose their own purpose will be clearly explained ...

11

Polynomial Meshes: Computation and Approximation

Polynomial Meshes: Computation and Approximation

... cf. (7), where m = (m 1 , . . . , m N ) t is the vector of discrete moments of the polynomial basis. Sparsity can be achieved by reformulating (10) as NonNegative Least Squares (NNLS) problem min u≥0 kV t u − mk 2 ...

13

Constructive Polynomial Approximation on the Sphere

Constructive Polynomial Approximation on the Sphere

... 15 (1914), pp. 130. 12. J. P. Imhof, On the method for numerical integration of Clenshaw and Curtis, Numer. Math. 5 (1963), pp. 138141. 13. A. K. Kushpel and J. Levesley, ``Radial Quasi-Interpolation on S 2 ,'' ...

28

Some contributions to the theory and application of polynomial approximation

Some contributions to the theory and application of polynomial approximation

... This chapter la of a different nature. I t is concerned with a much more practical problem. One is sometimes presented with a d iscrete set of data which is convex, or where physical reasons suggest that the data would ...

115

Chebyshev Polynomial Approximation for Distributed Signal Processing

Chebyshev Polynomial Approximation for Distributed Signal Processing

... Our ongoing work includes extending the scope and depth of our application examples. In addition to considering more applications and larger size networks, we plan a more thorough empirical comparison of the computation ...

8

The Method of Polynomial Approximation to Determine the "Optimal" Coefficients of the Mathematical Models of Corrosive Destruction. Algorithm 1

The Method of Polynomial Approximation to Determine the "Optimal" Coefficients of the Mathematical Models of Corrosive Destruction. Algorithm 1

... the method of polynomial approximation for the determining of the "optimal" coefficient of influence of the SSS on the rate of corrosion process by the example of optimal designing of thin-walled ...

11

Application of the Method of Polynomial Approximation for the Determining the "Optimal" Coefficient of the Mathematical Model of Corrosive Destruction. Algorithm 2

Application of the Method of Polynomial Approximation for the Determining the "Optimal" Coefficient of the Mathematical Model of Corrosive Destruction. Algorithm 2

... considered method of polynomial approximation is useful in the event that construction has a large number of parameters to be optimized, since it does not require their preliminary ...careful ...

10

A resolver to digital conversion method based on third order rational fraction polynomial approximation for PMSM control

A resolver to digital conversion method based on third order rational fraction polynomial approximation for PMSM control

... proposed method provides a reliable, low-cost and high-precision solution for high speed and high performance motor position detection ...PLSM method within the full range ...

10

Recursive Identification of Hammerstein Systems with Polynomial Function Approximation

Recursive Identification of Hammerstein Systems with Polynomial Function Approximation

... Wang Jian-hong, Tang De-zhi, Jiang Hong, Tang Xiao-jun. Recursive Identification of Hammerstein Systems with Polynomial Function Approximation. International Journal of Management and Fuzzy Systems. Vol. 3, ...

8

Polynomial Approximation of Spectral Data in LVQ and Relevance Learning

Polynomial Approximation of Spectral Data in LVQ and Relevance Learning

... Such data is usually recorded in order to serve as input data in a classification task. Different machine learning and classification algorithms can be applied, each having its own advantages and disadvantages. ...

9

Solving infinite-dimensional optimization problems by polynomial approximation

Solving infinite-dimensional optimization problems by polynomial approximation

... In this paper, we solve a class of convex infinite-dimensional optimization problems using a numerical approximation method that does not rely on discretization. Instead, we restrict the decision variable ...

13

Approximation of Finite Population Totals Using Lagrange Polynomial

Approximation of Finite Population Totals Using Lagrange Polynomial

... an approximation technique to approximate the finite popu- lation total called the Lagrange polynomial that doesn’t require any selection of bandwidth as in the case of local polynomial regression ...

14

Asymptotic consistency of the polynomial approximation in the linearized plate theory

Asymptotic consistency of the polynomial approximation in the linearized plate theory

... asymptotic method, known to justify the Kirchho-Love model, and the polynomial reduction ...the polynomial method, the re- duced model is obtained by projecting the three-dimensional displace- ...

11

Chebyshev polynomial approximation to approximate partial differential equations

Chebyshev polynomial approximation to approximate partial differential equations

... our method it is applicable in other fields, providing efficient solutions to complex systems of partial differential ...why polynomial approximations of this type are underutilised (in comparison to direct ...

18

Comparison of Legendre polynomial approximation and variational iteration method for the solutions of general linear Fredholm integro-differential equations

Comparison of Legendre polynomial approximation and variational iteration method for the solutions of general linear Fredholm integro-differential equations

... this method is that the coefficients of the Legendre polynomial of the solution are obtained easily by using the computer ...this method are increasing for the large values of the independent ...

9

A new kind of double Chebyshev polynomial approximation on unbounded domains

A new kind of double Chebyshev polynomial approximation on unbounded domains

... Collocation method with double EC polynomials In the process of obtaining the numerical solutions of partial differential equations with the double EC method, the main idea or major step is to evaluate the ...

13

The Best Approximation of the Sinc Function by a Polynomial of Degree  with the Square Norm

The Best Approximation of the Sinc Function by a Polynomial of Degree with the Square Norm

... The polynomial of degree n which is the best approximation of the sinc function on the interval 0, π/2 with the square norm is ...Lagrange’s method of multipliers, we construct the polynomial ...

12

Extending the stixel world using polynomial ground manifold approximation

Extending the stixel world using polynomial ground manifold approximation

... The polynomial fitting method still suffers from some noise, especially in case of shades on roads which lead to false detections; this is also visible in the example shown in ...the method can ...

7

Approximation Effects Due to Diffuse Derivatives from Polynomial Basis

Approximation Effects Due to Diffuse Derivatives from Polynomial Basis

... free method is that these can handle large deformations more ...MLS approximation method approximates value u(x) of unknown function u from the given ...

7

Study of polynomial and non polynomial spline based approximation

Study of polynomial and non polynomial spline based approximation

... 2. The first, second, third and fourth derivatives of SΔ(x) are continuous on [a ,b]. To be able to deal effectively with such problems we introduce ‘spline functions’ containing a parameter ω. These are ‘non- ...

5

Show all 10000 documents...

Related subjects