|
Equidistributed
In mathematics, a sequence (''s''1, ''s''2, ''s''3, ...) of real numbers is said to be equidistributed, or uniformly distributed, if the proportion of terms falling in a subinterval is proportional to the length of that subinterval. Such sequences are studied in Diophantine approximation theory and have applications to Monte Carlo integration. Definition A sequence (''s''1, ''s''2, ''s''3, ...) of real numbers is said to be ''equidistributed'' on a non-degenerate interval 'a'', ''b''if for every subinterval 'c'', ''d''of 'a'', ''b''we have :\lim_= . (Here, the notation , ∩ 'c'', ''d'' denotes the number of elements, out of the first ''n'' elements of the sequence, that are between ''c'' and ''d''.) For example, if a sequence is equidistributed in , 2 since the interval .5, 0.9occupies 1/5 of the length of the interval , 2 as ''n'' becomes large, the proportion of the first ''n'' members of the sequence which fall between 0.5 and 0.9 must approach 1/5. Lo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Van Der Corput Sequence
A van der Corput sequence is an example of the simplest one-dimensional low-discrepancy sequence over the unit interval; it was first described in 1935 by the Dutch mathematician J. G. van der Corput. It is constructed by reversing the base-''n'' representation of the sequence of natural numbers (1, 2, 3, …). The b-ary representation of the positive integer n \geq 1 is n ~=~ \sum_^ d_k(n) b^k ~=~ d_0(n) b^0 + \cdots + d_(n) b^, where b is the base in which the number n is represented, and 0 \leq d_k(n) , there exists a subsequence of the van der Corput sequence that converges to that number. They are also equidistributed over the unit interval. C implementation double corput(int n, int base) See also * * * , a natural generalization of the van der Corput sequence to higher dimensions References * * {{citation , last1=Kuipers , first1=L. , last2= Niederreiter , first2=H. , author2-link = Harald Niederreiter , title = Uniform distribution of sequences , pu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diophantine Approximation
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers. For this problem, a rational number ''a''/''b'' is a "good" approximation of a real number ''α'' if the absolute value of the difference between ''a''/''b'' and ''α'' may not decrease if ''a''/''b'' is replaced by another rational number with a smaller denominator. This problem was solved during the 18th century by means of continued fractions. Knowing the "best" approximations of a given number, the main problem of the field is to find sharp upper and lower bounds of the above difference, expressed as a function of the denominator. It appears that these bounds depend on the nature of the real numbers to be approximated: the lower bound for the approximation of a rational number by another rational number is larger than ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Low-discrepancy Sequence
In mathematics, a low-discrepancy sequence is a sequence with the property that for all values of ''N'', its subsequence ''x''1, ..., ''x''''N'' has a low discrepancy. Roughly speaking, the discrepancy of a sequence is low if the proportion of points in the sequence falling into an arbitrary set ''B'' is close to proportional to the measure of ''B'', as would happen on average (but not for particular samples) in the case of an equidistributed sequence. Specific definitions of discrepancy differ regarding the choice of ''B'' ( hyperspheres, hypercubes, etc.) and how the discrepancy for every B is computed (usually normalized) and combined (usually by taking the worst value). Low-discrepancy sequences are also called quasirandom sequences, due to their common use as a replacement of uniformly distributed random numbers. The "quasi" modifier is used to denote more clearly that the values of a low-discrepancy sequence are neither random nor pseudorandom, but such sequences share so ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Limit Superior And Limit Inferior
In mathematics, the limit inferior and limit superior of a sequence can be thought of as limiting (that is, eventual and extreme) bounds on the sequence. They can be thought of in a similar fashion for a function (see limit of a function). For a set, they are the infimum and supremum of the set's limit points, respectively. In general, when there are multiple objects around which a sequence, function, or set accumulates, the inferior and superior limits extract the smallest and largest of them; the type of object and the measure of size is context-dependent, but the notion of extreme limits is invariant. Limit inferior is also called infimum limit, limit infimum, liminf, inferior limit, lower limit, or inner limit; limit superior is also known as supremum limit, limit supremum, limsup, superior limit, upper limit, or outer limit. The limit inferior of a sequence x_n is denoted by \liminf_x_n\quad\text\quad \varliminf_x_n. The limit superior of a sequence x_n is denoted by \lims ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equidistribution Theorem
In mathematics, the equidistribution theorem is the statement that the sequence :''a'', 2''a'', 3''a'', ... mod 1 is uniformly distributed on the circle \mathbb/\mathbb, when ''a'' is an irrational number. It is a special case of the ergodic theorem where one takes the normalized angle measure \mu=\frac. History While this theorem was proved in 1909 and 1910 separately by Hermann Weyl, Wacław Sierpiński and Piers Bohl, variants of this theorem continue to be studied to this day. In 1916, Weyl proved that the sequence ''a'', 22''a'', 32''a'', ... mod 1 is uniformly distributed on the unit interval. In 1937, Ivan Vinogradov proved that the sequence ''p''''n'' ''a'' mod 1 is uniformly distributed, where ''p''''n'' is the ''n''th prime. Vinogradov's proof was a byproduct of the odd Goldbach conjecture, that every sufficiently large odd number is the sum of three primes. George Birkhoff, in 1931, and Aleksandr Khinchin, in 1933, proved that the generalization ''x'' + ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Almost Everywhere
In measure theory (a branch of mathematical analysis), a property holds almost everywhere if, in a technical sense, the set for which the property holds takes up nearly all possibilities. The notion of "almost everywhere" is a companion notion to the concept of measure zero, and is analogous to the notion of ''almost surely'' in probability theory. More specifically, a property holds almost everywhere if it holds for all elements in a set except a subset of measure zero, or equivalently, if the set of elements for which the property holds is conull. In cases where the measure is not complete, it is sufficient that the set be contained within a set of measure zero. When discussing sets of real numbers, the Lebesgue measure is usually assumed unless otherwise stated. The term ''almost everywhere'' is abbreviated ''a.e.''; in older literature ''p.p.'' is used, to stand for the equivalent French language phrase ''presque partout''. A set with full measure is one whose complement i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lebesgue Integral
In mathematics, the integral of a non-negative function of a single variable can be regarded, in the simplest case, as the area between the graph of that function and the -axis. The Lebesgue integral, named after French mathematician Henri Lebesgue, extends the integral to a larger class of functions. It also extends the domains on which these functions can be defined. Long before the 20th century, mathematicians already understood that for non-negative functions with a smooth enough graph—such as continuous functions on closed bounded intervals—the ''area under the curve'' could be defined as the integral, and computed using approximation techniques on the region by polygons. However, as the need to consider more irregular functions arose—e.g., as a result of the limiting processes of mathematical analysis and the mathematical theory of probability—it became clear that more careful approximation techniques were needed to define a suitable integral. Also, one might ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lp Space
In mathematics, the spaces are function spaces defined using a natural generalization of the Norm (mathematics)#p-norm, -norm for finite-dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue , although according to the Nicolas Bourbaki, Bourbaki group they were first introduced by Frigyes Riesz . spaces form an important class of Banach spaces in functional analysis, and of topological vector spaces. Because of their key role in the mathematical analysis of measure and probability spaces, Lebesgue spaces are used also in the theoretical discussion of problems in physics, statistics, economics, finance, engineering, and other disciplines. Applications Statistics In statistics, measures of central tendency and statistical dispersion, such as the mean, median, and standard deviation, are defined in terms of metrics, and measures of central tendency can be characterized as Central tendency#Solutions to variational problems, solutions to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Countable Set
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements. In more technical terms, assuming the axiom of countable choice, a set is ''countable'' if its cardinality (its number of elements) is not greater than that of the natural numbers. A countable set that is not finite is said countably infinite. The concept is attributed to Georg Cantor, who proved the existence of uncountable sets, that is, sets that are not countable; for example the set of the real numbers. A note on terminology Although the terms "countable" and "countably infinite" as defined here are quite co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irrational Number
In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being '' incommensurable'', meaning that they share no "measure" in common, that is, there is no length ("the measure"), no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself. Among irrational numbers are the ratio of a circle's circumference to its diameter, Euler's number ''e'', the golden ratio ''φ'', and the square root of two. In fact, all square roots of natural numbers, other than of perfect squares, are irrational. Like all real numbers, irrational numbers can be expressed in positional notation, notably as a decimal number. In the cas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractional Part
The fractional part or decimal part of a non‐negative real number x is the excess beyond that number's integer part. If the latter is defined as the largest integer not greater than , called floor of or \lfloor x\rfloor, its fractional part can be written as: :\operatorname (x)=x - \lfloor x \rfloor,\; x > 0. For a positive number written in a conventional positional numeral system (such as binary or decimal), its fractional part hence corresponds to the digits appearing after the radix point. The result is a real number in the half-open interval x, -\lfloor , x, \rfloor , or by the Weisstein,_Eric_W._"Fractional_Part."_From_MathWorld--A_Wolfram_Web_Resource /ref> : |
