The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
type: Item
instance of: scholarly article
title: The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
zbMATH Open document ID: 0487.68034
DOI: 10.1016/0898-1221(82)90052-9
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 3767038
zbMATH Keywords: matrix products
zbMATH Keywords: algorithms
zbMATH Keywords: numerical stability
author: Victor Y. Pan
MaRDI profile type: Publication
full work available at URL: 0898-1221(82)90052-9
OpenAlex ID: W2061436543
cites work: The bit-complexity of arithmetic algorithms
cites work: The bit-operation complexity of matrix multiplication and of all pair shortest path problem
cites work: The numerical instability of Bini's algorithm
cites work: Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
cites work: Computational Complexity and Numerical Stability
cites work: New combinations of methods for the acceleration of matrix multiplication
cites work: Q4091421
cites work: Q4190138
cites work: Q3885184
cites work: Q3935355
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Q3883493
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3767038