int acb_mat_lu(long * P, acb_mat_t LU, const acb_mat_t A, long prec) { acb_t d, e; acb_ptr * a; long i, j, m, n, r, row, col; int result; m = acb_mat_nrows(A); n = acb_mat_ncols(A); result = 1; if (m == 0 || n == 0) return result; acb_mat_set(LU, A); a = LU->rows; row = col = 0; for (i = 0; i < m; i++) P[i] = i; acb_init(d); acb_init(e); while (row < m && col < n) { r = acb_mat_find_pivot_partial(LU, row, m, col); if (r == -1) { result = 0; break; } else if (r != row) acb_mat_swap_rows(LU, P, row, r); acb_set(d, a[row] + col); for (j = row + 1; j < m; j++) { acb_div(e, a[j] + col, d, prec); acb_neg(e, e); _acb_vec_scalar_addmul(a[j] + col, a[row] + col, n - col, e, prec); acb_zero(a[j] + col); acb_neg(a[j] + row, e); } row++; col++; } acb_clear(d); acb_clear(e); return result; }
void _acb_poly_mullow_classical(acb_ptr res, acb_srcptr poly1, slong len1, acb_srcptr poly2, slong len2, slong n, slong prec) { len1 = FLINT_MIN(len1, n); len2 = FLINT_MIN(len2, n); if (n == 1) { acb_mul(res, poly1, poly2, prec); } else if (poly1 == poly2 && len1 == len2) { slong i; _acb_vec_scalar_mul(res, poly1, FLINT_MIN(len1, n), poly1, prec); _acb_vec_scalar_mul(res + len1, poly1 + 1, n - len1, poly1 + len1 - 1, prec); for (i = 1; i < len1 - 1; i++) _acb_vec_scalar_addmul(res + i + 1, poly1 + 1, FLINT_MIN(i - 1, n - (i + 1)), poly1 + i, prec); for (i = 1; i < FLINT_MIN(2 * len1 - 2, n); i++) acb_mul_2exp_si(res + i, res + i, 1); for (i = 1; i < FLINT_MIN(len1 - 1, (n + 1) / 2); i++) acb_addmul(res + 2 * i, poly1 + i, poly1 + i, prec); } else { slong i; _acb_vec_scalar_mul(res, poly1, FLINT_MIN(len1, n), poly2, prec); if (n > len1) _acb_vec_scalar_mul(res + len1, poly2 + 1, n - len1, poly1 + len1 - 1, prec); for (i = 0; i < FLINT_MIN(len1, n) - 1; i++) _acb_vec_scalar_addmul(res + i + 1, poly2 + 1, FLINT_MIN(len2, n - i) - 1, poly1 + i, prec); } }