The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms

DOI10.1016/0898-1221(85)90095-1zbMATH Open0674.68027OpenAlexW2006379975MaRDI QIDQ1121670FDOQ1121670

Authors: Victor Y. Pan 

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0898-1221(85)90095-1

Recommendations

• The bilinear complexity and practical algorithms for matrix multiplication
• On the complexity of some algorithms of matrix multiplication
• On the approximate bilinear complexity of matrix multiplication
• scientific article; zbMATH DE number 151736
• Linear complexity algorithms for semiseparable matrices
• The computational complexity of some problems of linear algebra (extended abstract)
• An introduction to the computational complexity of matrix multiplication
• On the complexity of integer matrix multiplication
• Relative bilinear complexity and matrix multiplication.

zbMATH Keywords

matrix multiplicationbit complexity\(\lambda \) algorithmsany precision approximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of partial derivatives
• Gaussian elimination is not optimal
• How to multiply matrices faster
• Title not available (Why is that?)
• On the Asymptotic Complexity of Matrix Multiplication
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Title not available (Why is that?)
• A generalization of the fast LUP matrix decomposition algorithm and applications
• Relations between exact and approximate bilinear algorithms. Applications
• Title not available (Why is that?)
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• Title not available (Why is that?)
• Title not available (Why is that?)
• On commutativity and approximation
• The bit-operation complexity of matrix multiplication and of all pair shortest path problem
• The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
• The bit-complexity of arithmetic algorithms
• Title not available (Why is that?)

Cited In (2)

• A logarithmic Boolean time algorithm for parallel polynomial division
• Polynomial division and its computational complexity

This page was built for publication: The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121670)