Frobenius形式的确定性计算

Proceedings 2001 IEEE International Conference on Cluster Computing Pub Date : 2001-10-14 DOI:10.1109/SFCS.2001.959911

A. Storjohann

{"title":"Frobenius形式的确定性计算","authors":"A. Storjohann","doi":"10.1109/SFCS.2001.959911","DOIUrl":null,"url":null,"abstract":"A deterministic algorithm for computing the Frobenius canonical-form of a matrix over a field is described. A similarity transformation-matrix is recovered in the same time. The algorithm is nearly optimal, requiring about the same number of field operations as required for matrix multiplication. Previously-known reductions to matrix multiplication are probabilistic.","PeriodicalId":378126,"journal":{"name":"Proceedings 2001 IEEE International Conference on Cluster Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Deterministic computation of the Frobenius form\",\"authors\":\"A. Storjohann\",\"doi\":\"10.1109/SFCS.2001.959911\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A deterministic algorithm for computing the Frobenius canonical-form of a matrix over a field is described. A similarity transformation-matrix is recovered in the same time. The algorithm is nearly optimal, requiring about the same number of field operations as required for matrix multiplication. Previously-known reductions to matrix multiplication are probabilistic.\",\"PeriodicalId\":378126,\"journal\":{\"name\":\"Proceedings 2001 IEEE International Conference on Cluster Computing\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE International Conference on Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.2001.959911\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE International Conference on Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.2001.959911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

摘要

描述了计算域上矩阵的Frobenius标准形式的一种确定性算法。同时恢复相似变换矩阵。该算法几乎是最优的，所需的字段操作数量与矩阵乘法所需的字段操作数量相同。以前已知的矩阵乘法的简化是概率性的。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Deterministic computation of the Frobenius form

A deterministic algorithm for computing the Frobenius canonical-form of a matrix over a field is described. A similarity transformation-matrix is recovered in the same time. The algorithm is nearly optimal, requiring about the same number of field operations as required for matrix multiplication. Previously-known reductions to matrix multiplication are probabilistic.

求助全文

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

来源期刊

Proceedings 2001 IEEE International Conference on Cluster Computing

自引率

0.00%

发文量

期刊最新文献

The complexity of factors of multivariate polynomials A replacement for Voronoi diagrams of near linear size "Planar" tautologies hard for resolution Traveling with a Pez dispenser (or, routing issues in MPLS) Almost tight upper bounds for vertical decompositions in four dimensions