- shifted polynomial
- мат. смещенный многочлен
Большой англо-русский и русско-английский словарь. 2001.
shifted polynomial
Смотреть что такое "shifted polynomial" в других словарях:
Primitive polynomial — In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF( p m ). In other words, a polynomial F(X) with coefficients in GF( p ) = Z/ p Z is a primitive… … Wikipedia
Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial … Wikipedia
Classical orthogonal polynomials — In mathematics, the classical orthogonal polynomials are the most widely used orthogonal polynomials, and consist of the Hermite polynomials, the Laguerre polynomials, the Jacobi polynomials together with their special cases the ultraspherical… … Wikipedia
Completing the square — In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form to the form In this context, constant means not depending on x. The expression inside the parenthesis is of the… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Jenkins-Traub algorithm — The Jenkins Traub algorithm for polynomial zeros is a fast globally convergent iterative method. It has been described as practically a standard in black box polynomial root finders .Given a polynomial P ,:P(z)=sum {i=0}^na iz^{n i}, quad a… … Wikipedia
Cyclic redundancy check — A cyclic redundancy check (CRC) is an error detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. Blocks of data entering these systems… … Wikipedia
Legendre polynomials — Note: People sometimes refer to the more general associated Legendre polynomials as simply Legendre polynomials . In mathematics, Legendre functions are solutions to Legendre s differential equation::{d over dx} left [ (1 x^2) {d over dx} P n(x)… … Wikipedia
Quadratic equation — This article is about quadratic equations and solutions. For more general information about quadratic functions, see Quadratic function. For more information about quadratic polynomials, see Quadratic polynomial. In mathematics, a quadratic… … Wikipedia
Khovanov homology — In mathematics, Khovanov homology is a homology theory for knots and links. It may be regarded as a categorification of the Jones polynomial. It was developed in the late 1990s by Mikhail Khovanov, then at the University of California, Davis, now … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
