|
Poincaré Inequality
In mathematics, the Poincaré inequality is a result in the theory of Sobolev spaces, named after the French mathematician Henri Poincaré. The inequality allows one to obtain bounds on a function using bounds on its derivatives and the geometry of its domain of definition. Such bounds are of great importance in the modern, direct methods of the calculus of variations. A very closely related result is Friedrichs' inequality. Statement of the inequality The classical Poincaré inequality Let ''p'', so that 1 ≤ ''p'' < ∞ and Ω a subset bounded at least in one direction. Then there exists a constant ''C'', depending only on Ω and ''p'', so that, for every function ''u'' of the ''W''01,''p''(Ω) of zero-trace (a.k.a. zero on the boundary) functions, : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doubling Space
In mathematics, a metric space with metric is said to be doubling if there is some doubling constant such that for any and , it is possible to cover the ball with the union of at most balls of radius . The base-2 logarithm of is called the doubling dimension of . Euclidean spaces \mathbb^d equipped with the usual Euclidean metric are examples of doubling spaces where the doubling constant depends on the dimension . For example, in one dimension, ; and in two dimensions, . In general, Euclidean space \mathbb^d has doubling dimension \Theta(d). Assouad's embedding theorem An important question in metric space geometry is to characterize those metric spaces that can be embedded in some Euclidean space by a bi-Lipschitz function. This means that one can essentially think of the metric space as a subset of Euclidean space. Not all metric spaces may be embedded in Euclidean space. Doubling metric spaces, on the other hand, would seem like they have more of a chance, since ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laplace Operator
In mathematics, the Laplace operator or Laplacian is a differential operator given by the divergence of the gradient of a scalar function on Euclidean space. It is usually denoted by the symbols \nabla\cdot\nabla, \nabla^2 (where \nabla is the nabla operator), or \Delta. In a Cartesian coordinate system, the Laplacian is given by the sum of second partial derivatives of the function with respect to each independent variable. In other coordinate systems, such as cylindrical and spherical coordinates, the Laplacian also has a useful form. Informally, the Laplacian of a function at a point measures by how much the average value of over small spheres or balls centered at deviates from . The Laplace operator is named after the French mathematician Pierre-Simon de Laplace (1749–1827), who first applied the operator to the study of celestial mechanics: the Laplacian of the gravitational potential due to a given mass density distribution is a constant multiple of that densi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rayleigh Quotient
In mathematics, the Rayleigh quotient () for a given complex Hermitian matrix ''M'' and nonzero vector ''x'' is defined as: R(M,x) = . For real matrices and vectors, the condition of being Hermitian reduces to that of being symmetric, and the conjugate transpose x^ to the usual transpose x'. Note that R(M, c x) = R(M,x) for any non-zero scalar ''c''. Recall that a Hermitian (or real symmetric) matrix is diagonalizable with only real eigenvalues. It can be shown that, for a given matrix, the Rayleigh quotient reaches its minimum value \lambda_\min (the smallest eigenvalue of ''M'') when ''x'' is v_\min (the corresponding eigenvector). Similarly, R(M, x) \leq \lambda_\max and R(M, v_\max) = \lambda_\max. The Rayleigh quotient is used in the min-max theorem to get exact values of all eigenvalues. It is also used in eigenvalue algorithms (such as Rayleigh quotient iteration) to obtain an eigenvalue approximation from an eigenvector approximation. The range of the Rayleigh quotient ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wirtinger's Inequality For Functions
: ''For other inequalities named after Wirtinger, see Wirtinger's inequality.'' In the mathematical field of analysis, the Wirtinger inequality is an important inequality for functions of a single variable, named after Wilhelm Wirtinger. It was used by Adolf Hurwitz in 1901 to give a new proof of the isoperimetric inequality for curves in the plane. A variety of closely related results are today known as Wirtinger's inequality, all of which can be viewed as certain forms of the Poincaré inequality. Theorem There are several inequivalent versions of the Wirtinger inequality: * Let be a continuous and differentiable function on the interval with average value zero and with . Then ::\int_0^L y(x)^2\,\mathrmx\leq\frac\int_0^L y'(x)^2\,\mathrmx, : and equality holds if and only if for some numbers and . * Let be a continuous and differentiable function on the interval with . Then ::\int_0^L y(x)^2\,\mathrmx\leq\frac\int_0^L y'(x)^2\,\mathrmx, : and equality holds if and only if ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Level Sets
In mathematics, a level set of a real-valued function of real variables is a set where the function takes on a given constant value , that is: : L_c(f) = \left\~, When the number of independent variables is two, a level set is called a level curve, also known as ''contour line'' or ''isoline''; so a level curve is the set of all real-valued solutions of an equation in two variables and . When , a level set is called a level surface (or ''isosurface''); so a level surface is the set of all real-valued roots of an equation in three variables , and . For higher values of , the level set is a level hypersurface, the set of all real-valued roots of an equation in variables. A level set is a special case of a fiber. Alternative names Level sets show up in many applications, often under different names. For example, an implicit curve is a level curve, which is considered independently of its neighbor curves, emphasizing that such a curve is defined by an implicit e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isoperimetric Inequality
In mathematics, the isoperimetric inequality is a geometric inequality involving the perimeter of a set and its volume. In n-dimensional space \R^n the inequality lower bounds the surface area or perimeter \operatorname(S) of a set S\subset\R^n by its volume \operatorname(S), :\operatorname(S)\geq n \operatorname(S)^ \, \operatorname(B_1)^, where B_1\subset\R^n is a unit sphere. The equality holds only when S is a sphere in \R^n. On a plane, i.e. when n=2, the isoperimetric inequality relates the square of the circumference of a closed curve and the area of a plane region it encloses. '' Isoperimetric'' literally means "having the same perimeter". Specifically in \R ^2, the isoperimetric inequality states, for the length ''L'' of a closed curve and the area ''A'' of the planar region that it encloses, that : L^2 \ge 4\pi A, and that equality holds if and only if the curve is a circle. The isoperimetric problem is to determine a plane figure of the largest possible area whose ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diameter
In geometry, a diameter of a circle is any straight line segment that passes through the center of the circle and whose endpoints lie on the circle. It can also be defined as the longest chord of the circle. Both definitions are also valid for the diameter of a sphere. In more modern usage, the length d of a diameter is also called the diameter. In this sense one speaks of diameter rather than diameter (which refers to the line segment itself), because all diameters of a circle or sphere have the same length, this being twice the radius r. :d = 2r \qquad\text\qquad r = \frac. For a convex shape in the plane, the diameter is defined to be the largest distance that can be formed between two opposite parallel lines tangent to its boundary, and the is often defined to be the smallest such distance. Both quantities can be calculated efficiently using rotating calipers. For a curve of constant width such as the Reuleaux triangle, the width and diameter are the same because all ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Set
In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harmonic Capacity
In mathematics, the capacity of a set in Euclidean space is a measure of the "size" of that set. Unlike, say, Lebesgue measure, which measures a set's volume or physical extent, capacity is a mathematical analogue of a set's ability to hold electrical charge. More precisely, it is the capacitance of the set: the total charge a set can hold while maintaining a given potential energy. The potential energy is computed with respect to an idealized ground at infinity for the harmonic or Newtonian capacity, and with respect to a surface for the condenser capacity. Historical note The notion of capacity of a set and of "capacitable" set was introduced by Gustave Choquet in 1950: for a detailed account, see reference . Definitions Condenser capacity Let Σ be a closed, smooth, (''n'' − 1)-dimensional hypersurface in ''n''-dimensional Euclidean space ℝ''n'', ''n'' ≥ 3; ''K'' will denote the ''n''-dimensional compact (i.e., closed and bounded) set of which Σ is the bo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fourier Transform
A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, which will output a function depending on temporal frequency or spatial frequency respectively. That process is also called ''analysis''. An example application would be decomposing the waveform of a musical chord into terms of the intensity of its constituent pitches. The term ''Fourier transform'' refers to both the frequency domain representation and the mathematical operation that associates the frequency domain representation to a function of space or time. The Fourier transform of a function is a complex-valued function representing the complex sinusoids that comprise the original function. For each frequency, the magnitude (absolute value) of the complex value represents the amplitude of a constituent complex sinusoid with that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Torus
In geometry, a torus (plural tori, colloquially donut or doughnut) is a surface of revolution generated by revolving a circle in three-dimensional space about an axis that is coplanar with the circle. If the axis of revolution does not touch the circle, the surface has a ring shape and is called a torus of revolution. If the axis of revolution is tangent to the circle, the surface is a horn torus. If the axis of revolution passes twice through the circle, the surface is a spindle torus. If the axis of revolution passes through the center of the circle, the surface is a degenerate torus, a double-covered sphere. If the revolved curve is not a circle, the surface is called a ''toroid'', as in a square toroid. Real-world objects that approximate a torus of revolution include swim rings, inner tubes and ringette rings. Eyeglass lenses that combine spherical and cylindrical correction are toric lenses. A torus should not be confused with a '' solid torus'', which is formed by r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
