fft_small_op_add, fft_small_op_sub, fft_small_op_neg
Synopsis
#include <flint/fft_small.h>void fft_small_op_add(fft_small_op_t Z, const fft_small_op_t A, const fft_small_op_t B, const fft_small_plan_t P)sourcevoid fft_small_op_sub(fft_small_op_t Z, const fft_small_op_t A, const fft_small_op_t B, const fft_small_plan_t P)sourcevoid fft_small_op_neg(fft_small_op_t Z, const fft_small_op_t A, const fft_small_plan_t P)sourceSet Z to A + B, A - B and -A, for operands in the same domain; Z gets that domain. Sums of primal operands represent sums of the inputs, whose larger coefficients the plan's bound must allow for.
Cite this page
The FLINT team, “fft_small_op_add, fft_small_op_sub, fft_small_op_neg (fft_small.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft_small/fft_small_op_add.html (generated 2026-10-20).
@misc{flint-doc-fft-small-fft-small-op-add,
author = {{The FLINT team}},
title = {{fft\_small\_op\_add, fft\_small\_op\_sub, fft\_small\_op\_neg (fft\_small.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fft_small/fft_small_op_add.html},
note = {Generated 2026-10-20}
}