Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan)
Wayne Eberly · SIAM Review · 1996
Previous article Next article Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan)Wayne EberlyWayne Eberlyhttps://doi.org/10.1137/1038020PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Alfred V. Aho, , John E. Hopcroft and , Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975x+470 54:1706 0326.68005 Google Scholar[2] M. Ben-Or and , P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings, 20th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1995, 301–309 Google Scholar[3] D. Bini and , V. Y. Pan, 1995, Private communication Google Scholar[4] Joachim von zur Gathen, Parallel algorithms for algebraic problems, SIAM J. Comput., 13 (1984), 802–824 10.1137/0213050 86h:68074 0553.68032 LinkISIGoogle Scholar[5] Joachim von zur Gathen, Parallel arithmetic computations: a surveyMathematical foundations of computer science, 1986 (Bratislava, 1986), Lecture Notes in Comput. Sci., Vol. 233, Springer, Berlin, 1986, 93–112 874 591 0616.68037 CrossrefGoogle Scholar[6] Joachim von zur Gathen, Functional decomposition of polynomials: the wild case, J. Symbolic Comput., 10 (1990), 437–452 92i:12008 0722.12003 CrossrefISIGoogle Scholar[7] Mark Giesbrecht, Nearly optimal algorithms for canonical matrix forms, SIAM J. Comput., 24 (1995), 948–969 10.1137/S0097539793252687 96f:65180 0839.65043 LinkISIGoogle Scholar[8] I. Gohberg, , T. Kailath, , I. Koltracht and , P. Lancaster, Linear complexity parallel algorithms for linear systems of equations with recursive structure, Linear Algebra Appl., 88/89 (1987), 271–315 10.1016/0024-3795(87)90113-3 88g:65027 0624.65020 CrossrefISIGoogle Scholar[10] I. Gohberg and , V. Olshevsky, Complexity of multiplication with vectors for structured matrices, Linear Algebra Appl., 202 (1994), 163–192 10.1016/0024-3795(94)90189-9 95d:65038 0803.65053 CrossrefISIGoogle Scholar[11] Raymond Greenlaw, , H. James Hoover and , Walter L. Ruzzo, Limits to parallel computation: P-completeness theory, The Clarendon Press Oxford University Press, New York, 1995xvi+311 96e:68033 0829.68068 Google Scholar[12] E. Kaltofen and , V. Y. Pan, Processor efficient parallel solution of linear systems over an abstract field, Proceedings, Third Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1991, 180–191 Google Scholar[13] E. Kaltofen and , V. Y. Pan, Processor-efficient parallel solution of linear systems II. The positive characteristic and singular cases, Proceedings, 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1992, 714–723 0977.68879 Google Scholar[14] V. Y. Pan, On randomized parallel computations with general and Toeplitz-like matrices, 1993, manuscript Google Scholar[15] V. Y. Pan, 1995, Private communication Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Exploring GPU acceleration of Deep Neural Networks using Block Circulant MatricesParallel Computing, Vol. 100 Cross Ref E-RNN: Design Optimization for Efficient Recurrent Neural Networks in FPGAs Cross Ref C ir CNN Cross Ref Volume 38, Issue 1| 1996SIAM Review History Published online:12 July 2006 InformationCopyright © 1996 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1038020Article page range:pp. 161-165ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics