Pages that link to "Item:Q3677069"

The following pages link to How Can We Speed Up Matrix Multiplication? (Q3677069):

Displaying 21 items.

• Optimization techniques for small matrix multiplication (Q533859) (← links)
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
• A study on quaternion block quasi-tridiagonal systems (Q815222) (← links)
• Fast rectangular matrix multiplication and some applications (Q931517) (← links)
• Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
• Normalized natural gradient in independent component analysis (Q985674) (← links)
• On practical algorithms for accelerated matrix multiplication (Q1183208) (← links)
• A polynomial method of approximate centers for linear programming (Q1196720) (← links)
• Fast rectangular matrix multiplication and applications (Q1271174) (← links)
• Algorithms for fast convolutions on motion groups (Q1582144) (← links)
• Fast rectangular matrix multiplication and QR decomposition (Q1893106) (← links)
• Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures (Q1903780) (← links)
• Fast bilinear algorithms for symmetric tensor contractions (Q2246165) (← links)
• Schur aggregation for linear systems and determinants (Q2378504) (← links)
• Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
• (Q2760378) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Fast parallel algorithms for polynomial division over an arbitrary field of constants (Q4723298) (← links)
• Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
• Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions (Q5157832) (← links)