• Min-plus matrix multiplication, also known as distance product, is an operation on matrices. Given two n × n {\displaystyle n\times n} matrices A = ( a...
    1 KB (228 words) - 07:40, 18 November 2024
  • formulation of the above can be obtained by using the min-plus algebra. Matrix multiplication in this system is defined as follows: Given two n × n matrices...
    31 KB (4,098 words) - 21:03, 14 April 2025
  • repeatedly square the adjacency matrix of the given graph, logarithmically many times, using min-plus matrix multiplication with maximization in place of...
    23 KB (3,170 words) - 01:52, 12 February 2025
  • Strassen algorithm (category Matrix multiplication algorithms)
    Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm for large matrices, with a...
    26 KB (3,597 words) - 23:26, 31 May 2025
  • Thumbnail for Shortest path problem
    Euclidean shortest path Flow network K shortest path routing Min-plus matrix multiplication Pathfinding Shortest Path Bridging Shortest path tree TRILL...
    46 KB (4,790 words) - 20:24, 16 June 2025
  • Thumbnail for Dynamic programming
    sides LeftSide = OptimalMatrixMultiplication(s, i, s[i, j]) RightSide = OptimalMatrixMultiplication(s, s[i, j] + 1, j) return MatrixMultiply(LeftSide, RightSide)...
    59 KB (9,166 words) - 15:39, 12 June 2025
  • with coefficients in R {\displaystyle R} , the matrix semiring using ordinary addition and multiplication rules of matrices. Given n ∈ N {\displaystyle...
    52 KB (8,021 words) - 14:35, 11 April 2025
  • Thumbnail for Linear programming
    \omega } is the exponent of matrix multiplication and α {\displaystyle \alpha } is the dual exponent of matrix multiplication. α {\displaystyle \alpha }...
    61 KB (6,690 words) - 17:57, 6 May 2025
  • Thumbnail for Addition
    signified by the plus symbol, +) is one of the four basic operations of arithmetic, the other three being subtraction, multiplication, and division. The...
    82 KB (10,267 words) - 02:42, 18 June 2025
  • generally irreducible non-negative matrix) A, the Perron–Frobenius eigenvector is the only (up to multiplication by constant) non-negative eigenvector...
    58 KB (8,224 words) - 08:53, 27 May 2025
  • Thumbnail for Arithmetic
    mathematics that deals with numerical operations like addition, subtraction, multiplication, and division. In a wider sense, it also includes exponentiation, extraction...
    165 KB (16,396 words) - 04:14, 2 June 2025
  • Thumbnail for GraphBLAS
    can be efficiently implemented via linear algebraic methods (e.g. matrix multiplication) over different semirings. The development of GraphBLAS and its...
    21 KB (1,838 words) - 12:22, 11 March 2025
  • In-place matrix transposition, also called in-situ matrix transposition, is the problem of transposing an N×M matrix in-place in computer memory, ideally...
    22 KB (3,044 words) - 20:41, 19 March 2025
  • square matrix multiplication Freivalds' algorithm: a randomized algorithm used to verify matrix multiplication Strassen algorithm: faster matrix multiplication...
    72 KB (7,951 words) - 17:13, 5 June 2025
  • scalar/vector multiplication, matrix-vector multiplication (vector interpreted as column)) Vector: 3 editable tables, preset last matrix/vector result...
    11 KB (1,401 words) - 13:30, 5 January 2025
  • repeated Dijkstra approach. There are also known algorithms using fast matrix multiplication to speed up all-pairs shortest path computation in dense graphs...
    23 KB (3,017 words) - 07:12, 23 May 2025
  • Thumbnail for Variance
    matrix of the components. The next expression states equivalently that the variance of the sum is the sum of the diagonal of covariance matrix plus two...
    61 KB (10,215 words) - 16:29, 24 May 2025
  • Thumbnail for Cartesian product of graphs
    {\displaystyle n_{2}\times n_{2}} adjacency matrix A 2 {\displaystyle \mathbf {A} _{2}} , then the adjacency matrix of the Cartesian product of both graphs...
    11 KB (1,450 words) - 01:00, 26 March 2025
  • Thumbnail for Array processing
    the visibilities covariance matrix and coloring the white noise term. This scheme attempts to make the interference-plus-noise term spectrally white....
    36 KB (5,733 words) - 12:52, 31 December 2024
  • result of a multiplication Matrix decompositions: LU decomposition — lower triangular times upper triangular QR decomposition — orthogonal matrix times triangular...
    70 KB (8,327 words) - 09:12, 7 June 2025
  • any additional multiplicative factor. Combined with appropriate factors of √2 (see above), this can be used to make the transform matrix orthogonal. Multidimensional...
    101 KB (11,972 words) - 16:40, 16 June 2025
  • queries and keys per loop iteration, in a similar way as blocked matrix multiplication. If backpropagation is needed, then the output vectors and the intermediate...
    33 KB (5,279 words) - 19:53, 29 May 2025
  • )\;dV_{\mathbf {X} }} _{=I_{2}}} This equation amounts the matrix-vector multiplications above plus the marginalization with respect to X {\displaystyle \mathbf...
    18 KB (2,435 words) - 22:22, 22 May 2025
  • technologies such as MiniDiscs, CDs, DVDs, Blu-ray discs, QR codes, Data Matrix, data transmission technologies such as DSL and WiMAX, broadcast systems...
    75 KB (12,395 words) - 16:42, 29 April 2025
  • Thumbnail for Magic square
    some other operation. For example, a multiplicative magic square has a constant product of numbers. A multiplicative magic square can be derived from an...
    283 KB (22,417 words) - 02:33, 9 June 2025
  • Thumbnail for Synthetic-aperture radar
    inversion of the covariance matrix R and multiplication by the a ω 1 , ω 2 {\displaystyle a_{\omega _{1},\omega _{2}}} matrix, which has to be done for...
    79 KB (11,260 words) - 07:13, 27 May 2025
  • Thumbnail for Pythagorean addition
    values. The alpha max plus beta min algorithm is a high-speed approximation of Pythagorean addition using only comparison, multiplication, and addition, producing...
    35 KB (3,471 words) - 05:15, 15 June 2025
  • for large numbers. The following identity relates log semiring to the min-plus semiring. lim T → 0 − T log ⁡ ( e − s T + e − t T ) = m i n { s , t } {\displaystyle...
    44 KB (8,358 words) - 04:35, 9 June 2025
  • Thumbnail for Minimum spanning tree
    expressions. Circuit design: implementing efficient multiple constant multiplications, as used in finite impulse response filters. Regionalisation of socio-geographic...
    44 KB (5,460 words) - 18:56, 21 May 2025
  • approach, the channel matrix is diagonalized by taking an SVD and removing the two unitary matrices through pre- and post-multiplication at the transmitter...
    25 KB (3,895 words) - 11:48, 18 November 2024