a) Very nearly linear
b) Having some properties of linearity

Wikipedia foundation.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Quasilinear — may refer to:* Quasilinear utility, a type of economic utility function linear in one argument * In complexity theory and mathematics, O( n log n ) * A type of differential equation where the coefficient of the highest order derivative does not… …   Wikipedia

  • Quasilinear utility — In economics and consumer theory, quasilinear utility functions are linear in one argument, generally the numeraire. Formally, for example, such a utility function could be written U(x,y) = u(x) + by, where b is a positive constant. Then if u… …   Wikipedia

  • quasilinear amplifier — kvazitiesinis stiprintuvas statusas T sritis radioelektronika atitikmenys: angl. quasilinear amplifier vok. quasilinearer Verstärker, m rus. квазилинейный усилитель, m pranc. amplificateur quasi linéaire, m …   Radioelektronikos terminų žodynas

  • quasilinear — adj. semi linear, being somewhat (but not entirely) linear …   English contemporary dictionary

  • Mechanism design — The Stanley Reiter diagram above illustrates a game of mechanism design. The upper left space Θ depicts the type space and the upper right space X the space of outcomes. The social choice function f(θ) maps a type profile to an outcome. In games… …   Wikipedia

  • Method of characteristics — In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first order equations, although more generally the method of characteristics is valid for any hyperbolic partial… …   Wikipedia

  • Marcinkiewicz interpolation theorem — In mathematics, the Marcinkiewicz interpolation theorem, discovered by Józef Marcinkiewicz (1939), is a result bounding the norms of non linear operators acting on Lp spaces. Marcinkiewicz theorem is similar to the Riesz–Thorin theorem about …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • Constraint counting — In mathematics, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a partial differential equation. Contents 1 Einstein strength 1.1 Linear equations 1.2 General solution… …   Wikipedia

  • Nina Nikolajewna Uralzewa — (russisch  Нина Николаевна Уральцева, englische Transkription Nina Nikolaevna Ural tseva; * 24. Mai 1934 in Leningrad) ist eine russische Mathematikerin, die sich mit partiellen Differentialgleichungen beschäftigt. Uralzewa besuchte die… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”