Victor Pan

Pan earned his Ph.D. at Moscow University in 1964, under the supervision of Anatoli Georgievich Vitushkin,{{r|mgp}} 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.{{r|lehman}}

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.{{ran|CVP}}

In the theory of matrix multiplication algorithms, Pan in 1978 published an algorithm with running time $O(n^\{2.795\})$. 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.{{ran|SNO}} He wrote the text How to Multiply Matrices Faster (Springer, 1984) surveying early developments in this area.{{r|how}}{{ran|HMM}} His 1982 algorithm{{ran|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).{{r|KS}} 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.{{ran|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,{{ran|UP}}

and, with Bernard Mourrain, algorithms for multivariate polynomials based on their relations to structured matrices.{{r|jcbpa}}{{ran|MPD}}

He also authored or co-authored several more books, on matrix and polynomial computation,{{r|polymat}}{{ran|PMC}}

structured matrices,{{r|struc}}{{ran|SMP}} and on

numerical root-finding procedures.{{r|numroot}}{{ran|NMR}}

Pan was appointed Distinguished Professor at Lehman College in 2000.{{r|lehman}}

In 2013 he became a fellow of the American Mathematical Society, for "contributions to the mathematical theory of computation".{{r|fams}}

{{rma|CVP|tw=3em|{{citation

| last = Pan | first = V. Ja.

| doi = 10.1070/rm1966v021n01abeh004147

| journal = Russian Math. Surveys

| mr = 0207178

| pages = 105–136

| title = On means of calculating values of polynomials

| volume = 21

| year = 1966| s2cid = 250869179

}}}}

{{rma|SNO|tw=3em|{{citation

| last = Pan | first = V. Ya.

| contribution = Strassen's algorithm is not optimal: Trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

| date = October 1978

| doi = 10.1109/sfcs.1978.34

| publisher = IEEE

| title = Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS 1978)| pages = 166–176

| s2cid = 14348408

}}}}

{{rma|P82|tw=3em|{{citation

| last1 = Pan | first1 = Victor Y.

| doi = 10.1016/0898-1221(82)90037-2

| journal = Computers and Mathematics with Applications

| mr = 644547

| pages = 23–34

| title = Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication

| volume = 8

| year = 1982| doi-access = free

}}}}

{{rma|FRM|tw=3em|{{citation

| last1 = Huang | first1 = Xiaohan

| last2 = Pan | first2 = Victor Y.

| doi = 10.1006/jcom.1998.0476

| issue = 2

| journal = Journal of Complexity

| mr = 1629113

| pages = 257–299

| title = Fast rectangular matrix multiplication and applications

| volume = 14

| year = 1998| doi-access = free

}}}}

{{rma|MPD|tw=3em|{{citation

| last1 = Mourrain | first1 = Bernard

| last2 = Pan | first2 = Victor Y.

| doi = 10.1006/jcom.1999.0530

| issue = 1

| journal = Journal of Complexity

| mr = 1762401

| pages = 110–180

| title = Multivariate polynomials, duality, and structured matrices

| volume = 16

| year = 2000| url = https://hal.inria.fr/inria-00073171/file/RR-3513.pdf

}} (winner, J. Complexity best paper award){{r|jcbpa}}}}

{{rma|UP|tw=3em|{{citation

| last = Pan | first = Victor Y.

| doi = 10.1006/jsco.2002.0531

| issue = 5

| journal = Journal of Symbolic Computation

| mr = 1919911

| pages = 701–733

| title = Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

| volume = 33

| year = 2002| doi-access = free

}}}}

{{rma|HMM|tw=3em|{{citation

| last = Pan | first = Victor

| doi = 10.1007/3-540-13866-8

| isbn = 3-540-13866-8

| location = Berlin

| publisher = Springer-Verlag

| series = Lecture Notes in Computer Science

| title = How to Multiply Matrices Faster

| volume = 179

| year = 1984| s2cid = 5280107

}}{{r|how}}}}

{{rma|PMC|tw=3em|{{citation

| last1 = Bini | first1 = Dario

| last2 = Pan | first2 = Victor Y.

| doi = 10.1007/978-1-4612-0265-3

| isbn = 0-8176-3786-9

| publisher = Birkhäuser | location = Boston, MA

| series = Progress in Theoretical Computer Science

| title = Polynomial and Matrix Computations, Vol. I: Fundamental Algorithms

| year = 1994| s2cid = 30728536

}}{{r|polymat}}}}

{{rma|SMP|tw=3em|{{citation

| last = Pan | first = Victor Y.

| doi = 10.1007/978-1-4612-0129-8

| isbn = 0-8176-4240-4

| publisher = Springer-Verlag | location = New York

| title = Structured Matrices and Polynomials: Unified Superfast Algorithms

| year = 2001}}{{r|struc}}}}

{{rma|NMR|tw=3em|{{citation

| last1 = McNamee | first1 = J. M.

| last2 = Pan | first2 = V. Y.

| isbn = 978-0-444-52730-1

| publisher = Elsevier/Academic Press | location = Amsterdam

| series = Studies in Computational Mathematics

| title = Numerical Methods for Roots of Polynomials, Part II

| volume = 16

| year = 2013}}{{r|numroot}}}}

{{reflist|refs=

{{citation|title=List of Fellows of the American Mathematical Society|url=http://www.ams.org/profession/fellows-list|website=American Mathematical Society|access-date=22 May 2015}}

Reviews of How to Multiply Matrices Faster:

• {{citation|first=Ian|last=Gladwell|title=none|journal=Mathematical Reviews|volume=179|year=1986|mr=0765701|doi=10.1007/3-540-13866-8|series=Lecture Notes in Computer Science|isbn=978-3-540-13866-2|s2cid=5280107}}
• {{citation|title=none|first=Don|last=Coppersmith|author-link=Don Coppersmith|journal=SIAM Review|volume=28|issue=2|date=July 1986|pages=250–252|jstor=2030488|doi=10.1137/1028072}}
• {{citation|title=none|first=Robert L.|last=Probert|journal=American Scientist|volume=74|issue=6|date=November–December 1986|page=682|jstor=27854420}}

{{citation|url=https://www.journals.elsevier.com/journal-of-complexity/awards/journal-of-complexity-best-paper-award|title=Best paper awards|journal=Journal of Complexity|access-date=2018-10-16}}

{{citation

| last1 = Karstadt | first1 = Elaye

| last2 = Schwartz | first2 = Oded

| doi = 10.1145/3364504

| issue = 1

| journal = Journal of the ACM

| mr = 4061328

| title = Matrix multiplication, a little faster

| volume = 67

| year = 2020

| pages = 1–31

| s2cid = 211041916

}}

{{citation|url=http://comet.lehman.cuny.edu/vpan/|title=Victor Pan of Lehman mathematics faculty selected as Distinguished Professor|archive-url=https://web.archive.org/web/20180214052102/http://comet.lehman.cuny.edu/vpan/|archive-date=2018-02-14|publisher=Lehman College}}

{{MathGenealogy|id=35501}}

Review of Numerical Methods for Roots of Polynomials, Part II:

• {{citation|first=Petko D.|last=Proinov|title=none|journal=Mathematical Reviews|mr=3293902}}

Reviews of Polynomial and Matrix Computations:

• {{citation|title=none|first=Murli M.|last=Gupta|year=1995|journal=Mathematical Reviews|mr=1289412|doi=10.1007/978-1-4612-0265-3|isbn=978-1-4612-6686-0|s2cid=30728536}}
• {{citation|last=Tate|first=Stephen R.|date=June 1995|doi=10.1145/202840.606473|issue=2|journal=ACM SIGACT News|pages=26–27|title=none|volume=26|s2cid=4740448|doi-access=free}}
• {{citation|title=none|first=Wayne|last=Eberly|journal=SIAM Review|volume=38|issue=1|date=March 1996|pages=161–165|jstor=2132983|doi=10.1137/1038020}}
• {{citation|title=none|first=Nicholas J.|last=Higham|author-link=Nicholas Higham|journal=Mathematics of Computation|volume=65|issue=214|date=April 1996|pages=888–889|jstor=2153629}}
• {{citation|last1=Emiris|first1=I. Z.|last2=Galligo|first2=A.|date=September 1996|doi=10.1145/240065.570109|issue=3|journal=ACM SIGSAM Bulletin|pages=21–23|title=none|volume=30|s2cid=14598227}}

Review of Structured Matrices and Polynomials:

• {{citation|title=none|first=Aaron|last=Melman|journal=Mathematical Reviews|mr=1843842|year=2002|doi=10.1007/978-1-4612-0129-8|isbn=978-1-4612-6625-9}}

}}

• {{Google Scholar id|9-i5_74AAAAJ}}
• [http://www.americanscientist.org/authors/detail/victor-pan Profile in American Scientist]

{{authority control}}

{{DEFAULTSORT:Pan, Victor Ya.}}

Category:Year of birth missing (living people)

Category:Living people

Category:20th-century American mathematicians

Category:21st-century American mathematicians

Category:American computer scientists

Category:Soviet emigrants to the United States

Category:Soviet mathematicians

Category:Soviet computer scientists

Category:Theoretical computer scientists

Category:Fellows of the American Mathematical Society

Category:Lehman College faculty