On multiplication of 2 \(\times\) 2 matrices
From MaRDI portal
Publication:2548859
DOI10.1016/0024-3795(71)90009-7zbMath0225.68018OpenAlexW2065815779MaRDI QIDQ2548859
Publication date: 1971
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(71)90009-7
Related Items (65)
Gaussian elimination is optimal for solving linear equations in dimension two ⋮ Fast algorithms for the basic operation of cellular methods of linear algebra ⋮ Generation of test matrices with specified eigenvalues using floating-point arithmetic ⋮ Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank ⋮ Multiplicative complexity of direct sums of quadratic systems ⋮ Fast commutative matrix algorithms ⋮ On the arithmetic complexity of Strassen-like matrix multiplications ⋮ A non-commutative cryptosystem based on quaternion algebras ⋮ An introduction to the computational complexity of matrix multiplication ⋮ The bilinear complexity and practical algorithms for matrix multiplication ⋮ Unnamed Item ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication ⋮ Geometry and the complexity of matrix multiplication ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Flip Graphs for Matrix Multiplication ⋮ On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field ⋮ Error‐free transformation of matrix multiplication with a posteriori validation ⋮ Tensor surgery and tensor rank ⋮ A normal form for matrix multiplication schemes ⋮ Postulation of general quintuple fat point schemes in \(\mathbb P^3\) ⋮ Numerical stability and tensor nuclear norm ⋮ Computational methods of linear algebra ⋮ The complexity of basic complex operations ⋮ The tensor rank of tensor product of two three-qubit W states is eight ⋮ Tensor rank is not multiplicative under the tensor product ⋮ On the algorithmic complexity of associative algebras ⋮ Using duality for the synthesis of an optimal algorithm involving matrix multiplication ⋮ Rank-profile revealing Gaussian elimination and the CUP matrix decomposition ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ New fast hybrid matrix multiplication algorithms ⋮ Fast hybrid matrix multiplication algorithms ⋮ On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications ⋮ Trisymmetric multiplication formulae in finite fields ⋮ On the additive complexity of 2 \(\times 2\) matrix multiplication ⋮ Numerical CP decomposition of some difficult tensors ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ Optimization techniques for small matrix multiplication ⋮ Optimum computation of p bilinear forms ⋮ Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\) ⋮ Some bilinear forms whose multiplicative complexity depends on the field of constants ⋮ On the complexity of quaternion multiplication ⋮ A survey of techniques in applied computational complexity ⋮ Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation ⋮ Numerical tensor calculus ⋮ A new fast recursive matrix multiplication algorithm ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ The complexity of vector-products ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ On the optimal evaluation of a set of bilinear forms ⋮ Fast matrix decomposition in \(\mathbb F_2\) ⋮ A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications ⋮ Algebraic complexity of the computation of a pair of bilinear forms ⋮ A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) ⋮ The border rank of the multiplication of $2\times 2$ matrices is seven ⋮ The border support rank of two-by-two matrix multiplication is seven ⋮ Computing images of polynomial maps ⋮ On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication ⋮ Tripartite Entanglement Transformations and Tensor Rank ⋮ Multiplicative complexity and algebraic structure ⋮ Progress on the symmetric Strassen conjecture ⋮ Typical tensorial rank ⋮ A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Cites Work
This page was built for publication: On multiplication of 2 \(\times\) 2 matrices
