FNFT
fnft__poly_roots_fasteigen.h
Go to the documentation of this file.
1 /*
2 * This file is part of FNFT.
3 *
4 * FNFT is free software; you can redistribute it and/or
5 * modify it under the terms of the version 2 of the GNU General
6 * Public License as published by the Free Software Foundation.
7 *
8 * FNFT is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public License
14 * along with this program. If not, see <http://www.gnu.org/licenses/>.
15 *
16 * Contributors:
17 * Sander Wahls (TU Delft) 2017-2018.
18 */
19 
26 #ifndef FNFT__POLY_ROOTS_FASTEIGEN_H
27 #define FNFT__POLY_ROOTS_FASTEIGEN_H
28 
29 #include "fnft.h"
30 
52  FNFT_COMPLEX const * const p, FNFT_COMPLEX * const roots);
53 
54 #ifdef FNFT_ENABLE_SHORT_NAMES
55 #define poly_roots_fasteigen(...) fnft__poly_roots_fasteigen(__VA_ARGS__)
56 #endif
57 
58 #endif
FNFT_INT
int32_t FNFT_INT
Definition: fnft_numtypes.h:56
FNFT_UINT
size_t FNFT_UINT
Definition: fnft_numtypes.h:62
FNFT_COMPLEX
double complex FNFT_COMPLEX
Definition: fnft_numtypes.h:47
fnft__poly_roots_fasteigen
FNFT_INT fnft__poly_roots_fasteigen(const FNFT_UINT deg, FNFT_COMPLEX const *const p, FNFT_COMPLEX *const roots)
Fast computation of polynomial roots.