The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
type: Item
instance of: scholarly article
title: The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
zbMATH Open document ID: 0674.68027
DOI: 10.1016/0898-1221(85)90095-1
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4104381
zbMATH Keywords: bit complexity
zbMATH Keywords: matrix multiplication
zbMATH Keywords: \(\lambda \) algorithms
zbMATH Keywords: any precision approximation algorithms
author: Victor Y. Pan
MaRDI profile type: Publication
full work available at URL: 0898-1221(85)90095-1
OpenAlex ID: W2006379975
cites work: Q4187223
cites work: Q4773298
cites work: Relations between exact and approximate bilinear algorithms. Applications
cites work: On commutativity and approximation
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: Q4190138
cites work: Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
cites work: The complexity of partial derivatives
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Q5185900
cites work: A generalization of the fast LUP matrix decomposition algorithm and applications
cites work: Q3935355
cites work: Q5676984
cites work: The bit-operation complexity of matrix multiplication and of all pair shortest path problem
cites work: The bit-complexity of arithmetic algorithms
cites work: The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
cites work: How to multiply matrices faster
cites work: Q4773299
cites work: Gaussian elimination is not optimal
cites work: Q5674306
published in: Computers & Mathematics with Applications
Recommended article: The bilinear complexity and practical algorithms for matrix multiplication
Recommended article: On the complexity of some algorithms of matrix multiplication
Recommended article: On the approximate bilinear complexity of matrix multiplication
Recommended article: Q4031860
Recommended article: Linear complexity algorithms for semiseparable matrices
Recommended article: The computational complexity of some problems of linear algebra
Recommended article: An introduction to the computational complexity of matrix multiplication
Recommended article: On the complexity of integer matrix multiplication
Recommended article: Relative bilinear complexity and matrix multiplication.
description: scientific article; zbMATH DE number 4104381