首页    期刊浏览 2025年05月25日 星期日
登录注册

文章基本信息

  • 标题:Massively Parallel Searching for Better Algorithms or How to Do a Cross Product with Five Multiplications
  • 本地全文:下载
  • 作者:John Gustafson ; Srinivas Aluru
  • 期刊名称:Scientific Programming
  • 印刷版ISSN:1058-9244
  • 出版年度:1996
  • 卷号:5
  • DOI:10.1155/1996/284218
  • 出版社:Hindawi Publishing Corporation
  • 摘要:A number of "tricks" are known that trade multiplications for additions. The term "tricks" reflects the way these methods seem not to proceed from any general theory, but instead jump into existence as recipes that work. The Strassen method for 2 × 2 matrix product with seven multiplications is a well-known example, as is the method for finding a complex number product in three multiplications. We have created a practical computer program for finding such tricks automatically, where massive parallelism makes the combinatorially explosive search tolerable for small problems. One result of this program is a method for cross products of three-vectors that requires only five multiplications.
国家哲学社会科学文献中心版权所有