Using Strassen's algorithm to accelerate the solution of linear systems
type: Item
instance of: scholarly article
title: Using Strassen's algorithm to accelerate the solution of linear systems
zbMATH Open document ID: 1215.65049
DOI: 10.1007/BF00129836
author: Yong-Cai Geng
author: Sumit K. Garg
published in: The Journal of Supercomputing
publication date: 2011-07-02T00:00:00Z
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 5917010
zbMATH Keywords: Strassen's algorithm
zbMATH Keywords: fast matrix multiplication
zbMATH Keywords: linear systems
zbMATH Keywords: LAPACK
zbMATH Keywords: vector computers
describes a project that uses: LAPACK
describes a project that uses: BLAS
MaRDI profile type: Publication
cites work: Extra High Speed Matrix Multiplication on the Cray-2
cites work: Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
cites work: Matrix multiplication via arithmetic progressions
cites work: Corrigenda: “An Extended Set of FORTRAN Basic Linear Algebra Subprograms”
cites work: Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
cites work: Exploiting fast matrix multiplication within the level 3 BLAS
cites work: Computational Complexity and Numerical Stability
cites work: Q3713483
cites work: Gaussian elimination is not optimal
full work available at URL: https://doi.org/10.1007/bf00129836
OpenAlex ID: W1972907356
description: scientific article; zbMATH DE number 5917010