Victor Yakovlevich Pan (Russian: Пан Виктор Яковлевич) is a Soviet and American mathematician and computer scientist, known for his research on algorithms for polynomials and matrix multiplication.
YouTube Encyclopedic
-
1/5Views:225 0688611 602623495
-
Bret Victor - Inventing on Principle
-
Bill Green's History of Computers - VTID 2020
-
Good Programming is Mathematics and Vice Versa
-
Reacting to viral essay "Quantum computing hype is bad for science" by Victor Galitski
-
20 Root Locus Analysis Part 2
Transcription
Education and career
Pan earned his Ph.D. at Moscow University in 1964, under the supervision of Anatoli Georgievich Vitushkin,[1] and continued his work at the Soviet Academy of Sciences. During that time, he published a number of significant papers and became known informally as "polynomial Pan" for his pioneering work in the area of polynomial computations. In late 1970s, he immigrated to the United States and held positions at several institutions including IBM Research. Since 1988, he has taught at Lehman College of the City University of New York.[2]
Contributions
Victor Pan is an expert in computational complexity and has developed a number of new algorithms. One of his notable early results is a proof that the number of multiplications in Horner's method is optimal.[CVP]
In the theory of matrix multiplication algorithms, Pan in 1978 published an algorithm with running time . This was the first improvement over the Strassen algorithm after nearly a decade, and kicked off a long line of improvements in fast matrix multiplication that later included the Coppersmith–Winograd algorithm and subsequent developments.[SNO] He wrote the text How to Multiply Matrices Faster (Springer, 1984) surveying early developments in this area.[3][HMM] His 1982 algorithm[P82] still held the record in 2020 for the fastest "practically useful" matrix multiplication algorithm (i.e., with a small base size and manageable hidden constants).[4] In 1998, with his student Xiaohan Huang, Pan showed that matrix multiplication algorithms can take advantage of rectangular matrices with unbalanced aspect ratios, multiplying them more quickly than the time bounds one would obtain using square matrix multiplication algorithms.[FRM]
Since that work, Pan has returned to symbolic and numeric computation and to an earlier theme of his research, computations with polynomials. He developed fast algorithms for the numerical computation of polynomial roots,[UP] and, with Bernard Mourrain, algorithms for multivariate polynomials based on their relations to structured matrices.[5][MPD] He also authored or co-authored several more books, on matrix and polynomial computation,[6][PMC] structured matrices,[7][SMP] and on numerical root-finding procedures.[8][NMR]
Recognition
Pan was appointed Distinguished Professor at Lehman College in 2000.[2]
In 2013 he became a fellow of the American Mathematical Society, for "contributions to the mathematical theory of computation".[9]
Selected publications
Research papers
| CVP. |
| SNO. | Pan, V. Ya. (October 1978), "Strassen's algorithm is not optimal: Trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations", Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), IEEE, doi:10.1109/sfcs.1978.34, S2CID 14348408
|
| P82. | Pan, Victor Y. (1982), "Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication", Computers and Mathematics with Applications, 8: 23–34, doi:10.1016/0898-1221(82)90037-2, MR 0644547
|
| FRM. | Huang, Xiaohan; Pan, Victor Y. (1998), "Fast rectangular matrix multiplication and applications", Journal of Complexity, 14 (2): 257–299, doi:10.1006/jcom.1998.0476, MR 1629113
|
| MPD. | Mourrain, Bernard; Pan, Victor Y. (2000), "Multivariate polynomials, duality, and structured matrices" (PDF), Journal of Complexity, 16 (1): 110–180, doi:10.1006/jcom.1999.0530, MR 1762401 (winner, J. Complexity best paper award)[5]
|
| UP. | Pan, Victor Y. (2002), "Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding", Journal of Symbolic Computation, 33 (5): 701–733, doi:10.1006/jsco.2002.0531, MR 1919911
|
Books
| HMM. | Pan, Victor (1984), How to Multiply Matrices Faster, Lecture Notes in Computer Science, vol. 179, Berlin: Springer-Verlag, doi:10.1007/3-540-13866-8, ISBN 3-540-13866-8, S2CID 5280107[3]
|
| PMC. | Bini, Dario; Pan, Victor Y. (1994), Polynomial and Matrix Computations, Vol. I: Fundamental Algorithms, Progress in Theoretical Computer Science, Boston, MA: Birkhäuser, doi:10.1007/978-1-4612-0265-3, ISBN 0-8176-3786-9, S2CID 30728536[6]
|
| SMP. | Pan, Victor Y. (2001), Structured Matrices and Polynomials: Unified Superfast Algorithms, New York: Springer-Verlag, doi:10.1007/978-1-4612-0129-8, ISBN 0-8176-4240-4[7]
|
| NMR. | McNamee, J. M.; Pan, V. Y. (2013), Numerical Methods for Roots of Polynomials, Part II, Studies in Computational Mathematics, vol. 16, Amsterdam: Elsevier/Academic Press, ISBN 978-0-444-52730-1[8]
|
References
- ^ Victor Pan at the Mathematics Genealogy Project
- ^ a b Victor Pan of Lehman mathematics faculty selected as Distinguished Professor, Lehman College, archived from the original on 2018-02-14
- ^ a b Reviews of How to Multiply Matrices Faster:
- Gladwell, Ian (1986), Mathematical Reviews, Lecture Notes in Computer Science, 179, doi:10.1007/3-540-13866-8, ISBN 978-3-540-13866-2, MR 0765701, S2CID 5280107
{{citation}}: CS1 maint: untitled periodical (link) - Coppersmith, Don (July 1986), SIAM Review, 28 (2): 250–252, doi:10.1137/1028072, JSTOR 2030488
{{citation}}: CS1 maint: untitled periodical (link) - Probert, Robert L. (November–December 1986), American Scientist, 74 (6): 682, JSTOR 27854420
{{citation}}: CS1 maint: untitled periodical (link)
- Gladwell, Ian (1986), Mathematical Reviews, Lecture Notes in Computer Science, 179, doi:10.1007/3-540-13866-8, ISBN 978-3-540-13866-2, MR 0765701, S2CID 5280107
- ^ Karstadt, Elaye; Schwartz, Oded (2020), "Matrix multiplication, a little faster", Journal of the ACM, 67 (1): 1–31, doi:10.1145/3364504, MR 4061328, S2CID 211041916
- ^ a b "Best paper awards", Journal of Complexity, retrieved 2018-10-16
- ^ a b Reviews of Polynomial and Matrix Computations:
- Gupta, Murli M. (1995), Mathematical Reviews, doi:10.1007/978-1-4612-0265-3, ISBN 978-1-4612-6686-0, MR 1289412, S2CID 30728536
{{citation}}: CS1 maint: untitled periodical (link) - Tate, Stephen R. (June 1995), ACM SIGACT News, 26 (2): 26–27, doi:10.1145/202840.606473, S2CID 4740448
{{citation}}: CS1 maint: untitled periodical (link) - Eberly, Wayne (March 1996), SIAM Review, 38 (1): 161–165, doi:10.1137/1038020, JSTOR 2132983
{{citation}}: CS1 maint: untitled periodical (link) - Higham, Nicholas J. (April 1996), Mathematics of Computation, 65 (214): 888–889, JSTOR 2153629
{{citation}}: CS1 maint: untitled periodical (link) - Emiris, I. Z.; Galligo, A. (September 1996), ACM SIGSAM Bulletin, 30 (3): 21–23, doi:10.1145/240065.570109, S2CID 14598227
{{citation}}: CS1 maint: untitled periodical (link)
- Gupta, Murli M. (1995), Mathematical Reviews, doi:10.1007/978-1-4612-0265-3, ISBN 978-1-4612-6686-0, MR 1289412, S2CID 30728536
- ^ a b Review of Structured Matrices and Polynomials:
- Melman, Aaron (2002), Mathematical Reviews, doi:10.1007/978-1-4612-0129-8, ISBN 978-1-4612-6625-9, MR 1843842
{{citation}}: CS1 maint: untitled periodical (link)
- Melman, Aaron (2002), Mathematical Reviews, doi:10.1007/978-1-4612-0129-8, ISBN 978-1-4612-6625-9, MR 1843842
- ^ a b Review of Numerical Methods for Roots of Polynomials, Part II:
- ^ "List of Fellows of the American Mathematical Society", American Mathematical Society, retrieved 22 May 2015
External links
- Victor Pan publications indexed by Google Scholar
- Profile in American Scientist
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
This page was last edited on 28 January 2023, at 22:59