X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fnormal.h;h=5f444278b36ef7142ed9428ed3a3cf34ed5e4787;hp=25a1743bb6f15f4edb921d9769ca532488fdde47;hb=f152bcaada41397cdf12d21fc2c4172d77ab7cb2;hpb=e3830d7f64627be5f6f4f265c0e8effb653be6b9 diff --git a/ginac/normal.h b/ginac/normal.h index 25a1743b..5f444278 100644 --- a/ginac/normal.h +++ b/ginac/normal.h @@ -6,7 +6,7 @@ * computation, square-free factorization and rational function normalization. */ /* - * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by @@ -20,27 +20,33 @@ * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ #ifndef __GINAC_NORMAL_H__ #define __GINAC_NORMAL_H__ -#ifndef NO_NAMESPACE_GINAC +#include "lst.h" + namespace GiNaC { -#endif // ndef NO_NAMESPACE_GINAC class ex; class symbol; // Quotient q(x) of polynomials a(x) and b(x) in Q[x], so that a(x)=b(x)*q(x)+r(x) -extern ex quo(const ex &a, const ex &b, const symbol &x, bool check_args = true); +extern ex quo(const ex &a, const ex &b, const ex &x, bool check_args = true); // Remainder r(x) of polynomials a(x) and b(x) in Q[x], so that a(x)=b(x)*q(x)+r(x) -extern ex rem(const ex &a, const ex &b, const symbol &x, bool check_args = true); +extern ex rem(const ex &a, const ex &b, const ex &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 ex &x); + +// Pseudo-remainder of polynomials a(x) and b(x) in Q[x] +extern ex prem(const ex &a, const ex &b, const ex &x, bool check_args = true); -// Pseudo-remainder of polynomials a(x) and b(x) in Z[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 ex &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); @@ -52,10 +58,17 @@ extern ex gcd(const ex &a, const ex &b, ex *ca = NULL, ex *cb = NULL, bool check extern ex lcm(const ex &a, const ex &b, bool check_args = true); // Square-free factorization of a polynomial a(x) -extern ex sqrfree(const ex &a, const symbol &x); +extern ex sqrfree(const ex &a, const lst &l = lst()); + +// Square-free partial fraction decomposition of a rational function a(x) +extern ex sqrfree_parfrac(const ex & a, const symbol & x); + +// Collect common factors in sums. +extern ex collect_common_factors(const ex & e); + +// Resultant of two polynomials e1,e2 with respect to symbol s. +extern ex resultant(const ex & e1, const ex & e2, const ex & s); -#ifndef NO_NAMESPACE_GINAC } // namespace GiNaC -#endif // ndef NO_NAMESPACE_GINAC #endif // ndef __GINAC_NORMAL_H__