Results 241 to 250 of about 421,634 (286)
Some of the next articles are maybe not open access.
Associated Legendre Polynomial Approximations
Journal of Applied Physics, 1951Approximations for the associated Legendre Polynomials are derived by a phase integral method. The method is an extension of the WBK method, applicable to separable multidimensional wave propagation problems.
openaire +2 more sources
Approximation by Bernstein Polynomials
American Journal of Mathematics, 1994Let \[ B_ n(f; x)= \sum^ n_{k=0} f\left({k\over n}\right)\left(\begin{smallmatrix} n\\ k\end{smallmatrix}\right) x^ k(1-x)^{n- k} \] and \(w_ \varphi(f; \delta)= \sup_{0\leq t\leq \delta} \sup_ x| f(x- t\varphi(x))- 2f(x)+ f(x+ t\varphi(x)))|\), where \(f\in C[0,1]\), \(\varphi(x)= \sqrt{x(1-x)}\) and the second supremum is taken for those values of ...
openaire +2 more sources
Approximation by $\delta $-Polynomials
SIAM Journal on Numerical Analysis, 1973The approximation to complex-valued functions, continuous on a closed Jordan curve by polynomials of degree n, whose uniform norm on that curve is greater than or equal to some prescribed constant, is investigated. The limits for the resultant sequence of the best such deviations are found for a large class of functions.
openaire +3 more sources
Algebraic Polynomial Approximation
1987In this chapter we relate the rate of convergence of best polynomial approximation to our new modulus of smoothness. Asymptotic behavior of the derivatives of the optimal algebraic polynomials will also be related to that modulus of smoothness. The results are of both direct and converse type and yield necessary and sufficient conditions whenever the ...
Z. Ditzian, V. Totik
openaire +1 more source
Minimax Approximation of Sign Function by Composite Polynomial for Homomorphic Comparison
IEEE Transactions on Dependable and Secure Computing, 2022Eunsang Lee, Joon-Woo Lee, Jong-Seon No
exaly
2011
Finding the greatest common divisor (GCD) of two given polynomials is a basic problem in algebraic computing. The problem is usually stated as follows: given the (real or complex) coefficients of two polynomials, compute the coefficients of their greatest common divisor.
openaire +1 more source
Finding the greatest common divisor (GCD) of two given polynomials is a basic problem in algebraic computing. The problem is usually stated as follows: given the (real or complex) coefficients of two polynomials, compute the coefficients of their greatest common divisor.
openaire +1 more source
Bounded by Polynomial Approximation
Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1964openaire +2 more sources