|
D.7.2.7 furtherInvar
Procedure from library ainvar.lib (see ainvar_lib).
- Usage:
- furtherInvar(m,id,karl,q); m matrix, id,karl ideals, q poly, n int
- Assume:
- karl,id,q are invariant under the vector field m,
moreover, q must be a variable
- Return:
- list of two ideals, the first ideal contains further invariants of
the vector field
| m = sum m[i,1]*d/dx(i) with respect to id,p,q,
| i.e. we compute elements in the (invariant) subring generated by id
which are divisible by q and divide them by q as often as possible.
The second ideal contains all invariants given before.
If n=1, a different algorithm is chosen which is sometimes faster
(default: n=0)
Example:
|