26#ifndef FNFT__POLY_ROOTS_FFTGRIDSEARCH_H
27#define FNFT__POLY_ROOTS_FFTGRIDSEARCH_H
129#ifdef FNFT_ENABLE_SHORT_NAMES
130#define poly_roots_fftgridsearch(...) fnft__poly_roots_fftgridsearch(__VA_ARGS__)
131#define poly_roots_fftgridsearch_paraherm(...) fnft__poly_roots_fftgridsearch_paraherm(__VA_ARGS__)
size_t FNFT_UINT
Definition fnft_numtypes.h:62
double complex FNFT_COMPLEX
Definition fnft_numtypes.h:47
int32_t FNFT_INT
Definition fnft_numtypes.h:56
double FNFT_REAL
Definition fnft_numtypes.h:40
FNFT_INT fnft__poly_roots_fftgridsearch(const FNFT_UINT deg, FNFT_COMPLEX const *const p, FNFT_UINT *const M_ptr, FNFT_REAL const *const PHI, FNFT_COMPLEX *const roots)
Unit circle roots of a polynomial via grid search.
FNFT_INT fnft__poly_roots_fftgridsearch_paraherm(const FNFT_UINT deg, FNFT_COMPLEX const *const p, FNFT_UINT *const M_ptr, FNFT_REAL const *const PHI, FNFT_COMPLEX *const roots)
Unit circle roots of a parahermitian Laurent polynomial via grid search.