The basic polynomial algebra subprograms

DOI10.1007/978-3-662-44199-2_100MaRDI QIDQ2879193zbMATH OpenOpenAlexFDO

Authors Changbo Chen, Svyatoslav Covanov, F. Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie

Publication date 8 September 2014

Published in Mathematical Software – ICMS 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44199-2_100

zbMATH Keywords

parallel processingmulti-core processorspolynomial arithmeticfast Fourier transforms (FFTs)

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• Basic polynomial algebra subprograms
• The basic polynomial algebra subprograms
• Sparse polynomial arithmetic with the BPAS library
• scientific article; zbMATH DE number 4124978
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}

Cited in

(8)

• \textsc{Rings}: an efficient Java/Scala library for polynomial rings
• Sparse polynomial arithmetic with the BPAS library
• The basic polynomial algebra subprograms
• scientific article; zbMATH DE number 3954155 (Why is no real title available?)
• scientific article; zbMATH DE number 4124978 (Why is no real title available?)
• Employing C++ templates in the design of a computer algebra library
• Basic polynomial algebra subprograms
• Subresultant chains using Bézout matrices

Describes a project that uses

Uses Software

• Cilk
• BPAS
• modpn
• FFTW
• Magma
• FLINT
• AXIOM

This page was built for publication: The basic polynomial algebra subprograms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879193)