Zassenhaus Algorithm

The Zassenhaus algorithm is a method in linear algebra for computing a basis of the intersection and a basis of the sum of two given subspaces of a vector space, a computation widely implemented in computer algebra systems. It is named after Hans Zassenhaus, although no publication by Zassenhaus himself describing the method is known to exist. The algorithm is not to be confused with the unrelated Cantor-Zassenhaus algorithm, which solves a completely different problem, factoring polynomials over finite fields, and shares only Zassenhaus's name rather than any mathematical content. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/