Pages that link to "Item:Q1183208"
From MaRDI portal
The following pages link to On practical algorithms for accelerated matrix multiplication (Q1183208):
Displayed 15 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)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Fast rectangular matrix multiplication and QR decomposition (Q1893106) (← links)
- Randomized preprocessing versus pivoting (Q1940337) (← links)
- Efficient transitive closure of sparse matrices over closed semirings (Q2368941) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- Improving the Numerical Stability of Fast Matrix Multiplication (Q2827068) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation (Q6081940) (← links)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)