Pages that link to "Item:Q2760378"
From MaRDI portal
The following pages link to A practical algorithm for faster matrix multiplication (Q2760378):
Displaying 21 items.
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Fast algorithms with preprocessing for matrix-vector multiplication problems (Q1342512) (← links)
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm) (Q1826443) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- Fast matrix decomposition in \(\mathbb F_2\) (Q2511223) (← links)
- Improving the numerical stability of fast matrix multiplication (Q2827068) (← links)
- Algorithm 898 (Q2989091) (← links)
- Fast Output-Sensitive Matrix Multiplication (Q3452839) (← links)
- Fast algorithm for the multiplication of a row vector by a randomly selected matrix<i>A</i> (Q3560579) (← links)
- Efficient complex matrix multiplication (Q3792146) (← links)
- (Q4316719) (← links)
- (Q4340242) (← links)
- Faster Online Matrix-Vector Multiplication (Q4575890) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Automatic generation of fast algorithms for matrix–vector multiplication (Q4641573) (← links)
- Multiplying matrices faster than coppersmith-winograd (Q5415522) (← links)