convert to partial fraction form
convert(f, parfrac, x)
convert(f, parfrac, K)
convert(f, parfrac, x, K)
convert(flist, parfrac, x)
rational function in x
main variable name
(optional) real, complex, a field extension, true, false, sqrfree
list consisting of the numerator, prefactored denominator, and powers (this is a programmer entry point)
Convert to parfrac performs a partial fraction decomposition of the rational function f in the variable x.
If no x is provided, parfrac attempts to determine a suitable x, and proceeds if the operation is not ambiguous. For example, an expression that is a rational polynomial in both a and b requires that the variable be specified.
The optional argument K specifies how the denominator in f is to be factored. If this argument is not specified, the denominator is factored by the factor command, which factors over the field implied by the coefficients present.
If the optional argument K is real (or complex), then a real (complex) floating-point factorization of the denominator is performed.
Note: This is implemented only for the univariate case.
If the argument K is RootOf or a radical or a list or set of RootOfs or radicals, then the denominators are factored over the algebraic number field implied by the field extensions K.
If the argument K is the name `sqrfree' then a square-free partial factorization is computed. A square-free factorization of the denominator in x is computed.
If the last argument is `true', this declares that the denominator of f is already in the desired factored form, and no factorization is required.
Note: Such a partial fraction decomposition can be done only if the factors in the denominator are relatively prime to each other.
If the programmer entry point form is used, then x must be a name, and the input flist must have the form:
where n is the numerator, and f1p1,f2p2,... are the denominator factors. All f1,f2,... must be relatively prime, and all p1,p2,... must be positive integer values.
The programmer form also provides the output in a different form:
where p is the polynomial part, f1,f2,... are as in the input, and the n11,n12,... are the numerators of the partial fraction form such that the algebraic partial fraction form can be obtained as:
Note: The programmer form output is dense, meaning all zero coefficients are included, and the polynomial part is always included (even if zero).
f ≔ x5+1x4−x2
f ≔ xx−b2
Note: This is an error because Maple cannot determine whether to use x or b.
Error, (in `convert/parfrac`) the variable name (for conversion to partial fractions) must be provided
f ≔ 2.3⁢x5.4⁢x3−2.3⁢x+1
f ≔ 4⁢x3−6⁢x2−2x4−2⁢x3−2⁢x+4
The cubic factor (x^3-2) does not factor over the integers.
p ≔ x5−2⁢x4−2⁢x3+4⁢x2+x−2:
f ≔ 36p
f ≔ 36convert⁡p,sqrfree,x
Programmer entry point form,
fl ≔ 4⁢x3−6⁢x2−2,x−2,2,x3−2,1
pl ≔ convert⁡fl,parfrac,x
which you can compare to the regular form.
f ≔ fl1mul⁡i1i2,i=fl2..−1
p ≔ convert⁡f,parfrac,x,true
Download Help Document