High performance implementation of the TFT

DOI10.1145/2608628.2608661zbMath1325.65190OpenAlexW2104914240MaRDI QIDQ3452412

No author found.

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2608661

zbMATH Keywords

parallelizationvectorizationtruncated Fourier transformautomatic performance tuning

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Uses Software

• SPIRAL
• FFTW
• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic

This page was built for publication: High performance implementation of the TFT