|
Cyclic Polygon
In geometry, the circumscribed circle or circumcircle of a polygon is a circle that passes through all the vertices of the polygon. The center of this circle is called the circumcenter and its radius is called the circumradius. Not every polygon has a circumscribed circle. A polygon that does have one is called a cyclic polygon, or sometimes a concyclic polygon because its vertices are concyclic. All triangles, all regular simple polygons, all rectangles, all isosceles trapezoids, and all right kites are cyclic. A related notion is the one of a minimum bounding circle, which is the smallest circle that completely contains the polygon within it, if the circle's center is within the polygon. Every polygon has a unique minimum bounding circle, which may be constructed by a linear time algorithm. Even if a polygon has a circumscribed circle, it may be different from its minimum bounding circle. For example, for an obtuse triangle, the minimum bounding circle has the longest side ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circumscribed Polygon
In geometry, the circumscribed circle or circumcircle of a polygon is a circle that passes through all the vertex (geometry), vertices of the polygon. The center of this circle is called the circumcenter and its radius is called the circumradius. Not every polygon has a circumscribed circle. A polygon that does have one is called a cyclic polygon, or sometimes a concyclic polygon because its vertices are concyclic. All triangles, all Regular polygon, regular simple polygons, all rectangles, all isosceles trapezoids, and all right kites are cyclic. A related notion is the one of a Smallest circle problem, minimum bounding circle, which is the smallest circle that completely contains the polygon within it, if the circle's center is within the polygon. Every polygon has a unique minimum bounding circle, which may be constructed by a linear time algorithm. Even if a polygon has a circumscribed circle, it may be different from its minimum bounding circle. For example, for an obtuse t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bisection
In geometry, bisection is the division of something into two equal or congruent parts, usually by a line, which is then called a ''bisector''. The most often considered types of bisectors are the ''segment bisector'' (a line that passes through the midpoint of a given segment) and the ''angle bisector'' (a line that passes through the apex of an angle, that divides it into two equal angles). In three-dimensional space, bisection is usually done by a plane (geometry), plane, also called the ''bisector'' or ''bisecting plane''. Perpendicular line segment bisector Definition *The perpendicular bisector of a line segment is a line, which meets the segment at its midpoint perpendicularly. The Horizontal intersector of a segment AB also has the property that each of its points X is equidistant from the segment's endpoints: (D)\quad , XA, = , XB, . The proof follows from and Pythagoras' theorem: :, XA, ^2=, XM, ^2+, MA, ^2=, XM, ^2+, MB, ^2=, XB, ^2 \; . Property (D) is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cofactor Expansion
In linear algebra, the Laplace expansion, named after Pierre-Simon Laplace, also called cofactor expansion, is an expression of the determinant of an matrix as a weighted sum of minors, which are the determinants of some submatrices of . Specifically, for every , \begin \det(B)&= \sum_^ (-1)^ B_ M_, \end where B_ is the entry of the th row and th column of , and M_ is the determinant of the submatrix obtained by removing the th row and the th column of . The term (-1)^ M_ is called the cofactor of B_ in . The Laplace expansion is often useful in proofs, as in, for example, allowing recursion on the size of matrices. It is also of didactic interest for its simplicity, and as one of several ways to view and compute the determinant. For large matrices, it quickly becomes inefficient to compute, when compared to Gaussian elimination. Examples Consider the matrix : B = \begin 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end. The determinant of this matrix can be computed by using ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix is denoted , , or . The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e & f \\ g & h & i \end= aei + bfg + cdh - ceg - bdi - afh. The determinant of a matrix can be defined in several equivalent ways. Leibniz formula expresses the determinant as a sum of signed products of matrix entries such that each summand is the product of different entries, and the number of these summands is n!, the factorial of (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Locus (mathematics)
In geometry, a locus (plural: ''loci'') (Latin word for "place", "location") is a set of all points (commonly, a line, a line segment, a curve or a surface), whose location satisfies or is determined by one or more specified conditions.. In other words, the set of the points that satisfy some property is often called the ''locus of a point'' satisfying this property. The use of the singular in this formulation is a witness that, until the end of the 19th century, mathematicians did not consider infinite sets. Instead of viewing lines and curves as sets of points, they viewed them as places where a point may be ''located'' or may move. History and philosophy Until the beginning of the 20th century, a geometrical shape (for example a curve) was not considered as an infinite set of points; rather, it was considered as an entity on which a point may be located or on which it moves. Thus a circle in the Euclidean plane was defined as the ''locus'' of a point that is at a given dist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kernel (linear Algebra)
In mathematics, the kernel of a linear map, also known as the null space or nullspace, is the linear subspace of the domain of the map which is mapped to the zero vector. That is, given a linear map between two vector spaces and , the kernel of is the vector space of all elements of such that , where denotes the zero vector in , or more symbolically: :\ker(L) = \left\ . Properties The kernel of is a linear subspace of the domain .Linear algebra, as discussed in this article, is a very well established mathematical discipline for which there are many sources. Almost all of the material in this article can be found in , , and Strang's lectures. In the linear map L : V \to W, two elements of have the same image in if and only if their difference lies in the kernel of , that is, L\left(\mathbf_1\right) = L\left(\mathbf_2\right) \quad \text \quad L\left(\mathbf_1-\mathbf_2\right) = \mathbf. From this, it follows that the image of is isomorphic to the quotient of by the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix (mathematics)
In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, \begin1 & 9 & -13 \\20 & 5 & -6 \end is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a "-matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra. Therefore, the study of matrices is a large part of linear algebra, and most properties and operations of abstract linear algebra can be expressed in terms of matrices. For example, matrix multiplication represents composition of linear maps. Not all matrices are related to linear algebra. This is, in particular, the case in graph theory, of incidence matrices, and adjacency matrices. ''This article focuses on matrices related to linear algebra, and, unle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polarization Identity
In linear algebra, a branch of mathematics, the polarization identity is any one of a family of formulas that express the inner product of two vectors in terms of the norm of a normed vector space. If a norm arises from an inner product then the polarization identity can be used to express this inner product entirely in terms of the norm. The polarization identity shows that a norm can arise from at most one inner product; however, there exist norms that do not arise from any inner product. The norm associated with any inner product space satisfies the parallelogram law: \, x+y\, ^2 + \, x-y\, ^2 = 2\, x\, ^2 + 2\, y\, ^2. In fact, as observed by John von Neumann, the parallelogram law characterizes those norms that arise from inner products. Given a normed space (H, \, \cdot\, ), the parallelogram law holds for \, \cdot\, if and only if there exists an inner product \langle \cdot, \cdot \rangle on H such that \, x\, ^2 = \langle x,\ x\rangle for all x \in H, in which case ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Coordinates
A Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of numerical coordinates, which are the signed distances to the point from two fixed perpendicular oriented lines, measured in the same unit of length. Each reference coordinate line is called a ''coordinate axis'' or just ''axis'' (plural ''axes'') of the system, and the point where they meet is its ''origin'', at ordered pair . The coordinates can also be defined as the positions of the perpendicular projections of the point onto the two axes, expressed as signed distances from the origin. One can use the same principle to specify the position of any point in three-dimensional space by three Cartesian coordinates, its signed distances to three mutually perpendicular planes (or, equivalently, by its perpendicular projection onto three mutually perpendicular lines). In general, ''n'' Cartesian coordinates (an element of real ''n''-space) specify the point in an ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Plane
In mathematics, the Euclidean plane is a Euclidean space of dimension two. That is, a geometric setting in which two real quantities are required to determine the position of each point ( element of the plane), which includes affine notions of parallel lines, and also metrical notions of distance, circles, and angle measurement. The set \mathbb^2 of pairs of real numbers (the real coordinate plane) augmented by appropriate structure often serves as the canonical example. History Books I through IV and VI of Euclid's Elements dealt with two-dimensional geometry, developing such notions as similarity of shapes, the Pythagorean theorem (Proposition 47), equality of angles and areas, parallelism, the sum of the angles in a triangle, and the three cases in which triangles are "equal" (have the same area), among many other topics. Later, the plane was described in a so-called '' Cartesian coordinate system'', a coordinate system that specifies each point uniquely in a plane by a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compass
A compass is a device that shows the cardinal directions used for navigation and geographic orientation. It commonly consists of a magnetized needle or other element, such as a compass card or compass rose, which can pivot to align itself with magnetic north. Other methods may be used, including gyroscopes, magnetometers, and GPS receivers. Compasses often show angles in degrees: north corresponds to 0°, and the angles increase clockwise, so east is 90°, south is 180°, and west is 270°. These numbers allow the compass to show azimuths or bearings which are commonly stated in degrees. If local variation between magnetic north and true north is known, then direction of magnetic north also gives direction of true north. Among the Four Great Inventions, the magnetic compass was first invented as a device for divination as early as the Chinese Han Dynasty (since c. 206 BC),Li Shu-hua, p. 176 and later adopted for navigation by the Song Dynasty Chinese during the 11th centur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sextant
A sextant is a doubly reflecting navigation instrument that measures the angular distance between two visible objects. The primary use of a sextant is to measure the angle between an astronomical object and the horizon for the purposes of celestial navigation. The estimation of this angle, the altitude, is known as ''sighting'' or ''shooting'' the object, or ''taking a sight''. The angle, and the time when it was measured, can be used to calculate a position line on a nautical or aeronautical chart—for example, sighting the Sun at noon or Polaris at night (in the Northern Hemisphere) to estimate latitude (with sight reduction). Sighting the height of a landmark can give a measure of ''distance off'' and, held horizontally, a sextant can measure angles between objects for a position on a chart. A sextant can also be used to measure the lunar distance between the moon and another celestial object (such as a star or planet) in order to determine Greenwich Mean Time and hence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
