- extremal function
- мат. экстремальная функция
Большой англо-русский и русско-английский словарь. 2001.
extremal function
Смотреть что такое "extremal function" в других словарях:
Extremal optimization — (EO) is an optimization heuristic inspired by the Bak Sneppen model of self organized criticality from the field of statistical physics. This heuristic was designed initially to address combinatorial optimization problems such as the travelling… … Wikipedia
Extremal length — In the mathematical theory of conformal and quasiconformal mappings, the extremal length of a collection of curves Gamma is a conformal invariant of Gamma. More specifically, suppose thatD is an open set in the complex plane and Gamma is a… … Wikipedia
Extremal orders of an arithmetic function — In mathematics, in number theory, the extremal orders of an arithmetic function are best possible bounds of the given arithmetic function. Specifically, if f(n) is an arithmetic function and m(n) is a non decreasing function that is ultimately… … Wikipedia
extremal — adj. of or pertaining to most extreme possible value of a function or the calculation of extrema (Mathematics) … English contemporary dictionary
Maximally stable extremal regions — Feature detection Output of a typical corner detection algorithm … Wikipedia
Normal order of an arithmetic function — In number theory, the normal order of an arithmetic function is some simpler or better understood function which usually takes the same or closely approximate values. Let ƒ be a function on the natural numbers. We say that the normal order of ƒ… … Wikipedia
Round function — In topology and in calculus, a round function is a scalar function , over a manifold M, whose critical points form one or several connected components, each homeomorphic to the circle S1, also called critical loops. They are special cases of… … Wikipedia
Erdős–Stone theorem — In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán s theorem to bound the number of edges in an H free graph for a non complete graph H . It is named after Paul Erdős and Arthur Stone, who proved it in… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Analytic capacity — In complex analysis, the analytic capacity of a compact subset K of the complex plane is a number that denotes how big a bounded analytic function from mathbb{C}setminus E can become. Roughly speaking, gamma(E) measures the size of the unit ball… … Wikipedia
Calculus of variations — is a field of mathematics that deals with extremizing functionals, as opposed to ordinary calculus which deals with functions. A functional is usually a mapping from a set of functions to the real numbers. Functionals are often formed as definite … Wikipedia
