arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.08289cs.SC
收藏

我们能(和不能)用稀疏多项式做什么?

What Can (and Can't) we Do with Sparse Polynomials?

Daniel S. Roche

摘要:

简而言之,稀疏多项式是其零系数未显式存储的多项式。这样的对象在精确计算中无处不在,因此我们自然希望有有效的算法来处理它们。然而,这种紧凑的存储带来了新的算法挑战,因为密集多项式的快速算法可能不再有效。在本教程中,我们将在三个方面研究稀疏多项式算法的最新技术:算术,插值和因式分解。其目的是强调在理论和实践方面的最新进展,以及未来工作的机会。

英文摘要:

Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact storage comes new algorithmic challenges, as fast algorithms for dense polynomials may no longer be efficient. In this tutorial we examine the state of the art for sparse polynomial algorithms in three areas: arithmetic, interpolation, and factorization. The aim is to highlight recent progress both in theory and in practice, as well as opportunities for future work.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑