首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > C/C++/VC++ > 快速多元多项式乘法在C++

快速多元多项式乘法在C++

  • 资源大小:16.84 kB
  • 上传时间:2021-06-29
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: 乘法 多项式 快速 多元

资 源 简 介

Introduction Polymul is a self-contained C++ template library for efficient multiplication of multivariate polynomials. It is intended for low order polynomials of a few variables, but is in principle limited only by the compiler"s maximum template recursion depth. Polynomials can be created over any scalar type, such as integers or floating point numbers. In addition to normal polynomial multiplication the library can also do truncated (Taylor series) multiplication, as well as linear changes of coordinates. Polynomials can also be evaluated at arbitrary points. Check out an Example or go directly to the API documentation. Scope The aim of Polymul is to do "naive" polynomial multiplication as fast as possible. It does not try to use any of the tricks, such as FFTs, that exists for turning polynomial multiplication into an Nlog(N) process. Since Polymul only deals with polynomial

文 件 列 表

polymul-1.01
gentab.py
polymul_tab.h
README
benchmark.cpp
polymul_test.cpp
polymul.h
VIP VIP
0.174568s