We approximate the d complex zeros of a univariate polynomial p(x) of a
...
In our quest for the design, the analysis and the implementation of a
su...
The DLG root-squaring iterations by Dandelin 1826, Lobachevsky 1834, and...
We depart from our approximation of 2000 of all root radii of a polynomi...
We report an ongoing work on clustering algorithms for complex roots of ...
A matrix algorithm performs at sub-linear cost if it uses much fewer flo...
We seek complex roots of a univariate polynomial P with real or complex
...
Low Rank Approximation (LRA) of a matrix is a hot research subject,
fund...
Low rank approximation (LRA) of a matrix is a major subject of matrix an...
Low rank approximation (LRA) of a matrix is a hot subject of modern
comp...
We describe Ccluster, a software for computing natural ϵ-clusters of
com...
Univariate polynomial root-finding has been studied for four millennia a...
Univariate polynomial root-finding has been studied for four millennia a...
Univariate polynomial root-finding has been studied for four millennia a...
Univariate polynomial root-finding has been studied for four millennia, ...
Fast matrix-by-matrix multiplication (hereafter MM) is a highly recogniz...