Bernstein polynomialIn the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial that is a linear combination of Bernstein basis polynomials. The idea is named after Sergei Natanovich Bernstein. A numerically stable way to evaluate polynomials in Bernstein form is de Casteljau's algorithm. Polynomials in Bernstein form were first used by Bernstein in a constructive proof for the Weierstrass approximation theorem. With the advent of computer graphics, Bernstein polynomials, restricted to the interval [0, 1], became important in the form of Bézier curves.
Factorization of polynomials over finite fieldsIn mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition is theoretically possible and is unique for polynomials with coefficients in any field, but rather strong restrictions on the field of the coefficients are needed to allow the computation of the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finite field, in the field of rationals or in a finitely generated field extension of one of them.
Error functionIn mathematics, the error function (also called the Gauss error function), often denoted by erf, is a complex function of a complex variable defined as: Some authors define without the factor of . This nonelementary integral is a sigmoid function that occurs often in probability, statistics, and partial differential equations. In many of these applications, the function argument is a real number. If the function argument is real, then the function value is also real.
Irreducible polynomialIn mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients.
Radius of convergenceIn mathematics, the radius of convergence of a power series is the radius of the largest disk at the center of the series in which the series converges. It is either a non-negative real number or . When it is positive, the power series converges absolutely and uniformly on compact sets inside the open disk of radius equal to the radius of convergence, and it is the Taylor series of the analytic function to which it converges.
Uniform convergenceIn the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence. A sequence of functions converges uniformly to a limiting function on a set as the function domain if, given any arbitrarily small positive number , a number can be found such that each of the functions differs from by no more than at every point in .
Pointwise convergenceIn mathematics, pointwise convergence is one of various senses in which a sequence of functions can converge to a particular function. It is weaker than uniform convergence, to which it is often compared. Suppose that is a set and is a topological space, such as the real or complex numbers or a metric space, for example. A net or sequence of functions all having the same domain and codomain is said to converge pointwise to a given function often written as if (and only if) The function is said to be the pointwise limit function of the Sometimes, authors use the term bounded pointwise convergence when there is a constant such that .
Greek diacriticsGreek orthography has used a variety of diacritics starting in the Hellenistic period. The more complex polytonic orthography (πολυτονικό σύστημα γραφής), which includes five diacritics, notates Ancient Greek phonology. The simpler monotonic orthography (μονοτονικό σύστημα γραφής), introduced in 1982, corresponds to Modern Greek phonology, and requires only two diacritics. Polytonic orthography () is the standard system for Ancient Greek and Medieval Greek.
Digraph (orthography)A digraph or digram (from the δίς , "double" and γράφω , "to write") is a pair of characters used in the orthography of a language to write either a single phoneme (distinct sound), or a sequence of phonemes that does not correspond to the normal values of the two characters combined. Some digraphs represent phonemes that cannot be represented with a single character in the writing system of a language, like the English sh in ship and fish. Other digraphs represent phonemes that can also be represented by single characters.
Tsakonian languageTsakonian or Tsaconian (also Tzakonian or Tsakonic, τσακώνικα and Tsakonian: τσακώνικα, α τσακώνικα γρούσσα) is a highly divergent modern variety of Greek, spoken in the Tsakonian region of the Peloponnese, Greece. Tsakonian derives from Doric Greek, being its only extant variant. Although it is conventionally treated as a dialect of Greek, some compendia treat it as a separate language. Tsakonian is critically endangered, with only a few hundred/thousand, mostly elderly, fluent speakers left.
