Sign Up to like & get
recommendations!
1
Published in 2019 at "Numerical Algorithms"
DOI: 10.1007/s11075-019-00745-3
Abstract: The problem of computing the roots of a particular sequence of sparse polynomials p n ( t ) is considered. Each instance p n ( t ) incorporates only the n + 1 monomial terms t…
read more here.
Keywords:
high degree;
computing roots;
sparse high;
roots sparse ... See more keywords