8 citations · 11 across the 5 of their papers we have counts for
5 papers
New Progress in Classic Area: Polynomial Root-squaring and Root-finding
Victor Y. Pan
The DLG root-squaring iterations, due to Dandelin 1826 and rediscovered by Lobachevsky 1834 and Graeffe 1837, have been the main approach to root-finding for a univariate polynomia…
Fast Matrix Multiplication and Symbolic Computation
Jean-Guillaume Dumas, Victor Pan
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when Strassen surprisingly decreased the exponent 3 in the cubic cost of the straigh…
Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
Victor Y. Pan
Matrix multiplication (hereafter we use the acronym MM) is among the most fundamental operations of modern computations. The efficiency of its performance depends on various factor…
Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract)
Victor Y. Pan, Elias Tsigaridas
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MN…
Novel Approach to Real Polynomial Root-finding and Matrix Eigen-solving
Victor Y. Pan
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can b…