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. TI-59 / TI-58 - Wikipedia

    en.wikipedia.org/wiki/TI-59_/_TI-58

    Here is a sample program that computes the factorial of an integer number from 2 to 69. For 5!, if "5 A" is pressed, it gives the result, 120. Unlike the SR-52, the TI-58 and TI-59 do not have the factorial function built-in, but do support it through the software module which was delivered with the calculator.

  4. Duplication and elimination matrices - Wikipedia

    en.wikipedia.org/wiki/Duplication_and...

    In mathematics, especially in linear algebra and matrix theory, the duplication matrix and the elimination matrix are linear transformations used for transforming half-vectorizations of matrices into vectorizations or (respectively) vice versa.

  5. Unimodular matrix - Wikipedia

    en.wikipedia.org/wiki/Unimodular_matrix

    In mathematics, a unimodular matrix M is a square integer matrix having determinant +1 or −1. Equivalently, it is an integer matrix that is invertible over the integers : there is an integer matrix N that is its inverse (these are equivalent under Cramer's rule ).

  6. Computational complexity of matrix multiplication - Wikipedia

    en.wikipedia.org/wiki/Computational_complexity...

    In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed. Matrix multiplication algorithms are a central subroutine in theoretical and numerical algorithms for numerical linear algebra and optimization, so finding the fastest algorithm for matrix multiplication is of major practical ...

  7. Logarithm of a matrix - Wikipedia

    en.wikipedia.org/wiki/Logarithm_of_a_matrix

    The exponential of a matrix A is defined by =!. Given a matrix B, another matrix A is said to be a matrix logarithm of B if e A = B.. Because the exponential function is not bijective for complex numbers (e.g. = =), numbers can have multiple complex logarithms, and as a consequence of this, some matrices may have more than one logarithm, as explained below.

  8. Circulant matrix - Wikipedia

    en.wikipedia.org/wiki/Circulant_matrix

    Any circulant is a matrix polynomial (namely, the associated polynomial) in the cyclic permutation matrix: = + + + + = (), where is given by the companion matrix = []. The set of n × n {\displaystyle n\times n} circulant matrices forms an n {\displaystyle n} - dimensional vector space with respect to addition and scalar multiplication.

  9. Matrix multiplication - Wikipedia

    en.wikipedia.org/wiki/Matrix_multiplication

    Matrix multiplication is thus a basic tool of linear algebra, and as such has numerous applications in many areas of mathematics, as well as in applied mathematics, statistics, physics, economics, and engineering. [3] [4] Computing matrix products is a central operation in all computational applications of linear algebra.