A Fast, Vectorizable Algorithm for Producing Single-Precision Sine-Cosine Pairs
Marcus H. Mendenhall
Abstract
This paper presents an algorithm for computing Sine-Cosine pairs to modest accuracy, but in a manner which contains no conditional tests or branching, making it highly amenable to vectorization. An exemplary implementation for PowerPC AltiVec processors is included, but the algorithm should be easily portable to other achitectures, such as Intel SSE.
Create a lesson
Related papers
manylp: reproducible, exact, and batched linear programming for genome-scale dynamic flux balance analysis
Fabio Cumbo
asdex: Automatic Sparse Differentiation in JAX
Adrian Hill, Guillaume Dalle
Scen-Opt: A Scenario Optimization Toolbox for Data-Driven Convex Programming
Ben Wooding, Simone Garatti, Marco C. Campi et al.
A performance enhancement of the Payne-Hanek range reduction algorithm
Tue Ly
DistributedDesignOptimizer: A modular Python framework for Setup, Execution and Processing of Distributed Design Optimization
Sebastian Ellmaier, Albert J. de Wit, Akilesh Raveendran et al.
KnottedGraph: Scalable knotted-graph topology for scientific and mathematical discovery
Hakan Akgün, Xianquan Yan, Kehan Liu et al.