Strassen算法是构造矩阵运算快速算法的一种非最优的聚合、统一和消去三线性技术

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI:10.1109/SFCS.1978.34

V. Pan

{"title":"Strassen算法是构造矩阵运算快速算法的一种非最优的聚合、统一和消去三线性技术","authors":"V. Pan","doi":"10.1109/SFCS.1978.34","DOIUrl":null,"url":null,"abstract":"A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear non-commutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen's famous algorithms for matrix operations.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"135","resultStr":"{\"title\":\"Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations\",\"authors\":\"V. Pan\",\"doi\":\"10.1109/SFCS.1978.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear non-commutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen's famous algorithms for matrix operations.\",\"PeriodicalId\":346837,\"journal\":{\"name\":\"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"135\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1978.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1978.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 135

摘要

介绍了一种新的三线性聚合、统一和对消运算技术，并将其应用于矩阵乘法的快速线性非交换算法的构造。结果是Strassen著名的矩阵运算算法的渐近改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

19th Annual Symposium on Foundations of Computer Science (sfcs 1978)

自引率

0.00%

发文量