Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
From MaRDI portal
Publication:2538448
DOI10.1007/BF02308867zbMath0193.11902MaRDI QIDQ2538448
Publication date: 1970
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132024
Related Items
Tensors in computations, Fast rectangular matrix multiplication and QR decomposition, FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES, Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Fast matrix multiplication is stable, Stability of fast algorithms for matrix multiplication, Pebbling Game and Alternative Basis for High Performance Matrix Multiplication, Computational methods of linear algebra, Fast matrix multiplication and its algebraic neighbourhood, On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication, New ways to multiply \(3 \times 3\)-matrices, A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications, On practical algorithms for accelerated matrix multiplication, Fast linear algebra is stable, Optimization techniques for small matrix multiplication, Using Strassen's algorithm to accelerate the solution of linear systems, Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation, Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity, Improving the Numerical Stability of Fast Matrix Multiplication
Cites Work
