Pages that link to "Item:Q1183208"
From MaRDI portal
The following pages link to On practical algorithms for accelerated matrix multiplication (Q1183208):
Displaying 45 items.
- New fast hybrid matrix multiplication algorithms (Q464981) (← links)
- 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)
- How to multiply matrices faster (Q799337) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← 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 applications (Q1271174) (← links)
- Fast algorithms with preprocessing for matrix-vector multiplication problems (Q1342512) (← links)
- Matrix multiplication for finite algebraic systems (Q1813190) (← links)
- Fast rectangular matrix multiplication and QR decomposition (Q1893106) (← links)
- Randomized preprocessing versus pivoting (Q1940337) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- Fast bilinear algorithms for symmetric tensor contractions (Q2246165) (← links)
- Efficient transitive closure of sparse matrices over closed semirings (Q2368941) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Some fast algorithms multiplying a matrix by its adjoint (Q2674011) (← links)
- A practical algorithm for faster matrix multiplication (Q2760378) (← links)
- Improving the numerical stability of fast matrix multiplication (Q2827068) (← links)
- Analyzing group based matrix multiplication algorithms (Q2883812) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
- Algorithm 898 (Q2989091) (← links)
- Fast Output-Sensitive Matrix Multiplication (Q3452839) (← links)
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays (Q3757394) (← links)
- Approximating Matrix Multiplication for Pattern Recognition Tasks (Q4238529) (← links)
- Fast Multiresolution Algorithms for Matrix-Vector Multiplication (Q4307039) (← links)
- (Q4316719) (← links)
- (Q4340242) (← links)
- Faster Online Matrix-Vector Multiplication (Q4575890) (← links)
- Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods (Q4581359) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Automatic generation of fast algorithms for matrix–vector multiplication (Q4641573) (← links)
- Cache-Aided Matrix Multiplication Retrieval (Q5088555) (← links)
- (Q5133661) (← links)
- Multiplying matrices faster than coppersmith-winograd (Q5415522) (← links)
- Fast matrix multiplication using coherent configurations (Q5741785) (← links)
- A fast algorithm for matrix multiplication and its efficient realization on systolic arrays (Q5951345) (← links)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
