From: Christian Bauer Date: Tue, 29 Oct 2002 18:59:14 +0000 (+0000) Subject: added the sprem() function to normal.h, and fixed some documentation X-Git-Tag: release_1-0-12~2 X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=commitdiff_plain;h=64c3117e974abb88920a68bbc0b8d01139e43aad;ds=sidebyside added the sprem() function to normal.h, and fixed some documentation --- diff --git a/ginac/normal.cpp b/ginac/normal.cpp index 610c48d6..5e6aa470 100644 --- a/ginac/normal.cpp +++ b/ginac/normal.cpp @@ -471,14 +471,14 @@ ex decomp_rational(const ex &a, const symbol &x) } -/** Pseudo-remainder of polynomials a(x) and b(x) in Z[x]. +/** Pseudo-remainder of polynomials a(x) and b(x) in Q[x]. * * @param a first polynomial in x (dividend) * @param b second polynomial in x (divisor) * @param x a and b are polynomials in x * @param check_args check whether a and b are polynomials with rational * coefficients (defaults to "true") - * @return pseudo-remainder of a(x) and b(x) in Z[x] */ + * @return pseudo-remainder of a(x) and b(x) in Q[x] */ ex prem(const ex &a, const ex &b, const symbol &x, bool check_args) { if (b.is_zero()) @@ -523,14 +523,14 @@ ex prem(const ex &a, const ex &b, const symbol &x, bool check_args) } -/** Sparse pseudo-remainder of polynomials a(x) and b(x) in Z[x]. +/** Sparse pseudo-remainder of polynomials a(x) and b(x) in Q[x]. * * @param a first polynomial in x (dividend) * @param b second polynomial in x (divisor) * @param x a and b are polynomials in x * @param check_args check whether a and b are polynomials with rational * coefficients (defaults to "true") - * @return sparse pseudo-remainder of a(x) and b(x) in Z[x] */ + * @return sparse pseudo-remainder of a(x) and b(x) in Q[x] */ ex sprem(const ex &a, const ex &b, const symbol &x, bool check_args) { if (b.is_zero()) diff --git a/ginac/normal.h b/ginac/normal.h index 71bf7548..be67d8eb 100644 --- a/ginac/normal.h +++ b/ginac/normal.h @@ -42,9 +42,12 @@ extern ex rem(const ex &a, const ex &b, const symbol &x, bool check_args = true) // Decompose rational function a(x)=N(x)/D(x) into Q(x)+R(x)/D(x) with degree(R, x) < degree(D, x) extern ex decomp_rational(const ex &a, const symbol &x); -// Pseudo-remainder of polynomials a(x) and b(x) in Z[x] +// Pseudo-remainder of polynomials a(x) and b(x) in Q[x] extern ex prem(const ex &a, const ex &b, const symbol &x, bool check_args = true); +// Pseudo-remainder of polynomials a(x) and b(x) in Q[x] +extern ex sprem(const ex &a, const ex &b, const symbol &x, bool check_args = true); + // Exact polynomial division of a(X) by b(X) in Q[X] (quotient returned in q), returns false when exact division fails extern bool divide(const ex &a, const ex &b, ex &q, bool check_args = true);