Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 63, 1997 - Issue 1-2
Submit an article Journal homepage
58
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Two new algorithms for matrix multiplication and vector convolution

Chang-Jun Jiang Shandong Institute of Mining and Technology, Tai'an, P.R, 271019, China
&
Zhe-Hui Wu Shandong Institute of Mining and Technology, Tai'an, P.R, 271019, China
Pages 27-36 | Received 24 Aug 1996, Published online: 20 Mar 2007

References

  • Strassen , V. 1969 . Gaussian Elimination Is Not Optimal . Numer. Math , 13 : 345 – 356 .
  • Pan , V. Ya. 1980 . New Fast Algorithm Is Not Optimal . SI AM J. of Comput , 9 ( 2 ) : 321 – 342 .
  • Pan , V. Ya. 1981 . New Combinations of Methods for The Acceleration of Matrix Multiplication . Comput. & Math, with Appls , 1 ( 2 ) : 73 – 125 .
  • Bini , D. 1979 . Complexity for Approximate Matrix Multiplication . Information Processing Letters , 3 ( 5 ) : 46 – 47 .
  • Bini , D. 1979 . Lower Bounds of The Complexity of Linear Algebras . Information Processing Letters , 8 ( 5 ) : 234 – 235 .
  • Schonhage , A. 1981 . Partial and Total Matrix Multiplication . SI AM J. of Comput , 10 ( 3 ) : 435 – 455 .
  • Basse , S. 1978 . “ Computer Algorithms: Introduction to Design and Analysis ” . Addison -Wesley Publishing Company .
  • Cooley , J. W. and Tukey , J. W. 1965 . An Algorithm for Machine Computation of Complex Fourier Series . Math. Comput , 19 : 297 – 301 .
  • Agarwal , R. C. and Burrus , C. S. 1974 . Fast Convolution Using Fermat Number Transforms with Application to Digital Filtering . IEEE Trans , 22 : 87 – 97 .
  • Nussbaumer , H. J. 1976 . Complex Convolution Via Format Number Transforms . IBM J, Ros.Dev , 20 : 282 – 284 .
  • Vegh , E. and Leibowitz , M. 1976 . Fast Complex Convolution in Finite Ring . IEEE Trans , 24 : 342 – 344 .
  • Agarwal , R. C. and Cooley , J. W. 1977 . New Algorithms for Digital Convolution . IEEE Trans , 25 : 392 – 410 .
  • Nussbaumer , H. J. 1978 . New Algorithms for Convolution and DFT Based on Polynomial Transforms . IEEE Intern. Conf. Acoust. Speech, Signal Processing Proc , 25 : 638 – 641 .
  • Nussbaumer , H. J. 1981 . “ Fast Fourier Transform and Convolution Algorithms ” . New York : Springer-Verlag Berlin HeidelBerg .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.