- logarithmic operator
- мат. логарифмический оператор
Большой англо-русский и русско-английский словарь. 2001.
logarithmic operator
Смотреть что такое "logarithmic operator" в других словарях:
Logarithmic derivative — In mathematics, specifically in calculus and complex analysis, the logarithmic derivative of a function f is defined by the formula where f ′ is the derivative of f. When f is a function f(x) of a real variable x, and takes real, strictly… … Wikipedia
Logarithmic mean — In mathematics, the logarithmic mean is a function of two numbers which is equal to their difference divided by the logarithm of their quotient. In symbols::egin{matrix}M {mbox{lm(x,y) =lim {(xi,eta) o(x,y)} frac{eta xi}{ln eta ln xi}… … Wikipedia
Logarithmic form — Any formula written in terms of logarithms may be said to be in logarithmic form.Logarithmic differential formsIn contexts including complex manifolds and algebraic geometry, a logarithmic differential form is a 1 form that, locally at least, can … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
Indefinite logarithm — The indefinite logarithm of a positive number n (variously denoted [log n] , mathrm{Log}(n) or even sometimes just log n) is the logarithm without regard to any particular base: it is a function (of the base), not a number . This is as opposed to … Wikipedia
Peak programme meter — A typical British quasi PPM. Each division between 1 and 7 is exactly four decibels and 6 is the intended maximum level. A peak programme meter (PPM) is an instrument used in professional audio for indicating the level of an audio signal. There… … Wikipedia
Digital compositing — is the process of digitally assembling multiple images to make a final image, typically for print, motion pictures or screen display. It is the evolution into the digital realm of optical film compositing. Contents 1 Mathematics 1.1 Algebraic… … Wikipedia
L (complexity) — In computational complexity theory, L (also known as LSPACE) is the complexity class containing decision problems which can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to … Wikipedia
Descriptive complexity — is a branch of finite model theory, a subfield of computational complexity theory and mathematical logic, which seeks to characterize complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of… … Wikipedia
Nordström's theory of gravitation — In theoretical physics, Nordström s theory of gravitation was a predecessor of general relativity. Strictly speaking, there were actually two distinct theories proposed by the Finnish theoretical physicist Gunnar Nordström, in 1912 and 1913… … Wikipedia
Immerman–Szelepcsényi theorem — The Immerman–Szelepcsényi Theorem was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the 1995 Gödel Prize. In its general form the theorem states that NSPACE = co NSPACE. In other words, if a… … Wikipedia
