florian/triangle_reflection_complex
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

update QEXT to new dynamic version

Browse Source
This commit is contained in:
Florian Stecker
2022-06-11 17:36:32 +02:00
parent 2e516e718d
commit 1a85a5ef14
6 changed files with 106 additions and 64 deletions
Download Patch File Download Diff File Expand all files Collapse all files

82
qext.c
View File

@@ -7,62 +7,90 @@ mpq_t *qext_coefficient;
#include <malloc.h>
#define LOOP(i,n) for(int i = 0; i < (n); i++)
#define RANK(x) ((x)->type->rank)
void qext_setup(int rank, const int *coeffs)
const int qext_type_trivial_coeffs[] = {-1, 1};
struct qext_type qext_type_trivial_v = {1, qext_type_trivial_coeffs, NULL};
struct qext_type *QT_TRIVIAL = &qext_type_trivial_v;
const int qext_type_sqrt5_coeffs[] = {-5, 0, 1};
struct qext_type qext_type_sqrt5_v = {2, qext_type_sqrt5_coeffs, NULL};
struct qext_type *QT_SQRT5 = &qext_type_sqrt5_v;
static void qext_init_type(struct qext_type *type)
{
qext_rank = rank;
qext_coefficient = malloc(rank*sizeof(mpq_t));
LOOP(i, rank) {
mpq_init(qext_coefficient[i]);
mpq_set_si(qext_coefficient[i], -coeffs[i], coeffs[rank]);
type->coeffs = malloc(type->rank*sizeof(mpq_t));
LOOP(i, type->rank) {
mpq_init(type->coeffs[i]);
mpq_set_si(type->coeffs[i],
-type->integer_coeffs[i],
type->integer_coeffs[type->rank]);
}
}
void qext_init(qext_number x)
struct qext_type *qext_newtype(int rank, const int *coeffs)
{
x->rk = qext_rank;
x->a = malloc(x->rk*sizeof(mpq_t));
LOOP(i, x->rk) mpq_init(x->a[i]);
struct qext_type *type = malloc(sizeof(struct qext_type));
type->rank = rank;
type->integer_coeffs = coeffs;
qext_init_type(type);
return type;
}
void qext_init(qext_number x, struct qext_type *type)
{
if(type->coeffs == NULL) // uninitialized default type
qext_init_type(type);
x->type = type;
x->a = malloc(RANK(x)*sizeof(mpq_t));
LOOP(i, RANK(x)) mpq_init(x->a[i]);
}
void qext_clear(qext_number x)
{
LOOP(i, x->rk) mpq_clear(x->a[i]);
LOOP(i, RANK(x)) mpq_clear(x->a[i]);
free(x->a);
}
void qext_set(qext_number x, qext_number y)
{
LOOP(i, x->rk) mpq_set(x->a[i], y->a[i]);
LOOP(i, RANK(x)) mpq_set(x->a[i], y->a[i]);
}
void qext_set_int(qext_number x, int y)
{
mpq_set_si(x->a[0], y, 1);
for(int i = 1; i < x->rk; i++)
for(int i = 1; i < RANK(x); i++)
mpq_set_ui(x->a[i], 0, 1);
}
void qext_set_q(qext_number x, mpq_t y)
{
mpq_set(x->a[0], y);
for(int i = 1; i < x->rk; i++)
for(int i = 1; i < RANK(x); i++)
mpq_set_ui(x->a[i], 0, 1);
}
void qext_add(qext_number result, qext_number x, qext_number y)
{
LOOP(i, x->rk) mpq_add(result->a[i], x->a[i], y->a[i]);
LOOP(i, RANK(x)) mpq_add(result->a[i], x->a[i], y->a[i]);
}
void qext_sub(qext_number result, qext_number x, qext_number y)
{
LOOP(i, x->rk) mpq_sub(result->a[i], x->a[i], y->a[i]);
LOOP(i, RANK(x)) mpq_sub(result->a[i], x->a[i], y->a[i]);
}
void qext_neg(qext_number result, qext_number x)
{
LOOP(i, RANK(x)) mpq_neg(result->a[i], x->a[i]);
}
void qext_print(qext_number x)
{
LOOP(i, x->rk) {
LOOP(i, RANK(x)) {
if(i == 0)
gmp_printf("%Qd", x->a[i]);
else if(i == 1)
@@ -76,7 +104,7 @@ void qext_snprint(char *str, size_t size, qext_number x)
{
int len = 0;
LOOP(i, x->rk) {
LOOP(i, RANK(x)) {
if(i == 0)
len += gmp_snprintf(str+len, size-len, "%Qd", x->a[i]);
else if(i == 1)
@@ -90,7 +118,7 @@ int qext_cmp(qext_number x, qext_number y)
{
int cmp;
LOOP(i, x->rk) {
LOOP(i, RANK(x)) {
cmp = mpq_cmp(x->a[i], y->a[i]);
if(cmp)
return cmp;
@@ -101,11 +129,11 @@ int qext_cmp(qext_number x, qext_number y)
void qext_mul(qext_number out, qext_number x, qext_number y)
{
mpq_t result[2*x->rk-1];
mpq_t result[2*RANK(x)-1];
mpq_t tmp;
mpq_init(tmp);
LOOP(i, 2*x->rk-1) {
LOOP(i, 2*RANK(x)-1) {
mpq_init(result[i]);
mpq_set_ui(result[i], 0, 1);
}
@@ -115,21 +143,21 @@ void qext_mul(qext_number out, qext_number x, qext_number y)
// degree 2: 4+2
// degree 4: 16+12, including 6 times 0*
LOOP(i, x->rk) LOOP(j, x->rk) {
LOOP(i, RANK(x)) LOOP(j, RANK(x)) {
mpq_mul(tmp, x->a[i], y->a[j]);
mpq_add(result[i+j], result[i+j], tmp);
}
for(int i = x->rk-2; i >= 0; i--) {
LOOP(j, x->rk) {
mpq_mul(tmp, qext_coefficient[j], result[x->rk+i]);
for(int i = RANK(x)-2; i >= 0; i--) {
LOOP(j, RANK(x)) {
mpq_mul(tmp, x->type->coeffs[j], result[RANK(x)+i]);
mpq_add(result[i+j], result[i+j], tmp);
}
}
LOOP(i, x->rk) mpq_set(out->a[i], result[i]);
LOOP(i, RANK(x)) mpq_set(out->a[i], result[i]);
LOOP(i, 2*x->rk-1) mpq_clear(result[i]);
LOOP(i, 2*RANK(x)-1) mpq_clear(result[i]);
mpq_clear(tmp);
}