polynomial-valued

polynomial-valued
полиномиальнозначный

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "polynomial-valued" в других словарях:

  • Integer-valued polynomial — In mathematics, an integer valued polynomial P(t) is a polynomial taking an integer value P(n) for every integer n . Certainly every polynomial with integer coefficients is integer valued. There are simple examples to show that the converse is… …   Wikipedia

  • Interval-valued computation — is a special kind of theoretical models for computation. It is capable of working on “interval valued bytes”: special subsets of the unit interval. If such computers were realized, their computation power would be much greater than that of… …   Wikipedia

  • Numerical polynomial — In mathematics, a numerical polynomial is a polynomial with rational coefficients that takes integer values on integers. They are also called integer valued polynomials. They are objects of study in their own right in algebra, and are frequently… …   Wikipedia

  • Trigonometric polynomial — In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(nx) and cos(nx) with n a natural number. The coefficients may be taken as real numbers, for… …   Wikipedia

  • List of polynomial topics — This is a list of polynomial topics, by Wikipedia page. See also trigonometric polynomial, list of algebraic geometry topics.Basics*Polynomial *Coefficient *Monomial *Polynomial long division *Polynomial factorization *Rational function *Partial… …   Wikipedia

  • Bernstein polynomial — In the mathematical field of numerical analysis, a Bernstein polynomial, named after Sergei Natanovich Bernstein, is a polynomial in the Bernstein form, that is a linear combination of Bernstein basis polynomials.A numerically stable way to… …   Wikipedia

  • Zhegalkin polynomial — Zhegalkin (also Zegalkin or Gegalkine) polynomials form one of many possible representations of the operations of Boolean algebra. Introduced by the Russian mathematician I.I. Zhegalkin in 1927, they are the polynomials of ordinary high school… …   Wikipedia

  • single-valued function — noun (mathematics) a mathematical relation such that each element of a given set (the domain of the function) is associated with an element of another set (the range of the function) • Syn: ↑function, ↑mathematical function, ↑map, ↑mapping •… …   Useful english dictionary

  • Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Complex number — A complex number can be visually represented as a pair of numbers forming a vector on a diagram called an Argand diagram, representing the complex plane. Re is the real axis, Im is the imaginary axis, and i is the square root of –1. A complex… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»