enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Zassenhaus algorithm - Wikipedia

    en.wikipedia.org/wiki/Zassenhaus_algorithm

    In mathematics, the Zassenhaus algorithm [1] is a method to calculate a basis for the intersection and sum of two subspaces of a vector space. It is named after Hans Zassenhaus, but no publication of this algorithm by him is known. [2] It is used in computer algebra systems. [3]

  3. Line–line intersection - Wikipedia

    en.wikipedia.org/wiki/Line–line_intersection

    Assume that we want to find intersection of two infinite lines in 2-dimensional space, defined as a 1 x + b 1 y + c 1 = 0 and a 2 x + b 2 y + c 2 = 0. We can represent these two lines in line coordinates as U 1 = (a 1, b 1, c 1) and U 2 = (a 2, b 2, c 2). The intersection P′ of two lines is then simply given by [4]

  4. Intersection (geometry) - Wikipedia

    en.wikipedia.org/wiki/Intersection_(geometry)

    intersection of two polygons: window test. If one wants to determine the intersection points of two polygons, one can check the intersection of any pair of line segments of the polygons (see above). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by using window tests ...

  5. Linear span - Wikipedia

    en.wikipedia.org/wiki/Linear_span

    For example, in geometry, two linearly independent vectors span a plane. To express that a vector space V is a linear span of a subset S , one commonly uses one of the following phrases: S spans V ; S is a spanning set of V ; V is spanned or generated by S ; S is a generator set or a generating set of V .

  6. Linear algebra - Wikipedia

    en.wikipedia.org/wiki/Linear_algebra

    In three-dimensional Euclidean space, these three planes represent solutions to linear equations, and their intersection represents the set of common solutions: in this case, a unique point. The blue line is the common solution to two of these equations. Linear algebra is the branch of mathematics concerning linear equations such as:

  7. Linear subspace - Wikipedia

    en.wikipedia.org/wiki/Linear_subspace

    If V is a vector space over a field K, a subset W of V is a linear subspace of V if it is a vector space over K for the operations of V.Equivalently, a linear subspace of V is a nonempty subset W such that, whenever w 1, w 2 are elements of W and α, β are elements of K, it follows that αw 1 + βw 2 is in W.

  8. Vector space - Wikipedia

    en.wikipedia.org/wiki/Vector_space

    In this article, vectors are represented in boldface to distinguish them from scalars. [nb 1] [1] A vector space over a field F is a non-empty set V together with a binary operation and a binary function that satisfy the eight axioms listed below. In this context, the elements of V are commonly called vectors, and the elements of F are called ...

  9. Intersection curve - Wikipedia

    en.wikipedia.org/wiki/Intersection_curve

    The intersection of two planes. The analytic determination of the intersection curve of two surfaces is easy only in simple cases; for example: a) the intersection of two planes, b) plane section of a quadric (sphere, cylinder, cone, etc.), c) intersection of two quadrics in special cases. For the general case, literature provides algorithms ...