Приклади вживання Chebyshev Англійська мовою та їх переклад на Українською
{-}
- 
                        Colloquial
                    
- 
                        Ecclesiastic
                    
- 
                        Computer
                    
P I Chebyshev.
Chebyshev Gold Medal.
Pafnuty Chebyshev.
Chebyshev Markov Borel Cantelli.
Pafnuty Chebyshev.
Are Chebyshev polynomials of the first kind of degree N.
The first results in solving thisproblem were achieved by P. I. Chebyshev.
Chebyshev, please pay attention to the young man.
The distance is defined using various metrics as euclidean distance, euclidean-squared distance,manhattan distance, or Chebyshev distance.
And the Chebyshev function defined as the partial sums of the von Mangoldt function.
More generally, the rate of convergencecan be roughly quantified by e.g. Chebyshev's inequality and the Berry- Esseen theorem.
Chebyshev Gold Medal-- for outstanding performance in mathematics(1996).
It was invented by the nineteenth-century mathematician Pafnuty Chebyshev, who studied theoretical problems in kinematic mechanisms.
Chebyshev(1874) in connection with research on limit theorems.
We find the exnet value of the best(α,β)-approximation by generalized Chebyshev splines for a class of functions differentiable with weight on[- 1, 1].
Chebyshev in 1874 in connection with his studies in probability theory(the attempt to prove the central limit theorem).
Algorithms for the uniform piecewise polynomial approximation and for the best Chebyshev approximation of many-variables functions by sums of basic functions are also proposed.
This was a question Chebyshev had been interested in since the beginning of his research, but he was unable to solve it without the help of elliptic functions.
The(truncated) series can be used to computefunction values numerically,(often by recasting the polynomial into the Chebyshev form and evaluating it with the Clenshaw algorithm).
His conjecture was completely proved by Chebyshev(1821- 1894) in 1852 andso the postulate is also called the Bertrand- Chebyshev theorem or Chebyshev's theorem.
Chessboard distance", formalized as Chebyshev distance, is the minimum number of moves a king must make on a chessboard to travel between two squares.
In the paper we discuss methods and algorithms for Chebyshev approximation which can be used with success to solve main problems of analytical processing numerical data arrays.