activity
20122023
most citedFast Feasible and Unfeasible Matrix Multiplication

14 citations · 89 across the 38 of their papers we have counts for

collaborators
Showing 2015Show all

6 papers · 1 filter

math.NA2015

Fast Approximate Computations with Cauchy Matrices and Polynomials

Victor Y. Pan

Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants…

math.NA2015

How Bad Are Vandermonde Matrices?

Victor Y. Pan

The work on the estimation of the condition numbers of Vandermonde matrices, motivated by applications to interpolation and quadrature, can be traced back at least to the 1970s. Em…

cs.SC2015★ 2 cited

Accelerated Approximation of the Complex Roots and Factors of a Univariate Polynomial

Victor Y. Pan, Elias P. Tsigaridas, Vitaly Zaderman +1

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing tha…

cs.SC2015

Real Polynomial Root-finding by Means of Matrix and Polynomial Iterations

Victor Y. Pan, Liang Zhao

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. Th…

math.NA2015★ 1 cited

Polynomial Root Isolation by Means of Root Radii Approximation

Victor Y. Pan, Liang Zhao

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can…

cs.SC2015★ 3 cited

Numerically Safe Gaussian Elimination with No Pivoting

Victor Pan, Liang Zhao

Gaussian elimination with no pivoting and block Gaussian elimination are attractive alternatives to the customary but communication intensive Gaussian elimination with partial pivo…