Pages that link to "Item:Q2354472"
From MaRDI portal
The following pages link to A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472):
Displaying 6 items.
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- On the approximate bilinear complexity of matrix multiplication (Q891131) (← links)
- Symmetric matrices whose entries are linear functions (Q2206413) (← links)
- The border support rank of two-by-two matrix multiplication is seven (Q4615808) (← links)
- On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) (← links)
- The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)