New Fast Algorithms for Matrix Operations

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1980 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 9, pages 321-342 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Victor Y. Pan;

doi: 10.1137/0209027

New Fast Algorithms for Matrix Operations

- Summary
- Subjects
- Metrics

Abstract

A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear noncommutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen’s famous algorithms for matrix operations.

Keywords

fast algorithms for matrix operations, Analysis of algorithms and problem complexity, trilinear form, arithmetic complexity, Other matrix algorithms, bilinear forms

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	51
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%