The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic

DOI10.1016/0898-1221(82)90052-9zbMath0487.68034OpenAlexW2061436543MaRDI QIDQ1165575

Pan, Victor Y.

Publication date: 1982

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(82)90052-9

zbMATH Keywords

algorithmsnumerical stabilitymatrix products

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Polynomial division and its computational complexity, Algebraic complexity of computing polynomial zeros, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The numerical instability of Bini's algorithm
• The bit-operation complexity of matrix multiplication and of all pair shortest path problem
• New combinations of methods for the acceleration of matrix multiplication
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
• The bit-complexity of arithmetic algorithms
• On the Asymptotic Complexity of Matrix Multiplication
• Computational Complexity and Numerical Stability