
Root Radii and Subdivision for Polynomial RootFinding
The recent subdivision algorithms for univariate polynomial Complex Root...
read it

New practical advances in polynomial root clustering
We report an ongoing work on clustering algorithms for complex roots of ...
read it

Low Rank Approximation of a Matrix at Sublinear Cost
A matrix algorithm performs at sublinear cost if it uses much fewer flo...
read it

Polynomial root clustering and explicit deflation
We seek complex roots of a univariate polynomial P with real or complex ...
read it

Low Rank Approximation at Sublinear Cost by Means of Subspace Sampling
Low Rank Approximation (LRA) of a matrix is a hot research subject, fund...
read it

Low Rank Approximation Directed by Leverage Scores and Computed at Sublinear Cost
Low rank approximation (LRA) of a matrix is a major subject of matrix an...
read it

Refinement of Low Rank Approximation of a Matrix at Sublinear Cost
Low rank approximation (LRA) of a matrix is a hot subject of modern comp...
read it

Implementation of a NearOptimal Complex Root Clustering Algorithm
We describe Ccluster, a software for computing natural ϵclusters of com...
read it

Old and New Nearly Optimal Polynomial Rootfinders
Univariate polynomial rootfinding has been studied for four millennia a...
read it

New Efficient Hybrid Polynomial Rootfinders
Univariate polynomial rootfinding has been studied for four millennia a...
read it

Nearly Optimal Hybrid Polynomial Rootfinders
Univariate polynomial rootfinding has been studied for four millennia a...
read it

Polynomial Factorization Is Simple and Helpful  More So Than It Seems to Be
Univariate polynomial rootfinding has been studied for four millennia, ...
read it

Fast Feasible and Unfeasible Matrix Multiplication
Fast matrixbymatrix multiplication (hereafter MM) is a highly recogniz...
read it
Victor Y. Pan
is this you? claim profile