On the parallel evaluation of a sparse polynomial at a point

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.20, Iss.4, 1999-08, pp. : 323-329

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

High dimensional polynomial interpolation on sparse grids

By Barthelmann Volker Novak Erich Ritter Klaus

Advances in Computational Mathematics, Vol. 12, Iss. 4, 2000-03 ,pp. : 273-288

Springer Publishing Company

Access to resources Recommend Favorite

Point Evaluations and Polynomial Approximation in the Mean

By Akeroyd John Taylor Philip

Integral Equations and Operator Theory, Vol. 60, Iss. 3, 2008-03 ,pp. : 299-311

Springer Publishing Company

Access to resources Recommend Favorite

Towards an accurate performance modeling of parallel sparse factorization

By Grigori Laura

Applicable Algebra in Engineering, Communication and Computing, Vol. 18, Iss. 3, 2007-05 ,pp. : 241-261

Springer Publishing Company

Access to resources Recommend Favorite

Does polynomial parallel volume imply convexity?

By Heveling Matthias

Mathematische Annalen, Vol. 328, Iss. 3, 2004-03 ,pp. : 469-479

Springer Publishing Company

Access to resources Recommend Favorite

A Shared- and distributed-memory parallel general sparse direct solver

By Gupta Anshul

Applicable Algebra in Engineering, Communication and Computing, Vol. 18, Iss. 3, 2007-05 ,pp. : 263-277

Springer Publishing Company

Access to resources Recommend Favorite